62 search results - page 5 / 13 » Low-latency scheduling in large switches |
ICNP
2003
IEEE
14 years 3 months ago
2003
IEEE
Practical crossbar scheduling algorithms for CIOQ switches such as PIM and ¢ -SLIP, can perform poorly under extreme traffic conditions, frequently failing to be workconserving....
SIGCOMM
2010
ACM
13 years 10 months ago
2010
ACM
Cloud data centers host diverse applications, mixing workloads that require small predictable latency with others requiring large sustained throughput. In this environment, today&...
SIGMETRICS
2004
ACM
14 years 3 months ago
2004
ACM
The Least Attained Service (LAS) scheduling policy, when used for scheduling packets over the bottleneck link of an Internet path, can greatly reduce the average flow time for sh...
INFOCOM
2002
IEEE
14 years 2 months ago
2002
IEEE
—In this paper, we present three algorithms that provide performance guarantees for scheduling switches, such as optical switches, with configuration overhead. Each algorithm emu...
IPPS
2005
IEEE
14 years 3 months ago
2005
IEEE
We develop a message scheduling scheme that can theoretically achieve the maximum throughput for all–to–all personalized communication (AAPC) on any given Ethernet switched cl...