Distributed Computing

BITS Pilani Pravin Y Pawar

Pilani Campus
 BITS Pilani
Pilani Campus

DSECL ZG522, Big Data Systems

Lecture No. 2.0
 Session 2

• Parallel and Distributed Processing: Motivation

(Size of data and complexity of processing);
Storing data in parallel and distributed systems:
Shared Memory vs. Message Passing; Strategies
for data access: Partition, Replication, and
Messaging.

3
 Traditional Computing

Von Neumann architecture: instructions are sent from

memory to the CPU

Serial execution: Instructions are executed one after another

on a single Central Processing Unit (CPU)

Advantages :

simplifies the microcontroller chip design because only one

memory is accessed

Disadvantages:

• More expensive to produce the result

•More expensive to run
•Bus speed limitation
 Distributed Computing

1. What is a Distributed System

2. Examples of Distributed Systems
3. Common Characteristics
4. Basic Design Issues
5. Summary

5
1. What is a Distributed System?

6
7
8
9
• size scalability,
• geographical scalability,
administrative scalability.
10
Openess in Distributed Systems

• An example of a web service standard is SOAP, which

stands for Simple Object Access Protocol.
• SOAP “is a messaging protocol specification for exchanging
structured information in the implementation of web services
in computer networks.
11
13
14
15