LU1-Introduction To Distributed System
LU1-Introduction To Distributed System
SYSTEM
Topic of the day
• Characterisation of DS
• Challenges
• Example
DEFINITION # 1
• A distributed system is :
A collection of independent computers that
appear to the users of the system as a single
system.
All computer systems can fail, and it is the responsibility of system designers to plan
for the consequences of possible failures.
Distributed systems can fail in new ways. Faults in the network result in the isolation of
the computers that are connected to it, but that doesn’t mean that they stop
running. In fact, the programs on them may not be able to detect whether the
network has failed or has become unusually slow.
• Mobile Code to refer to code that can be sent from one computer to
another and run at the destination (e.g., Java applets and Java virtual
machine).
Transparency
• Hide the fact that its processes and resources are physically distributed across
multiple computers.
• Distributed systems designers must hide the complexity of the systems as much as
they can.
• For instance: While users hit search in google.com, they never notice that their query
goes through a complex process before google shows them a result. Some terms
of transparency in distributed systems are:
– Access
– Location
– Migration
– Replication
– Concurrency
– Failure
– Persistence
Different forms of transparency in a
distributed system
Transparency Description
Hide differences in data representation and how a resource is accessed (i.e., Intel
Access
and SPARC byte order format, file System for Linux, Windows, Mac system)
Migration Hides from an object the ability of a system to change that object’s location
Relocation Hide that a resource may be moved to another location while in use
Hides the fact that an object or its state may be replicated and that replicas reside
Replication
at different locations