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
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
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
## 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
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