NDLI: Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm

Content Provider	Springer Nature Link
Author	Geeraerts, Gilles Goossens, Joël Lindström, Markus
Copyright Year	2012
Abstract	Baker and Cirinei (Lecture Notes in Computer Science, vol. 4878, Springer, pp. 62–75, 2007) have introduced an exact but naive algorithm, that consists in solving a state reachability problem in a finite automaton, to check whether a set of sporadic hard real-time tasks is schedulable on an identical multiprocessor platform. However, this algorithm suffers from poor performance due to the exponential size of the automaton relative to the size of the task set. In this paper, we build on the work of Baker and Cirinei, and rely on their formalism to characterise the complexity of this problem. We prove that it is PSpace-complete. In order to obtain an algorithm that is applicable in practice to systems of realistic sizes, we successfully apply techniques developed by the formal verification community, specifically antichain techniques (Doyen and Raskin in Lecture Notes in Computer Science, vol. 6015, Springer, pp. 2–22, 2010) to this scheduling problem. For that purpose, we define and prove the correctness of a simulation relation on Baker and Cirinei’s automaton. We show that our improved algorithm yields dramatically improved performance for the schedulability test and opens for many further improvements. This work is an extended and revised version of a previous conference paper by the same authors (Lindström et al., Proceedings of the 19th International Conference on Real-Time and Network Systems (RTNS 2011), pp. 25–34, 2011).
Starting Page	171
Ending Page	218
Page Count	48
File Format	PDF
ISSN	09226443
Journal	Real-Time Systems
Volume Number	49
Issue Number	2
e-ISSN	15731383
Language	English
Publisher	Springer US
Publisher Date	2012-12-05
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Hard real-time scheduling Formal methods Automata theory Sporadic tasks Exact schedulability test Multiprocessor scheduling Complexity Computer Systems Organization and Communication Networks Communications Engineering, Networks Special Purpose and Application-Based Systems Performance and Reliability Control, Robotics, Mechatronics
Content Type	Text
Resource Type	Article
Subject	Control and Optimization Computer Networks and Communications Control and Systems Engineering Electrical and Electronic Engineering Computer Science Applications Modeling and Simulation

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

An analysis of global edf schedulability for arbitrary-deadline sporadic task systems

Improved multiprocessor global schedulability analysis

A pre-order relation for exact schedulability test of sporadic tasks on multiprocessor Global Fixed-Priority scheduling

Noname manuscript no. (will be inserted by the editor) multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm.

LRE-TL: an optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines

Interference-aware fixed-priority schedulability analysis on multiprocessors

DP-Fair: a unifying theory for optimal hard real-time multiprocessor scheduling

Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible

On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley’s optimal priority assignment algorithm

Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm

Similar Documents

An analysis of global edf schedulability for arbitrary-deadline sporadic task systems

Improved multiprocessor global schedulability analysis

A pre-order relation for exact schedulability test of sporadic tasks on multiprocessor Global Fixed-Priority scheduling

Noname manuscript no. (will be inserted by the editor) multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm.

LRE-TL: an optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines

Interference-aware fixed-priority schedulability analysis on multiprocessors

DP-Fair: a unifying theory for optimal hard real-time multiprocessor scheduling

Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible

On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley’s optimal priority assignment algorithm

Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm