NDLI: Reducing Preemptions and Migrations in Real-Time Multiprocessor Scheduling Algorithms by Releasing the Fairness

Content Provider	IEEE Xplore Digital Library
Author	Nelissen, G. Berten, V. Goossens, J. Milojevic, D.
Copyright Year	2011
Abstract	Over the past two decades, numerous optimal scheduling algorithms for real-time systems on multiprocessor platforms have been proposed for the Liu \& Lay land task model. However, recent studies showed that even if optimal algorithms can theoretically schedule any feasible task set, suboptimal algorithms usually perform better when executed on real computation platforms. This can be explained by the runtime overheads that such optimal algorithms induce. We have observed that all current optimal online multiprocessor real-time scheduling algorithms are (completely or partially) based on the notion of fairness. The respect of this fairness can be the cause of numerous preemptions and migrations. We therefore propose a new algorithm -- named U-EDF -- which releases the property of fairness and instead use an EDF-like scheduling policy. The simulation results are really encouraging since they show that, in average, U-EDF produces less than one preemption and one migration per job released during the schedule. Furthermore, we strongly believe in the optimality of our algorithm since all tested task sets were correctly scheduled under U-EDF.
Starting Page	15
Ending Page	24
File Size	803096
Page Count	10
File Format	PDF
ISBN	9781457711183
ISSN	15332306
DOI	10.1109/RTCSA.2011.57
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-08-28
Publisher Place	Japan
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Schedules Program processors Electrocardiography Real time systems Optimal scheduling Scheduling algorithm Algorithm design and analysis
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

Reducing Preemptions and Migrations in EKG

Minimizing Task Preemptions and Migrations in Multiprocessor Optimal Real-Time Schedules

Notional Processors: An Approach for Multiprocessor Scheduling

An Efficient Zero-Laxity Based Real-Time Multiprocessor Scheduling Algorithm

K_multiprocessor Group (KMG) optimal scheduling algorithm for reducing preemptions and migrations in RTS

Optimal semi-partitioned scheduling in soft real-time systems

OUTSTANDING PAPER: Optimal and Adaptive Multiprocessor Real-Time Scheduling: The Quasi-Partitioning Approach

DP-FAIR: A Simple Model for Understanding Optimal Multiprocessor Scheduling

Maximizing Contention-Free Executions in Multiprocessor Scheduling

Reducing Preemptions and Migrations in Real-Time Multiprocessor Scheduling Algorithms by Releasing the Fairness

Similar Documents

Reducing Preemptions and Migrations in EKG

Minimizing Task Preemptions and Migrations in Multiprocessor Optimal Real-Time Schedules

Notional Processors: An Approach for Multiprocessor Scheduling

An Efficient Zero-Laxity Based Real-Time Multiprocessor Scheduling Algorithm

K_multiprocessor Group (KMG) optimal scheduling algorithm for reducing preemptions and migrations in RTS

Optimal semi-partitioned scheduling in soft real-time systems

OUTSTANDING PAPER: Optimal and Adaptive Multiprocessor Real-Time Scheduling: The Quasi-Partitioning Approach

DP-FAIR: A Simple Model for Understanding Optimal Multiprocessor Scheduling

Maximizing Contention-Free Executions in Multiprocessor Scheduling

Reducing Preemptions and Migrations in Real-Time Multiprocessor Scheduling Algorithms by Releasing the Fairness