๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A Methodology for Visualizing Performance of Loosely Synchronous Programs

โœ Scribed by S.R. Sarukkai; D. Kimelman; L. Rudolph

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
868 KB
Volume
18
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

โœฆ Synopsis

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. C 1993 Academic Press. Inc.

๐Ÿ“œ SIMILAR VOLUMES

A Methodology for Building Application-S
A Methodology for Building Application-Specific Visualizations of Parallel Programs
โœ J.T. Stasko; E. Kraemer ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 663 KB

An application-specific visualization of a parallel program presents the inherent application domain, semantics, and data being manipulated by the program in a manner natural to one's understanding of the program. In this paper we discuss why application-specific views are necessary for program debu

Simple: A Methodology for Programming Hi
Simple: A Methodology for Programming High Performance Algorithms on Clusters of Symmetric Multiprocessors (SMPs)
โœ David A. Bader; Joseph JรกJรก ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 252 KB

We describe a methodology for developing high performance programs running on clusters of SMP nodes. The SMP cluster programming methodology is based on a small prototype kernel (Simple) of collective communication primitives that make efficient use of the hybrid shared and message-passing environme

A Methodology for Granularity-Based Cont
A Methodology for Granularity-Based Control of Parallelism in Logic Programs
โœ P. LOPEZ; M. HERMENEGILDO; S. DEBRAY ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 674 KB

Several types of parallelism can be exploited in logic programs while preserving correctness and efficiency, i.e. ensuring that the parallel execution obtains the same results as the sequential one and the amount of work performed is not greater. However, such results do not take into account a numb

The use of dynamic programming methodolo
The use of dynamic programming methodology for the solution of a class of nonlinear programming problems
โœ Mary W. Cooper ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 344 KB

## Abstract This paper presents an application of a method for finding the global solution to a problem in integers with a separable objective function of a very general form. This report shows that there is a relationship between an integer problem with a separable nonlinear objective function and