The Rewrite Rule Machine Node Architecture and Its Performance
نویسندگان
چکیده
The Rewrite Rule Machine (RRM) is a massively parallel MIMD/SIMD computer designed with the explicit purpose of supporting veryhigh-level parallel programming with rewrite rules. The RRM’s node architecture consists of a SIMD processor, a SIMD controller, local memory, and network and I/O interfaces. A 64-node cluster board is already an attractive RRM system capable of extremely high performance on a variety of applications. A cluster is SIMD at the node level, but it is MIMD at the system level to flexibly exploit the parallelism of complex nonhomogeneous applications. In addition to reporting detailed simulation experiments used to validate the node design, we measure the performance of an RRM cluster on three relevant applications.
منابع مشابه
Simulation and Performance Estimation for the Rewrite Rule Machine
The Rewrite Rule Machine (RRM) is a massively parallel machine being developed at SRI International that combines the power of SIMD with the generality of MIMD. The RRM exploits both extremely ne-grain and coarse-grain parallelism, and is based on an abstract model of computation that eases creating and porting parallel programs. In particular, the RRM can be programmed very naturally with very...
متن کاملAn Iterative Decision Rule to minimize cost of Acceptance Sampling Plan in Machine Replacement Problem
In this paper, we presented an optimal iterative decision rule for minimizing total cost in designing a sampling plan for machine replacement problem using the approach of dynamic programming and Bayesian inferences. Cost of replacing the machine and cost of defectives produced by machine has been considered in model. Concept of control threshold policy has been applied for decision making. If ...
متن کاملA Rewrite Stack Machine for Roc! a Rewrite Stack Machine for Roc! *
ROC! is a deterministic rewrite strategy language which includes the rewrite rulesas basic operators, and the deterministic choice and the repetition as high-level strategyoperators. In this paper we present a method which, for a given term rewriting system(TRS) R, constructs a new TRS R such that R-rewriting is equivalent (sound and com-plete) with R-rewriting constrained by RO...
متن کاملCompilation of Combinatory Reduction Systems
Combinatory Reduction Systems generalise Term Rewriting Systems. They are powerful enough to express-reduction of-calculus as a single rewrite rule. The additional expressive power has its price | CRSs are much harder to implement than ordinary TRSs. We propose an abstract machine suitable for executing CRSs. We deene what it means to execute an instruction, and give a translation from CRS rule...
متن کاملCompiling Rewriting onto SIMD and MIMD/SIMD Maschines
We present compilation techniques for Simple Maude, a declarative programming language based on Rewriting Logic which supports term, graph, and object-oriented rewriting. We show how to compile various constructs of Simple Maude onto SIMD and MIMD/SIMD massively parallel architectures, and in particular onto the Rewrite Rule Machine, a special purpose MIMD/SIMD architecture for rewriting. We sh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994