434 search results - page 18 / 87 » Scalable synchronous queues |
SIGCOMM
1998
ACM
14 years 2 months ago
1998
ACM
In recent years, a number of link scheduling algorithms have been proposed that greatly improve upon traditional FIFO scheduling in being able to assure rate and delay bounds for ...
INFOCOM
2002
IEEE
14 years 2 months ago
2002
IEEE
— We demonstrate that the dynamic behavior of queue and average window is determined predominantly by the stability of TCP/RED, not by AIMD probing nor noise traffic. We develop...
HIPC
2007
Springer
14 years 1 months ago
2007
Springer
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
MICRO
2003
IEEE
14 years 3 months ago
2003
IEEE
This paper describes several methods for improving the scalability of memory disambiguation hardware for future high ILP processors. As the number of in-flight instructions grows...
ISCA
2005
IEEE
14 years 3 months ago
2005
IEEE
Memory latency tolerant architectures support thousands of in-flight instructions without scaling cyclecritical processor resources, and thousands of useful instructions can compl...