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 3 of 3 for “"Disjoint-access parallelism"”.

  1. Techniques for enhancing parallelism in mechanisms that automatically execute sequential code in concurrent environments

    … (STM) employs transactionsto avoid conflicting accesses to common data (known as data items or transactional variables).A transaction may either commit, in which case it appears as if it has been executedat a single point in time, or abort, in which case it appears as if it is never executed. …

    greece Repository record for Techniques for enhancing parallelism in mechanisms that automatically execute sequential code in concurrent environments (opens in a new tab)

  2. High performance sequential and lock-free parallel access priority queue structures

    … performance sequential and lock-free parallel access priority queues. The choice of a high speed priority queue structure plays an integral role in numerous applications, particularly for sizeable scenarios such as large-scale discrete event simulations. The conventional priority queues fall …

    nus Repository record for High performance sequential and lock-free parallel access priority queue structures (opens in a new tab) Download file for High performance sequential and lock-free parallel access priority queue structures (opens in a new tab)

  3. Extending Relativistic Programming to Multiple Writers

    … Coarse grain locking allows multiple threads to access common data safely, but not at the same time. Non-Blocking Synchronization and Transactional Memory techniques optimistically allow concurrency, but only for disjoint accesses and only at a high performance cost. Relativistic programming is a …

    portland-state Repository record for Extending Relativistic Programming to Multiple Writers (opens in a new tab)