Optimal mapping of sequences of data parallel tasks (1995) [23 citations — 8 self]
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Subhlok95optimalmapping,author = {Jaspal Subhlok and Gary Vondran},
title = {Optimal mapping of sequences of data parallel tasks},
booktitle = {In Proceedings of the Fifth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming},
year = {1995},
pages = {134--143},
publisher = {ACM Press}
}
Years of Citing Articles
Abstract:
Many applications in a variety of domains including digital signal processing, image processing, and computer vision are composed of a sequence of tasks that act on a stream of input data sets in a pipelined manner. Recent research has established that these applications are best mapped to a massively parallel machine by dividing the tasks into modulesand assigninga subset of the available processors to each module. This paper addresses the problem of optimally mapping such applications onto a massively parallel machine. We formulate the problem of optimizing throughput in task pipelines and present two new solution algorithms. The formulation uses a general and realistic model for inter-task communication, takes memory constraints into account, and addresses the entire problem of mapping which includes clustering tasks into modules, assignment of processors to modules, and possible replication of modules. The first algorithm is based on dynamic programming and finds the optimal mapping of k tasks onto P processors in O(P 4
