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
Parallel Computer Architecture: A Hardware/Software Approach
Parallel Computer Architecture: A Hardware/Software Approach
Scalable Parallel Computing: Technology,Architecture,Programming
Scalable Parallel Computing: Technology,Architecture,Programming
Scheduling and Automatic Parallelization
Scheduling and Automatic Parallelization
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
IEEE Transactions on Parallel and Distributed Systems
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
Exploiting Unused Time Slots in List Scheduling Considering Communication Contention
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
A Static Scheduling Heuristic for Heterogeneous Processors
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing-Volume II
Scheduling Task Graphs on Arbitrary Processor Architectures Considering Contention
HPCN Europe 2001 Proceedings of the 9th International Conference on High-Performance Computing and Networking
A Dynamic Matching and Scheduling Algorithm for Heterogeneous Computing Systems
HCW '98 Proceedings of the Seventh Heterogeneous Computing Workshop
Task Scheduling Algorithms for Heterogeneous Processors
HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
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
Comparison of Contention Aware List Scheduling Heuristics for Cluster Computing
ICPPW '01 Proceedings of the 2001 International Conference on Parallel Processing Workshops
Communication Contention in Task Scheduling
IEEE Transactions on Parallel and Distributed Systems
Journal of Parallel and Distributed Computing
Journal of Parallel and Distributed Computing
Toward a Realistic Task Scheduling Model
IEEE Transactions on Parallel and Distributed Systems
An efficient MPI_allgather for grids
Proceedings of the 16th international symposium on High performance distributed computing
A dominant predecessor duplication scheduling algorithm for heterogeneous systems
The Journal of Supercomputing
The impact of heterogeneity on master-slave scheduling
Parallel Computing
Mapping pipeline skeletons onto heterogeneous platforms
Journal of Parallel and Distributed Computing
APPT '09 Proceedings of the 8th International Symposium on Advanced Parallel Processing Technologies
A memetic algorithm for reliability-based dynamic scheduling in heterogeneous computing environments
PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
Contention-aware scheduling with task duplication
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
Scheduling multiple DAGs onto heterogeneous systems
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Scheduling tasks and communications on a hierarchical system with message contention
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part II
AnthillSched: a scheduling strategy for irregular and iterative I/O-intensive parallel jobs
JSSPP'05 Proceedings of the 11th international conference on Job Scheduling Strategies for Parallel Processing
Hi-index | 0.00 |
Scheduling computational tasks on processors is a key issue for high-performance computing. Although a large number of scheduling heuristics have been presented in the literature, most of them target only homogeneous resources. Moreover, these heuristics often rely on a model where the number of processors is bounded but where the communication capabilities of the target architecture are not restricted. In this paper, we deal with a more realistic model for heterogeneous networks of workstations, where each processor can send and/or receive at most one message at any given time-step. First, we state a complexity result that shows that the model is at least as difficult as the standard one. Then, we show how to modify classical list scheduling techniques to cope with the new model. Next we introduce a new scheduling heuristic which incorporates load-balancing criteria into the decision process of scheduling and mapping ready tasks. Experimental results conducted using six classical testbeds (LAPLACE, LU, STENCIL, FORK-JOIN, DOOLITTLE, and LDMt) show very promising results.