Sciweavers

6 search results - page 1 / 2
» Priority Queue Based on Multilevel Prefix Tree
Sort
View
36
Voted
CORR
2007
Springer
78views Education» more  CORR 2007»
14 years 10 months ago
Priority Queue Based on Multilevel Prefix Tree
David S. Planeta
INFOCOM
2007
IEEE
15 years 4 months ago
Pipelined van Emde Boas Tree: Algorithms, Analysis, and Applications
Abstract— Priority queues are essential for various network processing applications, including per-flow queueing with Quality-of-Service (QoS) guarantees, management of large fa...
Hao Wang, Bill Lin
RTAS
1997
IEEE
15 years 2 months ago
Scalable Hardware Priority Queue Architectures for High-Speed Packet Switches
ÐWith effective packet-scheduling mechanisms, modern integrated networks can support the diverse quality-of-service requirements of emerging applications. However, arbitrating bet...
Sung-Whan Moon, Kang G. Shin, Jennifer Rexford
ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
14 years 10 months ago
On Sorting, Heaps, and Minimum Spanning Trees
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
Gonzalo Navarro, Rodrigo Paredes
IPPS
1998
IEEE
15 years 2 months ago
Prioritized Token-Based Mutual Exclusion for Distributed Systems
A number of solutions have been proposed for the problem of mutual exclusion in distributed systems. Some of these approaches have since been extended to a prioritized environment...
Frank Mueller