Limitations of the QRQW and EREW PRAM models
Identifieur interne : 000285 ( LNCS/Analysis ); précédent : 000284; suivant : 000286Limitations of the QRQW and EREW PRAM models
Auteurs : M. Kutylowski [Allemagne] ; K. Lorys [Allemagne]Source :
- Lecture notes in computer science [ 0302-9743 ] ; 1996.
Descripteurs français
- Pascal (Inist)
English descriptors
- KwdEn :
Abstract
We consider parallel random access machines (PRAMs) with restricted access to the shared memory resulting from handling congestion of memory requests. We study the (SIMD) QRQW PRAM model where multiple requests are queued and serviced one at a time. We also consider exclusive read exclusive write (EREW) PRAM and its modification obtained by adding a single bus. For the QRQW PRAMs we investigate the case when the machine can measure the duration of a single step. Even for such a (powerful) QRQW PRAM PARITY of n bits (PARITYn) requires Ω(logn) time while OR of n bits can be computed deterministically in a constant time. On randomized QRQW PRAM the function PARITYn is still difficult. We prove a lower time bound Ω(√logn/loglogn) for algorithms that succeed with probability 0.5 + ∈ (∈ > 0). These bounds show that implementing concurrent writes may degradate runtime of a CRCW PRAM algorithm. The simple 2-compaction problem is known to be hard for EREW PRAM. The same time bound Ω(√logn) for this problem has been proved for both deterministic and randomized EREW PRAM. We show that this is not a coincidence since the time complexity of this problem is the same for deterministic and randomized case. The technique which we apply is quite general and may be used to obtain similar results for any problem where the number of input configurations is small. We also show that improving time bound Ω(√logn) for 2-compaction on EREW PRAM requires novel and more sophisticated techniques.
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: 001388
- to stream PascalFrancis, to step Curation: 001604
- to stream PascalFrancis, to step Checkpoint: 001203
- to stream Main, to step Merge: 002D05
- to stream Main, to step Curation: 002825
- to stream Main, to step Exploration: 002825
- to stream LNCS, to step Extraction: 000285
Links to Exploration step
Pascal:97-0319515Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Limitations of the QRQW and EREW PRAM models</title>
<author><name sortKey="Kutylowski, M" sort="Kutylowski, M" uniqKey="Kutylowski M" first="M." last="Kutylowski">M. Kutylowski</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Heinz Nixdorf Institute and Dept. of Mathematics & Computer Science University of Paderborn</s1>
<s2>33095 Paderborn</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>Allemagne</country>
<wicri:noRegion>33095 Paderborn</wicri:noRegion>
<wicri:noRegion>Heinz Nixdorf Institute and Dept. of Mathematics & Computer Science University of Paderborn</wicri:noRegion>
<wicri:noRegion>Heinz Nixdorf Institute and Dept. of Mathematics & Computer Science University of Paderborn</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Lorys, K" sort="Lorys, K" uniqKey="Lorys K" first="K." last="Lorys">K. Lorys</name>
<affiliation wicri:level="4"><inist:fA14 i1="02"><s1>Institute of Computer Science, University of Wroclaw, and Dept. of Computer Science, University of Trier</s1>
<s2>54286 Trier</s2>
<s3>DEU</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Allemagne</country>
<wicri:noRegion>54286 Trier</wicri:noRegion>
<placeName><settlement type="city">Trèves (Allemagne)</settlement>
<region type="land" nuts="1">Rhénanie-Palatinat</region>
</placeName>
<orgName type="university">Université de Trèves</orgName>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">97-0319515</idno>
<date when="1996">1996</date>
<idno type="stanalyst">PASCAL 97-0319515 INIST</idno>
<idno type="RBID">Pascal:97-0319515</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">001388</idno>
<idno type="wicri:Area/PascalFrancis/Curation">001604</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">001203</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">001203</idno>
<idno type="wicri:doubleKey">0302-9743:1996:Kutylowski M:limitations:of:the</idno>
<idno type="wicri:Area/Main/Merge">002D05</idno>
<idno type="wicri:Area/Main/Curation">002825</idno>
<idno type="wicri:Area/Main/Exploration">002825</idno>
<idno type="wicri:Area/LNCS/Extraction">000285</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Limitations of the QRQW and EREW PRAM models</title>
<author><name sortKey="Kutylowski, M" sort="Kutylowski, M" uniqKey="Kutylowski M" first="M." last="Kutylowski">M. Kutylowski</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Heinz Nixdorf Institute and Dept. of Mathematics & Computer Science University of Paderborn</s1>
<s2>33095 Paderborn</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>Allemagne</country>
<wicri:noRegion>33095 Paderborn</wicri:noRegion>
<wicri:noRegion>Heinz Nixdorf Institute and Dept. of Mathematics & Computer Science University of Paderborn</wicri:noRegion>
<wicri:noRegion>Heinz Nixdorf Institute and Dept. of Mathematics & Computer Science University of Paderborn</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Lorys, K" sort="Lorys, K" uniqKey="Lorys K" first="K." last="Lorys">K. Lorys</name>
<affiliation wicri:level="4"><inist:fA14 i1="02"><s1>Institute of Computer Science, University of Wroclaw, and Dept. of Computer Science, University of Trier</s1>
<s2>54286 Trier</s2>
<s3>DEU</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Allemagne</country>
<wicri:noRegion>54286 Trier</wicri:noRegion>
<placeName><settlement type="city">Trèves (Allemagne)</settlement>
<region type="land" nuts="1">Rhénanie-Palatinat</region>
</placeName>
<orgName type="university">Université de Trèves</orgName>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="1996">1996</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algorithm</term>
<term>Computational complexity</term>
<term>Distributed memory multiprocessor system</term>
<term>Formal logic</term>
<term>Modeling</term>
<term>Open access</term>
<term>Parallel system</term>
<term>Storage access</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Système parallèle</term>
<term>Système multiprocesseur mémoire répartie</term>
<term>Accès mémoire</term>
<term>Accès libre</term>
<term>Algorithme</term>
<term>Modélisation</term>
<term>Logique formelle</term>
<term>Complexité calcul</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">We consider parallel random access machines (PRAMs) with restricted access to the shared memory resulting from handling congestion of memory requests. We study the (SIMD) QRQW PRAM model where multiple requests are queued and serviced one at a time. We also consider exclusive read exclusive write (EREW) PRAM and its modification obtained by adding a single bus. For the QRQW PRAMs we investigate the case when the machine can measure the duration of a single step. Even for such a (powerful) QRQW PRAM PARITY of n bits (PARITYn) requires Ω(logn) time while OR of n bits can be computed deterministically in a constant time. On randomized QRQW PRAM the function PARITYn is still difficult. We prove a lower time bound Ω(√logn/loglogn) for algorithms that succeed with probability 0.5 + ∈ (∈ > 0). These bounds show that implementing concurrent writes may degradate runtime of a CRCW PRAM algorithm. The simple 2-compaction problem is known to be hard for EREW PRAM. The same time bound Ω(√logn) for this problem has been proved for both deterministic and randomized EREW PRAM. We show that this is not a coincidence since the time complexity of this problem is the same for deterministic and randomized case. The technique which we apply is quite general and may be used to obtain similar results for any problem where the number of input configurations is small. We also show that improving time bound Ω(√logn) for 2-compaction on EREW PRAM requires novel and more sophisticated techniques.</div>
</front>
</TEI>
<affiliations><list><country><li>Allemagne</li>
</country>
<region><li>Rhénanie-Palatinat</li>
</region>
<settlement><li>Trèves (Allemagne)</li>
</settlement>
<orgName><li>Université de Trèves</li>
</orgName>
</list>
<tree><country name="Allemagne"><noRegion><name sortKey="Kutylowski, M" sort="Kutylowski, M" uniqKey="Kutylowski M" first="M." last="Kutylowski">M. Kutylowski</name>
</noRegion>
<name sortKey="Lorys, K" sort="Lorys, K" uniqKey="Lorys K" first="K." last="Lorys">K. Lorys</name>
</country>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/LNCS/Analysis
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000285 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/LNCS/Analysis/biblio.hfd -nk 000285 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Rhénanie |area= UnivTrevesV1 |flux= LNCS |étape= Analysis |type= RBID |clé= Pascal:97-0319515 |texte= Limitations of the QRQW and EREW PRAM models }}
![]() | This area was generated with Dilib version V0.6.31. | ![]() |