NDLI: A Sufficient Condition for Rate Monotonic Schedulability Based on Response Time Analysis

Content Provider	IEEE Xplore Digital Library
Author	Sangchul Han Moonju Park Minkyu Park
Copyright Year	2010
Abstract	Rate Monotonic scheduling algorithm is widely used in real-time systems and embedded systems for its implementation simplicity and optimality in fixed priority scheduling. Since determining the schedulability of a task set in Rate Monotonic scheduling is an important step in designing a real-time system, schedulability analysis has been extensively studied. Although there is an exact schedulability test method for Rate Monotonic scheduling, the exact test is too complex to be executed on-line for large number of tasks because it is based on the response time calculation which is NP-hard. Thus many researchers studied on polynomial time sufficient conditions on Rate Monotonic schedulability. The existing polynomial time sufficient conditions are in the form of a utilization bound; that is, if a task set's total utilization is not larger than a utilization bound, the task set is accepted as schedulable one. Though the utilization bound tests are simple, they suffer from poor processor utilization. In this paper, we propose a new sufficient schedulability condition based on the response time test, different from the previous approaches. The new test provides a condition that is both necessary and sufficient for task sets with period ratio less than 2, while the previous tests provide only sufficient conditions. Extensive simulations show that our test significantly outperforms the existing tests with utilization bound.
Starting Page	1751
Ending Page	1757
File Size	287773
Page Count	7
File Format	PDF
ISBN	9781424475476
e-ISBN	9781424475483
DOI	10.1109/CIT.2010.305
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2010-06-29
Publisher Place	United Kingdom
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Processor scheduling Periodic scheduling Scheduling Concrete Polynomials Schedulability test Time factors Mathematical model Rate-monotonic scheduling
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