Scheduling of Offset Free Systems

Authors:
Joël Goossens
Affiliations:
Université Libre de Bruxelles, Département d’Informatique CP 212, Boulevard du Triomphe, 1050 Brussels, Belgium joel.goossens@ulb.ac.be
Venue:
Real-Time Systems
Year:
2003

Citing 6
Cited 8

What is predictability for real-time systems?

Real-Time Systems
Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor

Real-Time Systems
Feasibility problems for recurring tasks on one processor

MFCS '90 Selected papers of the 15th international symposium on Mathematical foundations of computer science
The Non-Optimality of the Monotonic Priority Assignmentsfor Hard Real-Time Offset Free Systems

Real-Time Systems
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)

Contention-Free Periodic Message Scheduler Medium Access Control in Wireless Sensor / Actuator Networks

RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Holistic analysis of asynchronous real-time transactions with earliest deadline scheduling

Journal of Computer and System Sciences
Partially synchronizing periodic flows with offsets improves worst-case end-to-end delay analysis of switched ethernet

ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Exact schedulability tests for real-time scheduling of periodic tasks on unrelated multiprocessor platforms

Journal of Systems Architecture: the EUROMICRO Journal
Self-organized message scheduling for asynchronous distributed embedded systems

ATC'11 Proceedings of the 8th international conference on Autonomic and trusted computing
Existing offset assignments are near optimal for an industrial AFDX network

ACM SIGBED Review - Special Issue on the 10th International Workshop on Real-time Networks (RTN 2011)
On centralized schedulers for 802.11e WLANs distribution versus grouping of resources allocation

Wireless Communications & Mobile Computing
HW/SW tradeoffs for dynamic message scheduling in controller area network (CAN)

ARCS'13 Proceedings of the 26th international conference on Architecture of Computing Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study the problem of scheduling hard real-time periodic tasks. We consider independent tasks which are characterized by a period, a hard deadline and a computation time, but where the offsets may be chosen by the scheduling algorithm. We first show that we can restrict the problem by considering non-equivalent offset assignments. More precisely, we show that there are finitely many non-equivalent offset assignments and we propose a method to reduce significantly this number and consider only the minimal number of non-equivalent offset assignments. We then propose an optimal offset assignment rule which considers only the non-equivalent offset assignments. However the number of combinations remains exponential; for this reason, we also propose a nearly optimal algorithm with a more reasonable time complexity.