472 search results - page 59 / 95 » Quick-release Fair Scheduling |
PE
2006
Springer
13 years 8 months ago
2006
Springer
In this paper, we consider the problem of devising a loop scheduler that allocates slots to users according to their relative weights as smoothly as possible. Instead of the exist...
CDES
2006
13 years 10 months ago
2006
- Round-robin has been used as a fair (non starvation) scheduling policy in many computer applications. This paper presents a novel hardware design of a round-robin arbiter without...
RTSS
1999
IEEE
14 years 1 months ago
1999
IEEE
Packet switching in connection-oriented networks that may have multiple parallel links between pairs of switches is considered. An e cient packet-scheduling algorithm that guarant...
INFOCOM
2005
IEEE
14 years 2 months ago
2005
IEEE
— We consider the problem of scheduling multiple users sharing a time-varying wireless channel. (As an example, this is a model of scheduling in 3G wireless technologies, such as...
IWDC
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. Endpoint admission control is a mechanism for achieving scalable services by pushing quality-of-service functionality to end hosts. In particular, hosts probe the network...