DocumentCode
2767597
Title
The GPA machine: a generally partitionable MSIMD architecture
Author
Bridges, Timothy
Author_Institution
Data Parallel Syst. Inc., Bloomington, IN, USA
fYear
1990
fDate
8-10 Oct 1990
Firstpage
196
Lastpage
203
Abstract
The GPA machine, a massively parallel, multiple single-instruction-stream-multiple-data-stream (MSIMD) system is described. Its distinguishing characteristics is the generality of its partitioning capabilities. Like the PASM system it can be dynamically reconfigured to operate as one or more independent SIMD machines. However, unlike PASM, the only constraint placed on partitioning is that an individual processing element is a member of at most one partition. This capability allows for reconfiguration based on the run-time status of dynamic data structures and for partitioning of disconnected and overlapping data structures. Significant speedups are expected from operating on data structures in place; copying of data to a newly configured partition is unnecessary. The GPA system consists of N processing-element/RAM pairs and an interconnection network providing access to and from P control processors or microcontrollers. With current technologies, values for N and P of 64K and 16, respectively, are feasible
Keywords
parallel architectures; parallel machines; GPA machine; control processors; dynamic data structures; interconnection network; massively parallel; microcontrollers; multiple single-instruction-stream-multiple-data-stream; partitionable MSIMD architecture; run-time status; Aerodynamics; Bridges; Computer architecture; Concurrent computing; Control systems; Data structures; Parallel processing; Random access memory; Read-write memory; Runtime;
fLanguage
English
Publisher
ieee
Conference_Titel
Frontiers of Massively Parallel Computation, 1990. Proceedings., 3rd Symposium on the
Conference_Location
College Park, MD
Print_ISBN
0-8186-2053-6
Type
conf
DOI
10.1109/FMPC.1990.89460
Filename
89460
Link To Document