A BSP call-graph profiling tool
Jonathan
M.D. Hill, Stephen
Jarvis, Constantinos
Siniolakis, and Vasil
P. Vasilev
Oxford University Computing Laboratory

This WWW page is an extract from the paper:
Tables of contents
- Introduction
- Criteria for good BSP design
- Example: broadcasting n values to
p processes
- Interpreting call-graph information
- Identifying critical paths
- An architecture independent metric for critical paths
- Conclusions
Jonathan
Hill
Last updated: June 14th 1997