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

Performance analysis of parallel programs based on model calculations

โœ Scribed by Georg Fleischmann; Matthias Gente; Fridolin Hofmann; Gunter Bolch


Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
937 KB
Volume
20
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Automatic model generation for performan
โœ Hermann Mierendorff; Helmut Schwamborn ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 165 KB

A hybrid method for performance modeling of parallel programs is considered where the runtime of large sequential segments is estimated statically and the parallel program structure is evaluated by simulation. The present paper describes a way to generate a model of a given program automatically fro

On the performance of pure and impure pa
โœ A.P. Willem Bรถhm; Jeffrey P. Hammes; Sumit S. Sur ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 576 KB

This paper reports on the memory performance of parallel scientiยฎc algorithms, written in both pure and impure functional styles. The Id programming language is used, since it allows both pure and impure parallel functional programs to be expressed. The non-strict storage model of Id is introduced.

A comparative analysis of parallel progr
โœ Vanderwiel, Steven P.; Nathanson, Daphna; Lilja, David J. ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 136 KB ๐Ÿ‘ 2 views

Several parallel programming languages, libraries and environments have been developed to ease the task of writing programs for multiprocessors. Proponents of each approach often point out various language features that are designed to provide the programmer with a simple programming interface. Howe

Performance modeling and analysis of cor
โœ Wei-Ming Lin ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 330 KB

A performance analysis methodology for correlated parallel computations based on statistical theory is proposed. Divide-and-conquer strategy is widely used in solving problems in parallel by partitioning and allocating a number of given tasks to available computing resources. When the tasks exhibit