Download:
|
by Song Chen, Mary M. Eshaghian
ftp://ftp.njit.edu/pub/cis/mary/Cluster-M/concur95.ps.gz
Add To MetaCart
Abstract:
This paper presents a generic technique for mapping parallel algorithms onto parallel architectures. The proposed technique is a fast recursive mapping algorithm which is a component of the Cluster-M programming tool. The other components of Cluster-M are the Specification module and the Representation module. In the Specification module, for a given task specified by a high-level machine-independent program, a clustered task graph called Spec graph is generated. In the Representation module, for a given architecture or computing organization, a clustered system graph called Rep graph is generated. Given a task (or system) graph, a Spec (or Rep) graph can be generated using one of the clustering algorithms presented in this paper. The clustering is done only once for a given task graph (system graph) independent of any system graphs (task graphs). It is a machine-independent (application-independent) clustering, therefore, it is not repeated for different mappings. The Cluster-M mapping algorithm presented produces a sub-optimal matching of a given Spec graph containing M task modules, onto a Rep graph of N processors, in O(MN) time. This generic algorithm is suitable for both the allocation problem and the scheduling problem. Its performance is compared to other leading techniques. We show that Cluster-M produces better or similar results in significantly less time and using less or equal number of processors as compared to the other known methods. 1
Citations
|
195
|
A Taxonomy of Scheduling in General-purpose Distributed Computing Systems
– Casavant, Kuhl
- 1988
|
|
135
|
Hypenool: A Programming Aid for Message-Passing Systems
– Wu, Gajski
- 1990
|
|
131
|
DSC: Scheduling parallel tasks on an unbounded number of processors
– Yang, Gerasoulis
- 1994
|
|
128
|
On the mapping problem
– Bokhari
- 1981
|
|
122
|
Multiprocessor Scheduling with the aid of Network Flow Algorithms
– Stone
- 1977
|
|
98
|
A Comparison of Clustering Heuristics for Scheduling DAGS on Multiprocessors
– Gemsoulis, Yang
- 1992
|
|
97
|
Heuristic Algorithms for task assignment in distributed systems
– Lo
- 1988
|
|
96
|
A general approach to mapping of parallel computation upon multiprocessor architecture
– Kim, Brown
- 1988
|
|
96
|
Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors
– Sarkar
- 1989
|
|
88
|
Scheduling parallel program tasks onto arbitrary target machines
– Rewini, Lewis
- 1990
|
|
84
|
Allocating modules to processors in a distributed system
– Fernandez-Baca
- 1989
|
|
72
|
Partitioning Problems in Parallel, Pipelined, and Distributed Computing
– Bokhari
- 1988
|
|
63
|
Optimal scheduling for two-processor systems
– Coffman, Graham
- 1972
|
|
45
|
Automatic Determination of Grain Size for Efficient Parallel Processing
– McCreary, Gill
- 1989
|
|
45
|
A Graph Matching Approach to Optimal Task Assignment in Distributed Computing System Using a Minimax Criterion
– Shen, Tsai
- 1985
|
|
33
|
A shortest tree algorithm for optimal assignments across space and time in a distributed processor system
– Bokhari
- 1981
|
|
31
|
On mapping parallel algorithms into parallel architectures
– Berman, Snyder
- 1984
|
|
30
|
A Mapping Strategy for Parallel Processing
– Lee, Aggarwal
- 1987
|
|
27
|
A generalized scheme for mapping parallel algorithms
– Chaudhary, Aggarwal
- 1993
|
|
27
|
Task allocation onto a hypercube by recursive mincut bipartitionning
– Ercal, Ramanujam, et al.
- 1990
|
|
21
|
Cluster partitioning approaches to mapping parallel programs onto a hypercube
– Sadayappan, Ercal, et al.
- 1990
|
|
10
|
OREGAMI: Software Tools for Mapping Parallel Computations to Parallel Architectures
– Lo, Rajopadhye, et al.
- 1990
|
|
5
|
Cluster-M Parallel Programming Paradigm
– Eshaghian, Shaaban
- 1994
|
|
4
|
Mapping arbitrary non-uniform task graphs onto arbitrary non-uniform system graphs
– Chen, Eshaghian, et al.
- 1995
|
|
3
|
Mapping Realistic Data Sets on Parallel Computers
– Ponnusamy, Mansour, et al.
- 1993
|
