Message passing in computer clusters
Message passing is an inherent element of all computer clusters. All computer clusters, ranging from homemade Beowulfs to some of the fastest supercomputers in the world, rely on message passing to coordinate the activities of the many nodes they encompass. Message passing in computer clusters built with commodity servers and switches is used by virtually every internet service.
- Comment
- enMessage passing is an inherent element of all computer clusters. All computer clusters, ranging from homemade Beowulfs to some of the fastest supercomputers in the world, rely on message passing to coordinate the activities of the many nodes they encompass. Message passing in computer clusters built with commodity servers and switches is used by virtually every internet service.
- Depiction
- Has abstract
- enMessage passing is an inherent element of all computer clusters. All computer clusters, ranging from homemade Beowulfs to some of the fastest supercomputers in the world, rely on message passing to coordinate the activities of the many nodes they encompass. Message passing in computer clusters built with commodity servers and switches is used by virtually every internet service. Recently, the use of computer clusters with more than one thousand nodes has been spreading. As the number of nodes in a cluster increases, the rapid growth in the complexity of the communication subsystem makes message passing delays over the interconnect a serious performance issue in the execution of parallel programs. Specific tools may be used to simulate, visualize and understand the performance of message passing on computer clusters. Before a large computer cluster is assembled, a trace-based simulator can use a small number of nodes to help predict the performance of message passing on larger configurations. Following test runs on a small number of nodes, the simulator reads the execution and message transfer log files and simulates the performance of the messaging subsystem when many more messages are exchanged between a much larger number of nodes.
- Hypernym
- Element
- Is primary topic of
- Message passing in computer clusters
- Label
- enMessage passing in computer clusters
- Link from a Wikipage to another Wikipage
- Asymptotic bandwidth
- Beowulf cluster
- BIGSIM
- C (programming language)
- Cache (computing)
- Category:Cluster computing
- Category:Inter-process communication
- Category:Supercomputing
- C language
- Computer cluster
- Computer data logging
- DARPA
- Discrete-event simulation
- FeiTeng-1000
- File:MEGWARE.CLIC.jpg
- File:Roadrunner supercomputer HiRes.jpg
- File:Virginia tech xserve cluster.jpg
- Fortran
- High-availability cluster
- IP
- Job scheduling
- Latency (engineering)
- Locale (computer hardware)
- Message passing
- Message Passing Interface
- MPICH
- National Science Foundation
- Network switch
- Network topology
- Nvidia Tesla
- Oak Ridge National Laboratory
- Open MPI
- Parallel program
- Parallel Virtual Machine
- Performance simulation
- Point to point communication
- Probability distributions
- Profiling (computer programming)
- Python (programming language)
- Server (computing)
- Supercomputer
- Supercomputers
- Supercomputing
- Switched fabric
- Tianhe-I
- Trace-based simulator
- Xeon
- SameAs
- 4rn8B
- m.0j 5whk
- Q6821791
- Subject
- Category:Cluster computing
- Category:Inter-process communication
- Category:Supercomputing
- Thumbnail
- WasDerivedFrom
- Message passing in computer clusters?oldid=1085032315&ns=0
- WikiPageLength
- 14201
- Wikipage page ID
- 36044569
- Wikipage revision ID
- 1085032315
- WikiPageUsesTemplate
- Template:Parallel Computing
- Template:Reflist
- Template:Short description
