Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 7 of 7 for “"persistent data structures"”.

  1. Detectable Data Structures for Persistent Memory

    Persistent memory is a byte-addressable and durable storage medium that provides both performance benefits of main memory and durability of secondary storage. It is possible for a data structure to recover near-instantly after a system failure by accessing recovery data directly in persistent …

    waterloo Repository record for Detectable Data Structures for Persistent Memory (opens in a new tab)

  2. Novel approaches for constructing persistent Delaunay triangulations by applying different equations and different methods

    “Delaunay triangulation and data structures are an essential field of study and research in computer science, for this reason, the correct choices, and an adequate design are essential for the development of algorithms for the efficient storage and/or retrieval of information. However, most …

    must-thes Repository record for Novel approaches for constructing persistent Delaunay triangulations by applying different equations and different methods (opens in a new tab)

  3. Scalable and Productive Data Management for High-Performance Analytics

    Advancements in data acquisition technologies across different domains, from genome sequencing to satellite and telescope imaging to large-scale physics simulations, are leading to an exponential growth in dataset sizes. Extracting knowledge from this wealth of data enables scientific discoveries …

    vt Repository record for Scalable and Productive Data Management for High-Performance Analytics (opens in a new tab)

  4. EA-PHT-HPR: Designing Scalable Data Structures for Persistent Memory

    … In 2019, Intel released to the public the Optane data center persistent memory modules (DCPMM). These devices offer the capacity and persistence of block devices while providing the byte addressability and low latency of DRAM devices. The introduction of this technology now allows programmers to …

    waterloo Repository record for EA-PHT-HPR: Designing Scalable Data Structures for Persistent Memory (opens in a new tab)

  5. ADDING PERSISTENCE TO MAIN MEMORY PROGRAMMING

    Unlocking the true potential of the new persistent memories (PMEMs) requires eliminating traditional persistent I/O abstractions altogether, by introducing persistent semantics directly into main memory programming. Such a programming model elevates failure atomicity to a first-class application …

    gatech Repository record for ADDING PERSISTENCE TO MAIN MEMORY PROGRAMMING (opens in a new tab)

  6. Programming languages and tools with multiparty session

    … channels or need to store channels in shared data structures. We introduce a new and more flexible session type system, which allows channel references to be shared and stored in persistent data structures. We prove that the resulting language satisfies type safety, and we illustrate our type …

    glasgow Repository record for Programming languages and tools with multiparty session (opens in a new tab) Download PDF for Programming languages and tools with multiparty session (opens in a new tab)

  7. Towards Fast, Safe and Persistent Concurrent Data Structures for Non-experts

    … of designing and implementing correct concurrent data structures is non-trivial and often error-prone. The recent commercial availability of non-volatile memory has prompted many researchers to also consider designing concurrent data structures that allow recovery following a power failure. These …

    waterloo Repository record for Towards Fast, Safe and Persistent Concurrent Data Structures for Non-experts (opens in a new tab)