Pub. Date:
MIT Press
How to Build a Beowulf: A Guide to the Implementation and Application of PC Clusters

How to Build a Beowulf: A Guide to the Implementation and Application of PC Clusters


Current price is , Original price is $50.0. You

Temporarily Out of Stock Online

Please check back later for updated availability.

This item is available online through Marketplace sellers.


This how-to guide provides step-by-step instructions for building aBeowulf-type computer, including the physical elements that make up aclustered PC computing system, the software required (most of which isfreely available), and insights on how to organize the code to exploitparallelism.Supercomputing research—the goal of which is to make computers that are ever faster and more powerful—has been at the cutting edge of computer technology since the early 1960s. Until recently, research cost in the millions of dollars, and many of the companies that originally made supercomputers are now out of business.The early supercomputers used distributed computing and parallel processing to link processors together in a single machine, often called a mainframe. Exploiting the same technology, researchers are now using off-the-shelf PCs to produce computers with supercomputer performance. It is now possible to make a supercomputer for less than $40,000. Given this new affordability, a number of universities and research laboratories are experimenting with installing such Beowulf-type systems in their facilities.This how-to guide provides step-by-step instructions for building a Beowulf-type computer, including the physical elements that make up a clustered PC computing system, the software required (most of which is freely available), and insights on how to organize the code to exploit parallelism. The book also includes a list of potential pitfalls.

Product Details

ISBN-13: 9780262692182
Publisher: MIT Press
Publication date: 05/13/1999
Series: Scientific and Engineering Computation Series
Pages: 262
Product dimensions: 8.00(w) x 9.00(h) x 0.60(d)

About the Author

Donald J. Becker is Staff Scientist at the Center for Excellence in Space Data and Information Sciences.

John Salmon is Staff Scientist at the California Institute of Technology.

Daniel F. Savarese is the founder of Savarese Software Research. He founded ORO, was a senior scientist at Caltech's Center for Advanced Computing Research, and worked as vice president of software development for WebOS.

Thomas Sterling is a Professor of Computer Science at Louisiana State University, a Faculty Associate at California Institute of Technology, and a Distinguished Visiting Scientist at Oak Ridge National Laboratory.

William Gropp is Director of the Parallel Computing Institute and Thomas M. Siebel Chair in Computer Science at the University of Illinois Urbana-Champaign.

Ewing Lusk is Argonne Distinguished Fellow Emeritus at Argonne National Laboratory.

Table of Contents

Series Foreword
1 Introduction
1.1 A Brief History
1.2 The Beowulf Book
2 Overview of Beowulf Systems
2.1 What Is a Beowulf?
2.2 A TaXonomy of Parallel Computing
2.3 Benefits of Beowulf
2.4 A Critical Technology Convergence
2.5 The Beowulf System Node
2.6 The Beowulf Network
2.7 LinuX
2.8 Message Passing for Interprocessor Communication
2.9 Beowulf System Management
2.10 The Beowulf Challenge
3 Node Hardware
3.1 Overview of a Beowulf Node
3.2 Processors
3.3 Motherboard
3.4 Memory
3.5 BIOS
3.6 Secondary Storage
3.7 PCI Bus
3.8 EXamples of a Beowulf Node
3.9 BoXes, Shelves, Piles, and Racks
3.10 Node Assembly
4 The LinuX Operating System
4.1 History of LinuX
4.2 LinuX Kernels and LinuX Distributions
4.3 LinuX Features
4.4 File Systems
4.5 System Configuration
4.6 Tools for Program Development
4.7 LinuX's Unique Features
4.8 Installing an Initial System
4.9 Keeping Up with LinuX
4.10 Suggested References
5 Network Hardware and Software
5.1 Fast Ethernet
5.2 Alternative Network Technologies
5.3 TCP/IP
5.4 Sockets
5.5 Higher Level Protocols
5.6 Distributed File Systems
5.7 Remote Command EXecution
6 Managing Ensembles
6.1 System Access Models
6.2 Assigning Names
6.3 Cloning Nodes
6.4 Basic System Administration
6.5 Defending the Pack: Security Strategies
6.6 Job Scheduling
7 Parallel Applications
7.1 Parallelism
7.2 Broad Categories of Parallel Algorithms
7.3 Processlevel Parallelism
8 MPI A Userlevel Messagepassing Interface
8.1 History
8.2 MPI Basic Functionality
8.3 Parallel Data Structures withMPI
8.4 MPI Advanced Features
9 Programming with MPI A Detailed EXample
9.1 EXample: Sorting a List of Uniformly Distributed Integers
9.2 Analysis of Integer Sort
9.3 Measurement of Integer Sort
9.4 EXample: Sorting with Usersupplied Comparator
9.5 Analysis of a More General Sort
9.6 Summary
10 Conclusions and Views
10.1 New Generation Beowulfs
10.2 New Opportunities
10.3 True Costs
10.4 Total Work versus Peak Performance
10.5 Big Memory versus Outofcore
10.6 Bounding Influences on the Beowulf Domain
10.7 New Programming Models
10.8 Will LinuX Survive the Mass Market?
10.9 Final Thoughts
IndeX of Acronyms

Customer Reviews

Most Helpful Customer Reviews

See All Customer Reviews