Feasibility Intervals for the Deadline Driven Scheduler with Arbitrary Deadlines

Authors:
Joël Goossens;Raymond Devillers
Affiliations:
-;-
Venue:
RTCSA '99 Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications
Year:
1999

Citing 0
Cited 5

Multiprocessor Preprocessing Algorithms for Uniprocessor On-Line Scheduling

ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Janus: a cross-layer soft real-time architecture for virtualization

Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing
Exact schedulability tests for real-time scheduling of periodic tasks on unrelated multiprocessor platforms

Journal of Systems Architecture: the EUROMICRO Journal
Enhancement of Xen's scheduler for MapReduce workloads

Proceedings of the 20th international symposium on High performance distributed computing
General Response Time Computation for the Deadline Driven Scheduling of Periodic Tasks

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we extend the determination of feasibility intervals to task sets with arbitrary deadlines, both in the synchronous and the asynchronous case. Meanwhile we also improve the arguments and results generally found in the literature.