Sciweavers

74 search results - page 7 / 15
» Round robin scheduling - a survey
Sort
View
EOR
2007
174views more  EOR 2007»
13 years 7 months ago
A Benders approach for the constrained minimum break problem
This paper presents a hybrid IP/CP algorithm for designing a double round robin schedule with a minimal number of breaks. Both mirrored and non-mirrored schedules with and without ...
Rasmus V. Rasmussen, Michael A. Trick
ICC
2007
IEEE
102views Communications» more  ICC 2007»
14 years 1 months ago
Distributed Scheduling in Input Queued Switches
— Dealing with RTTs (Round Trip Time) in IQ switches has been recently recognized as a challenging problem, especially if considering distributed (multi-chip) scheduler implement...
Alessandra Scicchitano, Andrea Bianco, Paolo Giacc...
ICPADS
2007
IEEE
14 years 1 months ago
On the relative value of local scheduling versus routing in parallel server systems
We consider a system with a dispatcher and several identical servers in parallel. Task processing times are known upon arrival. We first study the impact of the local scheduling ...
Rong Wu, Douglas G. Down
ISCC
2005
IEEE
130views Communications» more  ISCC 2005»
14 years 19 days ago
Fair and Efficient Frame-Based Scheduling Algorithm for Multimedia Networks
The broad spread of packet data networks and the emergence of applications in multimedia communications, created a driving force towards an improved Quality of Service (QoS) model...
T. Al-Khasib, Hussein M. Alnuweiri, Hossam Fattah,...
ICN
2005
Springer
14 years 17 days ago
Packet Scheduling Across Networks of Switches
Abstract. Recent developments in computer and communication networks require scheduling decisions to be made under increasingly complex system dynamics. We model and analyze the pr...
Kevin Ross, Nicholas Bambos