NDLI: Global EDF scheduling for parallel real-time tasks

Content Provider	Springer Nature Link
Author	Li, Jing Luo, Zheng Ferry, David Agrawal, Kunal Gill, Christopher Lu, Chenyang
Copyright Year	2014
Abstract	As multicore processors become ever more prevalent, it is important for real-time programs to take advantage of intra-task parallelism in order to support computation-intensive applications with tight deadlines. In this paper, we consider the global earliest deadline first (GEDF) scheduling policy for task sets consisting of parallel tasks. Each task can be represented by a directed acyclic graph (DAG) where nodes represent computational work and edges represent dependences between nodes. In this model, we prove that GEDF provides a capacity augmentation bound of $$4-\frac{2}{m}$$ and a resource augmentation bound of $$2-\frac{1}{m}$$ . The capacity augmentation bound acts as a linear-time schedulability test since it guarantees that any task set with total utilization of at most $$m/(4-\frac{2}{m})$$ where each task’s critical-path length is at most $$1/(4-\frac{2}{m})$$ of its deadline is schedulable on $$m$$ cores under GEDF. In addition, we present a pseudo-polynomial time fixed-point schedulability test for GEDF; this test uses a carry-in work calculation based on the proof for the capacity bound. Finally, we present and evaluate a prototype platform—called PGEDF—for scheduling parallel tasks using global earliest deadline first (GEDF). PGEDF is built by combining the GNU OpenMP runtime system and the $$\text {LITMUS}^\text {RT}$$ operating system. This platform allows programmers to write parallel OpenMP tasks and specify real-time parameters such as deadlines for tasks. We perform two kinds of experiments to evaluate the performance of GEDF for parallel tasks. (1) We run numerical simulations for DAG tasks. (2) We execute randomly generated tasks using PGEDF. Both sets of experiments indicate that GEDF performs surprisingly well and outperforms an existing scheduling techniques that involves task decomposition.
Starting Page	395
Ending Page	439
Page Count	45
File Format	PDF
ISSN	09226443
Journal	Real-Time Systems
Volume Number	51
Issue Number	4
e-ISSN	15731383
Language	English
Publisher	Springer US
Publisher Date	2014-10-28
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Real-time scheduling Parallel scheduling Global EDF Resource augmentation bound Capacity augmentation bound 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

Multi-core real-time scheduling for generalized parallel task models

Outstanding Paper Award: Analysis of Global EDF for Parallel Tasks

Resource augmentation for uniprocessor and multiprocessor partitioned scheduling of sporadic real-time tasks

Implementation and evaluation of global and partitioned scheduling in a real-time OS

Fair lateness scheduling: reducing maximum lateness in G-EDF-like scheduling

The limited-preemptive feasibility of real-time tasks on uniprocessors

Task assignment algorithms for two-type heterogeneous multiprocessors

Slack-based multiprocessor scheduling of aperiodic real-time tasks

Sensitivity analysis of arbitrary deadline real-time systems with EDF scheduling

Global EDF scheduling for parallel real-time tasks

Similar Documents

Multi-core real-time scheduling for generalized parallel task models

Outstanding Paper Award: Analysis of Global EDF for Parallel Tasks

Resource augmentation for uniprocessor and multiprocessor partitioned scheduling of sporadic real-time tasks

Implementation and evaluation of global and partitioned scheduling in a real-time OS

Fair lateness scheduling: reducing maximum lateness in G-EDF-like scheduling

The limited-preemptive feasibility of real-time tasks on uniprocessors

Task assignment algorithms for two-type heterogeneous multiprocessors

Slack-based multiprocessor scheduling of aperiodic real-time tasks

Sensitivity analysis of arbitrary deadline real-time systems with EDF scheduling

Global EDF scheduling for parallel real-time tasks