Publication detail

Simulating PRAM algorithms with TRANSIM

DVOŘÁK, V., STAROBA, J.

Original Title

Simulating PRAM algorithms with TRANSIM

English Title

Simulating PRAM algorithms with TRANSIM

Type

conference paper

Language

en

Original Abstract

It is shown that practical PRAM programming using existing TRANSIM tool can serve not only to debugging parallel programs, but also to tuning their performance. Moreover, performance of PRAM algorithms for a finite problem size and processor count can be used for comparison with performance obtained at execution of real parallel programs. The well known bitonic sorting algoritm is chosen as an example and two of its recent modifications are investigated. Results demonstrate easiness of prototyping, debugging, and tuning PRAM parallel programs as a first step before turning to real parallel machines.

English abstract

It is shown that practical PRAM programming using existing TRANSIM tool can serve not only to debugging parallel programs, but also to tuning their performance. Moreover, performance of PRAM algorithms for a finite problem size and processor count can be used for comparison with performance obtained at execution of real parallel programs. The well known bitonic sorting algoritm is chosen as an example and two of its recent modifications are investigated. Results demonstrate easiness of prototyping, debugging, and tuning PRAM parallel programs as a first step before turning to real parallel machines.

Keywords

Bitonic sort, APRAM, Transim, parallel computing, simulation

RIV year

2001

Released

01.01.2001

Location

Hradec nad Moravicí

ISBN

80-85988-57-7

Book

Proceedings of the 35th Spring International Conference Modelling and Simulation of Systems MOSIS 2001

Pages from

81

Pages to

86

Pages count

6

Documents

BibTex


@inproceedings{BUT5581,
  author="Václav {Dvořák} and Jiří {Staroba}",
  title="Simulating PRAM algorithms with TRANSIM",
  annote="It is shown that practical PRAM programming using existing TRANSIM tool can serve not only to debugging parallel programs, but also to tuning their performance. Moreover, performance of PRAM algorithms for a finite problem size and processor count can be used for comparison with performance obtained at execution of real parallel programs. The well known bitonic sorting algoritm is chosen as an example and two of its recent modifications are investigated. Results  demonstrate easiness of prototyping, debugging, and tuning PRAM parallel programs as a first step before turning to real parallel machines.",
  booktitle="Proceedings of the 35th Spring International Conference Modelling and Simulation of Systems MOSIS 2001",
  chapter="5581",
  year="2001",
  month="january",
  pages="81--86",
  type="conference paper"
}