𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A scalable debugger for massively parallel message-passing programs

✍ Scribed by Sistare, S.; Allen, D.; Bowker, R.; Jourdenais, K.; Simons, J.; Title, R.


Book ID
118691551
Publisher
IEEE
Year
1994
Tongue
English
Weight
816 KB
Volume
2
Category
Article
ISSN
1063-6552

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A Communication Architecture for a Massi
✍ C. Germain; J.L. Bechennec; D. Etiemble; J.P. Sansonnet πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 916 KB

Communication networks stress the distinction between classical and massively parallel architectures. The network is the key for the whole architecture efficiency, while severe technological constraints limit the possible choices. This paper presents forced routing, which is the routing strategy of

High-level abstractions for message-pass
✍ Fan Chan; Jiannong Cao; Yudong Sun πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 684 KB

Large-scale scientific and engineering computation problems are usually complex and consequently the development of parallel programs for solving these problems is a difficult task. In this paper, we describe the graph-oriented programming (GOP) model and environment for building and evaluating para

Trace reduction for performance improvem
✍ Fumihiko Ino; Yuki Kanbe; Masao Okita; Kenichi Hagihara πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 794 KB

## Abstract This paper proposes a trace reduction method for assessing the improvability of the performance of message passing parallel programs. This assessment is based on a what‐if prediction approach that forecasts future program performance, for example, the execution time if the target progra

A scalable tool architecture for diagnos
✍ Markus Geimer; Felix Wolf; Brian J.N. Wylie; Bernd Mohr πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 772 KB

When scaling message-passing applications to thousands of processors, their performance is often affected by wait states that occur when processes fail to reach synchronization points simultaneously. As a first step in reducing the performance impact, we have shown in our earlier work that wait stat