A Mapping Strategy for Parallel Processing
IEEE Transactions on Computers
On mapping parallel algorithms into parallel architectures
Journal of Parallel and Distributed Computing
Heuristic Algorithms for Task Assignment in Distributed Systems
IEEE Transactions on Computers
Automatic determination of grain size for efficient parallel processing
Communications of the ACM - Special issue: multiprocessing
Scheduling parallel program tasks onto arbitrary target machines
Journal of Parallel and Distributed Computing - Special issue: software tools for parallel programming and visualization
Task allocation onto a hypercube by recursive mincut bipartitioning
Journal of Parallel and Distributed Computing
Task scheduling in parallel and distributed systems
Task scheduling in parallel and distributed systems
Evaluation of two programming paradigms for heterogeneous computing
Journal of Parallel and Distributed Computing
Partitioning and Scheduling Parallel Programs for Multiprocessors
Partitioning and Scheduling Parallel Programs for Multiprocessors
Hypertool: A Programming Aid for Message-Passing Systems
IEEE Transactions on Parallel and Distributed Systems
DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Computers
IEEE Transactions on Computers
Mapping Heterogeneous Task Graphs onto Networks: Execution Time Optimization
PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies
Executing multiple pipelined data analysis operations in the grid
Proceedings of the 2002 ACM/IEEE conference on Supercomputing
Partial task assignment of task graphs under heterogeneous resource constraints
Proceedings of the 40th annual Design Automation Conference
Use of PVFS for Efficient Execution of Jobs with Pipeline-Shared I/O
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Efficient scheduling algorithm for component-based networks
Future Generation Computer Systems
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Scheduling of tasks with batch-shared I/O on heterogeneous systems
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Semi-automatic restructuring of offloadable tasks for many-core accelerators
SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
| Hi-index | 0.00 |
In this paper, a generic technique for mapping heterogeneous task graphs onto heterogeneous system graphs is presented. The task and system graphs studied in this paper have nonuniform computation and communication weights associated with the nodes and the edges. Two clustering algorithms have been proposed which can be used to obtain a multilayer clustered graph called a Spec graph from a given task graph and a multilayer clustered graph called a Rep graph from a given system graph. We present a mapping algorithm which produces a suboptimal matching of a given Spec graph containing M task modules, onto a Rep graph of N processors, in O(MP) fame, where P=max(M,N). Our experimental results indicate that our mapping algorithm is the fastest one and generates results which are better than, or similar to, those of other leading techniques which work only for restricted task or system graphs.