Filters








250 Hits in 4.2 sec

Cache-oblivious shortest paths in graphs using buffer heap

Rezaul Alam Chowdhury, Vijaya Ramachandran
2004 Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures - SPAA '04  
For both priority queues with Decrease-Key operation, and for shortest path problems on general graphs, our results appear to give the first non-trivial cache-oblivious bounds.  ...  We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key ) amortized block transfers from external memory, where B is the (unknown) block-size  ...  CACHE-OBLIVIOUS PRIORITY QUEUES In this section we describe two cache-oblivious priority queues: the Buffer Heap (BH) and the Cache-Oblivious Tournament Tree (COTT).  ... 
doi:10.1145/1007912.1007949 dblp:conf/spaa/ChowdhuryR04 fatcat:plsnuv2u4ff7nftoj5z2zr4bdq

Efficient sparse polynomial factoring using the Funnel heap [article]

Fatima K. Abu Salem and Khalil El-Harake and Karl Gemayel
2016 arXiv   pre-print
We demonstrate that Funnel Heap is a more efficient merger than the cache oblivious k-merger, which fails to achieve its optimal (and amortised) cache complexity when used for performing sums of products  ...  , cache, and space complexity of this phase.  ...  Acknowledgments We thank the Lebanese National Council for Scientific Research and the University Research Board -American University of Beirut, for supporting this work. References  ... 
arXiv:1612.05403v1 fatcat:nnubi4w3rza3hh6tlzxefokh34

The weak-heap data structure: Variants and applications

Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
2012 Journal of Discrete Algorithms  
Unlike other previous constantfactor-optimal adaptive sorting algorithms, adaptive heapsort relying on the developed priority queue is practically workable. 2.  ...  The weak heap is a priority queue that was introduced as a competitive structure for sorting.  ...  We studied the constant-factor-optimality and practicality of adaptive heapsort when implemented with a weak heap.  ... 
doi:10.1016/j.jda.2012.04.010 fatcat:7itopm2mbndxvgziibmqavxxlm

In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses [chapter]

Jingsen Chen, Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
2012 Lecture Notes in Computer Science  
On another frontier, we compare different heap-construction alternatives in practice.  ...  The same bound for element comparisons was derived and conjectured to be optimal by Gonnet and Munro; however, their procedure requires Θ(n) pointers and does not have optimal cache behaviour.  ...  Such a construction requires n−1 element comparisons and no element moves. In addition, a navigation pile supports the priority-queue operations insert and delete easily and efficiently [9] .  ... 
doi:10.1007/978-3-642-32589-2_25 fatcat:laqctkvlzvbkjl7p6cjpxbvon4

Cache-oblivious priority queue and graph algorithm applications

Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro
2002 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing - STOC '02  
In this paper we develop an optimal cache-oblivious priority queue data structure, supporting insertion, deletion, and deletemin operations in O( 1 B log M/B N B ) amortized memory transfers, where M and  ...  Priority queues are a critical component in many of the best known external-memory graph algorithms, and using our cache-oblivious priority queue we develop several cacheoblivious graph algorithms. *  ...  Our results The main result of this paper is an optimal cache-oblivious priority queue.  ... 
doi:10.1145/509948.509950 fatcat:fhzfr2w4pbexzngwdtygse57tu

Cache-oblivious priority queue and graph algorithm applications

Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro
2002 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing - STOC '02  
In this paper we develop an optimal cache-oblivious priority queue data structure, supporting insertion, deletion, and deletemin operations in O( 1 B log M/B N B ) amortized memory transfers, where M and  ...  Priority queues are a critical component in many of the best known external-memory graph algorithms, and using our cache-oblivious priority queue we develop several cacheoblivious graph algorithms.  ...  Our results The main result of this paper is an optimal cache-oblivious priority queue.  ... 
doi:10.1145/509907.509950 dblp:conf/stoc/ArgeBDHM02 fatcat:fmrm5cem4jbizlv7tbl37oz2wm

Efficient, Oblivious Data Structures for MPC [chapter]

Marcel Keller, Peter Scholl
2014 Lecture Notes in Computer Science  
We present oblivious implementations of several data structures for secure multiparty computation (MPC) such as arrays, dictionaries, and priority queues.  ...  We subsequently use our oblivious priority queue for secure computation of Dijkstra's shortest path algorithm on general graphs, where the graph structure is secret.  ...  Acknowledgements We would like to thank Nigel Smart for various comments and suggestions. This work has been supported in part by EPSRC via grant EP/I03126X.  ... 
doi:10.1007/978-3-662-45608-8_27 fatcat:b2t43jrrnfeltbmixsdzoldixa

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.  ...  Acknowledgment The author would like to thank Rolf Fagerberg, Andy Brodnik, Jyrki Katajainen, Amr Elmasry, Jesper Asbjørn Sindahl Nielsen and the anonymous reviewers for valuable input.  ... 
doi:10.1007/978-3-642-40273-9_11 fatcat:zocxhiyfmvdgzn2yoob25h3wr4

An Optimal Cache‐Oblivious Priority Queue and Its Application to Graph Algorithms

Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland‐Minkley, J. Ian Munro
2007 SIAM journal on computing (Print)  
We develop an optimal cache-oblivious priority queue data structure, supporting insertion, deletion, and delete-min operations in O( 1 B log M/B N B ) amortized memory transfers, where M and B are the  ...  Priority queues are a critical component in many of the best known external memory graph algorithms, and using our cache-oblivious priority queue we develop several cache-oblivious graph algorithms.  ...  Acknowledgements The authors wish to thank an anonymous reviewer for pointing out a mistake in an earlier draft of this paper, and all the reviewers for numerous suggestions for improving the presentation  ... 
doi:10.1137/s0097539703428324 fatcat:qq5uolj22jgj3m6oq2prou4k7u

Cache-Oblivious Data Structures [chapter]

Lars Arge, Gerth Stølting Brodal, Rolf Fagerberg
2004 Handbook of Data Structures and Applications  
Merge Based Priority Queue: Funnel Heap The cache-oblivious priority queue Funnel Heap due to Brodal and Fagerberg [16] is inspired by the sorting algorithm Funnelsort [15, 20] .  ...  Exponential Level Based Priority Queue While the Funnel Heap is inspired by Mergesort and uses k-mergers as the basic building block, the exponential level priority queue of Arge et al.  ... 
doi:10.1201/9781420035179.ch34 fatcat:mxgs5yde2bdvtppbfer3s5fbsi

ObliVM: A Programming Framework for Secure Computation

Chang Liu, Xiao Shaun Wang, Kartik Nayak, Yan Huang, Elaine Shi
2015 2015 IEEE Symposium on Security and Privacy  
ObliVM offers a powerful, expressive programming language and user-friendly oblivious programming abstractions.  ...  We design and develop ObliVM, a programming framework for secure computation.  ...  stack, AVL tree, heap, and queue.  ... 
doi:10.1109/sp.2015.29 dblp:conf/sp/LiuWNHS15 fatcat:hpf5tvklujhebigki5iky6tpz4

Oblivious Data Structures

Xiao Shaun Wang, Kartik Nayak, Chang Liu, T-H. Hubert Chan, Elaine Shi, Emil Stefanov, Yan Huang
2014 Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security - CCS '14  
Our oblivious counterparts of the above outperform the best known ORAM scheme both asymptotically and in practice.  ...  Specifically, we apply these techniques to a broad range of commonly used data structures, including maps, sets, priority-queues, stacks, deques; and algorithms, including a memory allocator algorithm,  ...  Based on this framework for constructing oblivious data structures, we derive algorithms for oblivious map, queue, stack, and heap.  ... 
doi:10.1145/2660267.2660314 dblp:conf/ccs/WangNLCSSH14 fatcat:ix3keelbmfcu5cdxt7mgu7w73m

Cache-Oblivious Algorithms and Data Structures [chapter]

Gerth Stølting Brodal
2004 Lecture Notes in Computer Science  
and Vitter for an arbitrary memory and block size and an optimal off-line cache replacement strategy.  ...  This paper gives an overview of the results achieved on cache-oblivious algorithms and data structures since the seminal paper by Frigo et al.  ...  Finally, optimal cache-oblivious implicit dictionaries were developed in [42] and [43] . Priority queues Arge et al.  ... 
doi:10.1007/978-3-540-27810-8_2 fatcat:ikrcemqwzrg5pawaajqtxnruuy

Oblivious Sorting and Queues [article]

Johannes Schneider
2016 arXiv   pre-print
We are the first to present double-ended (priority) and LIFO queues as well as oblivious quicksort which is asymptotically optimal.  ...  We present a deterministic oblivious LIFO (Stack), FIFO, double-ended and double-ended priority queue as well as an oblivious mergesort and quicksort algorithm.  ...  In contrast, [21] presents a deterministic scheme for priority queues using the bucket heap concept for priority queues [3] coming with O(log 2 n) overhead.  ... 
arXiv:1612.03343v1 fatcat:yum4sqnh25bbbc2rhwuzihxrem

Computing betweenness centrality in external memory

Lars Arge, Michael T. Goodrich, Freek van Walderveen
2013 2013 IEEE International Conference on Big Data  
In this paper we describe the first known external-memory and cache-oblivious algorithms for computing betweenness centrality.  ...  Two of the algorithms are cache-oblivious.  ...  We end the round by scanning A while loading the priority queue blocks for each of the K/L groups in order, and update the priority queues using the information in A.  ... 
doi:10.1109/bigdata.2013.6691597 dblp:conf/bigdataconf/ArgeGW13 fatcat:smhxlmehargiliaraljh5b5lq4
« Previous Showing results 1 — 15 out of 250 results