A maximal chain approach for scheduling tasks in a multiprocessor system

Sachin Pawaskar, Hesham H Ali

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Scheduling dependent tasks is one of the most challenging versions of the scheduling problem in parallel and distributed systems. It is known to be computationally intractable in its general form as well as several restricted cases. As a result, researchers have studied restricted forms of the problem by constraining either the task graph representing the parallel tasks or the computer model. Also, in an attempt to solve the problem in the general case, a number of heuristics have been developed. In this paper, we study the scheduling problem for a fixed number of processors m. In the proposed work, we approach the problem by recursively reducing the m-processor scheduling to (m-1)-processor scheduling until we apply the optimal two-processor scheduling algorithm when m equals two. This is accomplished by identifying a maximal chain C in the task graph G and merging the (m-1) processor scheduling of (G-C) and the 1-processor scheduling of C. A number of experiments were conducted to compare the suggested approach with the standard list-scheduling algorithm. Based on the outcome of the conducted experiments, the proposed algorithms outperformed or matched the performance of the list heuristic almost all the time.

Original languageEnglish (US)
Title of host publicationProceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems
EditorsT. Gonzalez
Pages429-436
Number of pages8
Volume16
StatePublished - 2004
EventProceedings of the 16th IASTED International Conference on Parallel and Distributed Computing and Systems - Cambridge, MA, United States
Duration: Nov 9 2004Nov 11 2004

Other

OtherProceedings of the 16th IASTED International Conference on Parallel and Distributed Computing and Systems
CountryUnited States
CityCambridge, MA
Period11/9/0411/11/04

Fingerprint

Scheduling
Scheduling algorithms
Merging
Experiments

Keywords

  • Heuristics
  • Optimal algorithms
  • Parallel Processing
  • Task Scheduling

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Pawaskar, S., & Ali, H. H. (2004). A maximal chain approach for scheduling tasks in a multiprocessor system. In T. Gonzalez (Ed.), Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems (Vol. 16, pp. 429-436). [439-063]

A maximal chain approach for scheduling tasks in a multiprocessor system. / Pawaskar, Sachin; Ali, Hesham H.

Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems. ed. / T. Gonzalez. Vol. 16 2004. p. 429-436 439-063.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Pawaskar, S & Ali, HH 2004, A maximal chain approach for scheduling tasks in a multiprocessor system. in T Gonzalez (ed.), Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems. vol. 16, 439-063, pp. 429-436, Proceedings of the 16th IASTED International Conference on Parallel and Distributed Computing and Systems, Cambridge, MA, United States, 11/9/04.
Pawaskar S, Ali HH. A maximal chain approach for scheduling tasks in a multiprocessor system. In Gonzalez T, editor, Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems. Vol. 16. 2004. p. 429-436. 439-063
Pawaskar, Sachin ; Ali, Hesham H. / A maximal chain approach for scheduling tasks in a multiprocessor system. Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems. editor / T. Gonzalez. Vol. 16 2004. pp. 429-436
@inproceedings{e9528c42463d4b74b586c87f0d5c8827,
title = "A maximal chain approach for scheduling tasks in a multiprocessor system",
abstract = "Scheduling dependent tasks is one of the most challenging versions of the scheduling problem in parallel and distributed systems. It is known to be computationally intractable in its general form as well as several restricted cases. As a result, researchers have studied restricted forms of the problem by constraining either the task graph representing the parallel tasks or the computer model. Also, in an attempt to solve the problem in the general case, a number of heuristics have been developed. In this paper, we study the scheduling problem for a fixed number of processors m. In the proposed work, we approach the problem by recursively reducing the m-processor scheduling to (m-1)-processor scheduling until we apply the optimal two-processor scheduling algorithm when m equals two. This is accomplished by identifying a maximal chain C in the task graph G and merging the (m-1) processor scheduling of (G-C) and the 1-processor scheduling of C. A number of experiments were conducted to compare the suggested approach with the standard list-scheduling algorithm. Based on the outcome of the conducted experiments, the proposed algorithms outperformed or matched the performance of the list heuristic almost all the time.",
keywords = "Heuristics, Optimal algorithms, Parallel Processing, Task Scheduling",
author = "Sachin Pawaskar and Ali, {Hesham H}",
year = "2004",
language = "English (US)",
volume = "16",
pages = "429--436",
editor = "T. Gonzalez",
booktitle = "Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems",

}

TY - GEN

T1 - A maximal chain approach for scheduling tasks in a multiprocessor system

AU - Pawaskar, Sachin

AU - Ali, Hesham H

PY - 2004

Y1 - 2004

N2 - Scheduling dependent tasks is one of the most challenging versions of the scheduling problem in parallel and distributed systems. It is known to be computationally intractable in its general form as well as several restricted cases. As a result, researchers have studied restricted forms of the problem by constraining either the task graph representing the parallel tasks or the computer model. Also, in an attempt to solve the problem in the general case, a number of heuristics have been developed. In this paper, we study the scheduling problem for a fixed number of processors m. In the proposed work, we approach the problem by recursively reducing the m-processor scheduling to (m-1)-processor scheduling until we apply the optimal two-processor scheduling algorithm when m equals two. This is accomplished by identifying a maximal chain C in the task graph G and merging the (m-1) processor scheduling of (G-C) and the 1-processor scheduling of C. A number of experiments were conducted to compare the suggested approach with the standard list-scheduling algorithm. Based on the outcome of the conducted experiments, the proposed algorithms outperformed or matched the performance of the list heuristic almost all the time.

AB - Scheduling dependent tasks is one of the most challenging versions of the scheduling problem in parallel and distributed systems. It is known to be computationally intractable in its general form as well as several restricted cases. As a result, researchers have studied restricted forms of the problem by constraining either the task graph representing the parallel tasks or the computer model. Also, in an attempt to solve the problem in the general case, a number of heuristics have been developed. In this paper, we study the scheduling problem for a fixed number of processors m. In the proposed work, we approach the problem by recursively reducing the m-processor scheduling to (m-1)-processor scheduling until we apply the optimal two-processor scheduling algorithm when m equals two. This is accomplished by identifying a maximal chain C in the task graph G and merging the (m-1) processor scheduling of (G-C) and the 1-processor scheduling of C. A number of experiments were conducted to compare the suggested approach with the standard list-scheduling algorithm. Based on the outcome of the conducted experiments, the proposed algorithms outperformed or matched the performance of the list heuristic almost all the time.

KW - Heuristics

KW - Optimal algorithms

KW - Parallel Processing

KW - Task Scheduling

UR - http://www.scopus.com/inward/record.url?scp=11844302831&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=11844302831&partnerID=8YFLogxK

M3 - Conference contribution

VL - 16

SP - 429

EP - 436

BT - Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems

A2 - Gonzalez, T.

ER -