Towards an architecture-independent analysis of parallel algorithms
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Scheduling with sufficient loosely coupled processors
Journal of Parallel and Distributed Computing
Analysis and evaluation of heuristic methods for static task scheduling
Journal of Parallel and Distributed Computing
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
Task scheduling in parallel and distributed systems
Task scheduling in parallel and distributed systems
A comparison of list schedules for parallel processing systems
Communications of the ACM
Grain Size Determination for Parallel Processing
IEEE Software
Hypertool: A Programming Aid for Message-Passing 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
DFRN: A New Approach for Duplication Based Scheduling for Distributed Memory Multiprocessor Systems
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
(R) FAST: A Low-Complexity Algorithm for Efficient Scheduling of DAGs on Parallel Processors
ICPP '96 Proceedings of the Proceedings of the 1996 International Conference on Parallel Processing - Volume 2
A New Approach to Scheduling Parallel Programs Using Task Duplication
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 02
Low-Cost Task Scheduling for Distributed-Memory Machines
IEEE Transactions on Parallel and Distributed Systems
A Graph-Oriented Task Manager for Small Multiprocessor Systems
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
A New Parallelism Management Scheme for Multiprocessor Systems
ParNum '99 Proceedings of the 4th International ACPC Conference Including Special Tracks on Parallel Numerics and Parallel Computing in Image Processing, Video Processing, and Multimedia: Parallel Computation
Performance evaluation of a list scheduling algorithm in distributed memory multiprocessor systems
Future Generation Computer Systems - Special issue: Modeling and simulation in supercomputing and telecommunications
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 1 - Volume 02
Journal of Parallel and Distributed Computing
Energy aware DAG scheduling on heterogeneous systems
Cluster Computing
| Hi-index | 0.00 |
Scheduling parallel tasks, represented as a Directed Acyclic Graph (DAG), on a multiprocessor system has been an important research area in the past decades. One of the critical aspects of a class of scheduling algorithms, called "List Scheduling," is how to decide which task is to be scheduled next. This is achieved by assigning priorities to the nodes or the edges of the input DAG, and thus the task with the highest priority will be scheduled next. This paper proposes a low complexity scheduling algorithm to improve the priority node selection criteria in list scheduling algorithms. The worst case performance of the proposed algorithm is analyzed for general input DAGs. Also, the worst case performance and the optimality conditions are obtained for tree structured input DAGs. The performance comparison study shows that the proposed algorithm outperforms existing scheduling algorithms especially for input DAGs with high communication overheads. The performance improvement over existing algorithms becomes larger as the input DAG becomes more dense and the level of parallelism in the DAG is increased.