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 9 of 9 for “"Lock-based synchronization"”.

  1. ByteSTM: Java Software Transactional Memory at the Virtual Machine Level

    … be run sequentially is often due to the need for synchronization, the synchronization abstraction has a significant effect on program performance. Lock-based synchronization — the most widely used synchronization method — suffers from programability, scalability, and composability challenges. …

    vt Repository record for ByteSTM: Java Software Transactional Memory at the Virtual Machine Level (opens in a new tab)

  2. Improving Performance of Highly-Programmable Concurrent Applications by Leveraging Parallel Nesting and Weaker Isolation Levels

    … one another, thereby necessitating some form of synchronization to be declared. The most commonly used methodology is lock-based synchronization; although, to improve performance the most, developers must typically form complex, low-level implementations for large applications, which can easily …

    vt Repository record for Improving Performance of Highly-Programmable Concurrent Applications by Leveraging Parallel Nesting and Weaker Isolation Levels (opens in a new tab)

  3. Mechanisms for Unbounded, Conflict-Robust Hardware Transactional Memory

    Conventional lock implementations serialize access to critical sections guarded by the same lock, presenting programmers with a difficult tradeoff between granularity of synchronization and amount of parallelism realized. Recently, researchers have been investigating an emerging synchronization …

    penn Repository record for Mechanisms for Unbounded, Conflict-Robust Hardware Transactional Memory (opens in a new tab)

  4. Scheduling in Transactional Memory Systems: Models, Algorithms, and Evaluations

    Transactional memory provides an alternative synchronization mechanism that removes many limitations of traditional lock-based synchronization so that concurrent program writing is easier than lock-based code in modern multicore architectures. The fundamental module in a transactional memory system …

    lsu-thes Repository record for Scheduling in Transactional Memory Systems: Models, Algorithms, and Evaluations (opens in a new tab)

  5. Overlay Architectures for FPGA-Based Software Packet Processing

    … single thread of computation with coarse-grained synchronization around shared data structures. Comparing with multithreaded processors using lock-based synchronization, we measure up to 57\% additional throughput with the use of transactional-memory-based synchronization. Given our applications, …

    toronto-retro Repository record for Overlay Architectures for FPGA-Based Software Packet Processing (opens in a new tab)

  6. The System-on-a-Chip Lock Cache

    In this dissertation, we implement efficient lock-based synchronization by a novel, high performance, simple and scalable hardware technique and associated software for a target shared-memory multiprocessor System-on-a-Chip (SoC). The custom hardware part of our solution is provided in the form of …

    gatech Repository record for The System-on-a-Chip Lock Cache (opens in a new tab)

  7. Utility Accrual Real-Time Scheduling and Synchronization on Single and Multiprocessors: Models, Algorithms, and Tradeoffs

    … a class of utility accrual scheduling and synchronization algorithms for dynamic, single and multiprocessor real-time systems. Dynamic real-time systems operate in environments with run-time uncertainties including those on activity execution times and arrival behaviors. We consider the …

    vt Repository record for Utility Accrual Real-Time Scheduling and Synchronization on Single and Multiprocessors: Models, Algorithms, and Tradeoffs (opens in a new tab)

  8. On Improving Distributed Transactional Memory through Nesting, Partitioning and Ordering

    … aims to overcome the challenges of distributed-lock based synchronization. DTM employs transactions in order to guarantee consistency in a concurrent execution. When two or more transactions conflict, all but one need to be delayed or rolled back. Transactional Memory supports code composability …

    vt Repository record for On Improving Distributed Transactional Memory through Nesting, Partitioning and Ordering (opens in a new tab)

  9. Supporting Software Transactional Memory in Distributed Systems: Protocols for Cache-Coherence, Conflict Resolution and Replication

    Lock-based synchronization on multiprocessors is inherently non-scalable, non-composable, and error-prone. These problems are exacerbated in distributed systems due to an additional layer of complexity: multinode concurrency. Transactional memory (TM) is an emerging, alternative synchronization …

    vt Repository record for Supporting Software Transactional Memory in Distributed Systems: Protocols for Cache-Coherence, Conflict Resolution and Replication (opens in a new tab)