Sciweavers

155 search results - page 15 / 31
» On Schedulability Bounds of Static Priority Schedulers
Sort
View
WIOPT
2006
IEEE
15 years 3 months ago
Ad Hoc networks with topology-transparent scheduling schemes: Scaling laws and capacity/delay tradeoffs
— In this paper we investigate the limiting properties, in terms of capacity and delay, of an ad hoc network employing a topology-transparent scheduling scheme. In particular, we...
Daniele Miorandi, Hwee Pink Tan, Michele Zorzi
HIPC
2005
Springer
15 years 3 months ago
Scheduling Multiple Flows on Parallel Disks
We examine the problem of scheduling concurrent independent flows on multiple-disk I/O storage systems. Two models are considered: in the shared buffer model the memory buffer is ...
Ajay Gulati, Peter J. Varman
RTSS
2005
IEEE
15 years 3 months ago
ParaScale: Exploiting Parametric Timing Analysis for Real-Time Schedulers and Dynamic Voltage Scaling
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...
Sibin Mohan, Frank Mueller, William Hawkins, Micha...
CORR
2008
Springer
108views Education» more  CORR 2008»
14 years 9 months ago
Heavy-Tailed Limits for Medium Size Jobs and Comparison Scheduling
We study the conditional sojourn time distributions of processor sharing (PS), foreground background processor sharing (FBPS) and shortest remaining processing time first (SRPT) s...
Predrag R. Jelenkovic, Xiaozhu Kang, Jian Tan
78
Voted
GLOBECOM
2008
IEEE
15 years 4 months ago
On Traffic Long-Range Dependence at the Output of Schedulers with Multiple Service Classes
 Long-range dependence (LRD) is a widely verified property of Internet traffic, which severely impacts network performance yielding longer queuing delays. Moreover, LRD is almos...
Stefano Bregni, Paolo Giacomazzi, Gabriella Saddem...