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 20 of 117 for “"Mutual Exclusion"”.

  1. Distributed mutual exclusion algorithms

    … original algorithms which solve the distributed mutual exclusion problem. Two of the three solve the problem of allowing only one site at a time into the critical section. The third solves the more difficult problem of allowing a specific number of sites (k sites) into the critical section at a …

    unlv Repository record for Distributed mutual exclusion algorithms (opens in a new tab) Download PDF for Distributed mutual exclusion algorithms (opens in a new tab)

  2. Local-spin Abortable Mutual Exclusion

    Abortable mutual exclusion is a variant of mutual exclusion, in which processes are allowed to abort in the trying protocol. Scott presented the first local-spin abortable mutual exclusion algorithms. They are based on a queue and perform O(1) remote memory accesses (RMAs) when no processes abort. …

    toronto-retro Repository record for Local-spin Abortable Mutual Exclusion (opens in a new tab)

  3. Performance evaluation of distributed mutual exclusion algorithms

    … in which concurrent processes share resources, mutual exclusion refers to the problem of guaranteeing the integrity of those resources by restricting their use to one process at a time. Due the complex nature of distributed systems, distributed mutual exclusion algorithms are often not amenable …

    unlv Repository record for Performance evaluation of distributed mutual exclusion algorithms (opens in a new tab) Download PDF for Performance evaluation of distributed mutual exclusion algorithms (opens in a new tab)

  4. Semaphore Solutions for General Mutual Exclusion Problems

    … starvation-free semaphore solutions to general mutual exclusion problems is discussed. A reduction approach is introduced for recognizing edge-solvable problems, together with an O(N^2) algorithm for graph reduction, where N is the number of nodes. An algorithm for the automatic generation of …

    unt Repository record for Semaphore Solutions for General Mutual Exclusion Problems (opens in a new tab)

  5. Asynchronous, Distributed Optical Mutual Exclusion and Applications

    … we address a fundamental computationalproblem, mutual exclusion, in the setting of optical interconnects. As a main result, wepropose an optical network and an algorithm for it to distribute a token (shared resource)mutually exclusively among a set ofnprocessing elements. Following a request, …

    lsu-thes Repository record for Asynchronous, Distributed Optical Mutual Exclusion and Applications (opens in a new tab)

  6. Group Mutual Exclusion in Linear Time and Space

    The Group Mutual Exclusion (GME) problem, introduced by Joung, is a natural extension of the classical Mutual Exclusion problem. In the classical Mutual Exclusion problem, two or more processes are not simultaneously allowed to be in their CRITICAL SECTION, a piece of code where a common resource …

    ecu Repository record for Group Mutual Exclusion in Linear Time and Space (opens in a new tab)

  7. Types for mutual exclusion in concurrent programming languages

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2023-04-12 without embargo terms

    uiuc Repository record for Types for mutual exclusion in concurrent programming languages (opens in a new tab)

  8. Recoverable Mutual Exclusion in Detectable Lock-Based Data Structures

    … on addressing the challenges of recoverable mutual exclusion (RME) and the development of detectable lock-based data structures, offering innovative solutions that enhance performance and reliability in concurrent systems. A major contribution of this work is the introduction of the …

    waterloo Repository record for Recoverable Mutual Exclusion in Detectable Lock-Based Data Structures (opens in a new tab)

  9. The Problem of Mutual Exclusion: A New Distributed Solution

    … time. This is referred to as the problem of mutual exclusion. Several synchronization mechanisms have been proposed to solve this problem. In this thesis, an effort has been made to compile most of the existing mutual exclusion solutions for both shared memory and message-passing based …

    vcu Repository record for The Problem of Mutual Exclusion: A New Distributed Solution (opens in a new tab)

  10. Performance Comparison of Randomized and Deterministic Mutual Exclusion Algorithms

    Mutual exclusion is a well known in distributed computing. Mutual exclusion comes into existence when n processes try to access the Critical Section at the same time. It prevents any two processes from accessing the Critical Section simultaneously. Mutual exclusion is a standard building block for …

    calgary Repository record for Performance Comparison of Randomized and Deterministic Mutual Exclusion Algorithms (opens in a new tab)

  11. RGLock: Recoverable Mutual Exclusion for Non-Volatile Main Memory Systems

    … Management Systems. Whereas in the context of mutual exclusion in shared memory systems, none of the prominent lock algorithms (e.g., Lamport’s Bakery algorithm, MCS lock, etc.) are designed to tolerate crash failures, especially in operations carried out in the critical sections. Each of these …

    waterloo Repository record for RGLock: Recoverable Mutual Exclusion for Non-Volatile Main Memory Systems (opens in a new tab)

  12. Logical rings in the mutual exclusion problem of distributed memory systems

    In this thesis, we investigate distributed mutual exclusion algorithms and delineate the features of a new distributed mutual exclusion algorithm. The basis of the algorithm is the logical ring structure employed in token-based mutual exclusion algorithms. Specifically, there exists dynamic …

    unlv Repository record for Logical rings in the mutual exclusion problem of distributed memory systems (opens in a new tab) Download PDF for Logical rings in the mutual exclusion problem of distributed memory systems (opens in a new tab)

  13. Local-spin Algorithms for Variants of Mutual Exclusion Using Read and Write Operations

    Mutual exclusion (ME) is used to coordinate access to shared resources by concurrent processes. We investigate several new N-process shared-memory algorithms for variants of ME, each of which uses only reads and writes, and is local-spin, i.e., has bounded remote memory reference (RMR) complexity. …

    toronto-retro Repository record for Local-spin Algorithms for Variants of Mutual Exclusion Using Read and Write Operations (opens in a new tab)

  14. Mutual Exclusion Between Salmonberry and Douglas-Fir in the Coast Range of Oregon

    One serious problem faced by the forest industry in the Pacific Northwest is poor regeneration of commercial trees on land which is harvested and subsequently dominated by brush species. In Coastal Oregon, salmonberry is one of these brush species. Detailed investigations of field sites indicate …

    portland-state Repository record for Mutual Exclusion Between Salmonberry and Douglas-Fir in the Coast Range of Oregon (opens in a new tab)

Page 1 of 6