CS8791- Cloud Computing

Topic: Underlying Principles of Parllel and Distributed Computing

By

M.Gomathy Nayagam
Assistant Professor(SG)/CSE

Ramco Institute of Technology

Rajapalayam
 Reference

Morgan Kauffman, USA McGraw Hill, India

 Content
Eras of Computing
Parallel Vs Distributed Computing
Elements of Parallel Computing
Elements of Distributed Computing
Technologies for Distributed Computing
 Objective
After completing this topic you should be able to

Over view &

 Mile Stones of Technologies
Understand Eras of Computing and Computing platforms and technologies

Understand principles of Parallel and Distributed Computing

Elements of Parallel Computing

Hardware Architectural Styles for Processing

Shared Vs Distributed MIMD model

Approaches to Parallel Computing Model

Levels of Parallelism

Components of Distributed System

Architectural Styles for Distributed Computing

Models for Inter-Process Communication

Technologies for Distributed Computing

Service Oriented Computing

SOA – Web Services

 Quiz I
https://www.menti.com/848hxskb1b
14 23 1 
 Quiz I - Answer
Mosaic
 Introduction
Cloud Computing is new technological Trends
Main aim: to better utilization of IT Infrastructures, services and applications.
It is a pay-as-you go model.
IT assets are owned and maintined by service providers.
No need to owned any infrastucture by consumers/customers.
Three Major milestones have led to Cloud Computing Evolution are:
 Mainframes
 Large Computational Facilities leverging multiple processing Units.
 Not considered as distributed systems
 It offers large computational power by using multiple processor.
 Clusters
 It is an alternative technological advancement of Maniframe and super computers.
 Grid
 Cloud Computing
 Mile Stones to Cloud computing Evolution
2010: Microsoft
1970: DARPA’s TCP/IP 1999: Grid Computing Azure

1984: IEEE 802.3 1997: IEEE 2008: Google

Ethernet & LAN 802.11 (Wi-Fi) AppEngine
1966: Flynn’s Taxonomy
SISD, SIMD, MISD, MIMD 1989: TCP/IP
2007: Manjrasoft Aneka
IETF RFC 1122
1969: ARPANET
1984: DEC’s 2005: Amazon
1951: UNIVAC I, VMScluster AWS (EC2, S3)
First Mainframe
1975: Xerox
PARC 2004: Web 2.0
Clouds Invented 1990: Lee-Calliau
Ethernet WWW, HTTP, HTML
1960: Cray’s First
Grids Supercomputer

Clusters

Mainframes

1950 1960 1970 1980 1990 2000 2010

 Eras of Computing
 Two fundamental and dominant models of
Architectures
computing are sequential and parallel.
Sequential Era Compilers
 The sequential era began in the 1940s
Applications
 Parallel and Distributed computing era followed it within a
Problem Solving
decade. Environments
 Four key elements of computing developed during
Architectures
three eras are Compilers
 Architecture Parallel Era Applications

 Compilers Problem Solving

Environments
 Applications
 Problem solving environments 1940195019601970198019902000201020202030
 The computing era started with development in
hardware architectures.
 It enables the creation of system software
 Particularly in the area of compilers and operating
systems
 It supports the management of such systems and the
development of applications.
 Quiz II
https://www.menti.com/3z57puo1mj
53 53 65
 Quiz II- Answer
Cluster Computing
Parallel Vs Distributed Computing
interchageably
Term Parallel Computeing  Distributed Computing
Even though they mean slightly different things.
The term parallel implies a tightly coupled system
Distributed systems refers to a wider class of system, including those
that are tightly coupled.
Parallel Computing:
More precisely, the term parallel computing refers to a model in which the
computation is divided among several processors sharing the same
memory.
The architecture of parallel computing system is often characterized by the
homogeneity of components:
Homogenity- Each processor is of the same type and it has the same
capability as the others.
Parallel Vs Distributed Computing
Shared Memory:
It has single address space
It is accessible to all the processors.
What’s the Parallel Program is going to do?
It broken down the several units of execution
It can be allocated to different processor
It can communicate with each others by means of shared
memory.
So, parallel processing architecture considered that feature
as multiple processor sharing the same physical memeory.
These are considered as single computer.
Parallel Vs Distributed Computing
Over the time period the restriction of parallel
computing have been relaxed.
Today, all the architecture that are based on the concept
of shared memory.
It may be created with the support of libraries/secific
hardware/ highly effcient network infrasturcture/
physically present.
Example:
Custer of nodes are connected through Inifiniand
Network and configured with distributed shared memory
system can be considered as a parallel system.
Parallel Vs Distributed Computing
Distributed Computing
It encompasses any architecture or systems.
It allows the computation to be broken down into units and executed
concurrently on different computing elements.
These prcessor or computing elements on different nodes, processor on
the same node/computer or core within same processor.
Distributed computing includes a wider range of system and application
rather than Parallel Computing.
It implies that the location of computing elements are not the same.
Also,it might be hetergenous in terms of hardware and software features.
Classic examples of Distributed Computing are:
 Computational Girds
 Internet Computing Sysgtems.
Parallel Vs Distributed Computing

• Ten men pulling on a

rope to lift a load, that is
parallel computing.

•Ten men have ten ropes and

are lifting ten different loads
from one place to consolidate
at another place
 Elements of Parallel Computing
Silicon-based processor chips are reaching their physical limits.
It’s processing speed is constrined by:
 Speed of light
 Density of Transistors packaged in a processor
 It is constrianed by thermodynamics limitation

Viable solution to overcome this limitation is:

 Connect multiple prcessor workin in coordination with each others
to solve “Grand Challenge” Problem.
First step to solve this as:
 To the development of Parallel computing, it encopasses
techniques, architectures , and system for perfroming multiple
activities in parallel.
 Elements of Parallel Computing
What is Parallel Processing?
Processing of multiple tasks simultaneously on
multiple processors.
It consists of multiple active processes ( tasks)
simultaneously solving a given problem.
A divide-and-conquer technique is used to divide
the given task into multiple subtasks.
Programming on multi processor system using the
divide-and-conquer technique is called parallel
programming.
 Elements of parallel Computing
Today, Many applications require more computing
power.
Parallel Processing provides a cost effective
solution to this problem.
By increasing the number of CPU in computer
Adding an efficient Communication System between
them.
Here, workload can then be shared between
different processor.
It yeilds higher computing power and perfromance
than a single processor system.
 Elements of Parallel Computing
Parallel Processing influencing factors
The development of parallel processing is being
influenced by many factors.
Prominent among them are:
Computational requirements are ever increasing in the
areas of both scientific and business computing. The
technical computing problems, which require high-speed
computational power, are related to
 life sciences, aerospace, geographical information systems,
mechanical design and analysis etc.
Elements of Parallel Computing
Sequential architectures are reaching mechanical
physical limitations as they are constrained by the speed
of light and thermodynamics laws.
 The speed which sequential CPUs can operated is reaching
saturation point ( no more vertical growth), and hence an
alternative way to get high computation speed is to connect
multiple CPUs ( opportunity for horizontal growth).
Hardware improvements in pipelining , super scalar, and
the like are non scalable and require sophisticated
compiler technology.
 Developing such compiler technology is a difficult task.
Elements of Parallel Computing
Vector processing works well for certain kinds of
problems. It is suitable mostly for scientific problems
( involving lots of matrix operations) and graphical
processing.
 It is not useful for other areas, such as databases.
The technology of parallel processing is mature and can
be exploited commercially
 here is already significant R&D work on development tools and
environments
Significant development in networking technology is
paving the way for
 heterogeneous computing.
 Quiz III
https://www.menti.com/y3ah7g4npa
21 38 94 
Time Limit-20 Seconds
 Quiz III-Answer
All
Elements of Parallel Computing
Hardware Architectures for Parallel Processing
Core elements of parallel processing are CPU.
Computing systems are classified based on number of
instructions and data stream that can be processed
simultaneously. (Flynns Taxonomy)
Four Categories:
Single-Insturction,Single- Data (SISD) systems
Single-Instruction, Multiple-Data (SIMD) systems
Multiple-Insturction, Single-Data (MISD) systems
Multiple-Instruction, Multiple- Data (MIMD) systems
 Elements of Parallel Computing
Single – Instruction , Single Data (SISD) systems
It is a uni-processor machine
It capable of executing a single instruction.
Instruction
Instruction
It operates on a single data stream.
Stream
Stream
Machine instructions are processed sequentially.
Hence, this model are popularly called as
sequential computer.
Data
Data Data
Data
Most of the conventional systems are built using
Input
Input Output
Output
SISD model.
Instructions and data to be processed have to be
stored in primary memory.
The speed of processing element in SISD is
limited by rate at which the computer can Processor
Processor
transfer information internally.
Dominant representative SISD Systems are:
 IBM PC, Machintosh and Workstaions
 Elements of Parallel Computing
Single
Single Instruction
Instruction Stream
Stream
Single – Instruction , Multiple Data (SIMD) systems
It is a multiprocessor machine
It can capable of executing the same
instruction on all the CPUs
But operating on different data streams.
Data
Data Data
Data
This model are well suited for scientific Input
Input 11 Output
Output 11
computing
It involves lots of vector and Matrix operations
Processor
Processor11
For instance statement Ci = Ai * Bi, can be
passed to all the processing elements (PEs), Data
Data
Data
organized data elements of vectors A and B Data
Input
Input 22
Output
Output 22
can be divided into multiple sets ( N- sets for
N PE systems), and each PE can process one Processor
Processor22
data set.
Data
Data
Dominant representative SIMD systems are: Data
Data Output
Input Output N
N
Input N
N
 Cray’s Vector processing machine
 Thinking Machines Cm*
Processor
ProcessorNN
 GPGPU accelerators.
 Elements of Parallel Computing
Instruct Instruct Instruct
Multiple – Instruction , Single Data Instruct
ion
ion
Instruct
ion
ion
Instruct
ion
ion
Stream
Stream Stream
Stream Stream
Stream
(MISD) systems 11 22 NN

It is a multi processor machine

It can capable of executing different
instructions on different PEs all of them
operating on the same data set.
Processor
Processor11
For example

Stream
Stream

OutputStream
InputStream
 y = sin(x) + cos(x) + tan(x)

DataOutput
DataInput
Machines built using MISD model are

SingleData

SingleData
not useful in most of the applications.

Single

Single
Processor
Processor22
Few machines are built but none of them
available commercially.
This type of systems are more of an
intellectual exercise than a practical Processor
ProcessorNN

configuration.
 Elements of Parallel Computing
Multiple – Instruction , Multiple Instructi
Instructi
on
Instructi
Instructi
on
Instructi
Instructi
on
on on on
Data (MIMD) systems Stream
Stream
11
Stream
Stream
22
Stream
Stream
NN
It is a multi processor machine.
It can capable of executing multiple
instructions on multiple data sets. Data
Data Input
11
Input Data
DataOutput
Output
11
Each PE in the MIMD model has
separate instruction and data streams. Processor
Processor
11
So,this model are well suited to any
kind of application. Data
Data Input
Input Data
DataOutput
Output
22 22
Unlike SIMD, MISD machine, PEs in
MIMD machines work asynchronously, Processor
Processor
There are two types of MIMD based on 22

the way PEs are coupled with main Data Data

Data Output
Data Input
Input Output
memory NN 33

 Shared Memory MIMD

 Distributed Memory MIMD Processor
Processor
NN
 Elements of Parallel Computing
Shared Memory MIMD machines
All the PEs are connected to a single global
memory.
Systems based on this model are also
called tightly coupled multi processor Processor 1 Processor 2 Processor N
systems.
The communication between PEs in this Memory
model takes place through the shared Bus
memory.
Modification of the data stored in the
global memory by one PE is visible to all Global
Global System
System Memory
Memory
other PEs.
Dominant representative shared memory
MIMD systems are:
 Silicon graphics machines
 Sun/IBM SMP ( Symmetric Multi-Processing)
 Elements of Parallel Computing
Distributed Memory MIMD IPC Channel IPC Channel
machines
All PEs have a local memory.
Systems based on this model are also
called loosely coupled multi
processor systems.
The communication between PEs in
Processor 1 Processor 2 Processor 2
this model takes place through the
interconnection network. Memory Memory Memory
Bus Bus Bus
It can use IPC.
The network connecting PEs can be
Local
Local Local
Local Local
Local
configured to tree, mesh, cube, and Memory
Memory Memory
Memory Memory
Memory
so on.
Each PE operates asynchronously
 Elements of Parallel Computing
Shared Vs Distributed MIMD model
Parameters Shared Memory MIMD Distributed Memory
MIMD
Architecture Easier to program but it is Harder to extend
less tolerant to failure.
Failure Affects the entire system. •Not affects the entire
system.
•Because each of the PEs can
be easily isolated.
Scalability •Less Likely to scalable. •It will not happen here.
•Because the addition of •Each PEs having it
more PEs leads to Memory ownMemory.
Contention
 Quiz IV
https://www.menti.com/39d1kt9phd
38 55 06
 Quiz IV- Answer
All
 Elements of Parallel Computing
Approaches to parallel Programming
 A sequential program is one that runs on a single processor and has
a single line of control.
 To make many processors collectively work on a single program,
the program must be divided into smaller independent chunks so
that each processor can work on separate chunks of the problem.
 The program decomposed in this way is a parallel program.
 A wide variety of parallel programming approaches are available.
 Data Parallelism
 Process Parallelism
 Farmer-and-Worker Model
 The above said three models are suitable for task-level parallelism.
 Elements of Parallel Computing
Approaches to parallel Programming
Data Parallelism
 The divide-and-conquer technique is used to split data into
multiple sets.
 Each data set is processed on different PEs using the same
instruction.
 This approach is highly suitable to processing on machines
based on the SIMD model.
Process Parallelism
 A given operation has multiple (but distinct) activities that can
be processed on multiple processors
Farmer-and- Worker Model
 Elements of Parallel Computing
Approaches to parallel Programming
Farmer-and- Worker Model
Here, a job distribution approach is used
One processor is configured as master and all other
remaining PEs are designated as slaves
The master assigns the jobs to slave PEs and, on
completion, they inform the master, which in turn
collects results.
These approaches can beused indifferent levels of
parallelism
 Elements of Parallel Computing
Levels of Parallelism Grain Size Code Parallelized
 It decided on the lumps of code ( grain Item By
size)
 It can be a potential candidate of Large Separate Programmer
parallelism and heavy
weight
 The table shows the levels of process
parallelism.
 All these approaches have a common Medium Function or Programmer
goal procedure
 To boost processor efficiency by hiding latency.
 To conceal latency, there must be another thread ready to run
whenever a lengthy operation occurs.

 The idea is to execute concurrently Fine Loop or Parallelizing

two or more single-threaded instruction compiler
applications. block
 Such as compiling, text formatting,
database searching, and device Very Fine Instruction Processor
simulation.
 Elements of Parallel Computing
Levels of Parallelism
Messages IPC Messages IPC
Large
Large Level
Level
(Processes,
(Processes,Tasks)
Tasks)
Task 1 Task 2 Task N

Shared Memory Shared Memory

function f1() function f2() function fJ()
{…} {…} {…} Medium
Medium Level
Level
(Threads,
(Threads, Functions)
Functions)
Function 1 Function 2 Function J

a[0] = … a[1] = … a[k] = …

b[1] = … Fine
Fine Level
Level
b[0] = … b[k] = …
(Processor,
(Processor, Instructions)
Instructions)
Statements Statements Statements

Very
Very Fine
Fine Level
Level
+ x load (Cores,
(Cores, Pipeline, Instructions)
Pipeline, Instructions)
 Elements of Parallel Computing
Laws of Caution
Studying how much an application or a software system can
gain from parallelism
One think keep it in mind as:
 Parallelism is used to perform multiple activities together
 So that the system can increase its throughput or its speed.
But the relations that control the increment of speed are not
linear.
For example: for a given n processors, the user expects speed
to be increase by in times.
This is an ideal situation, but it rarely happens because of the
communication overhead.
 Elements of Parallel Computing
Here two important guidelines to take into
account
 Speed of computation is proportional to the square root of the system cost; they never
increase linearly. Therefore, the faster a system becomes, the more expensive it is to
increase its speed
 Speed by a parallel computer increases as the logarithm of the number of processors
(i.e. y=k*log(N)).
 Quiz V
https://www.menti.com/xn1bff18pv
56 35 59
Time Limit-20 Seconds
 Quiz V-Answer
SISD
 Elements of Distributed
Computing
Previously, we discussed techniques and architecture which
allows introduction of parallelism with in a single machine.
i.e., explained how parallelsim operates at different levels of
computing stack.
Here, in distributed computing,
 Extends these conscepts
 Explore how multiple activites can be perfromed by leverging
systems composed of multiple heterogenous machines and systems.
So, what exactly a distributed computing ?
What are the most common guidelines & Patterns for
imlementing distributed computing from the perspective of
software designer?
 Elements of Distributed
Computing
General concepts and definitions
Distributed computing?
It studies about the models, architectures, and algorithms
used for building and managing distributed systems.
Definition by Tanenbaum:
A distributed system is a collection of independent
computers that appears to its users as a single coherent
system
It especially focused on unified usage and
aggregation of distributed resources.
 Elements of Distributed
Computing
Some of the aspects for distributed computing are:
Architectural Model
 That are used to harness independent computers and present them as a whole
coherent system.
Communication
 It another fundamental aspects of distributed computing
 Distributed systems are composed of more than one computer that colloborate
together
 So, it is necessary to provide some sort of data and information exchange between
them, which generally occurs through networks.
A distributed system is one in which components located at networked
computers communicate and coordinate their action only by passing messages.
A distrbuted system is one in which components located at networked
computers communicate and coordinate their action only by passing message.
 Elements of Distributed
Computing
The components of a distributed system
communicate with some sort of message passing.
This is a term the encompasses several
communication models.
Some of them are:
Hardware
Operating System
Middleware
Applications
 Elements of Distributed
Computing
Components of Distributed
Systems
A distributed system is the result of
the interaction of several
components.
Applicatio
Applicatio
It traverses the entire computing Frameworks
Frameworks
for
ns
ns
for distributed
distributed
stack from hardware to software. programming
programming

The figh shows the an overview of

IPC
Middleware
Middleware
the different layers of Distributed IPC
primitives
primitives
for
for control
systems. and
control
and data.
data.

These layers are involved in Operating

Operating
System
System
providing the services of a
distributed systems. Networkin
Networkin
gg and
and
Parallel
Parallel
Hardware
Hardware Hardwar
Hardwar
ee
 Quiz I
https://www.menti.com/f4xk7ijejn
Code: 91 53 48
 Quiz I Answer
All
 Elements of Distributed
Computing
It emerges from the collaboration of several elements that by
working together give users the illusion of a single coherent
system.
At the very bottom layer, computer and network
hardware constitute the physical infrastructure
These components are directly managed by the operating
system
It provides the basic service for inter process
communication (IPC):
 Process scheduling and management
 Resource management in terms of file system and local devices.
 Elements of Distributed
Computing
Architectural Style for distributed Computing
Taken together these two layers become the
platform
On top of which specialized software is deployed
It turns a set of networked computers into a
distributed system.
i.e middleware layer
It is the one that enables distributed computing,
because it provides a coherent and uniform runtime
environment for applications
 Elements of Distributed
Computing
Architectural Style for distributed Computing
There are many different ways to organize the
components that, taken together, constitute such an
environment.
The interactions among these components and their
responsibilities give structure to the middleware and
characterize its type.
i.e., in other words, define its architecture.
Architectural styles aid in understanding the
classifying the organization of the software systems in
general and distributed computing in particular.
 Elements of Distributed
Computing
Architectural Style for distributed Computing
 The easy harnessing of heterogenous components and their
organization into a coherent and uniform system by using
wellknown standards at OS ,Hardware as well as Network Level.
 Ex;Network connectivity between different devices is
controlled by standards, which allow them into interact
seamlessly.
Design patterns help to know how to structure the
relevant of components within an application and
understand the internal organization of software
application by software engineers and developers.
 Elements of Distributed
Computing
Architectural Style for distributed Computing
Architectural styles do the same for the
overall architecture of software systems.
The architectural styles are classified into
two major classes
Software Architectural styles : Relates to the logical
organization of the software.
System Architectural styles: styles that describe the
physical organization of distributed software systems in
terms of their major components.
 Quiz 2
https://www.menti.com/fac42wfrdr
Code: 67 85 16
 Quiz 2 Answer
Hardware
 Elements of Distributed
Computing
Architectural Style for distributed Computing
Software architectural styles are based on the
logical arrangement of software components.
They are helpful
Because they provide an intuitive view of the
whole system, despite its physical deployment.
It also identify the main abstractions
These are used to shape the components of the
system and the expected interaction patterns
between them.
 Elements of Distributed
Computing
System Architectural Styles
Category Most common Architectural Styles
Data Centered Repository
Blackboard
Data Flow Pipe and filter
Batch Sequential
Virtual Machine Rule based
Interpreter
Call and return Main program and subroutine call/top-down
systems
Layered Systems
Independent Communicating Processes
Components Event Systems
 Elements of Distributed
Computing
Datacentered Architecture
It identifies the data as the fundamental element of the
software system.
Access to shared data is the core characteristics of the
data-centered architectures.
An integrity of data is overall goal for such systems.
The repository architectural style is the most relevant
reference model in this category
It is characterized by two main components.
 Central Data Structure- represents the current state of the system.
 Independent Components- it operates on the central data.
 Elements of Distributed
Computing
The ways in which the independent components interact
with the central data structure can be very
heterogeneous.
Repository based architecture is further subcategorized
into:
 Databases
 Blackboard Systems.
In the repository systems, the dynamics of the system is
controlled by independent components, which by
issuing an operation on the central repository, trigger
the selection of specific processes that operate on data
 Elements of Distributed
Computing
Black board Architectural Style
Characterized by 3 components:
Knowledge Source:
 These are entities that update the knowledge base
 It is maintained in the black board.
 Also, it represents intelligent agent sharing the blackboard, react
opportunistically to change in the knowledge base.
Blackboard:
 This represents the data structure
 It is shared among the knowledge sources and stores the
knowledge base of the application.
 It become more popular and widely used for AI applications.
 Quiz III
https://www.menti.com/38p2efu4n1
74 43 09
 Quiz III Answer
Middleware
 Elements of Distributed
Computing
Black board Architectural Style
 It maintains the knowledge about a domain in the form of
assertion and rule.
 These are entered by domain experts.
Control:
 The control is the collection of triggers and procedures.
 It govern the interaction with the blackboard and update the
status of the knowledge base.
 Elements of Distributed
Computing
DataFlow Architecture
 Core feautre – Access to data
 It incorporates the pattern of data-flow.
 The design is determined by an orderly motion of data from
component to component, which is the form of communication
between them.
 Generally this architecture classified into two:
 Batch Sequential
 Pipe-and- Filter Style
 Styles within this category differ in one of the following ways:
 How the control is exerted,
 The degree of concurrency among components,
 The topology that describes the flow of data.
 Elements of Distributed
Computing
Batch Sequential DataFlow Architecture
 It is characterized by an ordered sequence of separate programs
executing one after the other
 These programs are chained together by providing as input for the next
program.
 The output generated by the last program after its completion
 It is most likely in the form of a file.
 It was very popular in the mainframe era of computing and still finds
applications today.
 Example- many distributed applications for scientific computing are
defined by jobs expressed as sequence of programs
 pre-filter, analyze, and post process data
 It is very common to compose these phases using the batch sequential
style.
 Elements of Distributed
Computing
Pipe and Filter Style
It is a variation of the previous style
It express the activity of a software system as sequence
of data transformations.
Each component of the processing chain is called a filter.
The connection between one filter and the next is
represented by a data stream.
 Elements of Distributed
Computing
Batch Sequential Vs Pipe and Filter Style

Batch Sequential Pipe-and-Filter

Coarse grained File grained
High latency Reduced latency due to the
incremental processing of
input
External access to input Localized input
No concurrency Concurrency possible
Non interactive Interactivity awkward but
possible
 Quiz IV
https://www.menti.com/niirgzog4s
Code: 91 70 60
 Quiz IV Answer
Design Pattern
 Elements of Distributed
Computing
Virtual Machine architectures
 It is characterized by the presence of an abstract execution environment
 It generally referred as a virtual machine
 It simulates features that are not available in the hardware or software.
 Applications and systems are implemented on top of this layer .
 It becomes portable over different hardware and software environments.
 The general interaction flow for systems implementing this pattern:
 The program (or the application) defines its operations and state in an abstract
format.
 It is interpreted by the virtual machine engine.
 The interpretation of a program constitutes its execution.
 It is quite common in this scenario that the engine maintains an internal
representation of the program state.
 Elements of Distributed
Computing
Virtual machine architectures contd…
 Popular examples within this category are:
 Rule based systems
 Interpreters
 Command language processors.
 Rule-Based Style:
 This architecture is characterized by representing the abstract execution environment
as an inference engine.
 Programs are expressed in the form of rules or predicates that hold true.
 The input data for applications is generally represented by a set of assertions or facts
 Here, the inference engine uses to activate rules or to apply predicates, thus
transforming data.
 The examples of rule-based systems can be found in the networking domain:
 Network Intrusion Detection Systems (NIDS) often rely on a set of rules to identify abnormal
behaviors connected to possible intrusion in computing systems.
 Interpreter Style: The presence of engine to interpret the style.
 Elements of Distributed
Computing
Call and return Architectures
This identifies all systems that are organized into
components mostly connected together by method calls.
The activity of systems modeled in this way is
characterized by a chain of method calls whose overall
execution and composition identify the execution one or
more operations.
There are three categories in this
 Top down Style : developed with imperative programming
 Object Oriented Style: Object programming models
 Layered Style: provides the implementation in different levels of
abstraction of the system.
 Elements of Distributed
Computing
System Architectural Styles
System architectural styles cover the physical organization of
components and processes over a distributed infrastructure.
Two fundamental reference style
 Client / Server
 Peer- to – Peer
 Elements of Distributed
Computing
Client/Server
Architectural Model:
 The information and the
services of interest can be
centralized and accessed
through a single access
point : the server.
 Multiple clients are
interested in such services
and the server must be
appropriately designed to
efficiently serve requests
coming from different
clients.
 Elements of Distributed
Computing
Peer-to-Peer architectural Style
 Symmetric architectures .
 Here, all the components, called
peers.
 It plays the same role and
incorporate both client and server
capabilities of the client/server
model.
 More precisely, each peer acts as a
server when it processes requests
from other peers and as a clientt
when it issues requests to other
peers.
 Elements of Distributed
Computing
Models for Inter process Communication
Distributed systems are composed of a collection of
concurrent processes interacting with each other by
means of a network connection.
IPC is a fundamental aspect of distributed systems
design and implementation.
IPC is used to either exchange data and information or
coordinate the activity of processes.
 Elements of Distributed
Computing
Models for Inter process Communication
 There are several different models in which processes can
interact with each other – these maps to different
abstractions for IPC.
 Among the most relevant that we can mention are:
 Shared memory remote procedure call (RPC),
 Message passing.
 At lower level, IPC is realized through the fundamental
tools of network programming.
 Sockets are the most popular IPC primitive for
implementing communication channels between
distributed processes.
 Elements of Distributed
Computing
Message-based communication
 The abstraction of message has played an important role.
 The definition of distributed computing
 It is the one in which components located at networked computers
communicate and coordinate their actions only by passing messages.
 The term messages, in this case, identifies any discrete amount of
information that is passed from one entity to another.
 It encompasses any form of data representation .
 It is limited in size and time, where as this is an invocation to a
remote procedure or a serialized object instance or a generic message.
 The term message-based communication model can be used
to refer to any model for IPC
 Elements of Distributed
Computing
Message-based communication contd…
 Several distributed programming paradigms eventually use
message-based communication.
 Here are some of the most popular and important:
 Message Passing :
 This paradigm introduces the concept of a message as the main
abstraction of the model.
 The entities exchanging information explicitly encode in the form of
a message the data to be exchanged.
 The structure and the content of a message vary according to the
model. Examples of this model are:
 The Message-Passing-Interface (MPI)
 openMP.
 Elements of Distributed
Computing
Message-based communication contd…
 Remote Procedure Call (RPC) :
 This paradigm extends the concept of procedure call beyond the boundaries
of a single process.
 Thus triggering the execution of code in remote processes.
 Distributed Objects :
 This is an implementation of the RPC model for the object-oriented
paradigm
 It contextualizes this feature for the remote invocation of methods exposed
by objects.
 Examples of distributed object infrastructures are:
 Common Object Request Broker Architecture (CORBA),
 Component Object Model (COM, DCOM, and COM+),
 Java Remote Method Invocation (RMI),
 .NET Remoting.
 Elements of Distributed
Computing
Message-based communication contd…
 Distributed agents and active Objects:
 Programming paradigms based on agents and active objects involve by
definition the presence of instances, whether they are agents of objects,
despite the existence of requests.
 Web Service:
 An implementation of the RPC concept over HTTP
 Thus allowing the interaction of components that are developed with
different technologies.
 A Web service is exposed as a remote object hosted on a Web Server, and
method invocation are transformed in HTTP requests, using specific
protocols such as Simple Object Access Protocol (SOAP) or
Representational State Transfer (REST).
 Quiz V
https://www.menti.com/kkj39z4f8i
Code:  33 61 50
 Quiz V Answer
Interpretter
Models for message-based communication
Point-to-Point message model
Publish – and – Subscribe message model
Push Strategy
Pull Strategy
Request- reply message model
Models for message-based communication
Point-to-Point message model
 It organizes the communication among single components.
 Each message is sent from one component to another.
 There is a direct addressing to identify the message receiver.
 Here, It is necessary to know the location of or how to address another
component in the system.
 There is no central infrastructure.
 It dispatches the messages, and the communication is initiated by the message
sender
 Two major sub categories:
 Direct communication - the message is sent directly to the receiver and processed at the time
of reception.
 Queue-based communication- the receiver maintains a message queue in which the messages
received are placed for later processing.
 This model is useful for implementing system that are mostly based on one-to-
one or many-to-one communication
Models for message-based communication
Publish – and – Subscribe message model
It introduces a different strategy.
one that is based on notification among components
Therearetwomajorroles:the publisher and the subscriber.
The former provides facilities for the latter to register its
interest in a specific topic or event.
Specific conditions holding true on the publisher side
can trigger the creation of messages that are attached to a
specific event.
A message will be available to all the subscribers that
registered for the corresponding event
Models for message-based communication
Publish – and – Subscribe message model Contd…
 There are two major strategies for dispatching the event to the
subscribers:
 Push strategy:
 In this case it is the responsibility of the publisher to notify all the
subscribers — for example,with a method invocation.
 Pull strategy.
 In this case the publisher simply makes available the message for a
specific event,
 It is responsibility of the subscribers to check whether there are messages
on the events that are registered .
The publish-and-subscribe model is very suitable for one- to-
many communication model and indirect communication
patterns.
Models for message-based communication
Request- reply message model
 It identifies all communication models in which, for each
message sent by a process, there is a reply.
 This model is quite popular and provides a different classification
 It does not focus on the number of the components involved in
the communication
 But rather on how the dynamic of the interaction evolves.
 Point-to-point message models are more likely to be based on a
request-reply interaction, especially in the case of direct
communication.
 Publish- and-subscribe models are less likely to be based on
request-reply since they rely on notifications.
 Quiz I
https://www.menti.com/sifj1tmz6f
66 10 50
Quiz 1 Answer
Direct communication and Queue based
communications are sub categories of ______ message
based communication model.
Point to point
Publish subscribe
Request Reply
 Technologies for distributed computing
Remote Procedure Call (RPC)
RPC is the fundamental abstraction enabling the execution
procedures on clients’ request.
RPC allows extending the concept of a procedure call beyond
the boundaries of a process and a single memory address space.
The called procedure and calling procedure may be on the
same system or they may be on different systems.
 The concept of RPC has been discussed since 1976 and
completely formalized by Nelson and Birrell in the early 1980s
The important aspect of RPC is marshalling and unmarshalling.
 Technologies for distributed computing
Remote Procedure Call (RPC) Contd…
 Fig shows the major components of RPC.
 The system is based on a client/server model.
 The server process maintains a registry of all the available procedures.
 It can be remotely invoked and listens for requests from clients .
 It specifies which procedure to invoke, together with the values of the
parameters required by the procedure.
 RPC maintains the synchronous pattern that is natural in IPC and
function calls.
 Therefore, the calling process thread remains blocked until the
procedure on the server process has completed its execution and the
result (if any) is returned to the client.
 Marshaling and Unmarshaling are the important aspect of RPC.
 Remote Procedure Call (RPC)
Node
Node A
A Node
Node B
B

Main Procedure Procedure

Procedure
Registry
Registry

Procedure
Procedure C:Node
C:Node
Procedure
Procedure A
A BB Procedure
Procedure C
C

Procedure
Procedure B
B RPC
RPC Library
Library RPC
RPC Service
Service
Program
Program AA (RPC
(RPC Program
Program CC (RPC
(RPC
Client)
Client) Server)
Server)
Parameters
Parameters Marshaling
Marshaling Return
Return Value
Value Parameters
Parameters Unmarshaling
Unmarshaling Return
Return Value
Value
and
and Procedure
Procedure Name
Name Unmarshaling
Unmarshaling and
and Procedure
Procedure Name
Name Marshaling
Marshaling

Network
Network
 Technologies for distributed computing
Remote Procedure Call (RPC) Contd…
 Marshaling- identifies theprocess of converting parameter and return
values in to a form that is more suitable to be transported over a
network througha sequence of bytes.
 The term unmarshaling refers to the opposite procedure.
 Marshaling and unmarshaling are performed by the RPC runtime
infrastructure.
 The client and server user code does not necessarily have to perform
these tasks.
 The RPC runtime, on the other hand, is not only responsible for
parameter packing and unpacking but also for handling the request-
reply interaction.
 It happens between the client and the server process in a completely
transparent manner.
Technologies for distributed computing
Remote Procedure Call (RPC) Contd…
Therefore, developing a system leveraging RPC for IPC
consists of the following steps:
 Design and implementation of the server procedures that will be
exposed for remote invocation.
 Registration of remote procedures with the RPC server on the
node where they will be made available.
 Design and implementation of the client code that invokes the
remote procedure(s).
 Technologies for distributed computing
Remote Procedure Call (RPC) Contd…
 Each RPC implementation generally provides client and server
application programming inter- faces (APIs).
 It facilitate the use of this simple and powerful abstraction.
 An important observation has to be made concerning the passing of
parameters and return values.
 Since the server and the client processes are in two separate address
spaces, the use of parameters passed by references or pointers is not
suitable in this scenario.
 Second, in user-defined parameters and return value types, it is
necessary to ensure that the RPC runtime is able to marshal them.
 This is generally possible, especially when user-defined types are
composed of simple types, for which marshaling is naturally provided.
Technologies for distributed computing
Remote Procedure Call (RPC) Contd…
There also exist platform independent solutions for RPC
are:
 XML-RPC and JSON-RPC
It provide RPC facilities over XML and JSON,
respectively.
Thrift is the framework developed at Facebook for
enabling a transparent cross-language RPC model.
Currently, the term RPC implementations encompass a
variety of solutions including frameworks such
distributed object programming (CORBA, DCOM, Java
RMI, and .NET Remoting) and Web services that
evolved from the original RPC concept.
Technologies for distributed computing
Distributed Object Frameworks
Extend object-oriented programming systems.
It allows objects to be distributed across a heterogeneous
network and provide facilities.
So that they can be coherently act as though they were in
the same address space.
Distributed object frameworks leverage the basic
mechanism introduced with RPC and extend it to enable
the remote invocation of object methods
 Technologies for distributed computing
Distributed Object Frameworks Contd…
 With respect to the RPC model, the infrastructure manages
instances that are exposed through well- known interfaces instead
of procedures.
 Therefore, the common interaction pattern is the following:
 The server process maintains a registry of active objects that are made
available to other processes.According to the specific implementation,
active objects can be published using interface definitions or class
definitions.
 The client process,by using a given addressing scheme,obtains a reference to
the active remote object.This reference is represented by a pointer to an
instance that is of a shared type of interface and class definition.
 The client process invokes the methods on the active object by calling them
through the reference previously obtained. Parameters and return values are
marshaled as happens in the case of RPC.
Technologies for distributed computing
Distributed Object Frameworks Contd…
Distributed objectf rame works give the illusion of
interaction with a local instance while invoking remote
methods.
This is done by a mechanism called a proxy skeleton.
Figure gives an overview of how this infrastructure
works.
 Distributed Object Programming model
Node
Node A
A Node
Node B
B
Application
Application BB

21
21
10
10 16
16
Instance Remote
15
15
Instance
5:
5: Object
Object
1:
1:Ask
Ask for
for Object
Object
Object Proxy
Proxy Object Skeleton
Skeleton Activation
Activation
Reference
Reference
99 11
11 20
20 17
17 14 66 44
14

Remote
Remote Reference
Reference Module
Module Remote
Remote Reference
Reference Module
Module

Application
ApplicationAA
88 12
12 77
13
13
22 19
19 18 33
18

Network
Network
Technologies for distributed computing
Distributed Object Frameworks Contd…
 Proxy and skeleton always constitute a pair.
 The server process maintains the skeleton component.
 It is in charge of executing the methods that are remotely invoked,.
 The client maintains the proxy component.
 It allows its hosting environment to remotely invoke methods through the proxy
interface.
 The transparency of remote method invocation is achieved using one of the
fundamental properties of object-oriented programming: inheritance and
subclassing.
 Both the proxy and the active remote object expose the same interface, defining
the set of methods that can be remotely called.
 On the client side, a runtime object subclassing the type pub- lished by the server
is generated.
 This object translates the local method invocation into an RPC call for the
corresponding method on the remote active object
Technologies for distributed computing
Distributed Object Frameworks Contd…
On the server side, whenever an RPC request is received,
it is unpacked and the method call is dispatched to the
skeleton that is paired with the client that issued the
request.
Once the method execution on the server is completed,
the return values are packed and sent back to the client,
and the local method call on the proxy returns.
 Quiz 2
https://www.menti.com/c7zptw3pcv
20 29 71
 
 Quiz 2 Answer
The following are the RPC distributed computing
Technologies
XML RPC
JSON RPC
BOTH
 Examples of distributed Object
frameworks
Common Object Request Broker Architecture (CORBA):
 cross platform and cross language interoperability among distributed components.

Distributed Component Object Model (DCOM/COM+) :

 Microsoft technology for distributed object programming before the introduction
of .NET technology.
Java Remote Method Invocation (RMI):
 technology provided by Java for enabling RPC among distributed Java objects.

.NET Remoting:
 IPC among .NET applications, a uniform platform for accessing remote objects
from within any application developed in any of the languages supported by .NET.
 Service Oriented Computing
Service – oriented computing organizes distributed systems in
terms of services.
It represent the major abstraction for building systems.
Service orientation expresses applications and software
systems as an aggregation of services that are coordinated
within a service oriented architecture (SOA).
Even though there is no designed technology for the
development of service-oriented software systems, web
services are the de facto approach for developing SOA.
Web services, the fundamental component enabling Cloud
computing systems, leverage the Internet as the main
interaction channel between users and the system.
 What is Services?
A service encapsulates a software component that
provides a set of coherent and related function alities
that can be reused and integrated into bigger and more
complex applications
 Four Major Characteristics to identify
Service
Boundaries are explicit
 A service-oriented application is generally composed of
services that are spread across different domains, trust
authorities, and execution environments.
 Crossing such boundaries is costly;
Services are autonomous
 Services are components that exist to offer functionality and
are aggregated and coordinated to build more complex system.
 They are not designed to be part of a specific system, but they
can be integrated in several software systems, even at the same
time.
 The deployment of applications is atomic,
 Four Major Characteristics to identify
Service
Services share shema and contracts, not class or interface
defnintion
 Services are not expressed in terms of classes or interfaces,
as happens in object-oriented systems
Services compatibility is determined based on policy.
 Service orientation separates structural compatibility from
semantic compatibility.
 Structural compatibility is based on contracts and schema
and can be validated or enforced by machine-based
techniques.
 Semantic compatibility is expressed in the form of policies
that define the capabilities and requirements for a service
 Quiz 3
https://www.menti.com/zwq5vxr2hc
 28 95 6
 Quiz 3 ANswer
_____ is the framework developed at Facebook for
enabling a transparent cross-language RPC model.
CORBA
XML-RPC
Thrift
 Service-Oriented Architecture
(SOA)
SOA is an architectural style supporting service orientation.
It organizes a software system into a collection of interacting
services.
SOA encompasses a set of design principles that structure system
development and provide means for integrating components into a
coherent and decentralized system.
SOA based computing packages functionalities into a set of
interoperable services.
It can be integrated into different software systems belonging to
separate business domains.
There are two major roles within SOA:
 Service Provider
 Service Consumer
 Web Services
Web Services are the prominent technology for implementing SOA
systems and applications.
They leverage Internet technologies and standards for building
distributed systems.
Several aspects make Web Services the technology of choice for
SOA.
First, they allow for interoperability across different platforms and
programming languages.
Second, they are based on well-known and vendor-independent
standards such as HTTP, SOAP, and WSDL.
Third, they provide an intuitive and simple way to connect
heterogeneous software systems, enabling quick composition of
services in distributed environment.
Web Service Interaction
 References
Rajkumar Buyya, Christian Vecchiola, and
Thamarai Selvi, Mastering Cloud Computing,
McGraw Hill, ISBN-13: 978-1-25-902995-0, New
Delhi, India, 2013.
Rajkumar Buyya, Christian Vecchiola, and
Thamarai Selvi, Mastering Cloud Computing,
Morgan Kaufmann, ISBN: 978-0-12-411454-8,
Burlington, Massachusetts, USA, May 2013.