PRO : A Model for the Design and Analysis of Efficient and Scalable Parallel Algorithms
Identifieur interne : 004516 ( Crin/Curation ); précédent : 004515; suivant : 004517PRO : A Model for the Design and Analysis of Efficient and Scalable Parallel Algorithms
Auteurs : Assefaw Hadish Gebremedhin ; Isabelle Guérin Lassous ; Jens Gustedt ; Jan Arne TelleSource :
English descriptors
Abstract
We present a new parallel computation model that enables the design of resource-optimal and scalable parallel algorithms and simplifies their analysis. The model rests on the following novel ideas : it incorporates optimality relative to a specific sequential algorithm as an integral part, and it measures the quality of a parallel algorithm in terms of granularity. Inspired by the BSP model, an algorithm in the PRO model is organized as a sequence of supersteps. The supersteps are not however required to be separated by synchronization barriers.
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: Pour aller vers cette notice dans l'étape Curation :004516
Links to Exploration step
CRIN:gebremedhin05aLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="323">PRO : A Model for the Design and Analysis of Efficient and Scalable Parallel Algorithms</title>
</titleStmt>
<publicationStmt><idno type="RBID">CRIN:gebremedhin05a</idno>
<date when="2005" year="2005">2005</date>
<idno type="wicri:Area/Crin/Corpus">004516</idno>
<idno type="wicri:Area/Crin/Curation">004516</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">004516</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">PRO : A Model for the Design and Analysis of Efficient and Scalable Parallel Algorithms</title>
<author><name sortKey="Gebremedhin, Assefaw Hadish" sort="Gebremedhin, Assefaw Hadish" uniqKey="Gebremedhin A" first="Assefaw Hadish" last="Gebremedhin">Assefaw Hadish Gebremedhin</name>
</author>
<author><name sortKey="Guerin Lassous, Isabelle" sort="Guerin Lassous, Isabelle" uniqKey="Guerin Lassous I" first="Isabelle" last="Guérin Lassous">Isabelle Guérin Lassous</name>
</author>
<author><name sortKey="Gustedt, Jens" sort="Gustedt, Jens" uniqKey="Gustedt J" first="Jens" last="Gustedt">Jens Gustedt</name>
</author>
<author><name sortKey="Telle, Jan Arne" sort="Telle, Jan Arne" uniqKey="Telle J" first="Jan Arne" last="Telle">Jan Arne Telle</name>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>complexity analysis</term>
<term>parallel algorithms</term>
<term>parallel computation models</term>
<term>parallel computers</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en" wicri:score="1201">We present a new parallel computation model that enables the design of resource-optimal and scalable parallel algorithms and simplifies their analysis. The model rests on the following novel ideas : it incorporates optimality relative to a specific sequential algorithm as an integral part, and it measures the quality of a parallel algorithm in terms of granularity. Inspired by the BSP model, an algorithm in the PRO model is organized as a sequence of supersteps. The supersteps are not however required to be separated by synchronization barriers.</div>
</front>
</TEI>
<BibTex type="techreport"><ref>gebremedhin05a</ref>
<crinnumber>A05-R-507</crinnumber>
<category>15</category>
<equipe>Department of Computer Science</equipe>
<author><e>Gebremedhin, Assefaw Hadish</e>
<e>Guérin Lassous, Isabelle</e>
<e>Gustedt, Jens</e>
<e>Telle, Jan Arne</e>
</author>
<title>PRO : A Model for the Design and Analysis of Efficient and Scalable Parallel Algorithms</title>
<year>2005</year>
<type>Rapport de recherche</type>
<keywords><e>parallel computers</e>
<e>parallel computation models</e>
<e>parallel algorithms</e>
<e>complexity analysis</e>
</keywords>
<abstract>We present a new parallel computation model that enables the design of resource-optimal and scalable parallel algorithms and simplifies their analysis. The model rests on the following novel ideas : it incorporates optimality relative to a specific sequential algorithm as an integral part, and it measures the quality of a parallel algorithm in terms of granularity. Inspired by the BSP model, an algorithm in the PRO model is organized as a sequence of supersteps. The supersteps are not however required to be separated by synchronization barriers.</abstract>
</BibTex>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Crin/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 004516 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Crin/Curation/biblio.hfd -nk 004516 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Crin |étape= Curation |type= RBID |clé= CRIN:gebremedhin05a |texte= PRO : A Model for the Design and Analysis of Efficient and Scalable Parallel Algorithms }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |