Cluster computing: the commodity supercomputer
β Scribed by Mark Baker; Rajkumar Buyya
- Publisher
- John Wiley and Sons
- Year
- 1999
- Tongue
- English
- Weight
- 174 KB
- Volume
- 29
- Category
- Article
- ISSN
- 0038-0644
No coin nor oath required. For personal study only.
β¦ Synopsis
The availability of high-speed networks and increasingly powerful commodity microprocessors is making the usage of clusters, or networks, of computers an appealing vehicle for cost effective parallel computing. Clusters, built using Commodity-Off-The-Shelf (COTS) hardware components as well as free, or commonly used, software, are playing a major role in redefining the concept of supercomputing. In this paper we discuss the reasons why COTS-based clusters are becoming popular environments for running supercomputing applications. We describe the current enabling technologies and present four state-of-theart cluster-based projects. Finally, we summarise our findings and draw a number of conclusions relating to the usefulness and likely future of cluster computing.
π SIMILAR VOLUMES
an Analytical Overview Of The State Of The Art, Open Problems, And Future Trends In Heterogeneous Parallel And Distributed Computing this Book Provides An Overview Of The Ongoing Academic Research, Development, And Uses Of Heterogeneous Parallel And Distributed Computing In The Context Of Scientifi
The unitary group based open-shell state specific (SS) coupled-cluster (CC) theory is used to compute energies and ionization potentials for several electronic states of methylene, using a double-zeta plus polarization basis set model. The results are compared with the exact full configuration inter
The equilibrium has been studied between graphite and the C5 linear cluster, characterized by means of the most sophisticated available quantum-chemical data. For some combinations of theoretical parameters the agreement with the observed value of equilibrium constant is better than one order of mag
We present a formulation of the singles and doubles coupled-cluster (CCSD) method suitable for distributed memory parallel computer architectures. Results from test calculations using up to 128 nodes of the Intel i860 hypercube are presented. Although the new algorithm is highly parallel, the asympt