48 search results - page 1 / 10 » A Practical Nonblocking Queue Algorithm Using Compare-and-Sw... |
ICPADS
2000
IEEE
13 years 9 months ago
2000
IEEE
Many nonblocking algorithms have been proposed for shared queues. Previous studies indicate that link-based algorithms perform best. However, these algorithms have a memory manage...
PODC
1996
ACM
13 years 9 months ago
1996
ACM
Drawing ideas from previous authors, we present a new non-blocking concurrent queue algorithm and a new twolock queue algorithm in which one enqueue and one dequeue can proceed co...
ANCS
2006
ACM
13 years 11 months ago
2006
ACM
Clos networks are an important class of switching networks due to their modular structure and much lower cost compared with crossbars. For routing I/O permutations of Clos network...
PPOPP
2012
ACM
12 years 13 days ago
2012
ACM
Lock-freedom is a progress guarantee that ensures overall program progress. Wait-freedom is a stronger progress guarantee that ensures the progress of each thread in the program. ...
PADS
1998
ACM
13 years 9 months ago
1998
ACM
In this paper we consider the distributed simulation of queueing networks of FCFS servers with infinite buffers, and irreducible Markovian routing. We first show that for either t...