NDLI: A semi-partitioned approach for parallel real-time scheduling

Please wait, while we are loading the content...

Semantics-preserving implementation of multirate mixed-criticality synchronous programs

Combining network calculus and scheduling theory to improve delay bounds

FFX: a portable WCET annotation language

Real-time scheduling with resource sharing on uniform multiprocessors

Optimising task layout to increase schedulability via reduced cache related pre-emption delays

Extending fixed task-priority schedulability by interference limitation

Reducing the gap between design and scheduling

Static routing in symmetric real-time network-on-chips

Static profiling of the worst-case in real-time programs

The generalized multiprocessor periodic resource interface model for hierarchical multiprocessor scheduling

PRETI: partitioned real-time shared cache for mixed-criticality real-time systems

Linear transformation of conditional real-time tasks

Propagation rules of real-time constraints on physical systems simulators in a hardware-in-the loop context

A global optimal scheduling algorithm for multiprocessor low-power platforms

Re-sampling for statistical timing analysis of real-time systems

Job partitioning strategies for multiprocessor scheduling of real-time periodic tasks with restricted migrations

PDPA: period driven task and cache partitioning algorithm for multi-core systems

The scheduling problem of self-suspending periodic real-time tasks

Resource augmentation for fault-tolerance feasibility of real-time tasks under error bursts

Analytical leakage/temperature-aware power modeling and optimization for a variable speed real-time system

A semi-partitioned approach for parallel real-time scheduling

Content Provider	ACM Digital Library
Author	Goossens, Joël Courbin, Pierre George, Laurent Bado, Benjamin
Abstract	In this paper, we consider the problem of scheduling periodic Multi-Phase Multi-Thread tasks on a set of m identical processors with Earliest Deadline First (EDF) scheduling. Each periodic task is defined by a sequence of phases with offsets that can be possibly parallelized. We use a portioned semi-partitioned approach with migrations at local deadlines assigned to each phase. We extend this approach to take into account phase parallelism. The phase parallelism we consider is an extension of the popular job parallelism. A phase, if parallelizable, can be decomposed into parallel threads run on a configurable number of processors. We only require simultaneous execution of threads inside a window equal to the local deadline of their associated phase. To decide on the schedulability of a Multi-Phase Multi-Thread task, we extend the popular uniprocessor EDF feasibility condition for periodic asynchronous tasks. We propose two new schedulability tests for EDF that significantly improve the well known Leung and Merill feasibility test based on the feasibility interval $[O_{min},$ $O_{max}$ + 2P], where $O_{min}$ and $O_{max}$ are respectively the minimum and maximum phase offsets and P the least common multiple of the task periods. The first schedulability test is used when an EDF simulation is needed and gives, by simulation, a 44% gain in simulation speed. The second method provides a sufficient schedulability test with a time interval of length P based on the demand bound function. Finally, we study three local deadline assignment heuristics assigned to parallelizable phases. We compare and analyze the performances obtained by simulation for those three local deadline assignment heuristics.
Starting Page	151
Ending Page	160
Page Count	10
File Format	PDF
ISBN	9781450314091
DOI	10.1145/2392987.2393006
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2012-11-08
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Real-time scheduling theory
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

A semi-partitioned real-time scheduling approach for periodic task systems on multicore platforms

Semi-Partitioned Scheduling of Fork-Join Tasks Using Work-Stealing

Semi-Partitioned Scheduling of Dynamic Real-Time Workload: A Practical Approach Based on Analysis-Driven Load Balancing

System-level scheduling of real-time streaming applications using a semi-partitioned approach.

Is Semi-Partitioned Scheduling Practical?

An Optimal Semi-partitioned Scheduler for Uniform Heterogeneous Multiprocessors

System-level scheduling of real-time streaming applications using a semi-partitioned approach

Optimal Semi-Partitioned Scheduling in Soft Real-Time Systems ∗

Semi-partitioned hard-real-time scheduling under locked cache migration in multicore systems (2012)

A semi-partitioned approach for parallel real-time scheduling

Similar Documents

A semi-partitioned real-time scheduling approach for periodic task systems on multicore platforms

Semi-Partitioned Scheduling of Fork-Join Tasks Using Work-Stealing

Semi-Partitioned Scheduling of Dynamic Real-Time Workload: A Practical Approach Based on Analysis-Driven Load Balancing

System-level scheduling of real-time streaming applications using a semi-partitioned approach.

Is Semi-Partitioned Scheduling Practical?

An Optimal Semi-partitioned Scheduler for Uniform Heterogeneous Multiprocessors

System-level scheduling of real-time streaming applications using a semi-partitioned approach

Optimal Semi-Partitioned Scheduling in Soft Real-Time Systems ∗

Semi-partitioned hard-real-time scheduling under locked cache migration in multicore systems (2012)

A semi-partitioned approach for parallel real-time scheduling