Allocation for the SANDAC multiprocessor system

Book · Tue Dec 31 23:00:00 EST 1985

OSTI ID:5045854

Ravl, T M; Ercegovac, M D

This report describes an algorithm for the static allocation of tasks in a general Dataflow Multiprocessor and the SANDAC IV system in particular. Initially a model of execution and the underlying assumptions about the architecture are outlined. The authors then discuss a Graph Reduction algorithm for preprocessing the computation graph. The Graph Reduction algorithm reduces a fine grain graph to an optimal grain graph. The heuristic allocation algorithm is presented and is based on giving precedence to critical paths and minimizing the communication time between tasks. The performance of the algorithm is analyzed and the effect of varying parameters is studied. Subsequently an alternative variation with better characteristics is proposed.

• OSTI ID: 5045854
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990210* -- Supercomputers-- (1987-1989)
990220 -- Computers
Computerized Models
& Computer Programs-- (1987-1989)
ALGORITHMS
ARRAY PROCESSORS
COMMUNICATIONS
COMPUTER ARCHITECTURE
COMPUTER CODES
COMPUTER GRAPHICS
DATA-FLOW PROCESSING
MATHEMATICAL LOGIC
PARAMETRIC ANALYSIS
PERFORMANCE TESTING
PROGRAMMING
S CODES
TESTING