InforLorV4, PascalFrancis, Corpus, bibRecord, 000936

Portable List ranking: An experimental study

Identifieur interne : 000936 ( PascalFrancis/Corpus ); précédent : 000935; suivant : 000937

Portable List ranking: An experimental study

Auteurs : Isabelle Guérin Lassous ; Jens Gustedt

Source :

Lecture notes in computer science [ 0302-9743 ] ; 2001.

RBID : Pascal:01-0412125

Descripteurs français

Pascal (Inist)
- Algorithme, Système réparti, Structure gros grain, Parallélisme, Rangement liste.

English descriptors

KwdEn :
- Algorithm, Coarse grain structure, Distributed system, List ranking, Parallelism.

Abstract

We present two portable algorithms for the List Ranking Problem in the Coarse Grained Multicomputer model (CGM) and we report on experimental studies of these algorithms. With these experiments, we study the validity of the chosen CGM model, and also show the possible gains and limits of such algorithms.

Notice en format standard (ISO 2709)

Pour connaître la documentation sur le format Inist Standard.

A01	`01`	`1`		`@0 0302-9743`
A05				`@2 1982`
A08	`01`	`1`	`ENG`	`@1 Portable List ranking: An experimental study`
A09	`01`	`1`	`ENG`	`@1 Algorithm engineering : Saarbrücken, 5-8 September 2000`
A11	`01`	`1`		`@1 LASSOUS (Isabelle Guérin)`
A11	`02`	`1`		`@1 GUSTEDT (Jens)`
A12	`01`	`1`		`@1 NAHER (Stefan) @9 ed.`
A12	`02`	`1`		`@1 WAGNER (Dorothea) @9 ed.`
A14	`01`			`@1 INRIA Rocquencourt @3 FRA @Z 1 aut.`
A14	`02`			`@1 LORIA and INRIA Lorraine @3 FRA @Z 2 aut.`
A20				`@1 111-122`
A21				`@1 2001`
A23	`01`			`@0 ENG`
A26	`01`			`@0 3-540-42512-8`
A43	`01`			`@1 INIST @2 16343 @5 354000097018230100`
A44				`@0 0000 @1 © 2001 INIST-CNRS. All rights reserved.`
A45				`@0 14 ref.`
A47	`01`	`1`		`@0 01-0412125`
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 present two portable algorithms for the List Ranking Problem in the Coarse Grained Multicomputer model (CGM) and we report on experimental studies of these algorithms. With these experiments, we study the validity of the chosen CGM model, and also show the possible gains and limits of such algorithms.`
C02	`01`	`X`		`@0 001D02B04`
C02	`02`	`X`		`@0 001D02A06`
C02	`03`	`X`		`@0 001D02A05`
C03	`01`	`X`	`FRE`	`@0 Algorithme @5 09`
C03	`01`	`X`	`ENG`	`@0 Algorithm @5 09`
C03	`01`	`X`	`SPA`	`@0 Algoritmo @5 09`
C03	`02`	`X`	`FRE`	`@0 Système réparti @5 11`
C03	`02`	`X`	`ENG`	`@0 Distributed system @5 11`
C03	`02`	`X`	`SPA`	`@0 Sistema repartido @5 11`
C03	`03`	`X`	`FRE`	`@0 Structure gros grain @5 12`
C03	`03`	`X`	`ENG`	`@0 Coarse grain structure @5 12`
C03	`03`	`X`	`SPA`	`@0 Estructura grano grueso @5 12`
C03	`04`	`X`	`FRE`	`@0 Parallélisme @5 13`
C03	`04`	`X`	`ENG`	`@0 Parallelism @5 13`
C03	`04`	`X`	`SPA`	`@0 Paralelismo @5 13`
C03	`05`	`X`	`FRE`	`@0 Rangement liste @4 CD @5 96`
C03	`05`	`X`	`ENG`	`@0 List ranking @4 CD @5 96`
N21				`@1 288`

A30	`01`	`1`	`ENG`	`@1 WAE 2000 : international workshop on algorithm engineering @2 4 @3 Saarbrücken DEU @4 2000-09-05`

Format Inist (serveur)

NO :	PASCAL 01-0412125 INIST
ET :	Portable List ranking: An experimental study
AU :	LASSOUS (Isabelle Guérin); GUSTEDT (Jens); NAHER (Stefan); WAGNER (Dorothea)
AF :	INRIA Rocquencourt/France (1 aut.); LORIA and INRIA Lorraine/France (2 aut.)
DT :	Publication en série; Congrès; Niveau analytique
SO :	Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2001; Vol. 1982; Pp. 111-122; Bibl. 14 ref.
LA :	Anglais
EA :	We present two portable algorithms for the List Ranking Problem in the Coarse Grained Multicomputer model (CGM) and we report on experimental studies of these algorithms. With these experiments, we study the validity of the chosen CGM model, and also show the possible gains and limits of such algorithms.
CC :	001D02B04; 001D02A06; 001D02A05
FD :	Algorithme; Système réparti; Structure gros grain; Parallélisme; Rangement liste
ED :	Algorithm; Distributed system; Coarse grain structure; Parallelism; List ranking
SD :	Algoritmo; Sistema repartido; Estructura grano grueso; Paralelismo
LO :	INIST-16343.354000097018230100
ID :	01-0412125

Links to Exploration step

Pascal:01-0412125

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Portable List ranking: An experimental study</title>
<author><name sortKey="Lassous, Isabelle Guerin" sort="Lassous, Isabelle Guerin" uniqKey="Lassous I" first="Isabelle Guérin" last="Lassous">Isabelle Guérin Lassous</name>
<affiliation><inist:fA14 i1="01"><s1>INRIA Rocquencourt</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Gustedt, Jens" sort="Gustedt, Jens" uniqKey="Gustedt J" first="Jens" last="Gustedt">Jens Gustedt</name>
<affiliation><inist:fA14 i1="02"><s1>LORIA and INRIA Lorraine</s1>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">01-0412125</idno>
<date when="2001">2001</date>
<idno type="stanalyst">PASCAL 01-0412125 INIST</idno>
<idno type="RBID">Pascal:01-0412125</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000936</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Portable List ranking: An experimental study</title>
<author><name sortKey="Lassous, Isabelle Guerin" sort="Lassous, Isabelle Guerin" uniqKey="Lassous I" first="Isabelle Guérin" last="Lassous">Isabelle Guérin Lassous</name>
<affiliation><inist:fA14 i1="01"><s1>INRIA Rocquencourt</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Gustedt, Jens" sort="Gustedt, Jens" uniqKey="Gustedt J" first="Jens" last="Gustedt">Jens Gustedt</name>
<affiliation><inist:fA14 i1="02"><s1>LORIA and INRIA Lorraine</s1>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2001">2001</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>Coarse grain structure</term>
<term>Distributed system</term>
<term>List ranking</term>
<term>Parallelism</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Algorithme</term>
<term>Système réparti</term>
<term>Structure gros grain</term>
<term>Parallélisme</term>
<term>Rangement liste</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">We present two portable algorithms for the List Ranking Problem in the Coarse Grained Multicomputer model (CGM) and we report on experimental studies of these algorithms. With these experiments, we study the validity of the chosen CGM model, and also show the possible gains and limits of such algorithms.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>1982</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>Portable List ranking: An experimental study</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>Algorithm engineering : Saarbrücken, 5-8 September 2000</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>LASSOUS (Isabelle Guérin)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>GUSTEDT (Jens)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>NAHER (Stefan)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>WAGNER (Dorothea)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>INRIA Rocquencourt</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>LORIA and INRIA Lorraine</s1>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA20><s1>111-122</s1>
</fA20>
<fA21><s1>2001</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA26 i1="01"><s0>3-540-42512-8</s0>
</fA26>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000097018230100</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2001 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>14 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>01-0412125</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>
<fA66 i1="02"><s0>USA</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>We present two portable algorithms for the List Ranking Problem in the Coarse Grained Multicomputer model (CGM) and we report on experimental studies of these algorithms. With these experiments, we study the validity of the chosen CGM model, and also show the possible gains and limits of such algorithms.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02B04</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001D02A06</s0>
</fC02>
<fC02 i1="03" i2="X"><s0>001D02A05</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Algorithme</s0>
<s5>09</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Algorithm</s0>
<s5>09</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Algoritmo</s0>
<s5>09</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Système réparti</s0>
<s5>11</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Distributed system</s0>
<s5>11</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Sistema repartido</s0>
<s5>11</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Structure gros grain</s0>
<s5>12</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Coarse grain structure</s0>
<s5>12</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Estructura grano grueso</s0>
<s5>12</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Parallélisme</s0>
<s5>13</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Parallelism</s0>
<s5>13</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Paralelismo</s0>
<s5>13</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Rangement liste</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>List ranking</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fN21><s1>288</s1>
</fN21>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>WAE 2000 : international workshop on algorithm engineering</s1>
<s2>4</s2>
<s3>Saarbrücken DEU</s3>
<s4>2000-09-05</s4>
</fA30>
</pR>
</standard>
<server><NO>PASCAL 01-0412125 INIST</NO>
<ET>Portable List ranking: An experimental study</ET>
<AU>LASSOUS (Isabelle Guérin); GUSTEDT (Jens); NAHER (Stefan); WAGNER (Dorothea)</AU>
<AF>INRIA Rocquencourt/France (1 aut.); LORIA and INRIA Lorraine/France (2 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2001; Vol. 1982; Pp. 111-122; Bibl. 14 ref.</SO>
<LA>Anglais</LA>
<EA>We present two portable algorithms for the List Ranking Problem in the Coarse Grained Multicomputer model (CGM) and we report on experimental studies of these algorithms. With these experiments, we study the validity of the chosen CGM model, and also show the possible gains and limits of such algorithms.</EA>
<CC>001D02B04; 001D02A06; 001D02A05</CC>
<FD>Algorithme; Système réparti; Structure gros grain; Parallélisme; Rangement liste</FD>
<ED>Algorithm; Distributed system; Coarse grain structure; Parallelism; List ranking</ED>
<SD>Algoritmo; Sistema repartido; Estructura grano grueso; Paralelismo</SD>
<LO>INIST-16343.354000097018230100</LO>
<ID>01-0412125</ID>
</server>
</inist>
</record>

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 000936 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000936 | 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:01-0412125
   |texte=   Portable List ranking: An experimental study
}}

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

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

Portable List ranking: An experimental study

Portable List ranking: An experimental study

Source :

Descripteurs français

English descriptors

Abstract

Notice en format standard (ISO 2709)

Format Inist (serveur)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri