Results 1 -
3 of
3
Implementing Parallel Algorithms based on Prototype Evaluation and Transformation
- Department of Computer Science, University of Dortmund
, 1997
"... Combining parallel programming with prototyping is aimed at alleviating parallel programming by enabling the programmer to make practical experiments with ideas for parallel algorithms at a high level, neglecting low-level considerations of specific parallel architectures in the beginning of prog ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
Combining parallel programming with prototyping is aimed at alleviating parallel programming by enabling the programmer to make practical experiments with ideas for parallel algorithms at a high level, neglecting low-level considerations of specific parallel architectures in the beginning of program development. Therefore, prototyping parallel algorithms is aimed at bridging the gap between conceptual design of parallel algorithms and practical implementation on specific parallel systems. The essential prototyping activities are programming, evaluation and transformation of prototypes. This paper gives a report on some experience with implementing parallel algorithms based on prototype evaluation and transformation employing the ProSet-Linda approach. 1 Introduction Parallel programming is conceptually harder to undertake and to understand than sequential programming, because a programmer often has to cope with the coexistence and coordination of multiple parallel activities....
Network Simulation on Cray-T3E using MPI
- 3 rd Cray-SGI MPP conf
, 1997
"... We propose a novel approach for parallel discrete-event network simulation on packet-switched, point-to-point networks. Our algorithm resolves packet conflicts through priority sorting of appropriate integer conflict functions. We implement our method on CM-5, Cray-T3D, and Cray-T3E systems using C ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
We propose a novel approach for parallel discrete-event network simulation on packet-switched, point-to-point networks. Our algorithm resolves packet conflicts through priority sorting of appropriate integer conflict functions. We implement our method on CM-5, Cray-T3D, and Cray-T3E systems using C and MPI, and perform critical optimizations aimed at reducing sorting overhead, minimizing inter-processor communication, and optimizing scalar processing. Performance results for a packet-switched hypercube topology indicate that our parallel simulation approach achieves good scalability and efficiency; our optimized simulator can process ¸500K packet moves in 1sec, with an efficiency that exceeds ¸ 50% for a few thousands packets on the Cray-T3E with 32 PEs. 1 Introduction Simulation is a general approach for performance evaluation and testing of complex systems. Simulation speed depends on the system complexity and the efficiency of simulation algorithms. In discrete time-driven simulati...
Research Proposal Extension
"... Introduction We request renewal of access to KFA-Julich parallel computing facilities, and in particular the Cray-T3E systems, in order to develop further our research on parallel system interconnects. Our past activities and future work within our project's areas: (a) parallel simulation of ATM ro ..."
Abstract
- Add to MetaCart
Introduction We request renewal of access to KFA-Julich parallel computing facilities, and in particular the Cray-T3E systems, in order to develop further our research on parallel system interconnects. Our past activities and future work within our project's areas: (a) parallel simulation of ATM routers and networks, and (b) communication and consistency benchmarks of the Cray-T3E system architecture are briefly described below. 2 ATM Switch and Network Simulator The first part of the proposal considers the implementation of a discrete-event, parallel simulator of ATM switches and large ATM networks. Parallel simulation of ATM and communication networks offers natural parallelism. Events from different switches which occur during the same clock cycle are completely independent. They can be scheduled to different processors without any conflicts. Interprocessor communication is only needed to support duality of events at the end of each simulated clock-cycle. A data parallel approa

