Detail publikace

Prototyping Parallel Applications Based on Divide and Conquer Strategy

KUTÁLEK, V., DVOŘÁK, V.

Originální název

Prototyping Parallel Applications Based on Divide and Conquer Strategy

Typ

článek ve sborníku ve WoS nebo Scopus

Jazyk

angličtina

Originální abstrakt

The paper addresses a problem of parallel implementation of divide-and-conquer algorithms, whose performance is not always satisfactory. Questions like depth of recursion, multiple processes per processor, communication architecture and overhead, etc., are analyzed and the template for prototyping D&C algorithms in Transim language is explained. Prototypes of parallel D&C programs can be executed and their performance estimated before developing the code in detail. The technique is useful for programs with message passing as well as with shared variables. As an example a prototype of a parallel 1D-FFT benchmark targeted both to a distributed memory machine and to a SMP have been developed and simulated. The experiments show that the template can be used for quick estimation of performance and suitability of D&C approach in any given application.

Klíčová slova

Divide and conquer algorithms, parallel performance, parallel recursive FFT

Autoři

KUTÁLEK, V., DVOŘÁK, V.

Rok RIV

2002

Vydáno

25. 4. 2002

Místo

Ostrava

ISBN

80-85988-71-2

Kniha

Proceedings of 36th International Conference MOSIS '02 Modelling and Simulation of Systems

Edice

Vol. I

Strany od

313

Strany do

320

Strany počet

8

BibTex

@inproceedings{BUT9833,
  author="Vladimír {Kutálek} and Václav {Dvořák}",
  title="Prototyping Parallel Applications Based on Divide and Conquer Strategy",
  booktitle="Proceedings of 36th International Conference MOSIS '02 Modelling and Simulation of Systems",
  year="2002",
  series="Vol. I",
  pages="313--320",
  address="Ostrava",
  isbn="80-85988-71-2"
}