Limitations of the QRQW and EREW PRAM models
Identifieur interne :
001604 ( PascalFrancis/Curation );
précédent :
001603;
suivant :
001605
Limitations of the QRQW and EREW PRAM models
Auteurs : M. Kutylowski [
Allemagne] ;
K. Lorys [
Allemagne]
Source :
-
Lecture notes in computer science [ 0302-9743 ] ; 1996.
RBID : Pascal:97-0319515
Descripteurs français
English descriptors
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.
| pA |
| A01 | 01 | 1 | | @0 0302-9743 |
|---|
| A05 | | | | @2 1180 |
|---|
| A08 | 01 | 1 | ENG | @1 Limitations of the QRQW and EREW PRAM models |
|---|
| A09 | 01 | 1 | ENG | @1 Foundations of software technology and theoretical computer science : Hyderabad, December 18-20, 1996 |
|---|
| A11 | 01 | 1 | | @1 KUTYLOWSKI (M.) |
|---|
| A11 | 02 | 1 | | @1 LORYS (K.) |
|---|
| A12 | 01 | 1 | | @1 CHANDRU (V.) @9 ed. |
|---|
| A12 | 02 | 1 | | @1 VINAY (V.) @9 ed. |
|---|
| A14 | 01 | | | @1 Heinz Nixdorf Institute and Dept. of Mathematics & Computer Science University of Paderborn @2 33095 Paderborn @3 DEU @Z 1 aut. |
|---|
| A14 | 02 | | | @1 Institute of Computer Science, University of Wroclaw, and Dept. of Computer Science, University of Trier @2 54286 Trier @3 DEU @Z 2 aut. |
|---|
| A20 | | | | @1 310-321 |
|---|
| A21 | | | | @1 1996 |
|---|
| A23 | 01 | | | @0 ENG |
|---|
| A43 | 01 | | | @1 INIST @2 16343 @5 354000064022430270 |
|---|
| A44 | | | | @0 0000 @1 © 1997 INIST-CNRS. All rights reserved. |
|---|
| A45 | | | | @0 12 ref. |
|---|
| A47 | 01 | 1 | | @0 97-0319515 |
|---|
| A60 | | | | @1 P @2 C |
|---|
| A61 | | | | @0 A |
|---|
| A64 | 01 | 1 | | @0 Lecture notes in computer science |
|---|
| A66 | 01 | | | @0 DEU |
|---|
| A66 | 02 | | | @0 USA |
|---|
| C01 | 01 | | ENG | @0 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. |
|---|
| C02 | 01 | X | | @0 001D02B04 |
|---|
| C02 | 02 | X | | @0 001D02A05 |
|---|
| C03 | 01 | X | FRE | @0 Système parallèle @5 01 |
|---|
| C03 | 01 | X | ENG | @0 Parallel system @5 01 |
|---|
| C03 | 01 | X | SPA | @0 Sistema paralelo @5 01 |
|---|
| C03 | 02 | X | FRE | @0 Système multiprocesseur mémoire répartie @5 02 |
|---|
| C03 | 02 | X | ENG | @0 Distributed memory multiprocessor system @5 02 |
|---|
| C03 | 02 | X | SPA | @0 Sistema multiprocesador memoria distribuida @5 02 |
|---|
| C03 | 03 | X | FRE | @0 Accès mémoire @5 03 |
|---|
| C03 | 03 | X | ENG | @0 Storage access @5 03 |
|---|
| C03 | 03 | X | SPA | @0 Acceso memoria @5 03 |
|---|
| C03 | 04 | X | FRE | @0 Accès libre @5 04 |
|---|
| C03 | 04 | X | ENG | @0 Open access @5 04 |
|---|
| C03 | 04 | X | SPA | @0 Acceso libre @5 04 |
|---|
| C03 | 05 | X | FRE | @0 Algorithme @5 05 |
|---|
| C03 | 05 | X | ENG | @0 Algorithm @5 05 |
|---|
| C03 | 05 | X | GER | @0 Algorithmus @5 05 |
|---|
| C03 | 05 | X | SPA | @0 Algoritmo @5 05 |
|---|
| C03 | 06 | X | FRE | @0 Modélisation @5 06 |
|---|
| C03 | 06 | X | ENG | @0 Modeling @5 06 |
|---|
| C03 | 06 | X | SPA | @0 Modelización @5 06 |
|---|
| C03 | 07 | X | FRE | @0 Logique formelle @5 07 |
|---|
| C03 | 07 | X | ENG | @0 Formal logic @5 07 |
|---|
| C03 | 07 | X | SPA | @0 Lógica formal @5 07 |
|---|
| C03 | 08 | X | FRE | @0 Complexité calcul @5 08 |
|---|
| C03 | 08 | X | ENG | @0 Computational complexity @5 08 |
|---|
| C03 | 08 | X | SPA | @0 Complejidad computación @5 08 |
|---|
| N21 | | | | @1 181 |
|---|
|
|---|
| pR |
| A30 | 01 | 1 | ENG | @1 Foundations of software technology and theoretical computer science. Conference @2 16 @3 Hyderabad IND @4 1996-12-18 |
|---|
|
|---|
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: Pour aller vers cette notice dans l'étape Curation :001388
Links to Exploration step
Pascal:97-0319515
Le 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>
</affiliation><author><name sortKey="Lorys, K" sort="Lorys, K" uniqKey="Lorys K" first="K." last="Lorys">K. Lorys</name>
<affiliation wicri:level="1"><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>
</affiliation><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>
</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>
</affiliation><author><name sortKey="Lorys, K" sort="Lorys, K" uniqKey="Lorys K" first="K." last="Lorys">K. Lorys</name>
<affiliation wicri:level="1"><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>
</affiliation><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><seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt><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><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><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01><fA05><s2>1180</s2>
</fA05><fA08 i1="01" i2="1" l="ENG"><s1>Limitations of the QRQW and EREW PRAM models</s1>
</fA08><fA09 i1="01" i2="1" l="ENG"><s1>Foundations of software technology and theoretical computer science : Hyderabad, December 18-20, 1996</s1>
</fA09><fA11 i1="01" i2="1"><s1>KUTYLOWSKI (M.)</s1>
</fA11><fA11 i1="02" i2="1"><s1>LORYS (K.)</s1>
</fA11><fA12 i1="01" i2="1"><s1>CHANDRU (V.)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="02" i2="1"><s1>VINAY (V.)</s1>
<s9>ed.</s9>
</fA12><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>
</fA14><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>
</fA14><fA20><s1>310-321</s1>
</fA20><fA21><s1>1996</s1>
</fA21><fA23 i1="01"><s0>ENG</s0>
</fA23><fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000064022430270</s5>
</fA43><fA44><s0>0000</s0>
<s1>© 1997 INIST-CNRS. All rights reserved.</s1>
</fA44><fA45><s0>12 ref.</s0>
</fA45><fA47 i1="01" i2="1"><s0>97-0319515</s0>
</fA47><fA60><s1>P</s1>
<s2>C</s2>
</fA60><fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0>
</fA64><fA66 i1="01"><s0>DEU</s0>
</fA66><fA66 i1="02"><s0>USA</s0>
</fA66><fC01 i1="01" l="ENG"><s0>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.</s0>
</fC01><fC02 i1="01" i2="X"><s0>001D02B04</s0>
</fC02><fC02 i1="02" i2="X"><s0>001D02A05</s0>
</fC02><fC03 i1="01" i2="X" l="FRE"><s0>Système parallèle</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="ENG"><s0>Parallel system</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="SPA"><s0>Sistema paralelo</s0>
<s5>01</s5>
</fC03><fC03 i1="02" i2="X" l="FRE"><s0>Système multiprocesseur mémoire répartie</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="X" l="ENG"><s0>Distributed memory multiprocessor system</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="X" l="SPA"><s0>Sistema multiprocesador memoria distribuida</s0>
<s5>02</s5>
</fC03><fC03 i1="03" i2="X" l="FRE"><s0>Accès mémoire</s0>
<s5>03</s5>
</fC03><fC03 i1="03" i2="X" l="ENG"><s0>Storage access</s0>
<s5>03</s5>
</fC03><fC03 i1="03" i2="X" l="SPA"><s0>Acceso memoria</s0>
<s5>03</s5>
</fC03><fC03 i1="04" i2="X" l="FRE"><s0>Accès libre</s0>
<s5>04</s5>
</fC03><fC03 i1="04" i2="X" l="ENG"><s0>Open access</s0>
<s5>04</s5>
</fC03><fC03 i1="04" i2="X" l="SPA"><s0>Acceso libre</s0>
<s5>04</s5>
</fC03><fC03 i1="05" i2="X" l="FRE"><s0>Algorithme</s0>
<s5>05</s5>
</fC03><fC03 i1="05" i2="X" l="ENG"><s0>Algorithm</s0>
<s5>05</s5>
</fC03><fC03 i1="05" i2="X" l="GER"><s0>Algorithmus</s0>
<s5>05</s5>
</fC03><fC03 i1="05" i2="X" l="SPA"><s0>Algoritmo</s0>
<s5>05</s5>
</fC03><fC03 i1="06" i2="X" l="FRE"><s0>Modélisation</s0>
<s5>06</s5>
</fC03><fC03 i1="06" i2="X" l="ENG"><s0>Modeling</s0>
<s5>06</s5>
</fC03><fC03 i1="06" i2="X" l="SPA"><s0>Modelización</s0>
<s5>06</s5>
</fC03><fC03 i1="07" i2="X" l="FRE"><s0>Logique formelle</s0>
<s5>07</s5>
</fC03><fC03 i1="07" i2="X" l="ENG"><s0>Formal logic</s0>
<s5>07</s5>
</fC03><fC03 i1="07" i2="X" l="SPA"><s0>Lógica formal</s0>
<s5>07</s5>
</fC03><fC03 i1="08" i2="X" l="FRE"><s0>Complexité calcul</s0>
<s5>08</s5>
</fC03><fC03 i1="08" i2="X" l="ENG"><s0>Computational complexity</s0>
<s5>08</s5>
</fC03><fC03 i1="08" i2="X" l="SPA"><s0>Complejidad computación</s0>
<s5>08</s5>
</fC03><fN21><s1>181</s1>
</fN21><pR><fA30 i1="01" i2="1" l="ENG"><s1>Foundations of software technology and theoretical computer science. Conference</s1>
<s2>16</s2>
<s3>Hyderabad IND</s3>
<s4>1996-12-18</s4>
</fA30>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/PascalFrancis/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001604 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Curation/biblio.hfd -nk 001604 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= PascalFrancis
|étape= Curation
|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.
Data generation: Sat Jul 22 16:29:01 2017. Site generation: Wed Feb 28 14:55:37 2024 |  |
