k-Depth Look-Ahead Task Scheduling in Network of Heterogeneous Processors

Authors:
Namyoon Woo;Heon Young Yeom
Affiliations:
-;-
Venue:
ICOIN '02 Revised Papers from the International Conference on Information Networking, Wireless Communications Technologies and Network Applications-Part II
Year:
2002

Citing 9
Cited 0

Analysis and evaluation of heuristic methods for static task scheduling

Journal of Parallel and Distributed Computing
Using random task graphs to investigate the potential benefits of heterogeneity in parallel systems

Proceedings of the 1992 ACM/IEEE conference on Supercomputing
Task scheduling in parallel and distributed systems

Task scheduling in parallel and distributed systems
List scheduling with and without communication delays

Parallel Computing
Static scheduling algorithms for allocating directed task graphs to multiprocessors

ACM Computing Surveys (CSUR)
Link contention-constrained scheduling and mapping of tasks

Cluster Computing
A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures

IEEE Transactions on Parallel and Distributed Systems
Task Scheduling Algorithms for Heterogeneous Processors

HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
Fast and Effective Task Scheduling in Heterogeneous Systems

HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop

Quantified Score

Hi-index	0.00

Visualization

Abstract

The objective of the task scheduling is to achieve the minimum execution time of all the tasks with their precedence requirements satisfied. Although several task scheduling heuristics for the heterogeneous environment have been presented in the literature, they overlook the various type of network and do not perform efficiently on such an environment. We present the new scheduling heuristic which is named the 'k-Depth Look-ahead.' The proposed heuristic takes the network heterogeneity into consideration and our experimental study shows that the proposed heuristic generates a better schedule especially under the condition that the network resource costs high.