On the optimality of minimum laxity and earliest deadline scheduling for real-time multiprocessors

D. Towsley, Shivendra Panwar

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

Abstract

The problem of scheduling jobs with real-time constraints on a multiprocessor is considered. If a job does not complete within a certain time interval of its arrival to such a system, it is considered useless and need not be served. It is therefore desirable to schedule jobs so that the fraction of jobs served within their respective deadlines is maximized. Such a system is modeled as a multiple server queue. It is shown, for a variety of systems, that the minimum laxity (ML) policy maximizes the fraction of jobs that successfully complete service when jobs must begin service by their deadline, and that the earliest deadline policy does the same for wide class of systems when jobs must complete service by their deadlines. Results are given for unreliable multiprocessors and multiprocessors that serve several priority classes of jobs.

Original languageEnglish (US)
Title of host publicationProc EUROMICRO 90 Workshop Real Time
PublisherPubl by IEEE
Pages17-24
Number of pages8
ISBN (Print)0818620765
StatePublished - 1990
EventProceedings - EUROMICRO '90 Workshop on Real Time - Horsholm, Den
Duration: Jun 6 1990Jun 8 1990

Other

OtherProceedings - EUROMICRO '90 Workshop on Real Time
CityHorsholm, Den
Period6/6/906/8/90

Fingerprint

Servers
Scheduling

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Towsley, D., & Panwar, S. (1990). On the optimality of minimum laxity and earliest deadline scheduling for real-time multiprocessors. In Proc EUROMICRO 90 Workshop Real Time (pp. 17-24). Publ by IEEE.

On the optimality of minimum laxity and earliest deadline scheduling for real-time multiprocessors. / Towsley, D.; Panwar, Shivendra.

Proc EUROMICRO 90 Workshop Real Time. Publ by IEEE, 1990. p. 17-24.

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

Towsley, D & Panwar, S 1990, On the optimality of minimum laxity and earliest deadline scheduling for real-time multiprocessors. in Proc EUROMICRO 90 Workshop Real Time. Publ by IEEE, pp. 17-24, Proceedings - EUROMICRO '90 Workshop on Real Time, Horsholm, Den, 6/6/90.
Towsley D, Panwar S. On the optimality of minimum laxity and earliest deadline scheduling for real-time multiprocessors. In Proc EUROMICRO 90 Workshop Real Time. Publ by IEEE. 1990. p. 17-24
Towsley, D. ; Panwar, Shivendra. / On the optimality of minimum laxity and earliest deadline scheduling for real-time multiprocessors. Proc EUROMICRO 90 Workshop Real Time. Publ by IEEE, 1990. pp. 17-24
@inproceedings{751f038080e541c8b5b25028c9852cda,
title = "On the optimality of minimum laxity and earliest deadline scheduling for real-time multiprocessors",
abstract = "The problem of scheduling jobs with real-time constraints on a multiprocessor is considered. If a job does not complete within a certain time interval of its arrival to such a system, it is considered useless and need not be served. It is therefore desirable to schedule jobs so that the fraction of jobs served within their respective deadlines is maximized. Such a system is modeled as a multiple server queue. It is shown, for a variety of systems, that the minimum laxity (ML) policy maximizes the fraction of jobs that successfully complete service when jobs must begin service by their deadline, and that the earliest deadline policy does the same for wide class of systems when jobs must complete service by their deadlines. Results are given for unreliable multiprocessors and multiprocessors that serve several priority classes of jobs.",
author = "D. Towsley and Shivendra Panwar",
year = "1990",
language = "English (US)",
isbn = "0818620765",
pages = "17--24",
booktitle = "Proc EUROMICRO 90 Workshop Real Time",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - On the optimality of minimum laxity and earliest deadline scheduling for real-time multiprocessors

AU - Towsley, D.

AU - Panwar, Shivendra

PY - 1990

Y1 - 1990

N2 - The problem of scheduling jobs with real-time constraints on a multiprocessor is considered. If a job does not complete within a certain time interval of its arrival to such a system, it is considered useless and need not be served. It is therefore desirable to schedule jobs so that the fraction of jobs served within their respective deadlines is maximized. Such a system is modeled as a multiple server queue. It is shown, for a variety of systems, that the minimum laxity (ML) policy maximizes the fraction of jobs that successfully complete service when jobs must begin service by their deadline, and that the earliest deadline policy does the same for wide class of systems when jobs must complete service by their deadlines. Results are given for unreliable multiprocessors and multiprocessors that serve several priority classes of jobs.

AB - The problem of scheduling jobs with real-time constraints on a multiprocessor is considered. If a job does not complete within a certain time interval of its arrival to such a system, it is considered useless and need not be served. It is therefore desirable to schedule jobs so that the fraction of jobs served within their respective deadlines is maximized. Such a system is modeled as a multiple server queue. It is shown, for a variety of systems, that the minimum laxity (ML) policy maximizes the fraction of jobs that successfully complete service when jobs must begin service by their deadline, and that the earliest deadline policy does the same for wide class of systems when jobs must complete service by their deadlines. Results are given for unreliable multiprocessors and multiprocessors that serve several priority classes of jobs.

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

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

M3 - Conference contribution

SN - 0818620765

SP - 17

EP - 24

BT - Proc EUROMICRO 90 Workshop Real Time

PB - Publ by IEEE

ER -