395 search results - page 6 / 79 » Priority Scheduling of Distributed Systems Based on Model Ch... |
100
click to vote
INFOCOM
2006
IEEE
15 years 3 months ago
2006
IEEE
— We show that different flavors of TCP may be viewed as implementations of age-based scheduling disciplines. By parameterizing the scheduling disciplines of interest we are abl...
77
Voted
RTCSA
2007
IEEE
15 years 3 months ago
2007
IEEE
A task that suspends itself to wait for an I/O completion or to wait for an event from another node in distributed environments is called an I/O blocking task. In conventional har...
IEEEPACT
1998
IEEE
15 years 1 months ago
1998
IEEE
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...
79
Voted
DSRT
2000
IEEE
15 years 1 months ago
2000
IEEE
The problem of network bundwidth limitutions is encountered in ulmost uny distributed virtuul environment or networkedgume. In U typicul client-serversetup, where the virtuul worl...
125
click to vote
CONCUR
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The technique of partial order reduction (POR) for probabilistic model checking prunes the state space of the model so that a maximizing scheduler and a minimizing one pe...