Graphical representations of program performance on hypercube message-passing multiprocessors
Using the Intel iPSC and NCUBE hypercubes as examples, the author shows how global performance of a message-passing multiprocessor can be reconstructed from event traces of message-passing activity for each constituent processor. He combines event traces from all processors into a single global-event trace, and uses this to compute a state trace for the entire network of processors. Seecube is an interactive graphical analysis tool for viewing these state traces. States are viewed as collections of scalar-execution parameters. The user defines a mapping from parameter values to colors for six different parameter types. Parts of the state of the network are displayed as colorations of otherwise static displays, where parameters are represented as immobile display objects and the object's color codes the value of its parameter. Several different views are provided. Any collection of views can be displayed while a sequencer plays back the state trace on every view simultaneously, in real time proportional to observed event timing. Observing channel state in large hypercube multiprocessors requires an efficient method for representing large-dimension hypercubes in the plane.
- Research Organization:
- Tufts Univ., Medford, MA (USA)
- OSTI ID:
- 5702726
- Resource Relation:
- Other Information: Thesis (Ph. D.)
- Country of Publication:
- United States
- Language:
- English
Similar Records
An efficient communication scheme for solving S[sub n] equations on message-passing multiprocessors
Distributed discrete-event simulation using null message algorithms of hypercube architectures