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 “"Concurrent Data Structure"”.

  1. Μεθοδολογία παραμετροποίησης εφαρμογών βασισμένων σε ταυτόχρονες δομές δεδομένων για ενσωματωμένα συστήματα

    … and they often execute applications that rely on concurrent data structures. The selection of an efficient concurrent data structure implementation is a difficult and time consuming task. Selecting a non-efficient implementation usually has negative impact on various embedded system metrics such …

    greece Repository record for Μεθοδολογία παραμετροποίησης εφαρμογών βασισμένων σε ταυτόχρονες δομές δεδομένων για ενσωματωμένα συστήματα (opens in a new tab)

  2. A Concurrent List with Adaptive Bounds

    Few concurrent data structures adapt dynamically to access patterns, and those that do lack formal performance guarantees. This thesis introduces the first self-adjusting concurrent data structure with an adaptive bound analogous to those of optimal self-adjusting sequential structures. We present …

    york Repository record for A Concurrent List with Adaptive Bounds (opens in a new tab)

  3. Verifying a Quantitative Relaxation of Linearizability via Refinement

    Concurrent data structures have found increasingly widespread use in both multicore and distributed computing environments, thereby escalating the priority for verifying their correctness. The thread safe behavior of these concurrent objects is often described using formal semantics known as …

    vt Repository record for Verifying a Quantitative Relaxation of Linearizability via Refinement (opens in a new tab)

  4. A HIERARCHICAL SYSTEM VIEW AND ITS USE IN THE DATA DISTRIBUTION OF COMPOSED CONTAINERS IN STAPL

    In parallel programming, a concurrent container usually distributes its elements to all processing units (locations) equally to maximize the processing ability. However, this distribution strategy does not perform well when we apply nested parallel func- tions on a composed concurrent container, …

    tamu Repository record for A HIERARCHICAL SYSTEM VIEW AND ITS USE IN THE DATA DISTRIBUTION OF COMPOSED CONTAINERS IN STAPL (opens in a new tab)

  5. Correctness and Progress Verification of Non-Blocking Programs

    … about safety and liveness properties in a concurrent environment has led to the development of tools to verify that a concurrent data structure meets a correctness condition or progress guarantee. However, these tools possess shortcomings regarding the ability to verify a composition of …

    ucf Repository record for Correctness and Progress Verification of Non-Blocking Programs (opens in a new tab)

  6. Runtime Verification and Debugging of Concurrent Software

    … and other parallel hardware keeps increasing, concurrent software that exploit these parallel computing hardware become crucial for achieving high performance. However, developing correct and efficient concurrent software is a difficult task for programmers due to the inherent nondeterminism in …

    vt Repository record for Runtime Verification and Debugging of Concurrent Software (opens in a new tab)

  7. High-Performance Composable Transactional Data Structures

    … change in the way we design and use fundamental data structures. Concurrent data structures allow scalable and thread-safe accesses to shared data. They provide operations that appear to take effect atomically when invoked individually. A main obstacle to the practical use of concurrent data …

    ucf Repository record for High-Performance Composable Transactional Data Structures (opens in a new tab)