Scribd Logo
Upload

Welcome to Scribd!

  • Dcs

    Uploaded by

    irapurple03
    5 views1 page
    This document describes a hierarchical communication structure for distributed mutual exclusion across 4 data centers. Each data center has a unique coordinator node. Communication between data centers uses Ricart & Agrawala's algorithm. Within each data center, the coordinator performs centralized mutual exclusion. It then asks why this structure safely implements mutual exclusion both between and within data centers when assuming no node failures.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document describes a hierarchical communication structure for distributed mutual exclusion across 4 data centers. Each data center has a unique coordinator node. Communication between data centers uses Ricart & Agrawala's algorithm. Within each data center, the coordinator performs centralized mutual exclusion. It then asks why this structure safely implements mutual exclusion both between and within data centers when assuming no node failures.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    5 views1 page

    Dcs

    Uploaded by

    irapurple03
    This document describes a hierarchical communication structure for distributed mutual exclusion across 4 data centers. Each data center has a unique coordinator node. Communication between data centers uses Ricart & Agrawala's algorithm. Within each data center, the coordinator performs centralized mutual exclusion. It then asks why this structure safely implements mutual exclusion both between and within data centers when assuming no node failures.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 1

    exercise DC

    DC

    DC DC

    Assume we have 4 data center Singapore, Japan, US, UK. This hierarchical of communication in distributed mutual
    exclusion as below:

    1. Each data center has a unique coordinator node


    2. Communication between data center uses Ricart & Agrawala’s algorithm
    3. Within data center, the coordinator performs centralized mutual exclusion

    4. Question
    5. Why in difference data center safely implement ME (assume no failures node)
    6. Why in within data center safely implement ME (assume no failures node)

    You might also like