Uniprocessor scheduling under precedence constraints for embedded systems design

Authors:
Leonardo Mangeruca;Massimo Baleani;Alberto Ferrari;Alberto Sangiovanni-Vincentelli
Affiliations:
Parades E.E.I.G., Roma, Italy;Parades E.E.I.G., Roma, Italy;Parades E.E.I.G., Roma, Italy;University of California, Berkeley, California
Venue:
ACM Transactions on Embedded Computing Systems (TECS)
Year:
2007

Citing 13
Cited 0

Scheduling Processes with Release Times, Deadlines, Precedence and Exclusion Relations

IEEE Transactions on Software Engineering
Stack-based scheduling for realtime processes

Real-Time Systems
How to Integrate Precedence Constraints and Shared Resources in Real-Time Scheduling

IEEE Transactions on Computers
Scheduling Tasks with AND/OR Precedence Constraints

SIAM Journal on Computing
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Priority Inheritance Protocols: An Approach to Real-Time Synchronization

IEEE Transactions on Computers
The MSP.RTL real-time scheduler synthesis tool

RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Rate Monotonic Analysis: The Hyperbolic Bound

IEEE Transactions on Computers
Schedulability Analysis of Periodic Fixed Priority Systems

IEEE Transactions on Computers
Real Time Scheduling Theory: A Historical Perspective

Real-Time Systems
Rate monotonic vs. EDF: judgment day

Real-Time Systems
A generic approach to schedulability analysis of real-time tasks

Nordic Journal of Computing
Schedulability analysis using two clocks

TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a novel approach to the constrained scheduling problem, while addressing a more general class of constraints that arise from the timing requirements on real-time embedded controllers. We provide general necessary and sufficient conditions for scheduling under precedence constraints and derive sufficient conditions for two well-known scheduling policies. We define mathematical problems that provide optimum priority and deadline assignments, while ensuring both precedence constraints and system's schedulability. We show how these problems can be relaxed to corresponding integer linear programming (ILP) formulations leveraging on available solvers. The results are demonstrated on a real design case.