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 17 of 17 for “"Distributed Data Structures"”.

  1. Towards Understanding Relaxations of Distributed Data Structures

    … is providing efficient means for multiple, distributed processes to operate on the same data, while guaranteeing that the results of their actions make sense and are useful. In this dissertation, we explore a method of improving the efficiency of operations on shared data. The method we …

    tamu Repository record for Towards Understanding Relaxations of Distributed Data Structures (opens in a new tab)

  2. Bipartite Double-Word Compare-and-Swap

    … demand and have applications in several complex distributed data structures [5,10]. These operations are not offered by any modern architectures, so researchers have to implement their own versions of them using the primitives that are available in hardware. In this research, we implement a …

    calgary Repository record for Bipartite Double-Word Compare-and-Swap (opens in a new tab)

  3. A Design Space for Distributed Producer-Consumer Data Structures Using RDMA

    … of applications. In this thesis, we propose flow structures as an abstraction targeting distributed applications in which data need to flow directly between producers and consumers. Flow structures are asymmetric distributed producer/consumer data structures in which some servers only produce and …

    waterloo Repository record for A Design Space for Distributed Producer-Consumer Data Structures Using RDMA (opens in a new tab)

  4. Synchronised range queries

    … Systems) framework is, implemented based on distributed shared memory architecture, a parallel and discrete event simulation kernel to distribute and run parallel simulation of Multi-Agent Systems (MAS). There are several issues within such system and this thesis presents a notion of logical …

    birmingham Download PDF for Synchronised range queries (opens in a new tab)

  5. Serializability and Heterogeneous Trust from Two Phase Commit to Blockchains

    As distributed systems become more federated and cross-domain, we are forced to rethink some of our core abstractions. We need heterogeneous systems with rigorous consistency and self-authentication guarantees, despite a complex landscape of security and failure tolerance assumptions. I have …

    cornell Repository record for Serializability and Heterogeneous Trust from Two Phase Commit to Blockchains (opens in a new tab)

  6. Harnessing spatiotemporal data characteristics to facilitate large-scale analytics over voluminous, high-dimensional observational datasets

    Spatiotemporal data volumes have increased exponentially alongside a need to extract knowledge from them. We propose a methodology, encompassing a suite of algorithmic and systems innovations, to accomplish spatiotemporal data analysis at scale. Our methodology partitions and distributes data to …

    colostate Repository record for Harnessing spatiotemporal data characteristics to facilitate large-scale analytics over voluminous, high-dimensional observational datasets (opens in a new tab)

  7. The STAPL Parallel Container Framework

    … provides a run-time system, a collection of distributed data structures (pContainers) and parallel algorithms (pAlgorithms), and a generic methodology for extending them to provide customized functionality. Parallel containers are data structures addressing issues related to data …

    tamu Repository record for The STAPL Parallel Container Framework (opens in a new tab)

  8. Bounded Asynchrony and Nested Parallelism for Scalable Graph Processing

    … Because of this, there exists a clear need for distributed data structures and parallel algorithms to facilitate the processing of these large graphs. Graph traversals – wherein a computation proceeds from one vertex to another along the edges of a graph – are an important type of algorithm, as …

    tamu Repository record for Bounded Asynchrony and Nested Parallelism for Scalable Graph Processing (opens in a new tab)

  9. Large Scale Data Analysis in Parallel R and Its Use in Efficiently Scheduling Batch Jobs in the Cloud

    Large-scale data management and deep data analysis are increasingly important for both enterprise and scientific applications. Statistical languages provide rich functionality and ease of use for data analysis and modeling and have large user bases. R is among the most widely used of these …

    purdue-thes Repository record for Large Scale Data Analysis in Parallel R and Its Use in Efficiently Scheduling Batch Jobs in the Cloud (opens in a new tab)

  10. Multi-writer consistency conditions for shared memory objects

    Regularity is a shared memory consistency condition that has received considerable attention, notably in connection with quorum-based shared memory. Lamport's original definition of regularity assumed a single-writer model, however, and is not well defined when each shared variable may have …

    tamu Repository record for Multi-writer consistency conditions for shared memory objects (opens in a new tab)

  11. Application of Parallel Programming to Utchem Simulator on Massively Parallel Computers and a Cluster of Workstations

    … This work describes the application of distributed-memory parallel programming techniques to a compositional simulator called UTCHEM. The University of Texas Chemical Flooding Reservoir Simulator (UTCHEM) is a general-purpose highly vectorized chemical flooding simulator that models the …

    texas Repository record for Application of Parallel Programming to Utchem Simulator on Massively Parallel Computers and a Cluster of Workstations (opens in a new tab) Restricted access

  12. The STAPL pList

    … for parallelism. stapl provides a collection of distributed data structures (pContainers) and parallel algorithms (pAlgorithms) and a generic methodology for extending them to provide customized functionality. stapl pContainers are thread-safe, concurrent objects, providing appropriate interfaces …

    tamu Repository record for The STAPL pList (opens in a new tab)

  13. Parallel and scalable combinatorial string algorithms on distributed memory systems

    … for processing and analyzing DNA and genomic data are built upon combinatorial graph and string algorithms. The advent of high-throughput DNA sequencing is enabling the generation of billions of reads per experiment. Classical and sequential algorithms can no longer deal with these growing …

    gatech Repository record for Parallel and scalable combinatorial string algorithms on distributed memory systems (opens in a new tab)

  14. High-performance parallel systems for data-intensive computing

    Applications in data science rely on two computing paradigms: tuned high performance parallel programs and data analytics. While historically their differences were good reason to separate the paradigms into different systems, recent changes in hardware and, as a result, fast data processing …

    washington Repository record for High-performance parallel systems for data-intensive computing (opens in a new tab)

  15. New consistency orchestrators for emerging distributed systems

    … are gradually becoming more dependent on various distributed systems, e.g., smart home management systems, bank management, traffic monitoring, etc. Some run on data-centers while others run on edge devices, e.g., smart home applications. In all these environments, efficiently maintaining …

    uiuc Repository record for New consistency orchestrators for emerging distributed systems (opens in a new tab)

  16. On Partial Aborts and Reducing Validation Costs in Fault-tolerant Distributed Transactional Memory

    Distributed Transactional Memory (DTM) is an emerging synchronization abstraction thatpromises to alleviate the scalability, programmability, and composability challenges of lock-based distributed synchronization. With DTM, programmers organize code that read/writeshared memory objects, both local …

    vt Repository record for On Partial Aborts and Reducing Validation Costs in Fault-tolerant Distributed Transactional Memory (opens in a new tab)