cluster computing

1. DEPARTMENT OF INFORMATION TECHNOLOGY
CLASS SECTION :IT- A
NAME OF THE STUDENT:G RAHUL REDDY
ROLL NO: 21P61A1250
NAME OF THE TOPIC: CLUSTER COMPUTING
DATE:07-12-2022

2. INTRODUCTION
A COMPUTER CLUSTER IS A GROUP OF TIGHTLY
COUPLED
COMPUTERS THAT WORK TOGETHER CLOSELY SO
THAT IT
CAN BE VIEWED AS A SINGLE COMPUTER.
CLUSTERS ARE COMMONLY CONNECTED
THROUGH FAST
LOCAL AREA NETWORKS.
CLUSTERS HAVE EVOLVED TO SUPPORT
APPLICATIONS RANGING FROM ECOMMERCE, TO
HIGH PERFORMANCE DATABASE APPLICATIONS.

3. HISTORY
THE FIRST COMMODITY CLUSTERING PRODUCT WAS
ARCNET, DEVELOPED BY DATAPOINT IN 1977.
THE NEXT PRODUCT WAS VAXCLUSTER, RELEASED BY
DEC IN 1980’S.
MICROSOFT, SUN MICROSYSTEMS, AND OTHER
LEADING HARDWARE AND SOFTWARE COMPANIES
OFFER CLUSTERING PACKAGES

4. WHY CLUSTERS?
PRICE/PERFORMANCE:
THE REASON FOR THE GROWTH IN USE OF
CLUSTERS IS THAT THEY HAVE SIGNIFICANTLY
REDUCED THE COST OF PROCESSING POWER.
AVAILABILITY:
SINGLE POINTS OF FAILURE CAN BE
ELIMINATED, IF ANY ONE SYSTEM COMPONENT
GOES DOWN, THE SYSTEM AS A WHOLE STAY
HIGHLY AVAILABLE.
SCALABILITY:
HPC CLUSTERS CAN GROW IN OVERALL
CAPACITY BECAUSE PROCESSORS AND NODES
CAN BE ADDED AS DEMAND INCREASES.

5. LOGICAL VIEW OF CLUSTER

6. HIGH PERFORMANCE (HP) CLUSTERS
LOAD BALANCING CLUSTERS
 HIGH AVAILABILITY (HA) CLUSTERS
TYPES OF CLUSTER COMPUTING

7. HIGH PERFORMANCE CLUSTER
Start from 1994
Donald Becker of NASA assembled this cluster.
Also called Beowulf cluster
Applications like data mining, simulations, parallel
processing, weather modeling, etc

8. LOAD BALANCING CLUSER
PC cluster deliver load balancing performance
Commonly used with busy ftp and web servers
with large client base
Large number of nodes to share load

9. HIGH AVAILABILITY CLUSTER
Avoid single point of failure
This requires at least two nodes - a primary and a
backup.
Always with redundancy
Almost all load balancing cluster are with HA
capability

10. ISSUES TO BE
CONSIDERED
CLUSTER NETWORKING
CLUSTER SOFTWARE
PROGRAMMING
TIMING
NETWORK SELECTION
SPEED SELECTION

11. REFERENCE
1. "CLUSTER VS GRID COMPUTING". STACK OVERFLOW.
2.^ JUMP UP TO:A B GRAHAM-SMITH, DARIEN (29 JUNE
2012). "WEEKEND PROJECT: BUILD YOUR OWN
SUPERCOMPUTER". PC & TECH AUTHORITY. RETRIEVED 2
JUNE 2017.
3.^ BADER, DAVID; PENNINGTON, ROBERT (MAY 2001). "CLUSTER
COMPUTING: APPLICATIONS". GEORGIA TECH COLLEGE OF
COMPUTING. ARCHIVED FROM THE ORIGINAL ON 2007-12-21.
RETRIEVED 2017-02-28.

12. CONCLUSION
CLUSTERS ARE PROMISING
 SOLVE PARALLEL PROCESSING PARADOX
 NEW TRENDS IN HARDWARE AND SOFTWARE
TECHNOLOGIES ARE LIKELY TO MAKE CLUSTERS.
 CLUSTERS BASED SUPERCOMPUTERS (LINUX
BASED CLUSTERS) CAN BE SEEN EVERYWHERE !!