- Author:
- Jerry L. Potter
From the Publisher:
The development of parallel processing, with the attendant technology of advanced software engineering, VLSI circuits, and artificial intelligence, now allows high-performance computer systems to reach the speeds necessary to meet the challenge of future complex scientific and commercial applications. This collection of articles documents the design of one such computer, a single instruction multiple data stream (SIMD) class supercomputer with 16,834 processing units capable of over 6 billion 8 bit operations per second. It provides a complete description of the Massively Parallel Processor (MPP), including discussions of hardware and software with special emphasis on applications, algorithms, and programming.
This system with its massively parallel hardware and advanced software is on the cutting edge of parallel processing research, making possible AI, database, and image processing applications that were once thought to be inconceivable. The massively parallel processor represents the first step toward the large-scale parallelism needed in the computers of tomorrow. Orginally built for a variety of image-processing tasks, it is fully programmable and applicable to any problem with sizeable data demands.
Contents: "History of the MPP," D. Schaefer; "Data Structures for Implementing the Classy Algorithm on the MPP," R. White; "Inversion of Positive Definite Matrices on the MPP," R. White; "LANDSAT-4 Thematic Mapper Data Processing with the MPP," R. O. Faiss; "Fluid Dynamics Modeling," E. J. Gallopoulas; "Database Management," E. Davis; "List Based Processing on the MPP," J. L. Potter; "The Massively Parallel Processor System Overvew," K. E. Batcher; "Array Unit," K. E.Batcher; "Array Control Unit," K. E. Batcher; "Staging Memory," K. E. Batcher; "PE Design," J. Burkley; "Programming the MPP," J. L. Potter; "Parallel Pascal and the MPP," A. P Reeves; "MPP System Software," K. E. Batcher; "MPP Program Development and Simulation," E. J. Gallopoulas.
J. L. Potter is Associate Professor of Computer Science at Kent State University. The Massively Parallel Processor is included in the Scientific Computation Series, edited by Dennis Gannon.
Cited By
Fischer J The Roots of Beowulf Proceedings of the 20 Years of Beowulf Workshop on Honor of Thomas Sterling's 65th Birthday, (1-6)- Makino J, Hiraki K and Inaba M GRAPE-DR Proceedings of the 2007 ACM/IEEE conference on Supercomputing, (1-11)
- Bhagavathi D, Gurla H, Olariu S, Wilson L, Schwing J and Zhang J (1998). Time- and VLSI-Optimal Sorting on Enhanced Meshes, IEEE Transactions on Parallel and Distributed Systems, 9:10, (929-937), Online publication date: 1-Oct-1998.
- Bokka V and Gurla H (1998). Constant-Time Algorithms for Constrained Triangulations on Reconfigurable Meshes, IEEE Transactions on Parallel and Distributed Systems, 9:11, (1057-1072), Online publication date: 1-Nov-1998.
- Bokka V, Gurla H, Olariu S and Schwing J (1997). Podality-Based Time-Optimal Computations on Enhanced Meshes, IEEE Transactions on Parallel and Distributed Systems, 8:10, (1019-1035), Online publication date: 1-Oct-1997.
- Maresca M (1993). Polymorphic Processor Arrays, IEEE Transactions on Parallel and Distributed Systems, 4:5, (490-506), Online publication date: 1-May-1993.
- Sunwoo M and Aggarwal J (1993). A Sliding Memory Plane Array Processor, IEEE Transactions on Parallel and Distributed Systems, 4:6, (601-612), Online publication date: 1-Jun-1993.
- Lin W, Prasanna V and Przytula K (1991). Algorithmic mapping of neural network Models onto Parallel SIMD Machines, IEEE Transactions on Computers, 40:12, (1390-1401), Online publication date: 1-Dec-1991.
- Steele G Making asynchronous parallelism safe for the world Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (218-231)
- Schmitt L and Wilson S (1988). The AIS-5000 Parallel Processor, IEEE Transactions on Pattern Analysis and Machine Intelligence, 10:3, (320-330), Online publication date: 1-May-1988.
- Albert E, Knobe K, Lukas J and Steele G Compiling Fortran 8x array features for the connection machine computer system Proceedings of the ACM/SIGPLAN conference on Parallel programming: experience with applications, languages and systems, (42-56)
- Albert E, Knobe K, Lukas J and Steele G (1988). Compiling Fortran 8x array features for the connection machine computer system, ACM SIGPLAN Notices, 23:9, (42-56), Online publication date: 1-Sep-1988.
- Onaga K and Takechi T (1986). On design of rotary array communication and wavefront-driven algorithms for solving large-scale band-limited matrix equations, ACM SIGARCH Computer Architecture News, 14:2, (308-315), Online publication date: 1-May-1986.
- Stanfill C and Kahle B (1986). Parallel free-text search on the connection machine system, Communications of the ACM, 29:12, (1229-1239), Online publication date: 1-Dec-1986.
- Onaga K and Takechi T On design of rotary array communication and wavefront-driven algorithms for solving large-scale band-limited matrix equations Proceedings of the 13th annual international symposium on Computer architecture, (308-315)
- Ball D, Blais G, Schaefer D, Wilcox G and Wagoner R Simulation of a pyramid processor Proceedings of the 17th conference on Winter simulation, (476-480)
Recommendations
Interpreting Parallel Processor Performance Measurements
This paper discusses execution time versus number of simultaneous operations in parallel computing systems. The main focus is on shared memory multiprocessors. A model for execution time as a function of the number of processes used in a computation is ...
Architecture and Performance of the Hitachi SR2201 Massively Parallel Processor System
IPPS '97: Proceedings of the 11th International Symposium on Parallel ProcessingRISC-based Massively Parallel Processors (MPPs) often show low efficiency in real-world applications because of cache miss penalty, insufficient throughput of the memory system, and poor inter-processor communication performance. Hitachi's SR2201, an ...