A new approach to the maximum flow problem
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Partitioning Problems in Parallel, Pipeline, and Distributed Computing
IEEE Transactions on Computers
On the Complexity of Scheduling Problems for Parallel/Pipelined Machines
IEEE Transactions on Computers
Improved Algorithms for Mapping Pipelined and Parallel Computations
IEEE Transactions on Computers
Spawn: A Distributed Computational Economy
IEEE Transactions on Software Engineering
On the Assignment Problem of Arbitrary Process Systems to Heterogeneous Distributed Computer Systems
IEEE Transactions on Computers
DAWGS—a distributed compute server utilizing idle workstations
Journal of Parallel and Distributed Computing
Fast Allocation of Processes in Distributed and Parallel Systems
IEEE Transactions on Parallel and Distributed Systems
A Generalized Scheme for Mapping Parallel Algorithms
IEEE Transactions on Parallel and Distributed Systems
A taxonomy of scheduling in general-purpose distributed computing systems
IEEE Transactions on Software Engineering
A learning automata based framework for task assignment in heterogeneous computing systems
Proceedings of the 1999 ACM symposium on Applied computing
Exploiting Knowledge of Temporal Behaviour in Parallel Programs for Improving Distributed Mapping
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Clustering and reassignment-based mapping strategy for message-passing architectures
Journal of Systems Architecture: the EUROMICRO Journal
HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
A Scalable Task Duplication Based Scheduling Algorithm for Heterogeneous Systems
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Improving Scheduling of Tasks in a Heterogeneous Environment
IEEE Transactions on Parallel and Distributed Systems
Branch-and-bound task allocation with task clustering-based pruning
Journal of Parallel and Distributed Computing
Visual programming support for graph-oriented parallel-distributed processing: Research Articles
Software—Practice & Experience
Task allocation for maximizing reliability of distributed systems: a simulated annealing approach
Journal of Parallel and Distributed Computing
A New Task Graph Model for Mapping Message Passing Applications
IEEE Transactions on Parallel and Distributed Systems
Computers and Industrial Engineering
Modelling message-passing programs for static mapping
EURO-PDP'00 Proceedings of the 8th Euromicro conference on Parallel and distributed processing
Modeling and analysis of composite network embeddings
Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
High performance task scheduling algorithm for heterogeneous computing system
ICA3PP'05 Proceedings of the 6th international conference on Algorithms and Architectures for Parallel Processing
| Hi-index | 0.00 |
The problem of allocating task interaction graphs (TIGs) to heterogeneous computing systems to minimize job completion time is investigated. The only restriction is that the interprocessor communication cost is the same for any pair of processors. This is suitable for local area network based systems, such as Ethernet, as well as fully interconnected multiprocessor systems. An optimal polynomial solution exists if sufficient homogeneous processors and communication capacity are available. This solution is generalized to obtain two faster heuristics, one for the case of homogeneous processors and the other for heterogeneous processors. The heuristics were tested extensively with 60,900 systematically generated random TIGs and shown to be stable independent of the size of the TIG. A performance model is also proposed to predict the performance of the heuristic algorithms, and it is successful in explaining the experimental results qualitatively.