1 Distributed Systems REK’s adaptation of Prof. Claypool’s adaptation of Tanenbaum’s...
-
date post
20-Jan-2016 -
Category
Documents
-
view
225 -
download
0
Transcript of 1 Distributed Systems REK’s adaptation of Prof. Claypool’s adaptation of Tanenbaum’s...
![Page 1: 1 Distributed Systems REK’s adaptation of Prof. Claypool’s adaptation of Tanenbaum’s Distributed Systems Chapter 1.](https://reader035.fdocuments.in/reader035/viewer/2022062217/56649d405503460f94a198aa/html5/thumbnails/1.jpg)
1
Distributed Systems
REK’s adaptation of Prof. Claypool’s adaptation of
Tanenbaum’sDistributed Systems
Chapter 1
![Page 2: 1 Distributed Systems REK’s adaptation of Prof. Claypool’s adaptation of Tanenbaum’s Distributed Systems Chapter 1.](https://reader035.fdocuments.in/reader035/viewer/2022062217/56649d405503460f94a198aa/html5/thumbnails/2.jpg)
Distributed Computing Systems 2
The Rise of Distributed Systems
Computer hardware prices are falling and power increasing.
Network connectivity is increasing. Everyone is connected with fat pipes.
It is easy to connect hardware together. Definition: a distributed system is
A collection of independent computers that appears to its users as a single coherent system.
![Page 3: 1 Distributed Systems REK’s adaptation of Prof. Claypool’s adaptation of Tanenbaum’s Distributed Systems Chapter 1.](https://reader035.fdocuments.in/reader035/viewer/2022062217/56649d405503460f94a198aa/html5/thumbnails/3.jpg)
Distributed Computing Systems 3
Forms of Transparency in a Distributed System
Transparency Description
AccessHide differences in data representation and how a resource is accessed
Location Hide where a resource is located
Migration Hide that a resource may move to another location
RelocationHide that a resource may be moved to another location while in use
ReplicationHide that a resource may be shared by several competitive users
ConcurrencyHide that a resource may be shared by several competitive users
Failure Hide the failure and recovery of a resource
PersistenceHide whether a (software) resource is in memory or on disk
![Page 4: 1 Distributed Systems REK’s adaptation of Prof. Claypool’s adaptation of Tanenbaum’s Distributed Systems Chapter 1.](https://reader035.fdocuments.in/reader035/viewer/2022062217/56649d405503460f94a198aa/html5/thumbnails/4.jpg)
Distributed Computing Systems 4
Scalability Problems
As distributed systems grow, centralized solutions are limited.
Concept Example
Centralized services A single server for all users
Centralized data A single on-line telephone book
Centralized algorithms
Doing routing based on complete information
![Page 5: 1 Distributed Systems REK’s adaptation of Prof. Claypool’s adaptation of Tanenbaum’s Distributed Systems Chapter 1.](https://reader035.fdocuments.in/reader035/viewer/2022062217/56649d405503460f94a198aa/html5/thumbnails/5.jpg)
Distributed Computing Systems 5
Hiding Communication Latency
• This is especially important for interactive applications
• If possible, system can do asynchronous communication.
• The system can hide latencies.
![Page 6: 1 Distributed Systems REK’s adaptation of Prof. Claypool’s adaptation of Tanenbaum’s Distributed Systems Chapter 1.](https://reader035.fdocuments.in/reader035/viewer/2022062217/56649d405503460f94a198aa/html5/thumbnails/6.jpg)
Distributed Computing Systems 6
Dividing the DNS name spaceinto zones
1.5
![Page 7: 1 Distributed Systems REK’s adaptation of Prof. Claypool’s adaptation of Tanenbaum’s Distributed Systems Chapter 1.](https://reader035.fdocuments.in/reader035/viewer/2022062217/56649d405503460f94a198aa/html5/thumbnails/7.jpg)
Distributed Computing Systems 7
Hardware Concepts
1.6
Basic organizations and memories in distributed computer systems
![Page 8: 1 Distributed Systems REK’s adaptation of Prof. Claypool’s adaptation of Tanenbaum’s Distributed Systems Chapter 1.](https://reader035.fdocuments.in/reader035/viewer/2022062217/56649d405503460f94a198aa/html5/thumbnails/8.jpg)
Distributed Computing Systems 8
Hardware Considerations
General Classification: Multiprocessor – a single address
space among the processors Multicomputer – each machine has its
own private memory. OS can be developed for either
type of environment.
![Page 9: 1 Distributed Systems REK’s adaptation of Prof. Claypool’s adaptation of Tanenbaum’s Distributed Systems Chapter 1.](https://reader035.fdocuments.in/reader035/viewer/2022062217/56649d405503460f94a198aa/html5/thumbnails/9.jpg)
Distributed Computing Systems 9
Multiprocessor Organizations
Uniform Memory Access [UMA] Caching is vital for reasonable
performance (e.g., caches on a shared memory multiprocessor).
Want to maintain cache coherency Write-through cache :: any changes to
cache are written through to memory.
![Page 10: 1 Distributed Systems REK’s adaptation of Prof. Claypool’s adaptation of Tanenbaum’s Distributed Systems Chapter 1.](https://reader035.fdocuments.in/reader035/viewer/2022062217/56649d405503460f94a198aa/html5/thumbnails/10.jpg)
Distributed Computing Systems 10
Multiprocessors
A bus-based multiprocessor.
1.7
![Page 11: 1 Distributed Systems REK’s adaptation of Prof. Claypool’s adaptation of Tanenbaum’s Distributed Systems Chapter 1.](https://reader035.fdocuments.in/reader035/viewer/2022062217/56649d405503460f94a198aa/html5/thumbnails/11.jpg)
Distributed Computing Systems 11
Multiprocessors
A crossbar switch An omega switching network
![Page 12: 1 Distributed Systems REK’s adaptation of Prof. Claypool’s adaptation of Tanenbaum’s Distributed Systems Chapter 1.](https://reader035.fdocuments.in/reader035/viewer/2022062217/56649d405503460f94a198aa/html5/thumbnails/12.jpg)
Distributed Computing Systems 12
Multiprocessor Organizations
Non-Uniform Memory Access [NUMA] A hierarchy where CPUs have their own
memory (not the same as a cache). Access costs to memory is non-uniform.
![Page 13: 1 Distributed Systems REK’s adaptation of Prof. Claypool’s adaptation of Tanenbaum’s Distributed Systems Chapter 1.](https://reader035.fdocuments.in/reader035/viewer/2022062217/56649d405503460f94a198aa/html5/thumbnails/13.jpg)
Distributed Computing Systems 13
Replication
Make a copy of information to increase availability and decrease centralized load. Example: P2P networks (Gnutella +)
distribute copies uniformly or in proportion to use.
Example: CDNs (Akamai) Example: Caching is a replication decision
made by client. Issue: Consistency of replicated
information Example: Web Browser cache
![Page 14: 1 Distributed Systems REK’s adaptation of Prof. Claypool’s adaptation of Tanenbaum’s Distributed Systems Chapter 1.](https://reader035.fdocuments.in/reader035/viewer/2022062217/56649d405503460f94a198aa/html5/thumbnails/14.jpg)
Distributed Computing Systems 14
Software Concepts
DOS (Distributed Operating Systems) NOS (Network Operating Systems) MiddlewareSystem Description Main Goal
DOSTightly-coupled operating system for multi-processors and homogeneous multicomputers
Hide and manage hardware resources
NOSLoosely-coupled operating system for heterogeneous multicomputers (LAN and WAN)
Offer local services to remote clients
Middleware
Additional layer atop of NOS implementing general-purpose services
Provide distribution transparency
![Page 15: 1 Distributed Systems REK’s adaptation of Prof. Claypool’s adaptation of Tanenbaum’s Distributed Systems Chapter 1.](https://reader035.fdocuments.in/reader035/viewer/2022062217/56649d405503460f94a198aa/html5/thumbnails/15.jpg)
Distributed Computing Systems 15
Uniprocessor Operating Systems
Separating applications from operating system code through a microkernel
Can extend to multiple computers
![Page 16: 1 Distributed Systems REK’s adaptation of Prof. Claypool’s adaptation of Tanenbaum’s Distributed Systems Chapter 1.](https://reader035.fdocuments.in/reader035/viewer/2022062217/56649d405503460f94a198aa/html5/thumbnails/16.jpg)
Distributed Computing Systems 16
Network Operating System
OSes can be different (Windows or Linux) Typical services: rlogin, rcp
Fairly primitive way to share files
![Page 17: 1 Distributed Systems REK’s adaptation of Prof. Claypool’s adaptation of Tanenbaum’s Distributed Systems Chapter 1.](https://reader035.fdocuments.in/reader035/viewer/2022062217/56649d405503460f94a198aa/html5/thumbnails/17.jpg)
Distributed Computing Systems 17
Network Operating System
Can have one computer provide files transparently for others (NFS)
(try a “df” on the WPI hosts to see. Similar to a “mount network drive” in Windows)
![Page 18: 1 Distributed Systems REK’s adaptation of Prof. Claypool’s adaptation of Tanenbaum’s Distributed Systems Chapter 1.](https://reader035.fdocuments.in/reader035/viewer/2022062217/56649d405503460f94a198aa/html5/thumbnails/18.jpg)
Distributed Computing Systems 18
Network Operating System
Different clients may mount the servers in different places Inconsistencies in view make NOS’s harder, in general for
users than DOS’s. But easier to scale by adding computers
![Page 19: 1 Distributed Systems REK’s adaptation of Prof. Claypool’s adaptation of Tanenbaum’s Distributed Systems Chapter 1.](https://reader035.fdocuments.in/reader035/viewer/2022062217/56649d405503460f94a198aa/html5/thumbnails/19.jpg)
Distributed Computing Systems 19
Distributed Operating Systems
But no longer have shared memory Provide message passing Can try to provide distributed shared memory
But tough to get acceptable performance
![Page 20: 1 Distributed Systems REK’s adaptation of Prof. Claypool’s adaptation of Tanenbaum’s Distributed Systems Chapter 1.](https://reader035.fdocuments.in/reader035/viewer/2022062217/56649d405503460f94a198aa/html5/thumbnails/20.jpg)
Distributed Computing Systems 20
Distributed System as Middleware
![Page 21: 1 Distributed Systems REK’s adaptation of Prof. Claypool’s adaptation of Tanenbaum’s Distributed Systems Chapter 1.](https://reader035.fdocuments.in/reader035/viewer/2022062217/56649d405503460f94a198aa/html5/thumbnails/21.jpg)
Distributed Computing Systems 21
Positioning Middleware
Network OS’s are not transparent. Distributed OS’s are not
independent of computers. Middleware can help.
![Page 22: 1 Distributed Systems REK’s adaptation of Prof. Claypool’s adaptation of Tanenbaum’s Distributed Systems Chapter 1.](https://reader035.fdocuments.in/reader035/viewer/2022062217/56649d405503460f94a198aa/html5/thumbnails/22.jpg)
Distributed Computing Systems 22
Middleware Models
View everything as a file - Plan 9. Less strict – distributed file systems. Make all procedure calls appear to
be local – Remote Procedure Calls (RPC).
Distributed objects (oo model). The Web – distributed documents.
![Page 23: 1 Distributed Systems REK’s adaptation of Prof. Claypool’s adaptation of Tanenbaum’s Distributed Systems Chapter 1.](https://reader035.fdocuments.in/reader035/viewer/2022062217/56649d405503460f94a198aa/html5/thumbnails/23.jpg)
Distributed Computing Systems 23
Middleware and Openness
In an open middleware-based distributed system, the protocols used by each middleware layer should be the same, as well as the interfaces they offer to applications.
If different, there will be compatibility issues If incomplete, then users will build their own or use
lower-layer services (frowned upon)
1.23
![Page 24: 1 Distributed Systems REK’s adaptation of Prof. Claypool’s adaptation of Tanenbaum’s Distributed Systems Chapter 1.](https://reader035.fdocuments.in/reader035/viewer/2022062217/56649d405503460f94a198aa/html5/thumbnails/24.jpg)
Distributed Computing Systems 24
Comparison between Systems
Item
Distributed OSNetwork OS
Middleware-based OSMultiproc. Multicomp.
Degree of transparency
Very High High Low High
Same OS on all nodes Yes Yes No No
Number of copies of OS
1 N N N
Basis for communication
Shared memory
Messages FilesModel specific
Resource management
Global, central
Global, distributed
Per node Per node
Scalability No Moderately Yes Varies
Openness Closed Closed Open Open
![Page 25: 1 Distributed Systems REK’s adaptation of Prof. Claypool’s adaptation of Tanenbaum’s Distributed Systems Chapter 1.](https://reader035.fdocuments.in/reader035/viewer/2022062217/56649d405503460f94a198aa/html5/thumbnails/25.jpg)
Distributed Computing Systems 25
Client-Server Model
• Use TCP/IP for reliable network connection.
•This implies the client must establish a connection before sending the first request.
![Page 26: 1 Distributed Systems REK’s adaptation of Prof. Claypool’s adaptation of Tanenbaum’s Distributed Systems Chapter 1.](https://reader035.fdocuments.in/reader035/viewer/2022062217/56649d405503460f94a198aa/html5/thumbnails/26.jpg)
Distributed Computing Systems 26
Internet Search Engine
![Page 27: 1 Distributed Systems REK’s adaptation of Prof. Claypool’s adaptation of Tanenbaum’s Distributed Systems Chapter 1.](https://reader035.fdocuments.in/reader035/viewer/2022062217/56649d405503460f94a198aa/html5/thumbnails/27.jpg)
Distributed Computing Systems 27
Multitiered Architectures
Thin client (a) to Fat client (e) (d) and (e) popular for NOS environments
![Page 28: 1 Distributed Systems REK’s adaptation of Prof. Claypool’s adaptation of Tanenbaum’s Distributed Systems Chapter 1.](https://reader035.fdocuments.in/reader035/viewer/2022062217/56649d405503460f94a198aa/html5/thumbnails/28.jpg)
Distributed Computing Systems 28
Multitiered Architectures: 3 tiers
Server may act as a client Example would be transaction monitor
across multiple databases
![Page 29: 1 Distributed Systems REK’s adaptation of Prof. Claypool’s adaptation of Tanenbaum’s Distributed Systems Chapter 1.](https://reader035.fdocuments.in/reader035/viewer/2022062217/56649d405503460f94a198aa/html5/thumbnails/29.jpg)
Distributed Computing Systems 29
Horizontal Distribution
Distribute servers across nodes E.g., Web server “farm” for load balancing
Distribute clients in peer-to-peer systems.