NDLI: Preempt a Job or Not in EDF Scheduling of Uniprocessor Systems

Content Provider	IEEE Xplore Digital Library
Author	Jinkyu Lee Shin, K.G.
Copyright Year	1968
Abstract	The earliest-deadline-first (EDF) policy has been widely studied for the scheduling of real-time jobs for its effectiveness and simplicity. However, since each preemption incurs an additional delay to the execution of jobs, the effectiveness of EDF is affected greatly by the underlying preemption policy that determines if and when a higher-priority job is allowed to preempt a currently executing lower-priority job. To address this problem, we propose a new and better (in meeting job deadlines) preemption policy of EDF, given a non-zero preemption delay. Specifically, we propose a controlled preemption (CP) policy that controls the condition of preempting jobs, whereas existing approaches focus on that of preempted jobs. We define cp-EDF in which the CP policy is applied to EDF, and analyze its schedulability. This schedulability analysis is then utilized to develop an algorithm that assigns the optimal control parameters of cp-EDF. Our in-depth evaluation has demonstrated that cp-EDF with the optimal parameter assignment improves EDF schedulability over existing preemption policies by up to 7.4%.
Sponsorship	IEEE Computer Society Technical Committee on Distributed Process IEEE Computer Society Technical Committee on VLSI IEEE Technical Committee on Computer Architecture IEEE Computer Society
Starting Page	1197
Ending Page	1206
Page Count	10
File Size	1110267
File Format	PDF
ISSN	00189340
Volume Number	63
Issue Number	5
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2014-01-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Delay Scheduling algorithms Algorithm design and analysis Real-time systems Schedules Scheduling real-time systems Preemption policy earliest-deadline-first (EDF) policy real-time uniprocessor scheduling schedulability analysis
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science Computational Theory and Mathematics Software Hardware and Architecture

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 EDF schedulability on a multiprocessor

Improvement of Real-Time Multi-CoreSchedulability with Forced Non-Preemption

A Note on EDF Schedulingfor Real-Time Energy Harvesting Systems

EDZL Schedulability Analysis in Real-Time Multicore Scheduling

A Non-Preemptive Scheduling Algorithm for Soft Real-Time Systems

A Scheduling Extension Scheme of the Earliest Deadline First Policy for Hard Real-Time Uniprocessor Systems Integrated on Posix Threads Based on Linux

A Method for Performance Analysis of Earliest-Deadline-First Scheduling Policy

An Efficient Non-Preemptive Real-Time Scheduling

Schedulability Analysis for Real-Time Systems with EDF Scheduling

Preempt a Job or Not in EDF Scheduling of Uniprocessor Systems

Similar Documents

An analysis of EDF schedulability on a multiprocessor

Improvement of Real-Time Multi-CoreSchedulability with Forced Non-Preemption

A Note on EDF Schedulingfor Real-Time Energy Harvesting Systems

EDZL Schedulability Analysis in Real-Time Multicore Scheduling

A Non-Preemptive Scheduling Algorithm for Soft Real-Time Systems

A Scheduling Extension Scheme of the Earliest Deadline First Policy for Hard Real-Time Uniprocessor Systems Integrated on Posix Threads Based on Linux

A Method for Performance Analysis of Earliest-Deadline-First Scheduling Policy

An Efficient Non-Preemptive Real-Time Scheduling

Schedulability Analysis for Real-Time Systems with EDF Scheduling

Preempt a Job or Not in EDF Scheduling of Uniprocessor Systems