Sciweavers

734 search results - page 22 / 147
» Multiprocess Time Queue
Sort
View
SPAA
2005
ACM
14 years 2 months ago
Using elimination to implement scalable and lock-free FIFO queues
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...
Mark Moir, Daniel Nussbaum, Ori Shalev, Nir Shavit
EUC
2008
Springer
13 years 10 months ago
Design and Analysis of a Stable Queue Control Scheme for the Internet
The recently proposed Active Queue Management (AQM) is an effective method used in Internet routers for congestion control, and to achieve a tradeoff between link utilization and ...
Naixue Xiong, Laurence Tianruo Yang, Yaoxue Zhang,...
DAC
2005
ACM
14 years 9 months ago
Low power network processor design using clock gating
Abstract-- Network processors (NPs) have emerged as successful platforms to providing both high performance and flexibility in building powerful routers. Typical NPs incorporate mu...
Jia Yu, Jun Yang 0002, Laxmi N. Bhuyan, Yan Luo
IPPS
2000
IEEE
14 years 1 months ago
Monotonic Counters: A New Mechanism for Thread Synchronization
Only a handful of fundamental mechanisms for synchronizing the access of concurrent threads to shared memory are widely implemented and used. These include locks, condition variab...
John Thornley, K. Mani Chandy
WADS
2007
Springer
115views Algorithms» more  WADS 2007»
14 years 2 months ago
Priority Queues Resilient to Memory Faults
In the faulty-memory RAM model, the content of memory cells can get corrupted at any time during the execution of an algorithm, and a constant number of uncorruptible registers are...
Allan Grønlund Jørgensen, Gabriel Mo...