About: Prototyping Parallel Aplications Based on Divide and Conquer Strategy     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • 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 wwith 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.
  • 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 wwith 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. (en)
Title
  • Prototyping Parallel Aplications Based on Divide and Conquer Strategy
  • Prototyping Parallel Aplications Based on Divide and Conquer Strategy (en)
skos:prefLabel
  • Prototyping Parallel Aplications Based on Divide and Conquer Strategy
  • Prototyping Parallel Aplications Based on Divide and Conquer Strategy (en)
skos:notation
  • RIV/00216305:26230/02:PU36193!RIV/2003/MSM/262303/N
http://linked.open.../vavai/riv/strany
  • 313-320
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • Z(MSM 262200012)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 660971
http://linked.open...ai/riv/idVysledku
  • RIV/00216305:26230/02:PU36193
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Divide and conquer algorithms, parallel performance, parallel recursive FFT (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [428E6A99695E]
http://linked.open...v/mistoKonaniAkce
  • Rožnov pod Radhoštěm
http://linked.open...i/riv/mistoVydani
  • Ostrava
http://linked.open...i/riv/nazevZdroje
  • Proceedings of 36th International Conference MOSIS '02 Modelling and Simulation of Systems
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...ocetUcastnikuAkce
http://linked.open...nichUcastnikuAkce
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Dvořák, Václav
  • Kutálek, Vladimír
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • Neuveden
https://schema.org/isbn
  • 80-85988-71-2
http://localhost/t...ganizacniJednotka
  • 26230
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 84 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software