93 search results - page 8 / 19 » Schedulability analysis of non-preemptive recurring real-tim... |
ESA
2008
Springer
15 years 1 months ago
2008
Springer
We devise the first constant-approximate feasibility test for sporadic multiprocessor real-time scheduling. We give an algorithm that, given a task system and > 0, correctly de...
109
click to vote
ESA
2009
Springer
15 years 6 months ago
2009
Springer
We introduce the First Fit Matching Periods algorithm for rate-monotonic multiprocessor scheduling of periodic tasks with implicit deadlines and show that it yields asymptotically...
ECRTS
2003
IEEE
15 years 5 months ago
2003
IEEE
We revisit the problem of supertasking in Pfair-scheduled multiprocessor systems. In this approach, a set of tasks, called component tasks, is assigned to a server task, called a ...
RTSS
2005
IEEE
15 years 5 months ago
2005
IEEE
Static timing analysis safely bounds worst-case execution times to determine if tasks can meet their deadlines in hard real-time systems. However, conventional timing analysis req...
110
click to vote
ECRTS
1999
IEEE
15 years 4 months ago
1999
IEEE
In this paper we address the real-time capabilities of P-NET, which is a multi-master fieldbus standard based on a virtual token passing scheme. We show how P-NET's medium ac...