9 search results - page 1 / 2 » Using elimination to implement scalable and lock-free FIFO q... |
WDAG
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. First-in-first-out (FIFO) queues are among the most fundamental and highly studied concurrent data structures. The most effective and practical dynamic-memory concurren...
SPAA
2005
ACM
14 years 4 months ago
2005
ACM
This paper shows for the first time that elimination, a scaling technique formerly applied only to counters and LIFO structures, can be applied to FIFO data structures, specific...
ICPADS
2006
IEEE
14 years 5 months ago
2006
IEEE
Congestion management is likely to become a critical issue in interconnection networks, as increasing power consumption and cost concerns will lead to the use of smaller networks....
HIPC
2007
Springer
14 years 3 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...
ISLPED
2006
ACM
14 years 5 months ago
2006
ACM
Buffering more in-flight instructions in an out-of-order microprocessor is a straightforward and effective method to help tolerate the long latencies generally associated with ...