Filters








436 Hits in 7.6 sec

The soft heap: an approximate priority queue with optimal error rate

Bernard Chazelle
2000 Journal of the ACM  
Given any mixed sequence of n operations, a soft heap with error rate (for any 0 Ͻ Յ 1/2) ensures that, at any time, at most n of its items have their keys raised.  ...  A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin.  ...  I wish to thank the anonymous referee for some useful suggestions.  ... 
doi:10.1145/355541.355554 fatcat:atvwrclmdnekllj2e4t6vnsxqm

A simpler implementation and analysis of Chazelle's Soft Heaps [chapter]

Haim Kaplan, Uri Zwick
2009 Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms  
Chazelle (JACM 47(6), 2000) devised an approximate meldable priority queue data structure, called Soft Heaps, and used it to obtain the fastest known deterministic comparison-based algorithm for computing  ...  Chazelle's soft heaps are derived from the binomial heaps data structure in which each priority queue is composed of a collection of binomial trees.  ...  Acknowledgment We would like to thank Bob Tarjan for his comments on an earlier version of this paper.  ... 
doi:10.1137/1.9781611973068.53 fatcat:d4vfuz3nmjhojpbrgnsbq4uz2u

A Selectable Sloppy Heap [article]

Adrian Dumitrescu
2017 arXiv   pre-print
As such, our data structure outperforms the soft heap data structure of Chazelle (which only offers constant amortized complexity for a fixed error rate 0<ε≤ 1/2) in applications such as dynamic percentile  ...  Here we offer a data structure called selectable sloppy heap handling a dynamic version in which upon request: (i) a new element is inserted or (ii) an element of a prescribed quantile group is deleted  ...  For any 0 < ε ≤ 1/2, a soft heap with error rate ε supports each operation in constant amortized time, except for Insert which takes O(log 1/ε) amortized time.  ... 
arXiv:1607.07673v2 fatcat:ctjmqaefezhkxfqan6j27urbny

Binomial, Fibonacci, and Pairing Heaps [chapter]

Michael Fredman
2004 Handbook of Data Structures and Applications  
The soft heap departs from the standard notion of priority queue by allowing for a type of error, referred to as corruption, which confers enhanced efficiency.  ...  The pairing heap thus self-organizes the sorted list arrangement to approximate an optimal merge pattern.  ...  Binomial Heap-Specific Algorithms Fibonacci Heap-Specific Algorithms  ... 
doi:10.1201/9781420035179.ch7 fatcat:jvwwedw67rfanpipdy426655li

A Selectable Sloppy Heap

Adrian Dumitrescu
2019 Algorithms  
As such, our data structure outperforms the soft heap data structure of Chazelle (which only offers constant amortized complexity for a fixed error rate 0 < ε ≤ 1 / 2 ) in applications such as dynamic  ...  Here we offer a data structure called selectable sloppy heap that handles a dynamic version in which upon request (i) a new element is inserted or (ii) an element of a prescribed quantile group is deleted  ...  For any 0 < ε ≤ 1/2, a soft heap with error rate ε supports each operation in constant amortized time, except for Insert which takes O(log 1/ε) amortized time.  ... 
doi:10.3390/a12030058 fatcat:fcbrgfxnmvhpna4eaba2fzoxvq

Eiffel: Efficient and Flexible Software Packet Scheduling [article]

Ahmed Saeed, Yimeng Zhao, Nandita Dukkipati, Mostafa Ammar, Ellen Zegura, Khaled Harras, Amin Vahdat
2018 arXiv   pre-print
As an even more efficient alternative, we also propose a new approximate priority queue that can outperform FFS-based queues for some scenarios.  ...  At the core of Eiffel is an integer priority queue based on the Find First Set (FFS) instruction and designed to support a wide range of policies and ranking functions efficiently.  ...  For instance, Soft-heap [22] is an approximate priority queue with a bounded error that is inversely proportional to the overhead of insertion.  ... 
arXiv:1810.03060v1 fatcat:lt4lby3p3rdkrjrwqs7rrmiuqi

Page 564 of Mathematical Reviews Vol. , Issue 2003A [page]

2003 Mathematical Reviews  
See also 03025, 03027, 03030, 03031, 03032, 03090. 68P Theory of data 2003a:68033 68P05 68P10 68Q25 68Q65 Chazelle, Bernard (1-PRIN; Princeton, NJ) The soft heap: an approximate priority queue with optimal  ...  This paper introduces a variant of the priority queue data struc- ture, called the soft heap.  ... 

A real-time Java virtual machine with applications in avionics

Austin Armbruster, Jason Baker, Antonio Cunei, Chapman Flack, David Holmes, Filip Pizlo, Edward Pla, Marek Prochazka, Jan Vitek
2007 ACM Transactions on Embedded Computing Systems  
This paper reports on our experience with the implementation of the Real-time Specification for Java on the Ovm open source Java virtual machine.  ...  We present the first use of Real-time Java in avionics in the context of control software for a ScanEagle Unmanned Aerial Vehicle. A. Armbruster et al.  ...  to the Ovm framework.  ... 
doi:10.1145/1324969.1324974 fatcat:gkidcfbbcvagzbeihmoc4ckc7a

Design and implementation of a comprehensive real-time java virtual machine

Joshua Auerbach, David F. Bacon, Bob Blainey, Perry Cheng, Michael Dawson, Mike Fulton, David Grove, Darren Hart, Mark Stoodley
2007 Proceedings of the 7th ACM & IEEE international conference on Embedded software - EMSOFT '07  
The system has been adopted for hard real-time development of naval weapons systems and soft real-time telecommunications servers.  ...  to a system implementing the complete semantics of the Java language.  ...  On a uniprocessor system, there is only one scheduler run queue, and selecting the next highest priority task to run is trivial.  ... 
doi:10.1145/1289927.1289967 dblp:conf/emsoft/AuerbachBBCDFGHS07 fatcat:6ss7gdxzyjhdrbawxog3dh3gja

Prioritized garbage collection: explicit GC support for software caches

Diogenes Nunez, Samuel Z. Guyer, Emery D. Berger
2016 Proceedings of the 2016 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications - OOPSLA 2016  
Prioritized GC provides an interface similar to soft references, called priority references, which identify objects that the collector can reclaim eagerly if necessary.  ...  The key difference is an API for defining the policy that governs when priority references are cleared and in what order.  ...  error.  ... 
doi:10.1145/2983990.2984028 dblp:conf/oopsla/NunezGB16 fatcat:e3dfjyxtrrazbisdekgazbmbxm

Prioritized garbage collection: explicit GC support for software caches

Diogenes Nunez, Samuel Z. Guyer, Emery D. Berger
2016 SIGPLAN notices  
Prioritized GC provides an interface similar to soft references, called priority references, which identify objects that the collector can reclaim eagerly if necessary.  ...  The key difference is an API for defining the policy that governs when priority references are cleared and in what order.  ...  error.  ... 
doi:10.1145/3022671.2984028 fatcat:wcwqunluk5dijgo44otdull2ui

Randomized minimum spanning tree algorithms using exponentially fewer random bits

Seth Pettie, Vijaya Ramachandran
2008 ACM Transactions on Algorithms  
In many ways it resembles more closely the deterministic minimum spanning tree algorithms based on Soft Heaps.  ...  (For the first two problems there are provably optimal deterministic algorithms with unknown, and possibly superlinear running times.)  ...  However an approximate Borůvka step possesses several useful properties beyond the reach of Soft Heaps. First, the error rate (i.e., sampling probability) can be chosen at will.  ... 
doi:10.1145/1328911.1328916 fatcat:mytnhdzm7fc75huzde36ger27y

A fast minimum spanning tree algorithm based on K-means

Caiming Zhong, Mikko Malinen, Duoqian Miao, Pasi Fränti
2015 Information Sciences  
Fredman and Tarjan [20] proposed the Fibonacci heap as a data structure of implementing the priority queue for constructing an exact MST.  ...  He discovered a new heap structure, called soft heap, to implement the priority queue, and as a result, the time complexity is reduced to OðEaðE; VÞÞ, where a is the inverse  ...  Acknowledgments This work was partially supported by the Natural Science Foundation of China (No. 61175054), the Center for International Mobility (CIMO), and sponsored by K.C.  ... 
doi:10.1016/j.ins.2014.10.012 fatcat:zpwjcqa4gvf4blrmeeobqmjbx4

State-only Imitation with Transition Dynamics Mismatch [article]

Tanmay Gangwani, Jian Peng
2020 arXiv   pre-print
It divides the overall optimization objective into two subproblems by introducing an indirection step and solves the subproblems iteratively.  ...  With the environment modeled as a Markov Decision Process (MDP), most of the existing IL algorithms are contingent on the availability of expert demonstrations in the same MDP as the one in which a new  ...  ., 2015) are used for reducing the variance of the estimated policy-gradients. The priority buffer B uses the heap-queue algorithm (Appendix 7.3).  ... 
arXiv:2002.11879v1 fatcat:y2jz7sdqdzcrvab7wwxjqey3km

Efficient Algorithms and Data Structures for Massive Data Sets [article]

Alka
2010 arXiv   pre-print
. (2) The first external memory version of soft heap, an approximate meldable priority queue. (3) Hard heap, the first meldable external memory priority queue that matches the amortised I/O performance  ...  of the known external memory priority queues, while allowing a meld operation at the same amortised cost. (4) I/O efficient exact, approximate and randomised algorithms for the minimum cut problem, which  ...  Hard heap: A Meldable Priority Queue When an EMSH has error-rate = 1/(N + 1), no element in it can be corrupt. In this case, EMSH becomes an exact priority queue, which we call hard heap.  ... 
arXiv:1005.3473v1 fatcat:qgy3ii4v2vc6hn4tx43x25jtkq
« Previous Showing results 1 — 15 out of 436 results