Distributed Systems REPORT
Distributed Systems REPORT
Distributed Systems REPORT
A Brief Introduction
OUTLINE
BRIEF HISTORY.
WHAT ARE DISTRIBUTED SYSTEMS ? ?
WHY DISTRIBUTED SYSTEMS ? ?
ADVANTAGES OF D.S. OVER THE
CENTRALIZED SYSTEM.
ADVANTAGES OF D.S. OVER
INDEPENDENT PCS.
OUTLINE (Contd.)
ORGANIZATION OF DISTRIBUTED
SYSTEM.
GOALS OF D.S.
Resource Sharing.
Openness.
Transparency.
Scalability.
Pitfalls.
OUTLINE (Contd.)
Concurrency.
TYPES OF DISTRIBUTED SYSTEMS.
Distributed Computing Systems.
SUMMARY.
HISTORY
1945~1985
Computers were large and expensive.
No way to connect them.
All systems were Centralized Systems.
Mid-1980s
Powerful microprocessors.
High Speed Computer Networks (LANs ,
WANs).
HISTORY (Contd.)
DISTRIBUTED
SYSTEMS
What is a Distributed System (DS)?
A distributed system is a piece of software that ensures
that a collection of independent computers appears
to its users as a single coherent system. (A. Tanenbaum)
Two aspects:
(1) independent computers and (2) single
Transparency.
Scalability.
Concurrency.
Pitfalls
RESOURCE SHARING:
With Distributed Systems, it is easier for
users to access remote resources and to share
resources with other users.
Examples: printers, files, Web pages, etc
mechanism
OPENNESS: (Contd.)
Monolithic Kernel: systems calls are trapped
and executed by the kernel. All system calls
are served by the kernel, e.g., UNIX.
Microkernel: provides minimal services.
IPC
some memory management
some low-level process management and
scheduling
low-level i/o (E.g., Mach can support multiple
file systems, multiple system interfaces.)
TRANSPARENCY:
It hides the fact that the processes and
resources are physically distributed
across multiple computers.
Transparency is of various forms as
follows:
TRANSPARENCY (Contd.)
SCALABILITY:
A system is described as scalable if it
remains effective when there is a significant
increase in the number of resources and the
number of users.
Challenges:
Controlling the cost of resources or money.
Controlling the performance loss.
SCALABILITY PROBLEMS
Characteristics of 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
globalclock exists.
CONCURRENCY:
There is a possibility that several clients
will attempt to access a shared resource
at the same time.
Any object that represents a shared