A work-optimal coarse-grained PRAM algorithm for Lexicographically First Maximal Independent Set
Identifieur interne : 000728 ( PascalFrancis/Checkpoint ); précédent : 000727; suivant : 000729A work-optimal coarse-grained PRAM algorithm for Lexicographically First Maximal Independent Set
Auteurs : Jens Gustedt [France] ; Jan Arne Telle [Norvège]Source :
- Lecture notes in computer science [ 0302-9743 ] ; 2003.
Descripteurs français
- Pascal (Inist)
English descriptors
- KwdEn :
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).
Affiliations:
Links toward previous steps (curation, corpus...)
Links to Exploration step
Pascal:04-0212566Le 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 wicri:level="1"><inist:fA14 i1="01"><s1>LORIA & INRIA Lorraine</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>LORIA & INRIA Lorraine</wicri:noRegion>
<wicri:noRegion>LORIA & INRIA Lorraine</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Telle, Jan Arne" sort="Telle, Jan Arne" uniqKey="Telle J" first="Jan Arne" last="Telle">Jan Arne Telle</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>University of Bergen</s1>
<s2>Bergen</s2>
<s3>NOR</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Norvège</country>
<wicri:noRegion>University of Bergen</wicri:noRegion>
</affiliation>
</author>
</titleStmt>
<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>
<idno type="wicri:Area/PascalFrancis/Curation">000354</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000728</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000728</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 wicri:level="1"><inist:fA14 i1="01"><s1>LORIA & INRIA Lorraine</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>France</country>
<wicri:noRegion>LORIA & INRIA Lorraine</wicri:noRegion>
<wicri:noRegion>LORIA & INRIA Lorraine</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Telle, Jan Arne" sort="Telle, Jan Arne" uniqKey="Telle J" first="Jan Arne" last="Telle">Jan Arne Telle</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>University of Bergen</s1>
<s2>Bergen</s2>
<s3>NOR</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Norvège</country>
<wicri:noRegion>University of Bergen</wicri:noRegion>
</affiliation>
</author>
</analytic>
<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>
</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>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>
</textClass>
</profileDesc>
</teiHeader>
<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>
</TEI>
<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>
<fA61><s0>A</s0>
</fA61>
<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>
</pA>
<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>
</pR>
</standard>
</inist>
<affiliations><list><country><li>France</li>
<li>Norvège</li>
</country>
</list>
<tree><country name="France"><noRegion><name sortKey="Gustedt, Jens" sort="Gustedt, Jens" uniqKey="Gustedt J" first="Jens" last="Gustedt">Jens Gustedt</name>
</noRegion>
</country>
<country name="Norvège"><noRegion><name sortKey="Telle, Jan Arne" sort="Telle, Jan Arne" uniqKey="Telle J" first="Jan Arne" last="Telle">Jan Arne Telle</name>
</noRegion>
</country>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000728 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/biblio.hfd -nk 000728 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= PascalFrancis |étape= Checkpoint |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. | ![]() |