Processor Allocation and Scheduling of Macro Dataflow Graphs on Distributed Memory Multicomputers by the PARADIGM Compiler (1993)
| Venue: | In Proceedings of the 1993 International Conference on Parallel Processing, volume II-Software |
| Citations: | 13 - 4 self |
BibTeX
@INPROCEEDINGS{Ramaswamy93processorallocation,
author = {Shankar Ramaswamy and Prithviraj Banerjee},
title = {Processor Allocation and Scheduling of Macro Dataflow Graphs on Distributed Memory Multicomputers by the PARADIGM Compiler},
booktitle = {In Proceedings of the 1993 International Conference on Parallel Processing, volume II-Software},
year = {1993},
pages = {134--138},
publisher = {CRC Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
: Functional or Control parallelism is an effective way to increase speedups in Multicomputers. Programs for these machines are represented by Macro Dataflow Graphs (MDGs) for the purpose of functional parallelism analysis and exploitation. Algorithms for allocation and scheduling of MDGs have been discussed along with some analysis of their optimality. These algorithms attempt to minimize the execution time of any given MDG through exploitation of functional parallelism. Our preliminary results show their effectiveness over naive algorithms. Keywords : Macro Dataflow Graphs, Distributed Memory Multicomputers, Allocation and Scheduling, Parallelizing Compilers, Optimization. 1 Introduction Distributed Memory Multicomputers offer significant advantages over shared memory multiprocessors in terms of cost and scalability. Unfortunately, writing efficient software for them is an extremely laborious process for users. The PARADIGM compiler project at Illinois is aimed at devising a paral...
