155 search results - page 9 / 31 » On Schedulability Bounds of Static Priority Schedulers |
CATA
2007
14 years 11 months ago
2007
This paper addresses the issue of determining the iteration bound for a synchronous data flow graph (SDFG) and determining whether or not a SDFG is live based on some calculations...
RTSS
2008
IEEE
15 years 4 months ago
2008
IEEE
—Wormhole switching with fixed priority preemption has been proposed as a possible solution for real-time on-chip communication. However, none of current priority assignment pol...
RTCSA
1999
IEEE
15 years 1 months ago
1999
IEEE
Abstract. We present an approach to static priority preemptive process scheduling for the synthesis of hard realtime distributed embedded systems where communication plays an impor...
71
Voted
INFOCOM
1996
IEEE
15 years 1 months ago
1996
IEEE
We present an end-to-end delay guarantee theorem for a class of guaranteed-deadline (GD) servers. The theorem can be instantiated to obtain end-to-end delay bounds for a variety of...
112
click to vote
ICDCS
2000
IEEE
15 years 2 months ago
2000
IEEE
Providing up-to-date input to users’ applications is an important data management problem for a distributed computing environment, where each data storage location and intermedi...