A work-optimal coarse-grained PRAM algorithm for Lexicographically First Maximal Independent Set
Identifieur interne :
000687 ( PascalFrancis/Corpus );
précédent :
000686;
suivant :
000688
A work-optimal coarse-grained PRAM algorithm for Lexicographically First Maximal Independent Set
Auteurs : Jens Gustedt ;
Jan Arne TelleSource :
-
Lecture notes in computer science [ 0302-9743 ] ; 2003.
RBID : Pascal:04-0212566
Descripteurs français
English descriptors
Abstract
The Lexicographically First Maximal Independent Set Problem on graphs with bounded degree 3 is at most n-complete, and thus very likely not parallelizable in a fine-grained setting. On the other hand, we show that in a coarse-grained setting (few processors and a lot of data) the situation is different, by giving a work-optimal algorithm on a shared memory machine for n and p such that p log p E O(log n).
Notice en format standard (ISO 2709)
Pour connaître la documentation sur le format Inist Standard.
| pA |
| A01 | 01 | 1 | | @0 0302-9743 |
|---|
| A05 | | | | @2 2841 |
|---|
| A08 | 01 | 1 | ENG | @1 A work-optimal coarse-grained PRAM algorithm for Lexicographically First Maximal Independent Set |
|---|
| A09 | 01 | 1 | ENG | @1 Theoretical computer science : Bertinoro, 13-15 October 2003 |
|---|
| A11 | 01 | 1 | | @1 GUSTEDT (Jens) |
|---|
| A11 | 02 | 1 | | @1 TELLE (Jan Arne) |
|---|
| A12 | 01 | 1 | | @1 BLUNDO (Carlo) @9 ed. |
|---|
| A12 | 02 | 1 | | @1 LANEVE (Cosimo) @9 ed. |
|---|
| A14 | 01 | | | @1 LORIA & INRIA Lorraine @3 FRA @Z 1 aut. |
|---|
| A14 | 02 | | | @1 University of Bergen @2 Bergen @3 NOR @Z 2 aut. |
|---|
| A20 | | | | @1 125-136 |
|---|
| A21 | | | | @1 2003 |
|---|
| A23 | 01 | | | @0 ENG |
|---|
| A26 | 01 | | | @0 3-540-20216-1 |
|---|
| A43 | 01 | | | @1 INIST @2 16343 @5 354000117802520090 |
|---|
| A44 | | | | @0 0000 @1 © 2004 INIST-CNRS. All rights reserved. |
|---|
| A45 | | | | @0 14 ref. |
|---|
| A47 | 01 | 1 | | @0 04-0212566 |
|---|
| A60 | | | | @1 P @2 C |
|---|
| A61 | | | | @0 A |
|---|
| A64 | 01 | 1 | | @0 Lecture notes in computer science |
|---|
| A66 | 01 | | | @0 DEU |
|---|
| C01 | 01 | | ENG | @0 The Lexicographically First Maximal Independent Set Problem on graphs with bounded degree 3 is at most n-complete, and thus very likely not parallelizable in a fine-grained setting. On the other hand, we show that in a coarse-grained setting (few processors and a lot of data) the situation is different, by giving a work-optimal algorithm on a shared memory machine for n and p such that p log p E O(log n). |
|---|
| C02 | 01 | X | | @0 001D02A06 |
|---|
| C03 | 01 | X | FRE | @0 Informatique théorique @5 01 |
|---|
| C03 | 01 | X | ENG | @0 Computer theory @5 01 |
|---|
| C03 | 01 | X | SPA | @0 Informática teórica @5 01 |
|---|
| C03 | 02 | X | FRE | @0 Algorithme optimal @5 09 |
|---|
| C03 | 02 | X | ENG | @0 Optimal algorithm @5 09 |
|---|
| C03 | 02 | X | SPA | @0 Algoritmo óptimo @5 09 |
|---|
| C03 | 03 | X | FRE | @0 Mémoire partagée @5 10 |
|---|
| C03 | 03 | X | ENG | @0 Shared memory @5 10 |
|---|
| C03 | 03 | X | SPA | @0 Memoria compartida @5 10 |
|---|
| C03 | 04 | X | FRE | @0 Structure gros grain @5 18 |
|---|
| C03 | 04 | X | ENG | @0 Coarse grain structure @5 18 |
|---|
| C03 | 04 | X | SPA | @0 Estructura grano grueso @5 18 |
|---|
| C03 | 05 | X | FRE | @0 Ensemble indépendant @5 19 |
|---|
| C03 | 05 | X | ENG | @0 Independent set @5 19 |
|---|
| C03 | 05 | X | SPA | @0 Conjunto independiente @5 19 |
|---|
| C03 | 06 | X | FRE | @0 Graphe maximal @5 20 |
|---|
| C03 | 06 | X | ENG | @0 Maximal graph @5 20 |
|---|
| C03 | 06 | X | SPA | @0 Grafo máximo @5 20 |
|---|
| C03 | 07 | X | FRE | @0 Degré graphe @5 21 |
|---|
| C03 | 07 | X | ENG | @0 Graph degree @5 21 |
|---|
| C03 | 07 | X | SPA | @0 Grado grafo @5 21 |
|---|
| C03 | 08 | X | FRE | @0 Graphe indépendant @4 CD @5 96 |
|---|
| C03 | 08 | X | ENG | @0 Independent graph @4 CD @5 96 |
|---|
| N21 | | | | @1 138 |
|---|
| N82 | | | | @1 PSI |
|---|
|
|---|
| pR |
| A30 | 01 | 1 | ENG | @1 ICTCS 2003 : Italian conference on theoretical computer science @2 8 @3 Bertinoro ITA @4 2003-10-13 |
|---|
|
|---|
Format Inist (serveur)
| NO : | PASCAL 04-0212566 INIST |
|---|
| ET : | A work-optimal coarse-grained PRAM algorithm for Lexicographically First Maximal Independent Set |
|---|
| AU : | GUSTEDT (Jens); TELLE (Jan Arne); BLUNDO (Carlo); LANEVE (Cosimo) |
|---|
| AF : | LORIA & INRIA Lorraine/France (1 aut.); University of Bergen/Bergen/Norvège (2 aut.) |
|---|
| DT : | Publication en série; Congrès; Niveau analytique |
|---|
| SO : | Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2003; Vol. 2841; Pp. 125-136; Bibl. 14 ref. |
|---|
| LA : | Anglais |
|---|
| EA : | The Lexicographically First Maximal Independent Set Problem on graphs with bounded degree 3 is at most n-complete, and thus very likely not parallelizable in a fine-grained setting. On the other hand, we show that in a coarse-grained setting (few processors and a lot of data) the situation is different, by giving a work-optimal algorithm on a shared memory machine for n and p such that p log p E O(log n). |
|---|
| CC : | 001D02A06 |
|---|
| FD : | Informatique théorique; Algorithme optimal; Mémoire partagée; Structure gros grain; Ensemble indépendant; Graphe maximal; Degré graphe; Graphe indépendant |
|---|
| ED : | Computer theory; Optimal algorithm; Shared memory; Coarse grain structure; Independent set; Maximal graph; Graph degree; Independent graph |
|---|
| SD : | Informática teórica; Algoritmo óptimo; Memoria compartida; Estructura grano grueso; Conjunto independiente; Grafo máximo; Grado grafo |
|---|
| LO : | INIST-16343.354000117802520090 |
|---|
| ID : | 04-0212566 |
|---|
Links to Exploration step
Pascal:04-0212566
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">A work-optimal coarse-grained PRAM algorithm for Lexicographically First Maximal Independent Set</title>
<author><name sortKey="Gustedt, Jens" sort="Gustedt, Jens" uniqKey="Gustedt J" first="Jens" last="Gustedt">Jens Gustedt</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA & INRIA Lorraine</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14><author><name sortKey="Telle, Jan Arne" sort="Telle, Jan Arne" uniqKey="Telle J" first="Jan Arne" last="Telle">Jan Arne Telle</name>
<affiliation><inist:fA14 i1="02"><s1>University of Bergen</s1>
<s2>Bergen</s2>
<s3>NOR</s3>
<sZ>2 aut.</sZ>
</inist:fA14><publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">04-0212566</idno>
<date when="2003">2003</date>
<idno type="stanalyst">PASCAL 04-0212566 INIST</idno>
<idno type="RBID">Pascal:04-0212566</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000687</idno>
</publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">A work-optimal coarse-grained PRAM algorithm for Lexicographically First Maximal Independent Set</title>
<author><name sortKey="Gustedt, Jens" sort="Gustedt, Jens" uniqKey="Gustedt J" first="Jens" last="Gustedt">Jens Gustedt</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA & INRIA Lorraine</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14><author><name sortKey="Telle, Jan Arne" sort="Telle, Jan Arne" uniqKey="Telle J" first="Jan Arne" last="Telle">Jan Arne Telle</name>
<affiliation><inist:fA14 i1="02"><s1>University of Bergen</s1>
<s2>Bergen</s2>
<s3>NOR</s3>
<sZ>2 aut.</sZ>
</inist:fA14><series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2003">2003</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>Coarse grain structure</term>
<term>Computer theory</term>
<term>Graph degree</term>
<term>Independent graph</term>
<term>Independent set</term>
<term>Maximal graph</term>
<term>Optimal algorithm</term>
<term>Shared memory</term>
</keywords><keywords scheme="Pascal" xml:lang="fr"><term>Informatique théorique</term>
<term>Algorithme optimal</term>
<term>Mémoire partagée</term>
<term>Structure gros grain</term>
<term>Ensemble indépendant</term>
<term>Graphe maximal</term>
<term>Degré graphe</term>
<term>Graphe indépendant</term>
</keywords><front><div type="abstract" xml:lang="en">The Lexicographically First Maximal Independent Set Problem on graphs with bounded degree 3 is at most n-complete, and thus very likely not parallelizable in a fine-grained setting. On the other hand, we show that in a coarse-grained setting (few processors and a lot of data) the situation is different, by giving a work-optimal algorithm on a shared memory machine for n and p such that p log p E O(log n).</div>
</front><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01><fA05><s2>2841</s2>
</fA05><fA08 i1="01" i2="1" l="ENG"><s1>A work-optimal coarse-grained PRAM algorithm for Lexicographically First Maximal Independent Set</s1>
</fA08><fA09 i1="01" i2="1" l="ENG"><s1>Theoretical computer science : Bertinoro, 13-15 October 2003</s1>
</fA09><fA11 i1="01" i2="1"><s1>GUSTEDT (Jens)</s1>
</fA11><fA11 i1="02" i2="1"><s1>TELLE (Jan Arne)</s1>
</fA11><fA12 i1="01" i2="1"><s1>BLUNDO (Carlo)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="02" i2="1"><s1>LANEVE (Cosimo)</s1>
<s9>ed.</s9>
</fA12><fA14 i1="01"><s1>LORIA & INRIA Lorraine</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14><fA14 i1="02"><s1>University of Bergen</s1>
<s2>Bergen</s2>
<s3>NOR</s3>
<sZ>2 aut.</sZ>
</fA14><fA20><s1>125-136</s1>
</fA20><fA21><s1>2003</s1>
</fA21><fA23 i1="01"><s0>ENG</s0>
</fA23><fA26 i1="01"><s0>3-540-20216-1</s0>
</fA26><fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000117802520090</s5>
</fA43><fA44><s0>0000</s0>
<s1>© 2004 INIST-CNRS. All rights reserved.</s1>
</fA44><fA45><s0>14 ref.</s0>
</fA45><fA47 i1="01" i2="1"><s0>04-0212566</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><fC01 i1="01" l="ENG"><s0>The Lexicographically First Maximal Independent Set Problem on graphs with bounded degree 3 is at most n-complete, and thus very likely not parallelizable in a fine-grained setting. On the other hand, we show that in a coarse-grained setting (few processors and a lot of data) the situation is different, by giving a work-optimal algorithm on a shared memory machine for n and p such that p log p E O(log n).</s0>
</fC01><fC02 i1="01" i2="X"><s0>001D02A06</s0>
</fC02><fC03 i1="01" i2="X" l="FRE"><s0>Informatique théorique</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="ENG"><s0>Computer theory</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="SPA"><s0>Informática teórica</s0>
<s5>01</s5>
</fC03><fC03 i1="02" i2="X" l="FRE"><s0>Algorithme optimal</s0>
<s5>09</s5>
</fC03><fC03 i1="02" i2="X" l="ENG"><s0>Optimal algorithm</s0>
<s5>09</s5>
</fC03><fC03 i1="02" i2="X" l="SPA"><s0>Algoritmo óptimo</s0>
<s5>09</s5>
</fC03><fC03 i1="03" i2="X" l="FRE"><s0>Mémoire partagée</s0>
<s5>10</s5>
</fC03><fC03 i1="03" i2="X" l="ENG"><s0>Shared memory</s0>
<s5>10</s5>
</fC03><fC03 i1="03" i2="X" l="SPA"><s0>Memoria compartida</s0>
<s5>10</s5>
</fC03><fC03 i1="04" i2="X" l="FRE"><s0>Structure gros grain</s0>
<s5>18</s5>
</fC03><fC03 i1="04" i2="X" l="ENG"><s0>Coarse grain structure</s0>
<s5>18</s5>
</fC03><fC03 i1="04" i2="X" l="SPA"><s0>Estructura grano grueso</s0>
<s5>18</s5>
</fC03><fC03 i1="05" i2="X" l="FRE"><s0>Ensemble indépendant</s0>
<s5>19</s5>
</fC03><fC03 i1="05" i2="X" l="ENG"><s0>Independent set</s0>
<s5>19</s5>
</fC03><fC03 i1="05" i2="X" l="SPA"><s0>Conjunto independiente</s0>
<s5>19</s5>
</fC03><fC03 i1="06" i2="X" l="FRE"><s0>Graphe maximal</s0>
<s5>20</s5>
</fC03><fC03 i1="06" i2="X" l="ENG"><s0>Maximal graph</s0>
<s5>20</s5>
</fC03><fC03 i1="06" i2="X" l="SPA"><s0>Grafo máximo</s0>
<s5>20</s5>
</fC03><fC03 i1="07" i2="X" l="FRE"><s0>Degré graphe</s0>
<s5>21</s5>
</fC03><fC03 i1="07" i2="X" l="ENG"><s0>Graph degree</s0>
<s5>21</s5>
</fC03><fC03 i1="07" i2="X" l="SPA"><s0>Grado grafo</s0>
<s5>21</s5>
</fC03><fC03 i1="08" i2="X" l="FRE"><s0>Graphe indépendant</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03><fC03 i1="08" i2="X" l="ENG"><s0>Independent graph</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03><fN21><s1>138</s1>
</fN21><fN82><s1>PSI</s1>
</fN82><pR><fA30 i1="01" i2="1" l="ENG"><s1>ICTCS 2003 : Italian conference on theoretical computer science</s1>
<s2>8</s2>
<s3>Bertinoro ITA</s3>
<s4>2003-10-13</s4>
</fA30><server><NO>PASCAL 04-0212566 INIST</NO>
<ET>A work-optimal coarse-grained PRAM algorithm for Lexicographically First Maximal Independent Set</ET>
<AU>GUSTEDT (Jens); TELLE (Jan Arne); BLUNDO (Carlo); LANEVE (Cosimo)</AU>
<AF>LORIA & INRIA Lorraine/France (1 aut.); University of Bergen/Bergen/Norvège (2 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2003; Vol. 2841; Pp. 125-136; Bibl. 14 ref.</SO>
<LA>Anglais</LA>
<EA>The Lexicographically First Maximal Independent Set Problem on graphs with bounded degree 3 is at most n-complete, and thus very likely not parallelizable in a fine-grained setting. On the other hand, we show that in a coarse-grained setting (few processors and a lot of data) the situation is different, by giving a work-optimal algorithm on a shared memory machine for n and p such that p log p E O(log n).</EA>
<CC>001D02A06</CC>
<FD>Informatique théorique; Algorithme optimal; Mémoire partagée; Structure gros grain; Ensemble indépendant; Graphe maximal; Degré graphe; Graphe indépendant</FD>
<ED>Computer theory; Optimal algorithm; Shared memory; Coarse grain structure; Independent set; Maximal graph; Graph degree; Independent graph</ED>
<SD>Informática teórica; Algoritmo óptimo; Memoria compartida; Estructura grano grueso; Conjunto independiente; Grafo máximo; Grado grafo</SD>
<LO>INIST-16343.354000117802520090</LO>
<ID>04-0212566</ID>
</server>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000687 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000687 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= PascalFrancis
|étape= Corpus
|type= RBID
|clé= Pascal:04-0212566
|texte= A work-optimal coarse-grained PRAM algorithm for Lexicographically First Maximal Independent Set
}}
| This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022 |  |
