NDLI: Comparison of hybrid minimum laxity/first-in-first-out scheduling policies for real-time multiprocessors

Content Provider	IEEE Xplore Digital Library
Author	Nain, P. Towsley, D.
Copyright Year	1968
Abstract	The behavior of two policies for scheduling customers with deadlines until the beginning of service onto multiprocessors is studied. Both policies attempt to approximate the performance of the minimum laxity (ML) scheduling policy without incurring its complete overhead by dividing the queue in two: one, of maximum size n>0, managed using the minimum laxity policy, and another, of unbounded size, managed in a first-in-first-out manner. One policy, F/ML(n), places the ML queue at the front, i.e. customers finding n or more in the system enter the first-in-first-out (FIFO) queue which in turn feeds the ML queue. The other policy, ML(n)/F, places the ML queue at the back, i.e. arriving customers enter the ML queue and if the total number in the system exceeds n, forces one customer from the ML queue to the FIFO queue. It is shown that these seemingly dissimilar policies exhibit exactly the same behavior for a fixed value of n both when customers are allowed to be discarded when they miss their deadlines before entering service and when they are not allowed to be discarded. Monotonicity properties are established for both policies.<>
Sponsorship	IEEE Computer Society Technical Committee on Distributed Process IEEE Computer Society Technical Committee on VLSI IEEE Technical Committee on Computer Architecture IEEE Computer Society
Starting Page	1271
Ending Page	1278
Page Count	8
File Size	769727
File Format	PDF
ISSN	00189340
Volume Number	41
Issue Number	10
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1992-10-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Feeds Stochastic processes Scheduling Real time systems Information science Contracts
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science Computational Theory and Mathematics Software Hardware and Architecture

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Comparison of hybrid minimum laxity / first-in -first-out scheduling policies for real-time multiprocessors

Comparison of hybrid minimum laxity / first-in -first-out scheduling policies for real-time multiprocessors

Rate-monotonic scheduling on uniform multiprocessors

A performance analysis of minimum laxity and earliest deadline scheduling in a real-time system

Scheduling distributed real-time tasks with minimum jitter

Robustness results concerning EDF scheduling upon uniform multiprocessors

An exact stochastic analysis of priority-driven periodic real-time systems and its approximations

Optimal utilization bounds for the fixed-priority scheduling of periodic task systems on identical multiprocessors

Comment on On-line scheduling policies for a class of IRIS real-time tasks

Comparison of hybrid minimum laxity/first-in-first-out scheduling policies for real-time multiprocessors

Similar Documents

Comparison of hybrid minimum laxity / first-in -first-out scheduling policies for real-time multiprocessors

Comparison of hybrid minimum laxity / first-in -first-out scheduling policies for real-time multiprocessors

Rate-monotonic scheduling on uniform multiprocessors

A performance analysis of minimum laxity and earliest deadline scheduling in a real-time system

Scheduling distributed real-time tasks with minimum jitter

Robustness results concerning EDF scheduling upon uniform multiprocessors

An exact stochastic analysis of priority-driven periodic real-time systems and its approximations

Optimal utilization bounds for the fixed-priority scheduling of periodic task systems on identical multiprocessors

Comment on On-line scheduling policies for a class of IRIS real-time tasks

Comparison of hybrid minimum laxity/first-in-first-out scheduling policies for real-time multiprocessors