Affiliation:
1. Centre d'Etudes et de Recherches de Toulouse, P.O. Box 4025, 31055 Toulouse Cedex, France
Abstract
We describe the MaRS machine: a parallel, distributed control multiprocessor for graph reduction using a functional machine language. The object code language is based on an optimized set of combinators, and its functional character allows an automatic parallelisation of the execution. A programming language, "MaRS LISP", has also been developed. A prototype of MaRS is currently being designed in VLSI 1.5-micron CMOS technology with 2 levels of metal, by means of a CAD system. The machine uses three basic types of processors for Reduction, Memory and Communication, plus auxiliary I/O and Arithmetic Processors; communications do not constitute an operational bottleneck, as interprocessor messages are routed via an Omega switching network. Initially, a Host Computer will be used for startup, testing and direct memory access. The machine architecture and its functional organization are described, as well as the theoretical execution model. We conclude on a number of specialized hardware and software mechanism that differentiate MaRS machine from other similar projects currently going on.
Publisher
Association for Computing Machinery (ACM)
Reference15 articles.
1. [
5
] H. B. Curry R. Feys W. Craig Combinatory Logic vol. I; North-Holland Amsterdam 1958 (2nd Printing 1968). [5] H. B. Curry R. Feys W. Craig Combinatory Logic vol. I ; North-Holland Amsterdam 1958 (2nd Printing 1968).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献