Sciweavers

740 search results - page 99 / 148
» Analysis of Scheduling Algorithms with Reservations
Sort
View
COMCOM
2004
114views more  COMCOM 2004»
14 years 9 months ago
WFI optimized PWGPS for wireless IP networks
The worst-case fairness index (WFI) has proved to be an important metric in the provision of fairness and bounded delay in both wired and wireless networks. A feature of wireless l...
Fei Xiang, Alan Marshall, Junzhou Luo
SPIN
2010
Springer
14 years 8 months ago
Time-Bounded Reachability in Distributed Input/Output Interactive Probabilistic Chains
Abstract. We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results ...
Georgel Calin, Pepijn Crouzen, Pedro R. D'Argenio,...
MOBIHOC
2006
ACM
15 years 9 months ago
Balancing distance and lifetime in delay constrained ad hoc networks
This paper addresses the problem of optimizing the packet transmission schedule in an ad hoc network with end-toend delay constraints. The emphasis is to determine the proper rela...
Ben Liang, Min Dong
FOCS
1994
IEEE
15 years 1 months ago
Scheduling Multithreaded Computations by Work Stealing
This paper studies the problem of e ciently scheduling fully strict (i.e., wellstructured) multithreaded computations on parallel computers. A popular and practical method of sche...
Robert D. Blumofe
SIGMETRICS
2003
ACM
101views Hardware» more  SIGMETRICS 2003»
15 years 3 months ago
Effects of clock resolution on the scheduling of interactive and soft real-time processes
It is commonly agreed that scheduling mechanisms in general purpose operating systems do not provide adequate support for modern interactive applications, notably multimedia appli...
Yoav Etsion, Dan Tsafrir, Dror G. Feitelson