Scheduling precedence graphs in systems with interprocessor communication times
SIAM Journal on Computing
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
Towards an architecture-independent analysis of parallel algorithms
SIAM Journal on Computing
Analysis and evaluation of heuristic methods for static task scheduling
Journal of Parallel and Distributed Computing
IEEE Transactions on Software Engineering
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
List scheduling with and without communication delays
Parallel Computing
Task Clustering and Scheduling for Distributed Memory Parallel Architectures
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Partitioning and Scheduling Parallel Programs for Multiprocessors
Partitioning and Scheduling Parallel Programs for Multiprocessors
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Hypertool: A Programming Aid for Message-Passing Systems
IEEE Transactions on Parallel and Distributed 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
A taxonomy of scheduling in general-purpose distributed computing systems
IEEE Transactions on Software Engineering
A parallel approach for multiprocessor scheduling
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Automatic Parallelization and Scheduling of Programs on Multiprocessors using CASCH
ICPP '97 Proceedings of the international Conference on Parallel Processing
Automatic task graph generation techniques
HICSS '95 Proceedings of the 28th Hawaii International Conference on System Sciences
A Comparison of Multiprocessor Scheduling Heuristics
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 02
A New Approach to Scheduling Parallel Programs Using Task Duplication
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 02
A Bottom-Up Approach to Task Scheduling on Distributed Memory Multiprocessors
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 02
Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
On the complexity of list scheduling algorithms for distributed-memory systems
ICS '99 Proceedings of the 13th international conference on Supercomputing
Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing
IEEE Transactions on Parallel and Distributed Systems
Immune-Like System Approach to Cellular Automata-Based Scheduling
PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
Preemptive Task Scheduling for Distributed Systems (Research Note)
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
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
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 Platform Independent Parallelising Tool Based on Graph Theoretic Models
VECPAR '00 Selected Papers and Invited Talks from the 4th International Conference on Vector and Parallel Processing
MA '01 Proceedings of the 5th International Conference on Mobile Agents
Scheduling Task Graphs on Arbitrary Processor Architectures Considering Contention
HPCN Europe 2001 Proceedings of the 9th International Conference on High-Performance Computing and Networking
On Task Scheduling Accuracy: Evaluation Methodology and Results
The Journal of Supercomputing
Communication Contention in Task Scheduling
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Toward a Realistic Task Scheduling Model
IEEE Transactions on Parallel and Distributed Systems
Parallel Computing - Heterogeneous computing
Contentions-conscious dynamic but deterministic scheduling of computational and communication tasks
Proceedings of the 2006 ACM symposium on Applied computing
Contentions-conscious dynamic but deterministic scheduling of computational and communication tasks
Proceedings of the 2006 ACM symposium on Applied computing
A probabilistic scheduling heuristic for computational grids
Multiagent and Grid Systems
Optimal scheduling of task graphs on parallel systems
PDCN'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks
Support for Fine Grained Dependent Tasks in OpenMP
IWOMP '07 Proceedings of the 3rd international workshop on OpenMP: A Practical Programming Model for the Multi-Core Era
Reliability versus performance for critical applications
Journal of Parallel and Distributed Computing
Minimizing Energy Consumption for Precedence-Constrained Applications Using Dynamic Voltage Scaling
CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
Scalable scheduling algorithms for wireless networkedcontrol systems
CASE'09 Proceedings of the fifth annual IEEE international conference on Automation science and engineering
List heuristic scheduling algorithms for distributed memory systems with improved time complexity
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Green: a framework for supporting energy-conscious programming using controlled approximation
PLDI '10 Proceedings of the 2010 ACM SIGPLAN conference on Programming language design and implementation
Dynamic resource allocation of computer clusters with probabilistic workloads
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Dynamic configuration steering for a reconfigurable superscalar processor
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
A simple scheduling heuristic for heterogeneous computing environments
ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing
A parallel bi-objective hybrid metaheuristic for energy-aware scheduling for cloud computing systems
Journal of Parallel and Distributed Computing
Temperature, Power, and Makespan Aware Dependent Task Scheduling for Data Centers
GREENCOM '11 Proceedings of the 2011 IEEE/ACM International Conference on Green Computing and Communications
Critical-Task anticipation scheduling algorithm for heterogeneous and grid computing
ACSAC'06 Proceedings of the 11th Asia-Pacific conference on Advances in Computer Systems Architecture
A productive duplication-based scheduling algorithm for heterogeneous computing systems
HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
Energy-Aware Scheduling Algorithm with Duplication on Heterogeneous Computing Systems
GRID '12 Proceedings of the 2012 ACM/IEEE 13th International Conference on Grid Computing
Proceedings of the Conference on Design, Automation and Test in Europe
Proceedings of the Ninth IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis
| Hi-index | 0.00 |
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NP-completeness of the problem has instigated researchers to propose a myriad of heuristic algorithms. While these algorithms are individually reported to be efficient, it is not clear how effective they are and how well they compare against each other. A comprehensive performance evaluation and comparison of these algorithms entails addressing a number of difficult issues. One of the issues is that a large number of scheduling algorithms are based upon radically different assumptions, making their comparison on a unified basis a rather intricate task. Another issue is that there is no standard set of benchmarks that can be used to evaluate and compare these algorithms. Furthermore, most algorithms are evaluated using small problem sizes, and it is not clear how their performance scales with the problem size. In this paper, we first provide a taxonomy for classifying various algorithms into different categories according to their assumptions and functionalities. We then propose a set of benchmarks which are of diverse structures without being biased towards a particular scheduling technique and still allow variations in important parameters. We have evaluated 15 scheduling algorithms, and compared them using the proposed benchmarks. Based upon the design philosophies and principles behind these algorithms, we interpret the results and discuss why some algorithms perform better than the others.