Sciweavers

74 search results - page 5 / 15
» Round robin scheduling - a survey
Sort
View
ORL
2010
158views more  ORL 2010»
13 years 1 months ago
Constructing fair round robin tournaments with a minimum number of breaks
Given n clubs with two teams each, we show that, if n is even, it is possible to construct a schedule for a single round robin tournament satisfying the following properties: the ...
Pim van 't Hof, Gerhard F. Post, Dirk Briskorn
LCN
1996
IEEE
13 years 11 months ago
An Enhanced Timed-Round-Robin Traffic Control Scheme for ATM Networks
ATM (asynchronous transfer mode) aims at providing both guaranteed bandwidth to support real-time communications and dynamic bandwidth sharing to accommodate bursty data traffic. ...
Qin Zheng
DAM
2006
118views more  DAM 2006»
13 years 7 months ago
Maximizing breaks and bounding solutions to the mirrored traveling tournament problem
We investigate the relation between two aspects of round robin tournament scheduling problems: breaks and distances. The distance minimization problem and the breaks maximization ...
Sebastián Urrutia, Celso C. Ribeiro
VLSID
2006
IEEE
143views VLSI» more  VLSID 2006»
14 years 1 months ago
Frame Based Fair Multiprocessor Scheduler: A Fast Fair Algorithm for Real-Time Embedded Systems
This paper presents Frame Based Fair Multiprocessor Scheduler (FBFMS) which provides accurate real-time proportional fair scheduling for a set of dynamic tasks on a symmetric mult...
Arnab Sarkar, P. P. Chakrabarti, Rajeev Kumar
INFOCOM
2000
IEEE
13 years 11 months ago
Comparisons of Packet Scheduling Algorithms for Fair Service Among Connections on the Internet
Abstract—We investigate the performance of TCP under three representatives of packet scheduling algorithms at the router. Our main focus is to investigate how fair service can be...
Go Hasegawa, Takahiro Matsuo, Masayuki Murata, Hid...