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

  1. Introduction
  2. Criteria for good BSP design
  3. Example: broadcasting n values to p processes
  4. Interpreting call-graph information
  5. Identifying critical paths
  6. An architecture independent metric for critical paths
  7. Conclusions

Jonathan Hill
Last updated: June 14th 1997