Download as pdf or txt
Download as pdf or txt
You are on page 1of 7

14/10/2021

1-Introduction
•Introduction •Three New Computing
Course No. SE-7123 / CE 7110
•The Platform Evolution Paradigms
•Evolutionary Trend •Computing Paradigm
•High-Performance Distinctions
Cloud Computing Computing •Centralized Computing
(Platform Evolution, HPC, HTC, Computing Paradigm
•High-Throughput •Parallel Computing
Distinctions)
Computing •Distributed Computing
•Cloud Computing
1 2

2-Type of Distributed System Design Goals 3-Architectural Styles, Middleware Organization


•Introduction
•Middleware & Distributed •Types of distributed •Architectures
Systems •Architectures Style
systems. • Layered Architectures
•Design Goals • Cluster Computing. • Object-based Architectures
• Supporting Resource Sharing. • Grid Computing. • Resource-Centered Architectures
• Distribution transparent. • Cloud Computing. • Event-based Architectures
• Openness. •Distributed •Middleware Organization
• Scalability. Information Systems.

3 4
14/10/2021

4,5-Architectural Styles, Middleware Organization 6-Process, Thread, Virtualization,


• Processes • Principle of Virtualization
• System Architecture • Decentralized Organizations
• Centralized Organizations • Threads • Virtualization & Distributed
• Structured Peer-to-Peer
• Simple Client-Server Architecture Systems • Thread implementation Systems
• Multitiered Architecture • Unstructured Peer-to-Peer • Lightweight Processes • Type of Virtualization
• Decentralized Organizations Systems
• Hierarchically Organized Peer- • Threads in Distributed • Application of Virtual Machines
• Peer-to-Peer Systems to DS
• Structured Peer-to-Peer Systems
to-Peer Networks Systems
• Unstructured Peer-to-Peer Systems
• Hybrid Architectures • Multithreaded Servers • Client
• Edge-Server Systems
• Collaborative Distributed • Virtualization • Client-side software for
Systems distribution transparency

5 6

7-Code Migration 8-Communication


• Code Migration • Client-Server Computing • Introduction • Stub Generation
• Advantage • Remote Evaluation • Type of Communication • Variations on RPC
• Disadvantage • Code-on-Demand • Remote Procedure Call • Asynchronous RPC
• Models for Code Migration • Basic RPC Operations • Multicast RPC
• Mobile Agents
• Code Segment • RPC Steps • DCE RPC
• Weak Mobility
• Resource Segment • Parameter Passing • Binding a Client to a Server
• Strong Mobility • Parameter passing in Object- • Message-Oriented
• Execution Segment
• Migration in based Systems Communication
• Sender-Initiated Migration Heterogeneous Systems • RPC-based Application Support • Advanced Transient
• Receiver-Initiated Migration Messaging

7 8
14/10/2021

9-MPI and Naming 10-DHT & Coordination


• The Message-Passing
Interface • DHT • Single-Computer vs.
• Structured Naming Distributed System
• Naming • Coordination
• Implementation of a • DME: Requirements
• Flat Naming Name Space • Clock Synchronization
• DME: Performance
• Broadcasting • Attribute-based Naming • Logical Clocks
• DME: A Simple Solution
• Forwarding Pointers • Hierarchical • Lamport’s Logical Clocks
• DME: Lamport’s Algorithm
• Home-based Approaches implementations • Vector Logical Clock
• DME: The Ricart-Agrawala
• Distributed Hash Tables • Distributed Mutual Exclusion
Algorithm
• Hierarchical Approaches

9 10

11-DME & Election Algorithms 12-Distributed Deadlock Detection


• Introduction
• Distributed Mutual Exclusion • Resource vs. • Deadlock Avoidance
• Single-Computer vs. Distributed • DME: A generalized Non- Communication Deadlocks
token based Algorithm • Deadlock Detection and
System • A Graph-Theoretic Model Recovery
• DME: Requirements • DME: RAYMOND’S TREE-
• Resource Allocation Graph • Control Organizations
BASED
• DME: Performance • Wait-For Graph • Centralized Deadlock-Detection
• DME: A Simple Solution • DME: SUZUKI-KASAMI’S
ALGO • Deadlock handling • Distributed Deadlock Detection
• DME: LAMPORT’S ALGORITHM strategies in DS Algorithms
• Election Algorithms
• DME: RICART AGRAWALA • Deadlock Prevention • Algorithms Unleashed
• The Bully Algorithm
Perspectives

11 12
14/10/2021

13-Distributed Deadlock Detection 14-Presentation Session by Students


• Introduction • Introduction
• Deadlock Avoidance • Deadlock Avoidance
• Resource vs. Communication • Deadlock Detection and • Resource vs. Communication • Deadlock Detection and
Deadlocks Deadlocks
Recovery Recovery
• A Graph-Theoretic Model • A Graph-Theoretic Model
• Control Organizations • Control Organizations
• Resource Allocation Graph • Resource Allocation Graph
• Centralized Deadlock- • Centralized Deadlock-
• Wait-For Graph Detection • Wait-For Graph Detection
• Deadlock handling strategies • Distributed Deadlock • Deadlock handling strategies • Distributed Deadlock
in DS Detection Algorithms in DS Detection Algorithms
• Deadlock Prevention • Algorithms Unleashed • Deadlock Prevention • Algorithms Unleashed
Perspectives Perspectives

13 14

Introduction Introduction
• In this session we learn about the evolutionary •These systems are distinguished by their
changes that have occurred in parallel, distributed,
and cloud computing over the past 30 years. Hardware Architectures, OS Platforms,
• Its driven by applications with variable workloads Processing Algorithms, Communication
and large data sets. Protocols, and Service Models applied.
• We study both High-Performance (HPC) and High-
Throughput Computing (HTC) systems in parallel •We also identify/learn essential issues on the
computers appearing as Computer Clusters, Service- Scalability, Performance, Availability, Security,
Oriented Architecture, Computational Grids, Peer-to- and Energy Efficiency in distributed systems.
Peer Networks, Internet Clouds and the IoT.

15 16
14/10/2021

The Platform Evolution Evolutionary Trend


•Computer technology • 1950 to 1970 (Mainframes) • Evolutionary trend
has gone through five • 1960 to 1980 (Lower-Cost toward parallel,
generations of Minicomputers)
distributed, and
development, with each • 1970 to 1990 (Personal Computers)
generation lasting from cloud computing
• 1980 to 2000 (Portable Computers)
10 to 20 years. with clusters, MPPs,
• 1990 to 2010 (???????)
•Successive generations • 2000 to 2020 (????????)
P2P networks,
are overlapped in about grids, clouds, web
10 years. services, and the
Internet of Things.

17 18

High-Performance Computing High-Throughput Computing


•HPC systems emphasize the raw speed • The development of market-oriented high-end
performance. Floating Point Operations Per computing systems is undergoing a strategic change
from an HPC paradigm to an HTC paradigm.
Second (FLOPS). • This HTC paradigm pays more attention to High-Flux
•Gflops in the early 1990s to now Pflops in 2010. computing.
Floating Point Operations Per Second (FLOPS). • High-Flux computing is in Internet searches and web
•This improvement was driven mainly by the services.
demands from scientific, engineering, and • The performance goal thus shifts to measure high
throughput or the number of tasks completed per unit
manufacturing communities. of time.

19 20
14/10/2021

Three New Computing Paradigms Computing Paradigm Distinctions

•Advances in virtualization make it possible • The high-technology community has argued for many
years about the precise definitions of centralized
to see the growth of Internet clouds as a computing, parallel computing, distributed computing,
and cloud computing.
new computing paradigm. • Distributed Computing is the opposite of Centralized
•Service-Oriented Architectures (SOA), Computing.
• Parallel Computing overlaps with Distributed Computing.
Virtualization, Cloud Computing, IoT with • Cloud Computing overlaps with Distributed, Centralized,
CPS (Cyber-Physical Systems) and Parallel Computing.

21 22

Centralized Computing Parallel Computing


•This is a computing paradigm by which all •In parallel computing, all processors are either
computer resources are centralized in one tightly coupled with centralized shared memory
physical system. or loosely coupled with distributed memory.
•All resources (processors, memory, and storage) •Interprocessor Communication is accomplished
are fully shared and tightly coupled within one
integrated OS. through shared memory or via message passing.
•Many data centers and supercomputers are Parallel Computer, Parallel Programs, Parallel
centralized systems. Programming.

23 24
14/10/2021

Distributed Computing Cloud Computing


•Its consists of multiple autonomous computers, •An Internet cloud of resources can be either a
each having its own private memory, centralized or a distributed computing system.
communicating through a computer network. •Clouds can be built with physical or virtualized
•Information exchange in a distributed system is resources over large data centers that are
accomplished through message passing. centralized or distributed.
•Distributed Program, Distributed Programming. •Some authors consider cloud computing to be a
form of utility computing or service computing.

25 26

Query Regarding Lecture Thanks


Email: mnaseem@ssuet.edu.pk Email: mnaseem@ssuet.edu.pk

27 28

You might also like