Task scheduling in multiprocessing systems

Hesham El-Rewini, Hesham H Ali, Ted Lewis

Research output: Contribution to journalArticle

101 Citations (Scopus)

Abstract

This paper addresses the task scheduling problem in many of its variations and surveys the major solutions. It concerns scheduling program tasks on parallel and distributed systems. The tasks are the consumers, and they are represented via directed graphs called task graphs. The processing elements are the resources, and their interconnection networks are represented via undirected graphs. The scheduler generates a schedule in the form of a timing diagram called the Gantt chart, which is used to show the allocation of the parallel program tasks onto the target machine processors and the execution order of the tasks. Models are provided for representing parallel programs, parallel systems, and communication cost. Several algorithms are presented for solving the scheduling problem in some special cases.

Original languageEnglish (US)
Pages (from-to)27-37
Number of pages11
JournalComputer
Volume28
Issue number12
DOIs
StatePublished - Dec 1995

Fingerprint

Multiprocessing systems
Scheduling
Directed graphs
Communication
Processing
Costs

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Hardware and Architecture
  • Software

Cite this

Task scheduling in multiprocessing systems. / El-Rewini, Hesham; Ali, Hesham H; Lewis, Ted.

In: Computer, Vol. 28, No. 12, 12.1995, p. 27-37.

Research output: Contribution to journalArticle

El-Rewini, H, Ali, HH & Lewis, T 1995, 'Task scheduling in multiprocessing systems', Computer, vol. 28, no. 12, pp. 27-37. https://doi.org/10.1109/2.476197
El-Rewini, Hesham ; Ali, Hesham H ; Lewis, Ted. / Task scheduling in multiprocessing systems. In: Computer. 1995 ; Vol. 28, No. 12. pp. 27-37.
@article{0d223ba679b24fefb0b24233b9e75843,
title = "Task scheduling in multiprocessing systems",
abstract = "This paper addresses the task scheduling problem in many of its variations and surveys the major solutions. It concerns scheduling program tasks on parallel and distributed systems. The tasks are the consumers, and they are represented via directed graphs called task graphs. The processing elements are the resources, and their interconnection networks are represented via undirected graphs. The scheduler generates a schedule in the form of a timing diagram called the Gantt chart, which is used to show the allocation of the parallel program tasks onto the target machine processors and the execution order of the tasks. Models are provided for representing parallel programs, parallel systems, and communication cost. Several algorithms are presented for solving the scheduling problem in some special cases.",
author = "Hesham El-Rewini and Ali, {Hesham H} and Ted Lewis",
year = "1995",
month = "12",
doi = "10.1109/2.476197",
language = "English (US)",
volume = "28",
pages = "27--37",
journal = "ACM SIGPLAN/SIGSOFT Workshop on Program Analysis for Software Tools and Engineering",
issn = "0018-9162",
publisher = "IEEE Computer Society",
number = "12",

}

TY - JOUR

T1 - Task scheduling in multiprocessing systems

AU - El-Rewini, Hesham

AU - Ali, Hesham H

AU - Lewis, Ted

PY - 1995/12

Y1 - 1995/12

N2 - This paper addresses the task scheduling problem in many of its variations and surveys the major solutions. It concerns scheduling program tasks on parallel and distributed systems. The tasks are the consumers, and they are represented via directed graphs called task graphs. The processing elements are the resources, and their interconnection networks are represented via undirected graphs. The scheduler generates a schedule in the form of a timing diagram called the Gantt chart, which is used to show the allocation of the parallel program tasks onto the target machine processors and the execution order of the tasks. Models are provided for representing parallel programs, parallel systems, and communication cost. Several algorithms are presented for solving the scheduling problem in some special cases.

AB - This paper addresses the task scheduling problem in many of its variations and surveys the major solutions. It concerns scheduling program tasks on parallel and distributed systems. The tasks are the consumers, and they are represented via directed graphs called task graphs. The processing elements are the resources, and their interconnection networks are represented via undirected graphs. The scheduler generates a schedule in the form of a timing diagram called the Gantt chart, which is used to show the allocation of the parallel program tasks onto the target machine processors and the execution order of the tasks. Models are provided for representing parallel programs, parallel systems, and communication cost. Several algorithms are presented for solving the scheduling problem in some special cases.

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

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

U2 - 10.1109/2.476197

DO - 10.1109/2.476197

M3 - Article

AN - SCOPUS:0029520321

VL - 28

SP - 27

EP - 37

JO - ACM SIGPLAN/SIGSOFT Workshop on Program Analysis for Software Tools and Engineering

JF - ACM SIGPLAN/SIGSOFT Workshop on Program Analysis for Software Tools and Engineering

SN - 0018-9162

IS - 12

ER -