Filters








19,269 Hits in 6.3 sec

Worst case constant time priority queue

Andrej Brodnik, Svante Carlsson, Michael L. Fredman, Johan Karlsson, J. Ian Munro
2005 Journal of Systems and Software  
When this data structure is used in combination with a new memory topology it provides an O(1) worst case time solution.  ...  worst case constant time solution for the vEB problem.  ...  Together with a new memory topology we achieve a worst case constant time for the vEB operations.  ... 
doi:10.1016/j.jss.2004.09.002 fatcat:xmue6ftcyrcudh3cfsxdzqwkza

Fast Meldable Priority Queues

Gerth Stølting Brodal
1995 BRICS Report Series  
<br />To our knowledge this is the first priority queue implementation that<br />supports Meld in worst case constant time and DeleteMin in logarithmic<br />time.  ...  We present priority queues that support the operations MakeQueue,<br />FindMin, Insert and Meld in worst case time O(1) and Delete and<br />DeleteMin in worst case time O(log n).  ...  We assume that comparisons can be performed in worst case constant time. For simplicity we assume that all priority queues are nonempty.  ... 
doi:10.7146/brics.v2i12.19515 fatcat:dxsmuwetabfvfebajaisjcfply

Fast meldable priority queues [chapter]

Gerth Stølting Brodal
1995 Lecture Notes in Computer Science  
We present priority queues that support the operations MakeQueue, FindMin, Insert and Meld in worst case time O(1) and Delete and DeleteMin in worst case time O(log n).  ...  The time bounds are optimal for all implementations where Meld takes worst case time o(n).  ...  We assume that comparisons can be performed in worst case constant time. For simplicity we assume that all priority queues are nonempty.  ... 
doi:10.1007/3-540-60220-8_70 fatcat:iaau75pvyzhjrie2roitruncyi

A priority queue with the time-finger property

Amr Elmasry, Arash Farzan, John Iacono
2012 Journal of Discrete Algorithms  
We present a priority queue that supports insert in worst-case constant time, and deletemin, access-min, delete, and decrease of an element x in worst-case O (log(min{w x , q x })) time, where w x (respectively  ...  Our priority queue then has both the working-set and the queueish properties; and, more strongly, it satisfies these properties in the worst-case sense.  ...  In Section 3, we present a priority queue that supports insert in worst-case constant time, and delete-min, access-min, delete, and decrease in O (log w x ) worst-case time.  ... 
doi:10.1016/j.jda.2012.04.014 fatcat:ej5de5oypnhc5los5qlyknuigm

Priority Queues with Multiple Time Fingers [article]

Amr Elmasry, Arash Farzan, John Iacono
2010 arXiv   pre-print
A priority queue is presented that supports the operations insert and find-min in worst-case constant time, and delete and delete-min on element x in worst-case O(lg(minw_x, q_x+2)) time, where w_x (respectively  ...  Our priority queue then has both the working-set and the queueish properties, and more strongly it satisfies these properties in the worst-case sense.  ...  In section 4, we present a priority queue that supports both delete and delete-min in O (lg(w x + 2)) worst-case time (and insertion in worst-case constant time).  ... 
arXiv:1009.5538v1 fatcat:t3pm2ukohvbspdjslxusyy53dm

Weak Heaps and Friends: Recent Developments [chapter]

Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen, Armin Weiß
2013 Lecture Notes in Computer Science  
In applications where this set of operations is sufficient, the priority queue that the users would select is a binary heap [29] or a weak heap [7] .  ...  Weak Heaps In its elementary form, a priority queue is a data structure that stores a collection of elements and supports the operations construct, minimum, insert, and extract-min [4] .  ...  In addition, with constant memory overhead, O(1) amortized time per insert can be improved to O(1) worst-case time [12] , while preserving O(1) worst-case time for minimum and O(lg n) worst-case time  ... 
doi:10.1007/978-3-642-45278-9_1 fatcat:xpymmd6toralpgl57qb3ia4ahm

A Survey on Priority Queues [chapter]

Gerth Stølting Brodal
2013 Lecture Notes in Computer Science  
Back in 1964 Williams introduced the binary heap as a basic priority queue data structure supporting the operations Insert and Ex-tractMin in logarithmic time.  ...  Since then numerous papers have been published on priority queues. This paper tries to list some of the directions research on priority queues has taken the last 50 years.  ...  The worst-case time for Meld in a binomial queue is Θ(lg n), but the amortized time was proven to be constant by Khoong and Leong [96] .  ... 
doi:10.1007/978-3-642-40273-9_11 fatcat:zocxhiyfmvdgzn2yoob25h3wr4

Worst-Case Optimal Priority Queues via Extended Regular Counters [article]

Amr Elmasry, Jyrki Katajainen
2011 arXiv   pre-print
Brodal showed that his worst-case efficient priority queues achieve these worst-case bounds. Unfortunately, this data structure is involved and the time bounds hide large constants.  ...  We describe a new variant of the worst-case efficient priority queues that relies on extended regular counters and provides the same asymptotic time and space bounds as the original.  ...  this manuscript and teaming up with us for six years in our research on the comparison complexity of priority-queue operations.  ... 
arXiv:1112.0993v1 fatcat:xogofnn27rfmrbl3dagznl7eqa

Calculating End-to-End Queuing Delay for Real-Time Services on an IP Network [chapter]

Robert E. Kooij, Olaf Østerbø, J. C. van der Wal
2003 Lecture Notes in Computer Science  
Results are shown indicating an improvement up to 45% over the worst-case method.  ...  Earlier work assessed these two components separately, leading to a 'worst case' result.  ...  Note that the worst-case method assesses end-to-end delay quantiles by taking the sum of the end-to-end quantile for K M/D/1 queues (contribution of real-time queue) and K times the service time of a data  ... 
doi:10.1007/3-540-45020-3_9 fatcat:ad6uppgsn5dy7cl3dqu5avcham

Policy-Based Benchmarking of Weak Heaps and Their Relatives, [chapter]

Asger Bruun, Stefan Edelkamp, Jyrki Katajainen, Jens Rasmussen
2010 Lecture Notes in Computer Science  
A weak heap supports insert and decrease in logarithmic worst-case time, whereas a weak queue reduces the worst-case running time of insert to O(1), and a run-relaxed weak queue that of both insert and  ...  All these structures support delete and delete-min in logarithmic worst-case time.  ...  Hence, worst-case efficient priority queues should only be used in applications where worst-case efficiency is essential. 3) Memory management is expensive.  ... 
doi:10.1007/978-3-642-13193-6_36 fatcat:xbihqjez5zfcjopljjgtbk4egi

Improvements in double ended priority queues

M. Ziaur Rahman, Rezaul Alam Chowdhury, M. Kaykobad
2003 International Journal of Computer Mathematics  
We also show that in the worst case, this structure, though slightly costlier to create, is better than min-max heaps of Strothotte (Min-max Heaps and Generalized Priority Queues -CACM, 29(10), 996-1000  ...  Experimental results show that, in the average case, with the exception of creation phase data movement, our algorithm outperforms min-max heap of Strothotte in all other aspects.  ...  Using max-heap FindMax can be performed in constant time and both DeleteMax and Insert(x) in logarithmic time.  ... 
doi:10.1080/207160310001599079 fatcat:3j3e5ohlwffqzblro7uoc3vshe

Improving System Predictability and Performance via Hardware Accelerated Data Structures

Chetan Kumar Ng, Sudhanshu Vyas, Jonathan A. Shidal, RonK. Cytron, ChristopherD. Gill, Joseph Zambreno, Phillip H. Jones
2012 Procedia Computer Science  
A new hardware priority queue design is presented, which supports insertions in constant time, and removals in O(log n) time.  ...  The hardware scheduler supports three (Rate Monotonic Scheduling (RMS), Earliest Deadline First (EDF), and priority based) scheduling algorithms, which can be configured during run-time.  ...  The hardware priority queue supports constant time enqueue operations and dequeue operations in O(log n) time.  ... 
doi:10.1016/j.procs.2012.04.129 fatcat:a4zz3tyquberxlczg7hilgb2sq

MultiQueues: Simpler, Faster, and Better Relaxed Concurrent Priority Queues [article]

Hamza Rihani, Peter Sanders, Roman Dementiev
2014 arXiv   pre-print
In this paper we present a very simple approach based on multiple sequential priority queues.  ...  However, a classical priority queue constitutes a severe bottleneck in this context, leading to very small throughput.  ...  Corollary 2 . 2 MultiQueues with d-ary heaps need constant average insertion time and expected time O(log n) per operation for worst case operations sequences.  ... 
arXiv:1411.1209v1 fatcat:gmwxoaft5zas3jdex5hjq2ncky

Scheduling in an Ethernet fronthaul network

M. K. Al-Hares, P. Assimakopoulos, D. Muench, N. J. Gomes
2017 2017 European Conference on Networks and Communications (EuCNC)  
In such cases, contentioninduced latency variation has to be characterized, especially when the fronthaul transports precision time protocol traffic, as it directly leads to errors in timestamping.  ...  OPNET models for strict priority and time-aware schedulers have been built and employed, and simulation results are used to compare the performance of the two scheduling schemes.  ...  Note that the worst case would be a full serialization (i.e. 8 s) but as the background source is constant frame-rate and frame size this worst case is not observed in these results due to the relative  ... 
doi:10.1109/eucnc.2017.7980783 dblp:conf/eucnc/Al-HaresAMG17 fatcat:5kajzgdswzhj5as35ix5t24jsa

Fat Heaps without Regular Counters [chapter]

Amr Elmasry, Jyrki Katajainen
2012 Lecture Notes in Computer Science  
We introduce a variant of fat heaps that does not rely on regular counters, and still achieves the optimal worst-case bounds: O(1) for find -min, insert and decrease, and O(lg n) for delete and delete-min  ...  Experimental results suggest that our implementation is superior to structures, like run-relaxed heaps, that achieve the same worst-case bounds, and competitive to structures, like Fibonacci heaps, that  ...  At the same time, fat heaps provide strict worst-case guarantees for all priority-queue operations.  ... 
doi:10.1007/978-3-642-28076-4_18 fatcat:vaf46pzhrvfcxocobeoy22cjzi
« Previous Showing results 1 — 15 out of 19,269 results