Mapping of algorithms into mesh connected computers

Book · Wed Jan 01 04:00:00 EST 1986

OSTI ID:7157601

Lin, T C

This thesis deals with the mapping of algorithms into mesh-connected computers. The first problem considered is about the mapping of algorithms with nested loops. For this problem, the emphasis is on the exploitation of algorithm's inherent parallelism, and the effective use of system's interconnection. The solution proposed is to use algorithm transformation to transform the loop indices to time and space indices. By this, the execution ordering of a given algorithm and the locations for performing computations can be determined. It is also shown that tradeoffs among computation time, communication time, and the number of processors can be determined by the selection of appropriate transformations. The second problem considered is the mapping of parallel algorithms to parallel processors, or the mapping problem. For this problem, the emphasis is on the minimization of interprocessor communication time. It is shown that, if the input data of an algorithm are loaded to processors appropriately, the interprocessor communication time can be greatly reduced. An execution graph model is proposed. The last part of this thesis proposes an augmented mesh architecture, called m/sup 2/-mesh. The drawbacks of mesh architecture and local memory scheme are analyzed, and the design idea for the new architecture is discussed.

• Research Organization: University of Southern California, Los Angeles (USA)
• OSTI ID: 7157601
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990210* -- Supercomputers-- (1987-1989)
ALGORITHMS
COMPUTER ARCHITECTURE
MAPPING
MATHEMATICAL LOGIC
MESH GENERATION
PARALLEL PROCESSING
PROGRAMMING