Simulation and performance estimation for the Rewrite Rule Machine

• Published in: [Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation pp. 336 - 344
• Main Authors: Aida, H., Goguen, J.A., Leinwand, S., Lincoln, P., Meseguer, J., Taheri, B., Winkler, T.
• Format: Conference Proceeding
• Language: English
• Published: IEEE Comput. Soc. Press 1992
• Subjects: Computational modeling; Computer architecture; Concurrent computing; Discrete event simulation; High performance computing; Parallel machines; Parallel processing; Parallel programming; Power engineering computing; Resource management
• ISBN: 0818627727; 9780818627729
• DOI: 10.1109/FMPC.1992.234941

The authors give an overview of the Rewrite Rule Machine's (RRM's) architecture and discuss performance estimates based on very detailed register-level simulations at the chip level, together with more abstract simulations and modeling for higher levels. For a 10000 ensemble RRM, the present estimates are as follows. (1) The raw peak performance is 576 trillion operations per second. (2) For general symbolic applications, ensemble Sun-relative speedup is roughly 6.7, and RRM performance with a wormhole network at 88% efficiency gives an idealized Sun-relative speedup of 59000. (3) For highly regular symbolic applications (the sorting problem is taken as a typical example), ensemble performance is a Sun-relative speedup of 127, and RRM performance is estimated at over 80% efficiency (relative to the cluster performance), yielding a Sun-relative speedup of over 91. (4) For systolic applications (a 2-D fluid flow problem is taken as a typical example), ensemble performance is a Sun-relative speedup of 400-670, and cluster-level performance, which should be attainable in practice, is at 82% efficiency.< >