Sustainable Scheduling Analysis

Authors:
Sanjoy Baruah;Alan Burns
Affiliations:
The University of North Carolina at Chapel Hill, USA;University of York, UK
Venue:
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Year:
2006

Citing 0
Cited 29

WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model

Theoretical Computer Science
Robust and sustainable schedulability analysis of embedded software

Proceedings of the 2008 ACM SIGPLAN-SIGBED conference on Languages, compilers, and tools for embedded systems
The space of EDF deadlines: the exact region and a convex approximation

Real-Time Systems
Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption

Real-Time Systems
Combining EDF and FP Scheduling: Analysis and Implementation in Ada 2005

Ada-Europe '09 Proceedings of the 14th Ada-Europe International Conference on Reliable Software Technologies
Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling

Real-Time Systems
Temporal isolation with the ravenscar profile and Ada 2005

ACM SIGAda Ada Letters
Online robust optimization framework for QoS guarantees in distributed soft real-time systems

EMSOFT '10 Proceedings of the tenth ACM international conference on Embedded software
Global EDF-based scheduling with laxity-driven priority promotion

Journal of Systems Architecture: the EUROMICRO Journal
Schedulability analysis for non-preemptive fixed-priority multiprocessor scheduling

Journal of Systems Architecture: the EUROMICRO Journal
Tests for global EDF schedulability analysis

Journal of Systems Architecture: the EUROMICRO Journal
A survey of hard real-time scheduling for multiprocessor systems

ACM Computing Surveys (CSUR)
An overview of interrupt accounting techniques for multiprocessor real-time systems

Journal of Systems Architecture: the EUROMICRO Journal
Multi-task Implementation of Multi-periodic Synchronous Programs

Discrete Event Dynamic Systems
On the quantification of sustainability and extensibility of FlexRay schedules

Proceedings of the 48th Design Automation Conference
Efficient computation of response time bounds for preemptive uniprocessor deadline monotonic scheduling

Real-Time Systems
Partitioned EDF scheduling for multiprocessors using a C=D task splitting scheme

Real-Time Systems
What to make of multicore processors for reliable real-time systems?

Ada-Europe'10 Proceedings of the 15th Ada-Europe international conference on Reliable Software Technologies
Preservation of timing properties with the ada ravenscar profile

Ada-Europe'10 Proceedings of the 15th Ada-Europe international conference on Reliable Software Technologies
Sharp utilization thresholds for some realtime scheduling problems

ACM SIGMETRICS Performance Evaluation Review
FPSL, FPCL and FPZL schedulability analysis

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

Proceedings of the 20th International Conference on Real-Time and Network Systems
Sustainability in static-priority restricted-migration scheduling

Proceedings of the 2012 ACM Research in Applied Computation Symposium
Schedulability analysis for Controller Area Network (CAN) with FIFO queues priority queues and gateways

Real-Time Systems
Schedulability analysis of EDF-scheduled embedded real-time systems with resource sharing

ACM Transactions on Embedded Computing Systems (TECS)
Global EDF scheduling of directed acyclic graphs on multiprocessor systems

Proceedings of the 21st International conference on Real-Time Networks and Systems
Feasibility intervals for homogeneous multicores, asynchronous periodic tasks, and FJP schedulers

Proceedings of the 21st International conference on Real-Time Networks and Systems
Partitioned EDF scheduling: a closer look

Real-Time Systems
Mixed-criticality scheduling on multiprocessors

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A schedulability test is defined to be sustainable if any task system deemed schedulable by the test remains so if it behaves "better" than mandated by its system specifications. We provide a formal definition of sustainability, and subject the concept to systematic analysis in the context of the uniprocessor scheduling of periodic and sporadic task systems. We argue that it is in general good engineering practice to use sustainable tests if possible, and classify common uniprocessor schedulability tests according to whether they are sustainable or not.