did-you-know? rent-now

Amazon no longer offers textbook rentals. We do!

did-you-know? rent-now

Amazon no longer offers textbook rentals. We do!

We're the #1 textbook rental company. Let us show you why.

9780262692182

How to Build a Beowulf : A Guide to the Implementation and Application of PC Clusters, Scientific and Engineering Computation

by
  • ISBN13:

    9780262692182

  • ISBN10:

    026269218X

  • Format: Paperback
  • Copyright: 1999-05-28
  • Publisher: Mit Pr

Note: Supplemental materials are not guaranteed with Rental or Used book purchases.

Purchase Benefits

List Price: $50.00 Save up to $12.50
  • Buy Used
    $37.50
    Add to Cart Free Shipping Icon Free Shipping

    USUALLY SHIPS IN 2-4 BUSINESS DAYS

Supplemental Materials

What is included with this book?

Summary

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.

Table of Contents

Series Foreword xiii
Foreword xv
Preface xix
Introduction
1(8)
A Brief History
2(2)
The Beowulf Book
4(5)
Overview of Beowulf Systems
9(16)
What Is a Beowulf?
9(3)
A Taxonomy of Parallel Computing
12(1)
Benefits of Beowulf
13(1)
A Critical Technology Convergence
14(2)
The Beowulf System Node
16(2)
The Beowulf Network
18(1)
Linux
19(1)
Message Passing for Interprocessor Communication
20(1)
Beowulf System Management
21(1)
The Beowulf Challenge
21(4)
Node Hardware
25(38)
Overview of a Beowulf Node
26(6)
Principal Specifications
28(1)
Basic Elements
29(3)
Processors
32(4)
Intel Pentium II
33(1)
DEC Alpha
34(1)
AMD K6
34(1)
Future Processors
34(2)
Motherboard
36(6)
A Typical Beowulf Motherboard
37(1)
Selection Considerations
37(1)
Layout of Major Components
38(4)
Memory
42(4)
Memory Capacity
42(1)
Memory Speed
42(1)
Memory Types
43(1)
Memory Hierarchy---L1 and L2 Caches
44(2)
Package Styles
46(1)
BIOS
46(1)
Secondary Storage
47(1)
PCI Bus
48(1)
Examples of a Beowulf Node
49(2)
Intel Pentium II Based Node
50(1)
DEC Alpha Based Node
50(1)
Boxes, Shelves, Piles, and Racks
51(1)
Node Assembly
52(11)
Motherboard Pre-assembly
54(1)
The Case
55(1)
Minimal Peripherals
56(1)
Booting the System
57(2)
Installing the Other Components
59(1)
Troubleshooting a PC that Won't Boot
60(3)
The Linux Operating System
63(30)
History of Linux
64(2)
Linux Kernels and Linux Distributions
66(1)
Linux Features
67(3)
File Systems
70(3)
System Configuration
73(3)
Tools for Program Development
76(7)
Linux's Unique Features
83(1)
Installing an Initial System
84(5)
Installation by CD or Network?
85(1)
Installation Summary
86(3)
Keeping Up with Linux
89(2)
Suggested References
91(2)
Web Sites
91(1)
Books
92(1)
Network Hardware and Software
93(30)
Fast Ethernet
93(9)
Ethernet Arbitration
94(1)
Packet Format
95(2)
NIC Architecture
97(2)
Hubs and Switches
99(2)
Gigabit Ethernet
101(1)
Alternative Network Technologies
102(3)
Asynchronous Transfer Mode
102(1)
FDDI
103(1)
Scalable Coherenet Interface
104(1)
Myrinet
104(1)
TCP/IP
105(3)
IP Addresses
106(1)
Zero-copy Protocols
107(1)
Sockets
108(4)
Higher Level Protocols
112(6)
Remote Procedure Calls
113(2)
Distributed Objects: CORBA and Java RMI
115(3)
Distributed File Systems
118(2)
NFS
118(1)
AFS
119(1)
Autofs: The Automounter
120(1)
Remote Command Execution
120(3)
BSD R Commands
120(1)
SSH---The Secure Shell
121(2)
Managing Ensembles
123(22)
System Access Models
123(2)
The Stand-alone System
123(1)
The Universally Accessible Machine
124(1)
The Guarded Beowulf
124(1)
Assigning Names
125(2)
Dynamically Assigned Addresses
126(1)
Cloning Nodes
127(5)
Creating Tar Images
128(1)
Setting up a Clone Root Partition
129(1)
Setting up BOOTP
129(2)
Building a Boot Clone Floppy
131(1)
Basic System Administration
132(5)
Booting and Shutting Down
133(1)
The Node File System
133(2)
Account Management
135(1)
PRSH---Parallel Remote Shell
136(1)
Defending the Pack: Security Strategies
137(6)
System Configuration
138(1)
IP Masquerading
138(3)
Restricting Host Access
141(1)
SSH: Secure Shell Revisited
142(1)
Job Scheduling
143(2)
Parallel Applications
145(18)
Parallelism
145(3)
Broad Categories of Parallel Algorithms
148(5)
Regular and Irregular
148(1)
Synchronous and Asynchronous
149(1)
Coarse and Fine Grained
149(1)
Bandwidth Greedy and Frugal
150(1)
Latency Tolerant and Intolerant
151(1)
Distributed and Shared Address Spaces
152(1)
Beowulf Systems and Choices of Parallelism
153(1)
Process-level Parallelism
153(10)
Example: Ray Tracing Animation
153(3)
Utilities for Process-parallel Computing
156(3)
Overheads---RSH and File I/O
159(1)
Summary
160(3)
MPI---A User-level Message-passing Interface
163(28)
History
163(1)
MPI Basic Functionality
164(9)
Example: ``Hello World'' in MPI
165(8)
Parallel Data Structures with MPI
173(12)
Example: A Parallel Array
174(6)
Example: A One-dimensional Cellular Automaton
180(5)
MPI Advanced Features
185(6)
Blocking and Non-blocking Calls and Alternative Sending Modes
185(2)
Virtual Topologies and Attribute Caching
187(1)
Derived Data Types
187(1)
Intercommunicators
188(1)
MPI-2
188(3)
Programming with MPI---A Detailed Example
191(30)
Example: Sorting a List of Uniformly Distributed Integers
193(6)
Analysis of Integer Sort
199(2)
Communication
199(1)
Redundancy
200(1)
Extra Work
200(1)
Load Imbalance
200(1)
Waiting
201(1)
Measurement of Integer Sort
201(8)
Example: Sorting with User-supplied Comparator
209(3)
Analysis of a More General Sort
212(6)
Choosing the Number of Fenceposts
216(2)
Summary
218(3)
Conclusions and Views
221(12)
New Generation Beowulfs
221(2)
New Opportunities
223(2)
Databases
223(1)
Web Servers
223(1)
Dynamic Interactive Simulation
223(1)
Virtual Reality
224(1)
Process Control
224(1)
Artificial Intelligence
224(1)
Genetic Programming
224(1)
True Costs
225(2)
Total Work versus Peak Performance
227(1)
Big Memory versus Out-of-core
228(1)
Bounding Influences on the Beowulf Domain
228(2)
New Programming Models
230(1)
Will Linux Survive the Mass Market?
231(1)
Final Thoughts
232(1)
Index of Acronyms 233(4)
Index 237

Supplemental Materials

What is included with this book?

The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.

The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.

Rewards Program