A methodology for visualizing performance of loosely synchronous programs

Abstract

We introduce a new set of views for displaying the progress of loosely synchronous computations involving large numbers of processors on large problems. We suggest a methodology for employing these views in succession in order to gain progressively more detail concerning program behavior. At each step, focus is refined to include just those program sections or processors which have been determined to be bottlenecks. We present our experience in using this methodology to uncover performance problems in selected applications. © 1993 Academic Press, Inc.