Processor Allocation and Scheduling of Macro Dataflow Graphs on Distributed Memory Multicomputers by the PARADIGM Compiler

Authors:
Shankar Ramaswamy;Prithviraj Banerjee
Affiliations:
University of Illinois at Urbana-Champaign;University of Illinois at Urbana-Champaign
Venue:
ICPP '93 Proceedings of the 1993 International Conference on Parallel Processing - Volume 02
Year:
1993

Citing 0
Cited 3

Asynchronous Resource Management

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Automatic choice of scheduling heuristics for parallel/distributed computing

Scientific Programming
On the validity of flow-level tcp network models for grid and cloud simulations

ACM Transactions on Modeling and Computer Simulation (TOMACS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Functional or Control parallelism is an efiectiuc way to increase speedups in Multicomputers. Programs for these machines are represented by Macro Dataflow Graphs (MRGsJ for the purpose of functional parallelism analysk and exploitation. Algorithms for allocation and schedttlang of MDGs have been discussed along with some analysis of their optirnality. These algorithms attempt to minimize the execution time of any given MDG through exploitation of functional parallelism. Our preliminary results show their eflectiveness over naive algorithms.