Sciweavers

473 search results - page 20 / 95
» Early-release fair scheduling
Sort
View
ISAAC
2001
Springer
116views Algorithms» more  ISAAC 2001»
14 years 1 months ago
Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness
In current networks, packet losses can occur if routers do not provide sufficiently large buffers. This paper studies how many buffers should be provided in a router to eliminat...
Hisashi Koga
MICRO
2002
IEEE
122views Hardware» more  MICRO 2002»
14 years 1 months ago
Microarchitectural denial of service: insuring microarchitectural fairness
Simultaneous multithreading seeks to improve the aggregate computation bandwidth of a processor core by sharing resources such as functional units, caches, TLB and so on. To date,...
Dirk Grunwald, Soraya Ghiasi
INFOCOM
2009
IEEE
14 years 3 months ago
Mobility-Driven Scheduling in Wireless Networks
—The design of scheduling policies for wireless data systems has been driven by a compromise between the objectives of high overall system throughput and the degree of fairness a...
Sem C. Borst, Nidhi Hegde, Alexandre Proutiere
JSAC
2011
100views more  JSAC 2011»
12 years 11 months ago
Scheduling for Optimal Rate Allocation in Ad Hoc Networks With Heterogeneous Delay Constraints
—This paper studies the problem of scheduling in single-hop wireless networks with real-time traffic, where every packet arrival has an associated deadline and a minimum fractio...
Juan José Jaramillo, R. Srikant, Lei Ying
COMCOM
2002
79views more  COMCOM 2002»
13 years 8 months ago
A probabilistic priority scheduling discipline for multi-service networks
This paper proposes a novel scheduling discipline for service differentiation in multi-service networks, which is referred to as the Probabilistic Priority (PP) discipline. PP is ...
Yuming Jiang, Chen-Khong Tham, Chi Chung Ko