NDLI: Utilization bound re-visited

Content Provider	IEEE Xplore Digital Library
Author	Deji Chen Mok, A.K. Tei-Wei Kuo
Copyright Year	1999
Description	Author affiliation: Fisher-Rosemount Syst. Inc., Austin, TX, USA (Deji Chen)
Abstract	Utilization bound is a well-known concept first introduced in the seminal paper of Liu and Layland (1973) which provides a simple and practical way to test the schedulability of a real-time task set. The original utilization bound for the fixed-priority scheduler was given as a function of the number of tasks in the periodic task set. We define the utilization bound as a function of the information about the task set. By making use of more than just the number of tasks, we obtain various improvements over the Liu and Layland bound. In particular, we give a more intuitive derivation of the bound as a function of the number of harmonic chains in the task periods which allows us to derive a simpler algorithm to calculate such bounds. We derive algorithms that yield better bounds as a function of the period parameters of the task set. We also give a generalization of the bound for tasks whose deadlines are smaller than their periods.
Starting Page	295
Ending Page	302
File Size	686627
Page Count	8
File Format	PDF
ISBN	0769503063
DOI	10.1109/RTCSA.1999.811259
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1999-12-13
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Scheduling algorithm Polynomials Computer science Processor scheduling Performance evaluation System testing Real time systems
Content Type	Text
Resource Type	Article

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

Minimum and maximum utilization bounds for multiprocessor RM scheduling

Utilization bound revisited

Period-Dependent Initial Values for Exact Schedulability Test of Rate Monotonic Systems

A generalized utilization bound test for fixed-priority real-time scheduling

Worst-case utilization bound for EDF scheduling on real-time multiprocessor systems

Improvement to Quick Processor-Demand Analysis for EDF-Scheduled Real-Time Systems

Improvements in Polynomial-Time Feasibility Testing for EDF

Fixed-Priority Multiprocessor Scheduling with Liu and Layland's Utilization Bound

Statistical analysis of WCET for scheduling

Utilization bound re-visited

Similar Documents

Minimum and maximum utilization bounds for multiprocessor RM scheduling

Utilization bound revisited

Period-Dependent Initial Values for Exact Schedulability Test of Rate Monotonic Systems

A generalized utilization bound test for fixed-priority real-time scheduling

Worst-case utilization bound for EDF scheduling on real-time multiprocessor systems

Improvement to Quick Processor-Demand Analysis for EDF-Scheduled Real-Time Systems

Improvements in Polynomial-Time Feasibility Testing for EDF

Fixed-Priority Multiprocessor Scheduling with Liu and Layland's Utilization Bound

Statistical analysis of WCET for scheduling

Utilization bound re-visited