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 6 of 6 for “"MUTUAL EXCLUSION PROBLEM"”.

  1. 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)

  2. 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)

  3. Distributed stabilizing data structures

    … Algorithm SSDS to accomplish two tasks: local mutual exclusion and line sorting. We propose two uniform, self-stabilizing, deterministic protocols on oriented chains: a time and space optimal solution to the local mutual exclusion problem (Algorithm LMEC ), and a space and (asymptotic) time …

    unlv Repository record for Distributed stabilizing data structures (opens in a new tab) Download PDF for Distributed stabilizing data structures (opens in a new tab)

  4. 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)

  5. Information Infrastructures in Distributed Environments: Algorithms for Mobile Networks and Resource Allocation

    … that communicate with each other to solve some problem. Distributed systems impact almost every aspect of daily life (e.g., cellular networks and the Internet); however, it is hard to develop services on top of distributed systems due to the unreliable nature of computing entities and …

    tamu Repository record for Information Infrastructures in Distributed Environments: Algorithms for Mobile Networks and Resource Allocation (opens in a new tab)

  6. ΑΝΑΛΥΣΗ ΚΑΙ ΣΧΕΔΙΑΣΜΟΣ ΤΟΥ ΠΥΡΗΝΑ ΤΟΥ ΛΕΙΤΟΥΡΓΙΚΟΥ ΣΥΣΤΗΜΑΤΟΣ ΤΗΣ ΠΟΛΥΕΠΕΞΕΡΓΑΣΤΙΚΗΣ ΜΗΧΑΝΗΣ SIMULA

    … PROCESS EXECUTION IS DISPUTED, AND THE PROBLEM OF PARALLELIZING THE SEQUENTIAL DES ALGORITHM EMBEDDED IN HIGHER LEVEL SIMULATION LANGUAGES IS STUDIED. A GRAPH MODEL IS FIRST DEVELOPED TO REPRESENT THE PROCESS INTERFERENCE. THEN, THE DUAL PROBLEM OF MUTUALLY EXCLUDING INTERFERING …

    greece Repository record for ΑΝΑΛΥΣΗ ΚΑΙ ΣΧΕΔΙΑΣΜΟΣ ΤΟΥ ΠΥΡΗΝΑ ΤΟΥ ΛΕΙΤΟΥΡΓΙΚΟΥ ΣΥΣΤΗΜΑΤΟΣ ΤΗΣ ΠΟΛΥΕΠΕΞΕΡΓΑΣΤΙΚΗΣ ΜΗΧΑΝΗΣ SIMULA (opens in a new tab)