NDLI: An optimal boundary fair scheduling

Content Provider	Springer Nature Link
Author	Nelissen, Geoffrey Su, Hang Guo, Yifeng Zhu, Dakai Nélis, Vincent Goossens, Joël
Copyright Year	2014
Abstract	Nowadays, many real-time operating systems discretize the time relying on a system time unit. To take this behavior into account, real-time scheduling algorithms must adopt a discrete-time model in which both timing requirements of tasks and their time allocations have to be integer multiples of the system time unit. That is, tasks cannot be executed for less than one time unit, which implies that they always have to achieve a minimum amount of work before they can be preempted. Assuming such a discrete-time model, the authors of Zhu et al. (Proceedings of the 24th IEEE international real-time systems symposium (RTSS 2003), 2003, J Parallel Distrib Comput 71(10):1411–1425, 2011) proposed an efficient “boundary fair” algorithm (named BF) and proved its optimality for the scheduling of periodic tasks while achieving full system utilization. However, BF cannot handle sporadic tasks due to their inherent irregular and unpredictable job release patterns. In this paper, we propose an optimal boundary-fair scheduling algorithm for sporadic tasks (named BF $$^2$$ ), which follows the same principle as BF by making scheduling decisions only at the job arrival times and (expected) task deadlines. This new algorithm was implemented in Linux and we show through experiments conducted upon a multicore machine that BF $$^2$$ outperforms the state-of-the-art discrete-time optimal scheduler (PD $$^2$$ ), benefiting from much less scheduling overheads. Furthermore, it appears from these experimental results that BF $$^2$$ is barely dependent on the length of the system time unit while PD $$^2$$ —the only other existing solution for the scheduling of sporadic tasks in discrete-time systems—sees its number of preemptions, migrations and the time spent to take scheduling decisions increasing linearly when improving the time resolution of the system.
Starting Page	456
Ending Page	508
Page Count	53
File Format	PDF
ISSN	09226443
Journal	Real-Time Systems
Volume Number	50
Issue Number	4
e-ISSN	15731383
Language	English
Publisher	Springer US
Publisher Date	2014-04-01
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Real-time Scheduling Optimal Discrete-time Multiprocessor Fairness 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

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

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

Quasi-partitioned scheduling: optimality and adaptation in multiprocessor real-time systems

Multiprocessor scheduling by reduction to uniprocessor: an original optimal approach

Multiprocessor extensions to real-time calculus

Compositional multiprocessor scheduling: the GMPR interface

Global scheduling based reliability-aware power management for multiprocessor real-time systems

A hierarchical multiprocessor bandwidth reservation scheme with timing guarantees

Generalized tardiness bounds for global multiprocessor scheduling

An optimal boundary fair scheduling

Similar Documents

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

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

Quasi-partitioned scheduling: optimality and adaptation in multiprocessor real-time systems

Multiprocessor scheduling by reduction to uniprocessor: an original optimal approach

Multiprocessor extensions to real-time calculus

Compositional multiprocessor scheduling: the GMPR interface

Global scheduling based reliability-aware power management for multiprocessor real-time systems

A hierarchical multiprocessor bandwidth reservation scheme with timing guarantees

Generalized tardiness bounds for global multiprocessor scheduling

An optimal boundary fair scheduling