0% found this document useful (0 votes)
70 views

Chap 01

A distributed system is a collection of independent computers that appears to users as a single coherent system. It allows work to be distributed across multiple machines to improve scalability. Key properties of distributed systems include transparency, where the distribution is hidden from users, and being open, scalable and reliable even when components fail. Techniques for improving scalability include hiding communication latencies and distributing/replicating resources. Examples of distributed systems include network file systems, grid computing systems, and sensor networks.

Uploaded by

Mohammed Radi
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
70 views

Chap 01

A distributed system is a collection of independent computers that appears to users as a single coherent system. It allows work to be distributed across multiple machines to improve scalability. Key properties of distributed systems include transparency, where the distribution is hidden from users, and being open, scalable and reliable even when components fail. Techniques for improving scalability include hiding communication latencies and distributing/replicating resources. Examples of distributed systems include network file systems, grid computing systems, and sensor networks.

Uploaded by

Mohammed Radi
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 16

Introduction

Chapter 1

Definition of a Distributed System (1)


A distributed system is:
A collection of independent computers that appears to its users as a single coherent system.

Definition of a Distributed System (2)


A distributed system is:
A distributed system is a system where I cant get my work done because a computer has failed that Ive never even heard of. Leslie Lamport

Definition of a Distributed System (3)

1.1

A distributed system organized as middleware. Note that the middleware layer extends over multiple machines.

Examples
Network of workstations Work flow information systems World wide web Network File System (/home on onyx) Parallel Virtual File System (beowulf)

Goals of a Distributed System


Easily connects users to resources Hides the fact that the resources are distributed over the network (transparency) Is open Is scalable

Transparency in a Distributed System


Transparency
Access Location Migration Relocation Replication

Description
Hide differences in data representation and how a resource is accessed Hide where a resource is located Hide that a resource may move to another location Hide that a resource may be moved to another location while in use Hide that a resource is replicated Hide that a resource may be shared by several competitive users Hide the failure and recovery of a resource Hide whether a (software) resource is in memory or on disk

Concurrency
Failure Persistence

Different forms of transparency in a distributed system.

Example of Access Transparency


Sending data from a SUN SPARC machine to an Intel machine requires data representation to be changed from big-endian to little-endian. But it is transparent to the user (and should also be to the programmer :-)) Internet standards specify that all data should be in big-endian format. This is also known as the network standard format.
Bytes

Big-endian
Bytes

Little-endian

Openness
An open system offers services according to standard rules that describe the syntax and semantics of those services. Examples Network protocols Interface Definition Languages

Scalability
Be able to add more users and resources to the system
Be able to separate users and resources geographically Be able able to managed easily as it grows

Scalability Problems
Concept Centralized services Centralized data Centralized algorithms Example A single server for all users A single on-line telephone book Doing routing based on complete information

Examples of scalability limitations.

Scalable Decentralized Algorithms

No machine has complete information about the system state Machines make decisions based only on local information Failure of one machine does not ruin the algorithm There is no implicit assumption that a global clock exists

Techniques for improving scalability: Hiding communication latencies, distribution and replication.

Scaling Techniques (1)

1.4

The difference between letting: a. a server or b. a client check forms as they are being filled

Scaling Techniques (2)

1.5

An example of dividing the DNS (Domain Name Service) name space into zones.

Distributed Systems Pitfalls


The network is reliable The network is secure The network is homogeneous The topology does not change Latency is zero Bandwidth is infinite Transport cost is zero There is one administrator

Types of Distributed Systems


Distributed Computing Systems Cluster Computing Grid Computing Distributed Information Systems Transaction Processing Systems Enterprise Application Integration Distributed Pervasive Systems Home Systems Electronic Health Care Systems Sensor Networks

You might also like