Behavior of task scheduling algorithms with probabilistic module execution times

M. Kholief, I. Awad, M. El-Derini, M. Nagi, H. Ali

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

Abstract

Static task scheduling in distributed computing systems is a very complex problem and known to be NP-hard. This problem is even harder when the module execution times become probabilistic. In this paper we study the effect of probabilistic module execution times on the performance of task-scheduling algorithms. We show that in static task scheduling, for probabilistic module execution times, and in the existence of some factors there is no need to use an expensive task-scheduling algorithm. Given any two static task-scheduling algorithms that use deterministic module execution times in assigning task modules to the distributed system, the performance of these two algorithms will not remain the same when these module execution times become probabilistic rather than deterministic. We also study the effects of some factors an our results.

Original languageEnglish (US)
Title of host publicationProceedings - 3rd IEEE Symposium on Computers and Communications, ISCC 1998
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages647-651
Number of pages5
ISBN (Print)0818685387, 9780818685385
DOIs
StatePublished - Jan 1 1998
Event3rd IEEE Symposium on Computers and Communications, ISCC 1998 - Athens, Greece
Duration: Jun 30 1998Jul 2 1998

Publication series

NameProceedings - 3rd IEEE Symposium on Computers and Communications, ISCC 1998

Other

Other3rd IEEE Symposium on Computers and Communications, ISCC 1998
CountryGreece
CityAthens
Period6/30/987/2/98

Fingerprint

Scheduling algorithms
Scheduling
Distributed computer systems

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Safety, Risk, Reliability and Quality

Cite this

Kholief, M., Awad, I., El-Derini, M., Nagi, M., & Ali, H. (1998). Behavior of task scheduling algorithms with probabilistic module execution times. In Proceedings - 3rd IEEE Symposium on Computers and Communications, ISCC 1998 (pp. 647-651). [702616] (Proceedings - 3rd IEEE Symposium on Computers and Communications, ISCC 1998). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISCC.1998.702616

Behavior of task scheduling algorithms with probabilistic module execution times. / Kholief, M.; Awad, I.; El-Derini, M.; Nagi, M.; Ali, H.

Proceedings - 3rd IEEE Symposium on Computers and Communications, ISCC 1998. Institute of Electrical and Electronics Engineers Inc., 1998. p. 647-651 702616 (Proceedings - 3rd IEEE Symposium on Computers and Communications, ISCC 1998).

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

Kholief, M, Awad, I, El-Derini, M, Nagi, M & Ali, H 1998, Behavior of task scheduling algorithms with probabilistic module execution times. in Proceedings - 3rd IEEE Symposium on Computers and Communications, ISCC 1998., 702616, Proceedings - 3rd IEEE Symposium on Computers and Communications, ISCC 1998, Institute of Electrical and Electronics Engineers Inc., pp. 647-651, 3rd IEEE Symposium on Computers and Communications, ISCC 1998, Athens, Greece, 6/30/98. https://doi.org/10.1109/ISCC.1998.702616
Kholief M, Awad I, El-Derini M, Nagi M, Ali H. Behavior of task scheduling algorithms with probabilistic module execution times. In Proceedings - 3rd IEEE Symposium on Computers and Communications, ISCC 1998. Institute of Electrical and Electronics Engineers Inc. 1998. p. 647-651. 702616. (Proceedings - 3rd IEEE Symposium on Computers and Communications, ISCC 1998). https://doi.org/10.1109/ISCC.1998.702616
Kholief, M. ; Awad, I. ; El-Derini, M. ; Nagi, M. ; Ali, H. / Behavior of task scheduling algorithms with probabilistic module execution times. Proceedings - 3rd IEEE Symposium on Computers and Communications, ISCC 1998. Institute of Electrical and Electronics Engineers Inc., 1998. pp. 647-651 (Proceedings - 3rd IEEE Symposium on Computers and Communications, ISCC 1998).
@inproceedings{ecd01bff06c34e369dee39e7c3396d29,
title = "Behavior of task scheduling algorithms with probabilistic module execution times",
abstract = "Static task scheduling in distributed computing systems is a very complex problem and known to be NP-hard. This problem is even harder when the module execution times become probabilistic. In this paper we study the effect of probabilistic module execution times on the performance of task-scheduling algorithms. We show that in static task scheduling, for probabilistic module execution times, and in the existence of some factors there is no need to use an expensive task-scheduling algorithm. Given any two static task-scheduling algorithms that use deterministic module execution times in assigning task modules to the distributed system, the performance of these two algorithms will not remain the same when these module execution times become probabilistic rather than deterministic. We also study the effects of some factors an our results.",
author = "M. Kholief and I. Awad and M. El-Derini and M. Nagi and H. Ali",
year = "1998",
month = "1",
day = "1",
doi = "10.1109/ISCC.1998.702616",
language = "English (US)",
isbn = "0818685387",
series = "Proceedings - 3rd IEEE Symposium on Computers and Communications, ISCC 1998",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "647--651",
booktitle = "Proceedings - 3rd IEEE Symposium on Computers and Communications, ISCC 1998",

}

TY - GEN

T1 - Behavior of task scheduling algorithms with probabilistic module execution times

AU - Kholief, M.

AU - Awad, I.

AU - El-Derini, M.

AU - Nagi, M.

AU - Ali, H.

PY - 1998/1/1

Y1 - 1998/1/1

N2 - Static task scheduling in distributed computing systems is a very complex problem and known to be NP-hard. This problem is even harder when the module execution times become probabilistic. In this paper we study the effect of probabilistic module execution times on the performance of task-scheduling algorithms. We show that in static task scheduling, for probabilistic module execution times, and in the existence of some factors there is no need to use an expensive task-scheduling algorithm. Given any two static task-scheduling algorithms that use deterministic module execution times in assigning task modules to the distributed system, the performance of these two algorithms will not remain the same when these module execution times become probabilistic rather than deterministic. We also study the effects of some factors an our results.

AB - Static task scheduling in distributed computing systems is a very complex problem and known to be NP-hard. This problem is even harder when the module execution times become probabilistic. In this paper we study the effect of probabilistic module execution times on the performance of task-scheduling algorithms. We show that in static task scheduling, for probabilistic module execution times, and in the existence of some factors there is no need to use an expensive task-scheduling algorithm. Given any two static task-scheduling algorithms that use deterministic module execution times in assigning task modules to the distributed system, the performance of these two algorithms will not remain the same when these module execution times become probabilistic rather than deterministic. We also study the effects of some factors an our results.

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

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

U2 - 10.1109/ISCC.1998.702616

DO - 10.1109/ISCC.1998.702616

M3 - Conference contribution

AN - SCOPUS:85053138463

SN - 0818685387

SN - 9780818685385

T3 - Proceedings - 3rd IEEE Symposium on Computers and Communications, ISCC 1998

SP - 647

EP - 651

BT - Proceedings - 3rd IEEE Symposium on Computers and Communications, ISCC 1998

PB - Institute of Electrical and Electronics Engineers Inc.

ER -