DocumentCode
3296847
Title
A Grimm collection of MIMD fairy tales
Author
Blank, Tom ; Nickolls, John R.
Author_Institution
MasPar Computer Corp., Sunnyvale, CA, USA
fYear
1992
fDate
19-21 Oct 1992
Firstpage
448
Lastpage
457
Abstract
The authors present two tales about massively parallel processors: `Who is Fairest of Us All?´ and `The SPMD Path.´ With a twist of humor, the tales discuss single-instruction multiple-data systems (SIMD), multiple-instruction multiple-data (MIMD) systems, differences, and the single program multiple data (SPMD) programming model. The first tale introduces autonomous SIMD (ASIMD), and then looks at the flexibility, programmability, cost, and effectiveness of MIMD and ASIMD systems. It is shown that ASIMD systems have the flexibility to solve real applications cost-effectively. The second tale describes the simple path that SPMD provides for programming, and why an ASIMD machine works well
Keywords
parallel processing; programming; cost; massively parallel processors; multiple-instruction multiple-data; programmability; single program multiple data programming model; single-instruction multiple-data systems; Communication system control; Concurrent computing; Control systems; Costs; Electric shock; Mirrors; Parallel processing; Parallel programming; Snow; Yarn;
fLanguage
English
Publisher
ieee
Conference_Titel
Frontiers of Massively Parallel Computation, 1992., Fourth Symposium on the
Conference_Location
McLean, VA
Print_ISBN
0-8186-2772-7
Type
conf
DOI
10.1109/FMPC.1992.234881
Filename
234881
Link To Document