Scribd
Upload
66 views9 pages

2 Model of Distributed Computation

This document provides an overview of distributed computing models. It discusses how a distributed system consists of multiple processors that communicate asynchronously through message passing without a global clock or shared memory. It introduces concepts like causal precedence relations and different models of communication networks, including FIFO, non-FIFO, and causal ordering models. It also discusses how events in a distributed system can be modeled using space-time diagrams and explores requirements for causally ordered message delivery.

Uploaded by

Jyothish Songh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
66 views9 pages

2 Model of Distributed Computation

This document provides an overview of distributed computing models. It discusses how a distributed system consists of multiple processors that communicate asynchronously through message passing without a global clock or shared memory. It introduces concepts like causal precedence relations and different models of communication networks, including FIFO, non-FIFO, and causal ordering models. It also discusses how events in a distributed system can be modeled using space-time diagrams and explores requirements for causally ordered message delivery.

Uploaded by

Jyothish Songh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 9

Distributed Computing

A Model of Distributed Computations


Dr. Barsha Mitra
BITS Pilani CSIS Dept, BITS Pilani, Hyderabad Campus
Hyderabad Campus
Preliminaries
•distributed system consists of a set of processors
•connected by a communication network
•communication delay is finite but unpredictable
•processors do not share a common global memory
•asynchronous message passing
•no common physical global clock
•communication medium may deliver messages out of order

Course ID: SS ZG526, Title: Distributed Computing 2 BITS Pilani, Hyderabad Campus
A Distributed Program
•Cij : channel from process pi to process pj
•mij: message sent by pi to pj
•Events –
•Internal Events
•Message Send Events
•Message Receive Events

Course ID: SS ZG526, Title: Distributed Computing 3 BITS Pilani, Hyderabad Campus
Space-Time Diagram

Course ID: SS ZG526, Title: Distributed Computing 4 BITS Pilani, Hyderabad Campus
A Model of Distributed Executions
Causal Precedence/Dependency or Happens Before Relation
•ei → ej
•path

Course ID: SS ZG526, Title: Distributed Computing 5 BITS Pilani, Hyderabad Campus
Models of Communication Networks
• FIFO model:
• each channel acts as a first-in first-out message queue
• message ordering is preserved by channel

• Non-FIFO model
• channel acts like a set
• sender process adds messages to channel
• receiver process removes messages from it

Course ID: SS ZG526, Title: Distributed Computing 6 BITS Pilani, Hyderabad Campus
Models of Communication Networks
•Causal ordering model is based on Lamport’s “happens before”
relation
•A system supporting causal ordering model satisfies :
CO: for mij and mkj , if send(mij ) → send(mkj ),
then rec(mij ) → rec(mkj )
•Causally ordered delivery of messages implies FIFO message delivery
•CO ⊂ FIFO ⊂ Non-FIFO

Course ID: SS ZG526, Title: Distributed Computing 7 BITS Pilani, Hyderabad Campus
Reference

• Ajay D. Kshemkalyani, and Mukesh Singhal, Chapter 2, “Distributed


Computing: Principles, Algorithms, and Systems”, Cambridge
University Press, 2008.

Course ID: SS ZG526, Title: Distributed Computing 8 BITS Pilani, Hyderabad Campus
Thank You

Course ID: SS ZG526, Title: Distributed Computing 9 BITS Pilani, Hyderabad Campus

You might also like