Models of machines and computation for mapping in multicomputers
ACM Computing Surveys (CSUR)
IEEE Transactions on Parallel and Distributed Systems
Task Allocation on a Network of Processors
IEEE Transactions on Computers
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Scheduling and Load Balancing in Parallel and Distributed Systems
Scheduling and Load Balancing in Parallel and Distributed Systems
Message Multicasting in Heterogeneous Networks
SIAM Journal on Computing
Broadcast scheduling optimization for heterogeneous cluster systems
Journal of Algorithms
Efficient Collective Communication on Heterogeneous Networks of Workstations
ICPP '98 Proceedings of the 1998 International Conference on Parallel Processing
A Realistic Model and an Efficient Heuristic for Scheduling with Heterogeneous Processors
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Developments from a June 1996 seminar on Online algorithms: the state of the art
Optimal sharing of bags of tasks in heterogeneous clusters
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
Efficient collective communication in distributed heterogeneous systems
Journal of Parallel and Distributed Computing
A New Task Mapping Technique for Communication-Aware Scheduling Strategies
ICPPW '01 Proceedings of the 2001 International Conference on Parallel Processing Workshops
Improving Static Scheduling Using Inter-task Concurrency Measures
ICPPW '01 Proceedings of the 2001 International Conference on Parallel Processing Workshops
On broadcasting in heterogenous networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Communication Contention in Task Scheduling
IEEE Transactions on Parallel and Distributed Systems
Minimizing mean flowtime and makespan on master--slave systems
Journal of Parallel and Distributed Computing
Off-Line and On-Line Scheduling on Heterogeneous Master-Slave Platforms
PDP '06 Proceedings of the 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing
Minimizing Sum of Completion Times and Makespan in Master-Slave Systems
IEEE Transactions on Computers
The master-slave paradigm with heterogeneous processors
IEEE Transactions on Parallel and Distributed Systems
Hi-index | 0.00 |
In this paper, we assess the impact of heterogeneity on scheduling independent tasks on master-slave platforms. We assume a realistic one-port model where the master can communicate with a single slave at any time. We target both on-line and off-line scheduling problems, and we focus on simpler instances where all tasks have the same size. While such on-line problems can be solved in polynomial time on homogeneous platforms, we show that there does not exist any optimal deterministic algorithm for heterogeneous platforms. Whether the source of heterogeneity comes from computation speeds, or from communication bandwidths, or from both, we establish lower bounds on the competitive ratio of any deterministic algorithm. We provide such bounds for the most important objective functions: the minimization of the makespan (or total execution time), the minimization of the maximum response time (difference between completion time and release time), and the minimization of the sum of all response times. Altogether, we obtain nine theorems which nicely assess the impact of heterogeneity on on-line scheduling. For off-line scheduling, we prove several result for problems with release dates, either optimality or NP-hardness. These theoretical contributions are complemented on the practical side by the implementation of several heuristics on a small but fully heterogeneous MPI platform. Our results show the superiority of those heuristics which fully take into account the relative capacity of the communication links.