Heuristic Algorithms for Task Assignment in Distributed Systems
IEEE Transactions on Computers
Scheduling precedence graphs in systems with interprocessor communication times
SIAM Journal on Computing
Scheduling with sufficient loosely coupled processors
Journal of Parallel and Distributed Computing
A bridging model for parallel computation
Communications of the ACM
Towards an architecture-independent analysis of parallel algorithms
SIAM Journal on Computing
General purpose parallel architectures
Handbook of theoretical computer science (vol. A)
An experimental investigation of distributed matrix multiplication techniques
Software—Practice & Experience
PYRROS: static task scheduling and code generation for message passing multiprocessors
ICS '92 Proceedings of the 6th international conference on Supercomputing
Models of machines and computation for mapping in multicomputers
ACM Computing Surveys (CSUR)
Models and algorithms for task allocation in a parallel environment
Models and algorithms for task allocation in a parallel environment
LogP: a practical model of parallel computation
Communications of the ACM
The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms
SIAM Journal on Computing
On Parallelizing the Multiprocessor Scheduling Problem
IEEE Transactions on Parallel and Distributed Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
On the Granularity and Clustering of Directed Acyclic Task Graphs
IEEE Transactions on Parallel and Distributed Systems
DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors
IEEE Transactions on Parallel and Distributed Systems
Task assignment in distributed systems
Task assignment in distributed systems
A Realistic Model and an Efficient Heuristic for Scheduling with Heterogeneous Processors
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Optimal sharing of bags of tasks in heterogeneous clusters
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Asymptotically Optimal Worksharing in HNOWs: How Long is "Sufficiently Long?"
ANSS '03 Proceedings of the 36th annual symposium on Simulation
Scheduling Strategies for Master-Slave Tasking on Heterogeneous Processor Platforms
IEEE Transactions on Parallel and Distributed Systems
Task allocation in a multi-server system
Journal of Scheduling
Journal of Parallel and Distributed Computing
International Journal of High Performance Computing and Networking
The impact of heterogeneity on master-slave scheduling
Parallel Computing
Mapping pipeline skeletons onto heterogeneous platforms
Journal of Parallel and Distributed Computing
The impact of heterogeneity on master-slave on-line scheduling
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
The architecture of SIG computing environment and its application to image processing
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
From static code distribution to more shrinkage for the multiterminal cut
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
PARA'10 Proceedings of the 10th international conference on Applied Parallel and Scientific Computing - Volume Part I
Using xQx to model and solve the uncapacitated task allocation problem
Operations Research Letters
Hi-index | 14.98 |
This paper studies the scheduling of tasks on a pool of identical workstations in a network where message passing is used for data transfer and communication between processors and where the precedence relations among tasks form a send-receive graph. Our parallel computation model differs from previous models by including all of the following practical considerations: 1) The sending and receiving of multiple messages from one processor to another is performed sequentially, 2) communication overhead is proportional to the message size, and 3) the starting and ending task must be performed on the same machine. These factors are crucial when performing parallel task execution using a pool of workstations whose communication primitives are provided by off-the-shelf packages, such as PVM, and whose message sizes are nontrivial. Although our model is new, using reduction from other well-known scheduling results shows that finding a scheduling with the optimal makespan is NP-hard. Our focus, therefore, is on developing and analyzing approximation algorithms for this problem. When the number of workstations in the network is abundant, a linear approximation algorithm is given with a proven performance bound of two times the optimal. When the number of available workstations is a fixed constant $k$ that is greater than $2$, we show an $O(n log n){\hbox{-}}{\rm time}$ approximation algorithm which always performs better than $(3+{\frac{k-2}{k}})$ times the optimal. Simulation results show that, on the average, both of our approximation algorithms perform much better than the worst case analysis and both generate schedulings whose makespans are very close to optimal.