Design and Rationale for MUPPET: A Programming Environment for Message Based Multiprocessors

MUPPET is a problem solving environment for scientific computing with message-based multiprocessors. It consists of four parts — concurrent languages, programming environments, application environments and man-machine interfaces. The programming paradigm of MUPPET is based on parallel abstract machines and transformations between them. This paradigm allows the development of programs which are portable among multiprocessors with different interconnection topologies.

[1]  Jeffrey D. Ullman,et al.  Some Thoughts About Supercomputer Organization , 1984, IEEE Computer Society International Conference.

[2]  Gregor Snelting,et al.  The PSG system: from formal language definitions to interactive programming environments , 1986, TOPL.

[3]  Dianne P. O'Leary,et al.  Data-flow algorithms for parallel matrix computation , 1985, CACM.

[4]  Heinz Mühlenbein,et al.  New solutions to the mapping problem of parallel systems: The evolution approach , 1987, Parallel Comput..

[5]  James C. Browne,et al.  Framework for formulation and analysis of parallel computation structures , 1986, Parallel Comput..

[6]  L. Snyder,et al.  Parallel Programming and the Poker Programming Environment , 1984, Computer.

[7]  M. H. Schultz,et al.  Topological properties of hypercubes , 1988, IEEE Trans. Computers.

[8]  Ehud Shapiro Systolic Programming: A Paradigm of Parallel Processing , 1984, FGCS.

[9]  Jeffrey D Ullma Computational Aspects of VLSI , 1984 .

[10]  Niklaus Wirth,et al.  Programming in Modula-2 , 1985, Texts and Monographs in Computer Science.

[11]  John L. Casti,et al.  Complexity, Language, and Life: Mathematical Approaches , 1986 .

[12]  Robert P. Cook,et al.  *MOD—A Language for Distributed Programming , 1980, IEEE Transactions on Software Engineering.

[13]  Ulf Grenander Pictures as Complex Systems , 1986 .

[14]  Shahid H. Bokhari,et al.  On the Mapping Problem , 1981, IEEE Transactions on Computers.

[15]  John R. Rice,et al.  Partitioning PDE computations: Methods and performance evaluation , 1987, Parallel Comput..

[16]  Heinz Mühlenbein,et al.  MUPPET: a programming environment for message-based multiprocessors , 1986, Parallel Comput..

[17]  Carl Hewitt,et al.  Viewing Control Structures as Patterns of Passing Messages , 1977, Artif. Intell..

[18]  R. Daniel Bergeron,et al.  Task Allocation Heuristics for Distributed Computing Systems , 1986, ICDCS.

[19]  G. C. Fox,et al.  Solving Problems on Concurrent Processors , 1988 .

[20]  Larry Rudolph,et al.  PIE: A Programming and Instrumentation Environment for Parallel Processing , 1985, IEEE Software.

[21]  Roger B. Dannenberg,et al.  AMPL: Design, Implementation, and Evaluation of a Multiprocessing Language , 1981 .

[22]  John P. Hayes,et al.  A Microprocessor-based Hypercube Supercomputer , 1986, IEEE Micro.

[23]  Lawrence Snyder,et al.  Poker on the Cosmic Cube: The First Retargetable Parallel Programming Language and Environment , 1986, ICPP.

[24]  Lawrence Snyder,et al.  Introduction to the configurable, highly parallel computer , 1982, Computer.

[25]  Heinz Mühlenbein,et al.  Parallel adaptive full-multigrid methods on message-based multiprocessors , 1986, Parallel Comput..

[26]  Henry Ledgard,et al.  Reference Manual for the ADA® Programming Language , 1983, Springer New York.

[27]  L. Uhr,et al.  Massively Parallel Multi-Computer Hardware=Software Structures for Learning , 1985 .

[28]  Nissim Francez,et al.  Script: a communication abstraction mechanism , 1985, OPSR.

[29]  P. Quinton Automatic synthesis of systolic arrays from uniform recurrent equations , 1984, ISCA 1984.

[30]  Ilya Prigogine,et al.  Order out of chaos , 1984 .

[31]  Heinz Mühlenbein,et al.  Mapping strategies in message-based multiprocessor systems , 1989, Parallel Comput..