List heuristic scheduling algorithms for distributed memory systems with improved time complexity

Authors:
Maruf Ahmed;Sharif M. H. Chowdhury;Masud Hasan
Affiliations:
Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology, Dhaka, Bangladesh;Department of Computer Science and Engineering, Shah Jalal University of Science and Technology, Sylhet, Bangladesh;Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology, Dhaka, Bangladesh
Venue:
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Year:
2008

Citing 13
Cited 0

Scheduling precedence graphs in systems with interprocessor communication times

SIAM Journal on Computing
Applications and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed memory multiprocessors

Proceedings of the 1992 ACM/IEEE conference on Supercomputing
On the complexity of list scheduling algorithms for distributed-memory systems

ICS '99 Proceedings of the 13th international conference on Supercomputing
The soft heap: an approximate priority queue with optimal error rate

Journal of the ACM (JACM)
Grain Size Determination for Parallel Processing

IEEE Software
Hypertool: A Programming Aid for Message-Passing Systems

IEEE Transactions on Parallel and Distributed Systems
A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures

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 Comparison of General Approaches to Multiprocessor Scheduling

IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Fast and Effective Task Scheduling in Heterogeneous Systems

HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
Benchmarking the Task Graph Scheduling Algorithms

IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a compile time list heuristic scheduling algorithm called Low Cost Critical Path algorithm (LCCP) for the distributed memory systems. LCCP has low scheduling cost for both homogeneous and heterogeneous systems. In some recent papers list heuristic scheduling algorithms keep their scheduling cost low by using a fixed size heap and a FIFO, where the heap always keeps fixed number of tasks and the excess tasks are inserted in the FIFO. When the heap has empty spaces, tasks are inserted in it from the FIFO. The best known list scheduling algorithm based on this strategy requires two heap restoration operations, one after extraction and another after insertion. Our LCCP algorithm improves on this by using only one such operation for both the extraction and insertion, which in theory reduces the scheduling cost without compromising the scheduling performance. In our experiment we compare LCCP with other well known list scheduling algorithms and it shows that LCCP is the fastest among all.