System Models For Distributed and Cloud Computing

SYSTEM MODELS FOR DISTRIBUTED AND CLOUD COMPUTING
Massive systems are considered highly scalable, and can reach web-scale connectivity,
either physically or logically. They are classified into four groups: clusters, P2P networks,
computing grids, and Internet clouds over huge data centers.
Cluster Architecture
A computing cluster consists of interconnected stand-alone computers which work
cooperatively as a single integrated computing resource. Figure shows the architecture of a
typical server cluster built around a low-latency, high bandwidth interconnection network. This
network can be as simple as a SAN (e.g., Myrinet) or a LAN (e.g., Ethernet). Cluster is
connected to the Internet via a virtual private network (VPN) gateway. The gateway IP address
locates the cluster. Most clusters have loosely coupled node computers.
Single-System Image
Ideal cluster should merge multiple system images into a single-system image (SSI).
Cluster designers desire a cluster operating system or some middleware to support SSI at various
levels, including the sharing of CPUs, memory, and I/O across all cluster nodes. An SSI is an
illusion created by software or hardware that presents a collection of resources as one integrated,
powerful resource. A cluster with multiple system images is nothing but a collection of
independent computers
Hardware, Software, and Middleware Support
The building blocks are computer nodes (PCs, workstations, servers, or SMP), special
communication software such as PVM or MPI, and a network interface card in each computer
node. Special cluster middleware supports are needed to create SSI or high availability (HA).
Both sequential and parallel applications can run on the cluster, and special parallel
environments are needed to facilitate use of the cluster resources. Users may want all distributed
memory to be shared by all servers by forming distributed shared memory (DSM). Many SSI
features are expensive or difficult to achieve at various cluster operational levels. Instead of
achieving SSI, many clusters are loosely coupled machines.
Major Cluster Design Issues
 scalable performance
 efficient message passing,
 high system availability
 seamless fault tolerance
 cluster-wide job management
Grid computing
Grid computing is envisioned to allow close interaction among applications running on
distant computers simultaneously.
Computational Grids
A computing grid offers an infrastructure that couples computers, software/middleware,
special instruments, and people and sensors together. The grid is often constructed across LAN,
WAN, or Internet backbone networks at a regional, national, or global scale. The computers used
in a grid are primarily workstations, servers, clusters, and supercomputers. Figure shows a
computational grid built over multiple resource sites owned by different organizations.
The grid is built across various IP broadband networks including LANs and WANs
already used by enterprises or organizations over the Internet. The grid is presented to users as
integrated resources pool as shown in the upper half of the figure. At the client end, wired or
wireless terminal devices are present. The grid integrates the computing, communication,
contents, and transactions as rented services.
Peer-to-Peer Network
The P2P architecture offers a distributed model of networked systems. A P2P network is client-
oriented instead of server-oriented.
P2P Systems
In a P2P system, every node acts as both a client and a server, providing part of the
system resources. Peer machines are simply client computers connected to the Internet. All client
machines act autonomously to join or leave the system freely. This implies that no master-slave
relationship exists among the peers. No central coordination or central database is needed.
The architecture of a P2P network at two abstraction levels is shown in the figure.
Initially, the peers are totally unrelated. Each peer machine joins or leaves the P2P network
voluntarily. Only the participating peers form the physical network at any time. Unlike the
cluster or grid, a P2P network does not use a dedicated interconnection network.
Overlay Networks
Based on communication or file-sharing needs, the peer IDs form an overlay network at
the logical level. This overlay is a virtual network formed by mapping each physical machine
with its ID, logically, through a virtual mapping as shown in Figure. Based on communication or
file-sharing needs, the peer IDs form an overlay network at the logical level. This overlay is a
virtual network formed by mapping each physical machine with its ID, logically, through a
virtual mapping as shown in the above Figure.
There are two types of overlay networks:
An unstructured overlay network is characterized by a random graph. There is no fixed route to
send messages or files among the nodes. Often, flooding is applied to send a query to all
nodes in an unstructured overlay, thus resulting in heavy network traffic and nondeterministic
search results.
Structured overlay networks follow certain connectivity topology and rules for inserting and
removing nodes (peer IDs) from the overlay graph.Routing mechanisms are developed to take
advantage of the structured overlays.
P2P networks are classified into four groups:
The first family is for distributed file sharing of digital contents (music, videos, etc.) on the P2P
network.
Collaboration P2P networks include MSN or Skype chatting, instant messaging, and
collaborative design, among others.
The third family is for distributed P2P computing in specific applications.
Other P2P platforms, such as JXTA, .NET, and FightingAID@home, support naming, discovery,
communication, security, and resource aggregation in some P2P applications.
Computing challenges in P2P
There are too many hardware models and architectures to select from; incompatibility
exists between software and the OS; we need system scalability as the workload increases..
Data locality, network proximity, and interoperability are three design objectives in
distributed P2P applications. P2P performance is affected by routing efficiency and self-
organization by participating peers.
Fault tolerance, failure management, and load balancing are other important issues in
using overlay networks. Lack of trust among peers poses another problem.
In summary, P2P networks are reliable for a small number of peer nodes. They are only
useful for applications that require a low level of security and have no concern for data
sensitivity.

System Models For Distributed and Cloud Computing

Uploaded by

Copyright:

Available Formats

System Models For Distributed and Cloud Computing

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

System Models For Distributed and Cloud Computing

Uploaded by

Copyright:

Available Formats

SYSTEM MODELS FOR DISTRIBUTED AND CLOUD COMPUTING

You might also like