NDLI: Approximate schedulability analysis

Content Provider	IEEE Xplore Digital Library
Author	Chakraborty, S. Kunzli, S. Thiele, L.
Copyright Year	2002
Description	Author affiliation: Comput. Eng. & Networks Lab., Swiss Fed. Inst. of Technol., Switzerland (Chakraborty, S.; Kunzli, S.; Thiele, L.)
Abstract	The schedulability analysis problem for many realistic task models is intractable. Therefore, known algorithms either have exponential complexity or at best can be solved in pseudo-polynomial time, thereby restricting application of the concerned models to a large extent. We introduce the notion of "approximate schedulability analysis" and show that if a small amount of "error" (which is specified as an input to the algorithm) can be tolerated in decisions made by the algorithm, then this problem can be solved in polynomial time. Our algorithms are analogous to fully polynomial time approximation schemes in the context of optimization problems. We show that this concept of approximate schedulability analysis is fairly general and can be applied to any task model which satisfies certain "task-independence" assumptions. Lastly, we substantiate our theoretical results with experimental evidence and clearly show tradeoffs between running time of the schedulability analysis and the error incurred for various values of the input error parameter.
Sponsorship	IEEE Comput. Soc. Tech. Committee on Real-Time Syst
Starting Page	159
Ending Page	168
File Size	414244
Page Count	10
File Format	PDF
ISBN	0769518516
ISSN	10528725
DOI	10.1109/REAL.2002.1181571
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2002-12-03
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Scheduling algorithm Processor scheduling Algorithm design and analysis Polynomials Approximation algorithms Computer networks Laboratories Electronic mail Application software Error analysis
Content Type	Text
Resource Type	Article
Subject	Computer Networks and Communications Hardware and Architecture Software

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

Resource Augmentation Bounds for Approximate Demand Bound Functions

The Partitioned EDF Scheduling of Sporadic Task Systems

Approximate Holistic Aggregation in Wireless Sensor Networks

Techniques for Multiprocessor Global Schedulability Analysis

A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithms

Schedulability analysis of non-preemptive recurring real-time tasks

Scheduling Arbitrary-Deadline Sporadic Task Systems on Multiprocessors

Approximate Capacity Subregions of Uniform Multihop Wireless Networks

The partitioned multiprocessor scheduling of sporadic task systems

Approximate schedulability analysis

Similar Documents

Resource Augmentation Bounds for Approximate Demand Bound Functions

The Partitioned EDF Scheduling of Sporadic Task Systems

Approximate Holistic Aggregation in Wireless Sensor Networks

Techniques for Multiprocessor Global Schedulability Analysis

A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithms

Schedulability analysis of non-preemptive recurring real-time tasks

Scheduling Arbitrary-Deadline Sporadic Task Systems on Multiprocessors

Approximate Capacity Subregions of Uniform Multihop Wireless Networks

The partitioned multiprocessor scheduling of sporadic task systems

Approximate schedulability analysis