MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling

Gilad Koren, Dennis Shasha, Shih Chen Huang

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

Abstract

We study competitive on-line scheduling in multiprocessor real-time environments. In our model, every task has a deadline and a value that it obtains only if it completes by its deadline. A task can be assigned to any processor, all of which are equally powerful. The problem is to design an on-line scheduling algorithm (i.e., one in which the scheduler has no knowledge of a task until it is released) with worst case guarantees as to the total value obtained by the system. We study systems with two or more processors. We present an inherent limit on the best competitive guarantee that any on-line parallel real-time scheduler can give. Then we present a competitive algorithm that achieves a worst case guarantee which is within a small factor from the best possible guarantee in many cases. The models are a distributed system having a centralized scheduler as well as a shared memory multiprocessor.

Original languageEnglish (US)
Title of host publicationProceedings - Real-Time Systems Symposium
Editors Anon
PublisherPubl by IEEE
Pages172-181
Number of pages10
ISBN (Print)081864480X
StatePublished - 1993
EventProceedings of the Real- Time Systems Symposium - Durham, NC, USA
Duration: Dec 1 1993Dec 3 1993

Other

OtherProceedings of the Real- Time Systems Symposium
CityDurham, NC, USA
Period12/1/9312/3/93

Fingerprint

Real time systems
Scheduling
Scheduling algorithms
Data storage equipment

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture

Cite this

Koren, G., Shasha, D., & Huang, S. C. (1993). MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling. In Anon (Ed.), Proceedings - Real-Time Systems Symposium (pp. 172-181). Publ by IEEE.

MOCA : A multiprocessor on-line competitive algorithm for real-time system scheduling. / Koren, Gilad; Shasha, Dennis; Huang, Shih Chen.

Proceedings - Real-Time Systems Symposium. ed. / Anon. Publ by IEEE, 1993. p. 172-181.

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

Koren, G, Shasha, D & Huang, SC 1993, MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling. in Anon (ed.), Proceedings - Real-Time Systems Symposium. Publ by IEEE, pp. 172-181, Proceedings of the Real- Time Systems Symposium, Durham, NC, USA, 12/1/93.
Koren G, Shasha D, Huang SC. MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling. In Anon, editor, Proceedings - Real-Time Systems Symposium. Publ by IEEE. 1993. p. 172-181
Koren, Gilad ; Shasha, Dennis ; Huang, Shih Chen. / MOCA : A multiprocessor on-line competitive algorithm for real-time system scheduling. Proceedings - Real-Time Systems Symposium. editor / Anon. Publ by IEEE, 1993. pp. 172-181
@inproceedings{ecccaf6f5c7f4cceaa459a9a0b25e3c6,
title = "MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling",
abstract = "We study competitive on-line scheduling in multiprocessor real-time environments. In our model, every task has a deadline and a value that it obtains only if it completes by its deadline. A task can be assigned to any processor, all of which are equally powerful. The problem is to design an on-line scheduling algorithm (i.e., one in which the scheduler has no knowledge of a task until it is released) with worst case guarantees as to the total value obtained by the system. We study systems with two or more processors. We present an inherent limit on the best competitive guarantee that any on-line parallel real-time scheduler can give. Then we present a competitive algorithm that achieves a worst case guarantee which is within a small factor from the best possible guarantee in many cases. The models are a distributed system having a centralized scheduler as well as a shared memory multiprocessor.",
author = "Gilad Koren and Dennis Shasha and Huang, {Shih Chen}",
year = "1993",
language = "English (US)",
isbn = "081864480X",
pages = "172--181",
editor = "Anon",
booktitle = "Proceedings - Real-Time Systems Symposium",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - MOCA

T2 - A multiprocessor on-line competitive algorithm for real-time system scheduling

AU - Koren, Gilad

AU - Shasha, Dennis

AU - Huang, Shih Chen

PY - 1993

Y1 - 1993

N2 - We study competitive on-line scheduling in multiprocessor real-time environments. In our model, every task has a deadline and a value that it obtains only if it completes by its deadline. A task can be assigned to any processor, all of which are equally powerful. The problem is to design an on-line scheduling algorithm (i.e., one in which the scheduler has no knowledge of a task until it is released) with worst case guarantees as to the total value obtained by the system. We study systems with two or more processors. We present an inherent limit on the best competitive guarantee that any on-line parallel real-time scheduler can give. Then we present a competitive algorithm that achieves a worst case guarantee which is within a small factor from the best possible guarantee in many cases. The models are a distributed system having a centralized scheduler as well as a shared memory multiprocessor.

AB - We study competitive on-line scheduling in multiprocessor real-time environments. In our model, every task has a deadline and a value that it obtains only if it completes by its deadline. A task can be assigned to any processor, all of which are equally powerful. The problem is to design an on-line scheduling algorithm (i.e., one in which the scheduler has no knowledge of a task until it is released) with worst case guarantees as to the total value obtained by the system. We study systems with two or more processors. We present an inherent limit on the best competitive guarantee that any on-line parallel real-time scheduler can give. Then we present a competitive algorithm that achieves a worst case guarantee which is within a small factor from the best possible guarantee in many cases. The models are a distributed system having a centralized scheduler as well as a shared memory multiprocessor.

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

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

M3 - Conference contribution

AN - SCOPUS:0027849448

SN - 081864480X

SP - 172

EP - 181

BT - Proceedings - Real-Time Systems Symposium

A2 - Anon, null

PB - Publ by IEEE

ER -