Reducing Data Hazards on Multi-pipelined DSP Architecture with Loop Scheduling
Journal of VLSI Signal Processing Systems - Special issue on future directions in the design and implementations of DSP systems
A duplication based compile time scheduling method for task parallelism
Compiler optimizations for scalable parallel systems
Hindsight Helps: Deterministic Task Scheduling with Backtracking
ICPP '97 Proceedings of the international Conference on Parallel Processing
Probabilistic Rotation: Scheduling Graphs with Uncertain Execution Time
ICPP '97 Proceedings of the international Conference on Parallel Processing
Simultaneous Compression of Makespan and Number of Processors Using CRP
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Benchmarking the Task Graph Scheduling Algorithms
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
IEEE Transactions on Parallel and Distributed Systems
Parallel Computing - Heterogeneous computing
Automatic choice of scheduling heuristics for parallel/distributed computing
Scientific Programming
Dynamic energy aware task scheduling using run-queue peek
PDCN'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks
A transformation-based approach to static multiprocessor scheduling
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Dynamic energy aware task scheduling for periodic tasks using expected execution time feedback
PDCN '08 Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks
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
Partitioning composite web services for decentralized execution using a genetic algorithm
Future Generation Computer Systems
A simple scheduling heuristic for heterogeneous computing environments
ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing
Graph metrics for predicting speedup in static multiprocessor scheduling
ICHIT'11 Proceedings of the 5th international conference on Convergence and hybrid information technology
Resource management of distributed virtual machines
International Journal of Ad Hoc and Ubiquitous Computing
| Hi-index | 0.01 |
Many algorithms for scheduling DAGs on multi-processors have been proposed, but there has been little work done to determine their effectiveness. Since multi-processor scheduling is an NP-hard problem, no exact tractible algorithm exists, and no baseline is available from which to compare the resulting schedules. Furthermore, performance guarantees have been found for only a few simple DAGs. This paper is an attempt to quantify the differences in five of the heuristics. Classification criteria are defined for the DAGs, and the differences between the heuristics are noted for various criteria. The comparison is made between a graph based method, two critical path methods, and two list scheduling heuristics. The empirical performance of the five heuristics is compared when they are applied to the randomly generated DAGs.