NDLI: Multiprocessor fixed priority scheduling with limited preemptions

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

A contention-sensitive fine-grained locking protocol for multiprocessor real-time systems

A framework for the evaluation of measurement-based timing analyses

Analysis for supporting real-time computer vision workloads using OpenVX on multicore+GPU platforms

Scheduling with preemption delays: anomalies and issues

Flexible TDM-based resource management in on-chip networks

WCET analysis in shared resources real-time systems with TDMA buses

Response time analysis for G-EDF and G-DM scheduling of sporadic DAG-tasks with arbitrary deadline

Mixed criticality systems with weakly-hard constraints

On priority assignment for controller area network when some message identifiers are fixed

Non-work-conserving scheduling of non-preemptive hard real-time tasks based on fixed priorities

Multiprocessor fixed priority scheduling with limited preemptions

Joint management of processing and cooling power based on inaccurate thermal information in a stochastic real-time system

Memory-processor co-scheduling in fixed priority systems

Efficient context switching for the stack cache: implementation and analysis

Hard real-time guarantee of automotive applications during mode changes

WCET analysis for multi-core processors with shared buses and event-driven bus arbitration

Response time bounds for sporadic arbitrary-deadline tasks under global fixed-priority scheduling on multiprocessors

The concurrent consideration of uncertainty in WCETs and processor speeds in mixed-criticality systems

Time-division multiplexing vs network calculus: a comparison

Worst-case performance validation of safety-critical control systems with dropped samples

Iterative robust multiprocessor scheduling

Study of the reliability of statistical timing analysis for real-time systems

Resource reservation for real-time self-suspending tasks: theory and practice

A generic and compositional framework for multicore response time analysis

Improved priority assignment for real-time communications in on-chip networks

An exact schedulability test for global FP using state space pruning

Semi-partitioned model for dual-core mixed criticality system

A reliability-aware medium access control for unidirectional time-constrained WSNs

Modelling fault dependencies when execution time budgets are exceeded

How realistic is the mixed-criticality real-time system model?

Generalized mixed-criticality scheduling based on RUN

Multiprocessor fixed priority scheduling with limited preemptions

Content Provider	ACM Digital Library
Author	Thekkilakattil, Abhilash Dobrin, Radu Davis, Robert I. Bertogna, Marko Punnekkat, Sasikumar
Abstract	Challenges associated with allowing preemptions and migrations are compounded in multicore systems, particularly under global scheduling policies, because of the potentially high overheads. For example, multiple levels of cache greatly increase preemption and migration related overheads as well as the difficulty involved in accurately accounting for them, leading to substantially inflated worst-case execution times (WCETs). Preemption and migration related overheads can be significantly reduced, both in number and in size, by using fixed preemption points in the tasks' code; thus dividing each task into a series of non-preemptive regions (NPRs). This leads to an additional consideration in the scheduling policy. When a high priority task is released and all of the processors are executing non-preemptive regions of lower priority tasks, then there is a choice to be made in terms of how to manage the next preemption. With an eager approach the first lower priority task to reach a preemption point is preempted even if it is not the lowest priority running task. Alternatively, with a lazy approach, preemption is delayed until the lowest priority currently running task reaches its next preemption point. In this paper, we show that under global fixed priority scheduling with eager preemptions each task suffers from at most a single priority inversion each time it resumes execution. Building on this observation, we derive a new response time based schedulability test for tasks with fixed preemption points. Experimental evaluations show that global fixed priority scheduling with eager preemptions is significantly more effective than with lazy preemption using link based scheduling in terms of task set schedulability.
Starting Page	13
Ending Page	22
Page Count	10
File Format	PDF
ISBN	9781450335911
DOI	10.1145/2834848.2834855
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2015-11-04
Publisher Place	New York
Access Restriction	Subscribed
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

Multiprocessor Fixed Priority Scheduling with Limited

Generalized Fixed-Priority Scheduling with Limited Preemptions

Sporadic Multiprocessor Scheduling with Few Preemptions

Improving Feasibility of Fixed Priority Tasks Using Non-Preemptive Regions

Global and Partitioned Multiprocessor Fixed Priority Scheduling with Deferred Preemption

Fixed-Priority Multiprocessor Scheduling with Liu & Layland’s Utilization Bound

Reducing the number of preemptions in fixed priority scheduling.

Budget allocations for hierarchical fixed-priority scheduling of sporadic tasks with deferred preemptions upon

Some insights on fixed-priority preemptive non-partitioned multiprocessor scheduling.

Multiprocessor fixed priority scheduling with limited preemptions

Similar Documents

Multiprocessor Fixed Priority Scheduling with Limited

Generalized Fixed-Priority Scheduling with Limited Preemptions

Sporadic Multiprocessor Scheduling with Few Preemptions

Improving Feasibility of Fixed Priority Tasks Using Non-Preemptive Regions

Global and Partitioned Multiprocessor Fixed Priority Scheduling with Deferred Preemption

Fixed-Priority Multiprocessor Scheduling with Liu & Layland’s Utilization Bound

Reducing the number of preemptions in fixed priority scheduling.

Budget allocations for hierarchical fixed-priority scheduling of sporadic tasks with deferred preemptions upon

Some insights on fixed-priority preemptive non-partitioned multiprocessor scheduling.

Multiprocessor fixed priority scheduling with limited preemptions