The Stanford Dash Multiprocessor
Computer
A Parallel System Architecture Based on Dynamically Configurable Shared Memory Clusters
PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
Cache Injection: A Novel Technique for Tolerating Memory Latency in Bus-Based SMPs
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Program Execution Control for Communication on the Fly in Dynamic Shared Memory Processor Clusters
PARELEC '02 Proceedings of the International Conference on Parallel Computing in Electrical Engineering
PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part II
Scheduling task graphs for execution in dynamic SMP clusters with bounded number of resources
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Scheduling moldable tasks for dynamic SMP clusters in soc technology
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
| Hi-index | 0.00 |
Communication on-the-fly is a new, very efficient method of transferring data between shared memory processor clusters. It is based on synergy of processor switching between clusters and multiple reads of data from a transmission network shared by many processors. Effective use of this communication requires from the program to be specially structured. This paper presents a proposal of scheduling technique for programs given as Extended Macro-Dataflow Graphs. Scheduling is based on introducing proper transformations to the program graphs that reduce execution time of the program. These transformations work only on small subgraphs of the whole graph, but give global execution speedup. They are designed to use special architectural features such as communication on-the-fly and processor switching between clusters. Property of locality allows to preserve in every step the advantages of transformations applied to the graph earlier. The paper presents a set of such transformations. To show usefulness of them, an exemplary scheduling algorithm, which uses these transformations and an example of its application are presented.