Notes - MIECT
Computação Distribuída
Notes - MIECT
Computação Distribuída
  • Computação Distribuída
  • Introduction / Architecture
    • Distributed Systems
    • Architecture
    • Middleware Organizations
    • Processes
    • Threads
    • Virtualization
    • Clients
    • Servers
    • Migration
  • Communications
    • OSI Model
    • Middleware Layer
    • Types of Communication
    • Remote Call Procedure (RPC)
    • Sockets
    • Application-level Multicasting
  • Naming
    • Names
    • Addresses
    • Identifiers
    • Naming Systems
      • Flat Naming
      • Structured Naming
    • Internet Domain Name System (DNS)
    • Attribute-based naming - LDAP
  • Coordination
    • Clocks
      • Synchronizing without UTC
    • Reference Broadcast Synchronization – RBS
    • Happened-Before Relation
      • Logical Clocks
      • Vector Clocks
    • Mutual Exclusion Algorithms
    • Election Algorithms
    • Distributed Events Correspondance
  • Consistency & Replication
    • Replication
    • Performance and Scalability
    • Client-centric models
    • Replicates
    • Unicasting vs. Multicasting
    • Continuous Consistency
    • Protocols
  • Flaw Tolerance
    • Dependability
    • Terminology
    • Confidence vs. Security
    • Halting failures
    • Redundancy to mask failures
    • Consensus
      • Realistic
      • Consensus in arbitrary failures
      • Achieving failure tolerance
      • Distributed consensus
    • Failure Detection
    • Reliable RPCs
    • Distributed commit protocols
  • Python asyncio & Friends
    • Async
    • Sync vs. Async
    • Tools
  • Flask
    • Introduction
    • Python Requests
  • Containers
    • VM's vs Containers
    • OS Support
    • Building a container
    • Tools
    • Portability
    • Docker
      • Container
  • Map Reduce
    • Map Recude
    • Hadoop
    • Software Architecture
    • Task Scheduling
    • Comparison With Traditional Models
  • Cloud Computing
    • Cloud Computing
    • IaaS – Infrastructure as a Service
    • PaaS – Platform as a Service
    • SaaS – Software as a Service
    • Business Models
Powered by GitBook
On this page
  1. Coordination
  2. Happened-Before Relation

Vector Clocks

PreviousLogical ClocksNextMutual Exclusion Algorithms

Last updated 2 years ago

The Lamport clock does not ensure that if C(a) < C(b) it will be a cause-effect of a over b (a -> b).

Event a: m1 is received at T=16.

Event b: m2 is sent at T=20.

Therefore we cannot conclude that a causes b.

Before it executes an event Pi it executes VCi[i] = VCi[i] + 1

When the process Pi sends the message m to Pj, it places in the timestamp ts(m) the value VCi right after the execution of the previous step.

After receiving the message m, Pj saves for each k the VCj[k] = max(VCj[k], ts(m)[k]), executes the initial step, and then delivers it to the application.

It is necessary to ensure that m is only delivered after all casuistic messages have been delivered.

Pi increments VCi[i] only when it sends a message, and Pj adjusts VCj when receiving a message.

  • ts(m)[i] = VCj[i] + 1

  • ts(m)[k] <- VCj[k] for every k != i