Results 1 
6 of
6
Project proposal: A meldable, iteratorvalid priority queue, CPH
, 2005
"... Abstract. The Standard Template Library (STL) is a library of generic algorithms and data structures that has been incorporated in the C++ standard and ships with all modern C++ compilers. In the CPH STL project the goal is to implement an enhanced edition of the STL. The priorityqueue class of the ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. The Standard Template Library (STL) is a library of generic algorithms and data structures that has been incorporated in the C++ standard and ships with all modern C++ compilers. In the CPH STL project the goal is to implement an enhanced edition of the STL. The priorityqueue class of the STL is just an adapter that makes any resizable array to a queue in which the elements stored are arranged according to a given ordering function. In the C++ standard no compulsory support for the operations delete(), increase(), or meld() is demanded even if those are utilized in many algorithms solving graphtheoretic or geometric problems. In this project, the goal is to implement a CPH STL extension of the priorityqueue class which provides, in addition to the normal priorityqueue functionality, the operations delete(), increase(), and meld(). To make the first two of these operations possible, the class must also guarantee that external references to compartments inside the data structure are kept valid at all times.
Cache Performance of Indexing Data Structures
, 1999
"... The speed of computer processors is growing rapidly in comparison to the speed of DRAM chips. The cost of a cache miss, measured in processor clock cycles, is increasing exponentially, and this is quickly becoming a bottleneck for indexing in main memory. We study several indexing data structures on ..."
Abstract
 Add to MetaCart
The speed of computer processors is growing rapidly in comparison to the speed of DRAM chips. The cost of a cache miss, measured in processor clock cycles, is increasing exponentially, and this is quickly becoming a bottleneck for indexing in main memory. We study several indexing data structures on a simulated architecture and show that the relative performance of cacheconscious indexing structures is increasing with memory latency. In addition, we show that topdown algorithms for maintaining these structures reduce the total instruction count, leading to a modest improvement in execution time over the corresponding bottomup algorithms.
Cache Performance of Indexing Data Structures
"... The speed of computer processors is growing rapidly in comparison to the speed of DRAM chips. The cost of a cache miss, measured in processor clock cycles, is increasing exponentially, and this is quickly becoming a bottleneck for indexing in main memory. We study several indexing data structur ..."
Abstract
 Add to MetaCart
The speed of computer processors is growing rapidly in comparison to the speed of DRAM chips. The cost of a cache miss, measured in processor clock cycles, is increasing exponentially, and this is quickly becoming a bottleneck for indexing in main memory. We study several indexing data structures on a simulated architecture and show that the relative performance of cacheconscious indexing structures is increasing with memory latency. In addition, we show that topdown algorithms for maintaining these structures reduce the total instruction count, leading to a modest improvement in execution time over the corresponding bottomup algorithms. 1. Introduction Note: All figures and tables appear at the end of this document due to a formatting problem. The speed of computer processors is growing rapidly in comparison to the speed of DRAM chips. The processor clock cycle has been decreasing at a rate of roughly 70% every year, while the cycle time of common DRAM chips is decrea...
Correspondence Based Data Structures for Double Ended Priority Queues
"... this paper is to demonstrate the generality of two techniques used in [6] to develop an MDEPQ representation from an MPQ representation  height biased leftist trees. These methods  total correspondence and leaf correspondence  may be used to arrive at efficient DEPQ and MDEPQ data structures from ..."
Abstract
 Add to MetaCart
this paper is to demonstrate the generality of two techniques used in [6] to develop an MDEPQ representation from an MPQ representation  height biased leftist trees. These methods  total correspondence and leaf correspondence  may be used to arrive at efficient DEPQ and MDEPQ data structures from PQ and MPQ data structures such as the pairing heap [8; 18], Binomial and Fibonacci heaps [9], and Brodal's FMPQ [2] which also provide efficient support for the operation: Delete(Q,p): delete and return the element located at p We begin, in Section 2, by reviewing a rather straightforward way, dual priority queues, to obtain a (M)DEPQ structure from a (M)PQ structure. This method [2; 6] simply puts each element into both a minPQ and a maxPQ. In Section 3, we describe the total correspondence method and in Section 4, we describe leaf correspondence. Both sections provide examples of PQs and MPQs and the resulting DEPQs and MDEPQs. Section 5 gives complexity results. In Section 6, we provide the result of experiments that compare the performance of the MDEPQs based on height biased leftist tree [7], pairing heaps [8; 18], and FMPQs [2]. For reference purpose, we also provide run times for the splay tree data structure [16]. Although splay trees were not specifically designed to represent DEPQs, it is easy min Heap max Heap Fig. 1. Dual heap structure to use them for this purpose. Note that splay trees do not provide efficient support for the Meld operation
Data Structures with Unpredictable Timing
"... Abstract. A range of attacks on network components, such as algorithmic denialofservice attacks and cryptanalysis via timing attacks, are enabled by data structures for which an adversary can predict the durations of operations that he will induce on the data structure. In this paper we introduce ..."
Abstract
 Add to MetaCart
Abstract. A range of attacks on network components, such as algorithmic denialofservice attacks and cryptanalysis via timing attacks, are enabled by data structures for which an adversary can predict the durations of operations that he will induce on the data structure. In this paper we introduce the problem of designing data structures that confound an adversary attempting to predict the timing of future operations he induces, even if he has adaptive and exclusive access to the data structure and the timings of past operations. We also design a data structure for implementing a set (supporting membership query, insertion, and deletion) that exhibits timing unpredictability and that retains its efficiency despite adversarial attacks. To demonstrate these advantages, we develop a framework by which an adversary tracks a probability distribution on the data structure’s state based on the timings it emitted, and infers invocations to meet his attack goals. 1
Skip Lifts: A Probabilistic Alternative to RedBlack Trees
"... Abstract. We present the Skip lifts, a randomized dictionary data structure inspired from the skip list [Pugh ’90, Comm. of the ACM]. Similarly to the skip list, the skip lifts has the finger search property: Given a pointer to an arbitrary element f, searching for an element x takes expected O(log ..."
Abstract
 Add to MetaCart
Abstract. We present the Skip lifts, a randomized dictionary data structure inspired from the skip list [Pugh ’90, Comm. of the ACM]. Similarly to the skip list, the skip lifts has the finger search property: Given a pointer to an arbitrary element f, searching for an element x takes expected O(log δ) time where δ is the rank distance between the elements x and f. The skip lifts uses nodes of O(1) worstcase size and it is one of the few efficient dictionary data structures that performs an O(1) worstcase number of structural changes during an update operation. Given a pointer to the element to be removed from the skip lifts the deletion operation takes O(1) worstcase time. 1