CII3D4

SISTEM PARALEL DAN TERDISTRIBUSI

Materi 1
Pengenalan Sistem
Terdistribusi
Outline Today
• Definition
• Message Passing
• Characteristics of Distributed System
• Example of Distributed System
• Fallacies of Distributed System
• CAP Theorem
Centralized System
Centralized systems are systems that use
client/server architecture where one or
more client nodes are directly connected to
a central server.

This is the most commonly used type of

system in many organisations where client
sends a request to a company server and
receives the response.
Characteristic of Centralized System
• Presence of a global clock: As the entire system consists of
a central node(a server/ a master) and many client nodes(a
computer/ a slave), all client nodes sync up with the global
clock(the clock of the central node).
• One single central unit: One single central unit which
serves/coordinates all the other nodes in the system.
• Dependent failure of components: Central node failure
causes entire system to fail. This makes sense because
when the server is down, no other entity is there to
send/receive response/requests.
Limitation of Centralized System
• Can’t scale up vertically after a certain limit – After a limit,
even if you increase the hardware and software
capabilities of the server node, the performance will not
increase.
• Bottlenecks can appear when the traffic spikes – as the
server can only have a finite number of open ports to
which can listen to connections from client nodes. So,
when high traffic occurs like a shopping sale, the server
can essentially suffer a Denial-of-Service attack or
Distributed Denial-of-Service attack.
7 03/18/2021 CII3D4 – Sistem Paralel dan Terdistribusi
Distributed System
Definition
– A distributed system is one in which hardware or software
components located at networked computers communicate
and coordinate their actions only by passing messages.
[COU’12]
– A distributed system is a collection of independent computers
that appears to its users as a single coherent system. [TAN’07]
– A distributed system is a system consisting of a collection of
autonomous machines connected by communication
networks and equipped with software systems designed to
produce an integrated and consistent computing
environment. [JIA’05]

9 03/18/2021 CII3D4 – Sistem Paralel dan Terdistribusi

Message Passing vs. Conventional
• message passing sends a message to a
process and relies on the process and the
supporting infrastructure to select and invoke
the actual code to run.
• Message passing differs from conventional
programming where a process, subroutine, or
function is directly invoked by name

10 03/18/2021 CII3D4 – Sistem Paralel dan Terdistribusi

Overhead of message passing
• Total memory usage (-)
• Transfer time (-)
• Locality (+)

11 03/18/2021 CII3D4 – Sistem Paralel dan Terdistribusi

Characteristics of DS
• Concurrency
– concurrent programs execution – share resource
• No global clock
– programs coordinate actions by exchanging
messages
• Independent failures
– when some systems fail, others may not know

12 03/18/2021 CII3D4 – Sistem Paralel dan Terdistribusi

Examples of DS
Finance and commerce
The information society
Creative industries and entertainment
Healthcare
Education
Transport and logistics
Science
Environmental management
eCommerce e.g. Amazon and eBay, PayPal, online banking
and trading
Web information and search engines, ebooks, Wikipedia; social
networking: Facebook and MySpace .
online gaming, music and film in the home, user-generated
content, e.g. YouTube, Flickr
health informatics, on online patient records, monitoring
patients
e-learning, virtual learning environments; distance learning
GPS in route finding systems, map services: Google Maps,
Google Earth
The Grid as an enabling technology for collaboration
between scientists
sensor technology to monitor earthquakes, floods or
tsunamis

13 03/18/2021 CII3D4 – Sistem Paralel dan Terdistribusi

14 03/18/2021 CII3D4 – Sistem Paralel dan Terdistribusi
Fallacies of distributed computing
• The network is reliable.
• Latency is zero.
• Bandwidth is infinite.
• The network is secure.
• Topology doesn't change.
• There is one administrator.
• Transport cost is zero.
• The network is homogeneous.
15 03/18/2021 CII3D4 – Sistem Paralel dan Terdistribusi
CAP theorem (Brewer's theorem)
• It is impossible for a distributed computer system to
simultaneously provide more than two out of three of the
following guarantees
• Consistency
– Every read receives the most recent write or an error
• Availability
– Every request receives a (non-error) response – without guarantee that
it contains the most recent write
• Partition Tolerance
– The system continues to operate despite an arbitrary number of
messages being dropped (or delayed) by the network between nodes

16 03/18/2021 CII3D4 – Sistem Paralel dan Terdistribusi

Explanation
• No distributed system is safe from network failures, thus
network partitioning generally has to be tolerated. In the
presence of a partition, one is then left with two options:
consistency or availability.
• When choosing consistency over availability, the system will
return an error or a time out if particular information cannot be
guaranteed to be up to date due to network partitioning
• When choosing availability over consistency, the system will
always process the query and try to return the most recent
available version of the information, even if it cannot guarantee
it is up to date due to network partitioning

17 03/18/2021 CII3D4 – Sistem Paralel dan Terdistribusi

Only CA
• CAP is frequently misunderstood as if one had to
choose to abandon one of the three guarantees at all
times.
• In fact, the choice is really between consistency and
availability for when a partition happens only; at all
other times, no trade-off has to be made
• In the absence of network failure – that is, when the
distributed system is running normally – both
availability and consistency can be satisfied.
18 03/18/2021 CII3D4 – Sistem Paralel dan Terdistribusi
THANK YOU