BENDER, M. A., DUAN, Z., IACONO, J., AND WU, J. 2002. A localitypreserving cache-oblivious dynamic dictionary. In Proc. ACM-SIAM Sympos. on Discrete Algorithms, 29--38.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....model is automatically e#cient on each level of a multi level memory model. They also presented optimal cache oblivious algorithms for matrix transposition, FFT, and sorting. Cache oblivious search trees which match the search cost of the standard (cache aware) B trees [4] were presented in [6,8,9,11]. Cache oblivious algorithms have also been given for problems in computational geometry [6,10] for scanning dynamic sets [5] and for layout of static trees [7] Recently, the first Partially supported by the Future and Emerging Technologies programme of the EU under contract number ....

M. A. Bender, Z. Duan, J. Iacono, and J. Wu. A locality-preserving cache-oblivious dynamic dictionary. In Proc. 13th Ann. ACM-SIAM Symp. on Discrete Algorithms, pages 29--39, 2002.

.... algorithms for matrix transposition, FFT, and sorting [13] Bender et al. 7] gave a proposal for cache oblivious search trees with search cost matching that of standard (cache aware) B trees [5] Simpler cache oblivious search trees with complexities matching that of [7] were presented in [8, 11]. Cache oblivious data structures based on on exponential structures are presented in [6] Recently, a cache oblivious priority queue has been developed [3] which in turn gives rise to several cacheoblivious graph algorithms. We consider cache oblivious algorithms within the field of ....

M. A. Bender, Z. Duan, J. Iacono, and J. Wu. A locality-preserving cache-oblivious dynamic dictionary. In Proc. 13th Ann. ACM-SIAM Symp. on Discrete Algorithms, pages 29--39, 2002.

....into memory blocks, the algorithm does not achieve the perfect binary splitting into equal size subproblems. Cache aware algorithms have been studied in a number of di erent contexts [7, 8, 5, 10] The second approach to improving the memory performance of binary search is the cache oblivious [9, 4, 1, 2, 3] approach where the items are organized in a universal fashion so that items that are accessed closely in time are stored near each other. The method is called cache oblivious because knowledge of the memory block size is not needed to achieve the organization. The advantage of the cache oblivious ....

....the bene t of reducing the memory footprint of a single node, and thus increase the overall cache performance. However the computation of the implicit pointers at run time impacts the instruction count of the algorithm and can have a negative e ect on performance. In recent work Bender et al. [2] and Brodal et al. [3] have used the cache oblivious static search tree as the basis of a cache oblivious dynamic search structures that allow for insertions and deletions. In particular, Brodal et al. have discovered a very elegant and ecient way to calculate the pointers in the cache oblivious ....

Bender, M.A.; Duan, Z.; Iacono, J.; Wu J. (2002): A locality-preserving cacheoblivious dynamic dictionary. SODA'02, Proceedings of the Thirteenth Annual ACMSIAM Symposium on Discrete Algorithms, 29-38

....to recent surveys for further I O model and hierarchical memory model results [6, 26] Frigo et al. 22] developed cache oblivious algorithms for sorting, Fast Fourier Transform, and matrix multiplication. Subsequently, a number of other results have been obtained in the cache oblivious model [7, 10, 11, 12, 13, 16, 17, 24], among them several cache oblivious B tree structure with O(log B N) search and update bounds [11, 12, 13, 17, 24] Several of these structures can also support one dimensional range queries in O(log B N T B) memory transfers [12, 13, 17] but at an increased amortized update cost of O(log B N ....

....algorithms for sorting, Fast Fourier Transform, and matrix multiplication. Subsequently, a number of other results have been obtained in the cache oblivious model [7, 10, 11, 12, 13, 16, 17, 24] among them several cache oblivious B tree structure with O(log B N) search and update bounds [11, 12, 13, 17, 24]. Several of these structures can also support one dimensional range queries in O(log B N T B) memory transfers [12, 13, 17] but at an increased amortized update cost of O(log B N B N) memory transfers. To our knowledge, no cache oblivious structures for higher dimensional orthogonal range ....

[Article contains additional citation context not shown here]

M. A. Bender, Z. Duan, J. Iacono, and J. Wu. A locality-preserving cache-oblivious dynamic dictionary. In Proc. ACM-SIAM Symp. on Discrete Algorithms, pages 29--38, 2002.

....stored, plus O(1) additional space. In the present paper, we will abuse the terminology a little, taking implicit to mean a structure stored entirely in an array of elements of length O(n) We note that independently, a data structure very similar to ours has been proposed by Bender et al. [6]. Essentially, their proposal is leaf oriented, where ours is node oriented. The leaf oriented version allows an easy implementation of optimal scanning from any given location (the node oriented version needs successor pointers for this) whereas the node oriented version allows an implicit ....

M. A. Bender, Z. Duan, J. Iacono, and J. Wu. A locality-preserving cacheoblivious dynamic dictionary. In Proc. 13th Ann. ACM-SIAM Symp. on Discrete Algorithms, 2002.

No context found.

M. A. Bender, Z. Duan, J. Iacono, and J. Wu. A locality-preserving cacheoblivious dynamic dictionary. In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 29--38, 2002.

No context found.

M. A. Bender, Z. Duan, J. Iacono, and J. Wu. A locality-preserving cache-oblivious dynamic dictionary. In Proc. 13th ACM-SIAM Ann. Symp. on Discrete Algorithms, pages 29--38, 2002.

No context found.

M. A. Bender, Z. Duan, J. Iacono, and J. Wu. A locality-preserving cache-oblivious dynamic dictionary. In Proc. 13th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 29-39, 2002.

No context found.

M. A. Bender, Z. Duan, J. Iacono, and J. Wu. A locality-preserving cacheoblivious dynamic dictionary. In Proc. 13th ACM-SIAM Ann. Symp. on Discrete Algorithms, pages 29--38, 2002.

No context found.

M. A. Bender, Z. Duan, J. Iacono, and J. Wu. A locality-preserving cache-oblivious dynamic dictionary. In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 29-38, 2002.

No context found.

M. A. Bender, Z. Duan, J. Iacono, and J. Wu. A locality-preserving cache-oblivious dynamic dictionary. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 29-38, 2002.

....structure can be thought of as a cache oblivious linked list that supports scanning S consecutive elements in O(1 S=B) memory transfers (instead of the na ve O(S) and updates in O(1 B ) amortized memory transfers. B tree Simpli cation via packed memory structure low height trees [BDIW02, BFJ02] Simpli cation and persistence via exponential structures [RCR01, BCR02] Implicit [FG03a, FG03b] Static search trees Basic layout [Pro99] Experiments [LFN02] Optimal constant factor [BBF 03] Linked lists supporting scans [BCDFC02] Priority queues [ABD 02b, BF02b] ....

Michael A. Bender, Ziyang Duan, John Iacono, and Jing Wu. A locality-preserving cacheoblivious dynamic dictionary. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 29-38, San Francisco, California, January 2002. 16

....that elements have to be sorted. Allowing elements to be stored By keeping elements in sorted order, we mean that their logical order is monotone with respect to their memory addresses. This notion is valuable for algorithms that use memory addresses as proxies for order. See, for example, [6]. out of order leads to update bounds exponentially below the lower bound of ( log N ) B) for the sorted case. In particular, in Section 2 we develop a cacheoblivious structure using O(d(log log N ) B e) unrestricted block transfers, for any 0. This is our only result for which the ....

....it seems that this improvement is marginal. Our results form a body of tools for manipulating dynamic data in unknown and multilevel memory hierarchies. In particular, they can be used to improve cache oblivious B trees. The only cache oblivious B tree structures that support traversals optimally [4, 6, 7] require O(log B N B ) amortized memory transfers per update. By applying the structure in Section 4, we obtain the following improvement: Corollary 1. There is a cache oblivious data structure that maintains an ordered set subject to searches in O(log B N ) memory transfers, insertions and ....

M. A. Bender, Z. Duan, J. Iacono, and J. Wu. A locality-preserving cache-oblivious dynamic dictionary. In SODA, 2002.

.... in [37] Generalizations of Hilbert curves to higher dimensions are given in [1] Specific applications include matrix multiplication [11, 20] domain decomposition [3, 25, 39] and image processing [2, 34, 4, 51, 31, 30] They are also a standard tool in the creation of cache oblivious algorithms [21, 40, 5, 41, 6, 10], which have asymptotically optimal memory performance on multilevel memory hierarchies while avoiding memory specific parameterization. There is a large body of work on scheduling and online scheduling, in particular. We do not attempt to review all this work here, but refer the reader to the ....

M. A. Bender, Z. Duan, J. Iacono, and J. Wu. A locality-preserving cacheoblivious dynamic dictionary. In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 29--38, 2002.

....the memory hierarchy parameters (block size and memory level size) As a consequence, such algorithms tune automatically to arbitrary memory hierarchies with an arbitrarily many memory levels. Examples of cache oblivious data structures include cache oblivious B trees [6] and its simpli cations [8, 9, 20], cacheoblivious persistent trees [5] cache oblivious priority queues [2] and cache oblivious linked lists [4] However, all of these data structures assume a uniform distribution on operations. Although [17] does not explicitly state its results in the external memory model, its approach ....

Michael A. Bender, Ziyang Duan, John Iacono, and Jing Wu. A locality-preserving cache-oblivious dynamic dictionary. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 29-38, San Francisco, California, January 2002.

.... in [37] Generalizations of Hilbert curves to higher dimensions are given in [1] Specific applications include matrix multiplication [11, 20] domain decomposition [3, 25, 39] and image processing [2, 34, 4, 51, 31, 30] They are also a standard tool in the creation of cacheoblivious algorithms [21, 40, 5, 41, 6, 10], which have asymptotically optimal memory performance on multilevel memory hierarchies while avoiding memory specific parameterization. There is a large body of work on scheduling and online scheduling, in particular. We do not attempt to review all this work here, but refer the reader to the ....

M. A. Bender, Z. Duan, J. Iacono, and J. Wu. A localitypreserving cache-oblivious dynamic dictionary. In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 29--38, 2002.

No context found.

BENDER, M. A., DUAN, Z., IACONO, J., AND WU, J. 2002. A localitypreserving cache-oblivious dynamic dictionary. In Proc. ACM-SIAM Sympos. on Discrete Algorithms, 29--38.

No context found.

M. A. Bender, Z. Duan, J. Iacono and J. Wu. A locality-preserving cache-oblivious dynamic dictionary. In Proc. 13th Annu. ACM-SIAM Symp. on Discrete Algorithms, 29--39, 2002.

No context found.

M. A. Bender, Z. Duan, J. Iacono, and J. Wu. A locality-preserving cache-oblivious dynamic dictionary. In 13th SODA, pages 29-38, 2002.

No context found.

M. Bender, Z. Duan, J. Iacono, and J. Wu. A locality-preserving cache-oblivious dynamic dictionary. In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 02), pages 29-38, 2002.

No context found.

M. Bender, Z. Duan, J. Iacono, and J. Wu. A locality-preserving cache-oblivious dynamic dictionary. In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 02), pages 29--38, 2002.

No context found.

M. Bender, Z. Duan, J. Iacono, and J. Wu. A locality-preserving cache-oblivious dynamic dictionary. In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 02), pages 29-38, 2002.

No context found.

M. A. Bender, Z. Duan, J. Iacono, and J. Wu. A locality-preserving cache-oblivious dynamic dictionary. In Proc. 13th Ann. ACM-SIAM Symp. on Discrete Algorithms, pages 29--39, 2002.

No context found.

M. A. Bender, Z. Duan, J. Iacono, and J. Wu. A locality-preserving cache-oblivious dynamic dictionary. In Proc. 13th Ann. ACM-SIAM Symp. on Discrete Algorithms, pages 29--39, 2002.

No context found.

M. A. Bender, Z. Duan, J. Iacono, and J. Wu. A locality-preserving cache-oblivious dynamic dictionary. In Proc. 13th Ann. ACM-SIAM Symp. on Discrete Algorithms, pages 29--39, 2002.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC