Towards realistic implementations of external memory algorithms using a coarse grained paradigm
Identifieur interne :
000789 ( PascalFrancis/Corpus );
précédent :
000788;
suivant :
000790
Towards realistic implementations of external memory algorithms using a coarse grained paradigm
Auteurs : Jens GustedtSource :
-
Lecture notes in computer science [ 0302-9743 ] ; 2003.
RBID : Pascal:03-0298151
Descripteurs français
English descriptors
Abstract
We present an extension to SSCRAP, our C++ environment for the development of coarse grained algorithms, that allows for easy execution of programs in an external memory setting. Our environment is well suited for regular as well as irregular problems and scales from low end PCs to high end clusters and mainframe technology. It allows running algorithms designed on a high level of abstraction in one of the known coarse grained parallel models without modification in an external memory setting. The first tests presented here in this paper show a very efficient behavior in the context of out-of-core computation (mapping memory to disk files), and even some (marginal) speed up when used to reduced cache misses for in-core computation.
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 2667 |
|---|
| A08 | 01 | 1 | ENG | @1 Towards realistic implementations of external memory algorithms using a coarse grained paradigm |
|---|
| A09 | 01 | 1 | ENG | @1 ICCSA 2003 : computational science and its applications : Montréal, 18-21 May 2003 |
|---|
| A11 | 01 | 1 | | @1 GUSTEDT (Jens) |
|---|
| A12 | 01 | 1 | | @1 KUMAR (Vipin) @9 ed. |
|---|
| A12 | 02 | 1 | | @1 GAVRILOVA (Marina L.) @9 ed. |
|---|
| A12 | 03 | 1 | | @1 TAN (Chih Jeng Kenneth) @9 ed. |
|---|
| A12 | 04 | 1 | | @1 L'ECUYER (Pierre) @9 ed. |
|---|
| A14 | 01 | | | @1 INRIA Lorraine & LORIA @3 FRA @Z 1 aut. |
|---|
| A20 | | | | @2 Part II, 269-278 |
|---|
| A21 | | | | @1 2003 |
|---|
| A23 | 01 | | | @0 ENG |
|---|
| A26 | 01 | | | @0 3-540-40156-3 |
|---|
| A43 | 01 | | | @1 INIST @2 16343 @5 354000108546371390 |
|---|
| A44 | | | | @0 0000 @1 © 2003 INIST-CNRS. All rights reserved. |
|---|
| A45 | | | | @0 14 ref. |
|---|
| A47 | 01 | 1 | | @0 03-0298151 |
|---|
| 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 We present an extension to SSCRAP, our C++ environment for the development of coarse grained algorithms, that allows for easy execution of programs in an external memory setting. Our environment is well suited for regular as well as irregular problems and scales from low end PCs to high end clusters and mainframe technology. It allows running algorithms designed on a high level of abstraction in one of the known coarse grained parallel models without modification in an external memory setting. The first tests presented here in this paper show a very efficient behavior in the context of out-of-core computation (mapping memory to disk files), and even some (marginal) speed up when used to reduced cache misses for in-core computation. |
|---|
| C02 | 01 | X | | @0 001D02A07 |
|---|
| C03 | 01 | 3 | FRE | @0 Ordinateur central @5 01 |
|---|
| C03 | 01 | 3 | ENG | @0 Mainframes @5 01 |
|---|
| C03 | 02 | X | FRE | @0 Exécution programme @5 02 |
|---|
| C03 | 02 | X | ENG | @0 Program execution @5 02 |
|---|
| C03 | 02 | X | SPA | @0 Ejecución programa @5 02 |
|---|
| C03 | 03 | X | FRE | @0 Structure gros grain @5 03 |
|---|
| C03 | 03 | X | ENG | @0 Coarse grain structure @5 03 |
|---|
| C03 | 03 | X | SPA | @0 Estructura grano grueso @5 03 |
|---|
| C03 | 04 | X | FRE | @0 Accès mémoire @5 04 |
|---|
| C03 | 04 | X | ENG | @0 Storage access @5 04 |
|---|
| C03 | 04 | X | SPA | @0 Acceso memoria @5 04 |
|---|
| C03 | 05 | X | FRE | @0 Accès aléatoire @5 05 |
|---|
| C03 | 05 | X | ENG | @0 Random access @5 05 |
|---|
| C03 | 05 | X | SPA | @0 Acceso aleatorio @5 05 |
|---|
| C03 | 06 | X | FRE | @0 Environnement programmation @5 06 |
|---|
| C03 | 06 | X | ENG | @0 Programming environment @5 06 |
|---|
| C03 | 06 | X | SPA | @0 Medio ambiente programación @5 06 |
|---|
| C03 | 07 | X | FRE | @0 Bibliothèque programme @5 07 |
|---|
| C03 | 07 | X | ENG | @0 Program library @5 07 |
|---|
| C03 | 07 | X | SPA | @0 Biblioteca programa @5 07 |
|---|
| C03 | 08 | X | FRE | @0 Librairie SSCRAP @4 INC @5 82 |
|---|
| C03 | 09 | X | FRE | @0 Transmission en continu @4 CD @5 96 |
|---|
| C03 | 09 | X | ENG | @0 Streaming @4 CD @5 96 |
|---|
| N21 | | | | @1 195 |
|---|
| N82 | | | | @1 PSI |
|---|
|
|---|
| pR |
| A30 | 01 | 1 | ENG | @1 International conference on computational science and its applications @3 Montréal PQ CAN @4 2003-05-18 |
|---|
|
|---|
Format Inist (serveur)
| NO : | PASCAL 03-0298151 INIST |
|---|
| ET : | Towards realistic implementations of external memory algorithms using a coarse grained paradigm |
|---|
| AU : | GUSTEDT (Jens); KUMAR (Vipin); GAVRILOVA (Marina L.); TAN (Chih Jeng Kenneth); L'ECUYER (Pierre) |
|---|
| AF : | INRIA Lorraine & LORIA/France (1 aut.) |
|---|
| DT : | Publication en série; Congrès; Niveau analytique |
|---|
| SO : | Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2003; Vol. 2667; Part II, 269-278; Bibl. 14 ref. |
|---|
| LA : | Anglais |
|---|
| EA : | We present an extension to SSCRAP, our C++ environment for the development of coarse grained algorithms, that allows for easy execution of programs in an external memory setting. Our environment is well suited for regular as well as irregular problems and scales from low end PCs to high end clusters and mainframe technology. It allows running algorithms designed on a high level of abstraction in one of the known coarse grained parallel models without modification in an external memory setting. The first tests presented here in this paper show a very efficient behavior in the context of out-of-core computation (mapping memory to disk files), and even some (marginal) speed up when used to reduced cache misses for in-core computation. |
|---|
| CC : | 001D02A07 |
|---|
| FD : | Ordinateur central; Exécution programme; Structure gros grain; Accès mémoire; Accès aléatoire; Environnement programmation; Bibliothèque programme; Librairie SSCRAP; Transmission en continu |
|---|
| ED : | Mainframes; Program execution; Coarse grain structure; Storage access; Random access; Programming environment; Program library; Streaming |
|---|
| SD : | Ejecución programa; Estructura grano grueso; Acceso memoria; Acceso aleatorio; Medio ambiente programación; Biblioteca programa |
|---|
| LO : | INIST-16343.354000108546371390 |
|---|
| ID : | 03-0298151 |
|---|
Links to Exploration step
Pascal:03-0298151
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Towards realistic implementations of external memory algorithms using a coarse grained paradigm</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>INRIA Lorraine & LORIA</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14><publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">03-0298151</idno>
<date when="2003">2003</date>
<idno type="stanalyst">PASCAL 03-0298151 INIST</idno>
<idno type="RBID">Pascal:03-0298151</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000789</idno>
</publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Towards realistic implementations of external memory algorithms using a coarse grained paradigm</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>INRIA Lorraine & LORIA</s1>
<s3>FRA</s3>
<sZ>1 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>Mainframes</term>
<term>Program execution</term>
<term>Program library</term>
<term>Programming environment</term>
<term>Random access</term>
<term>Storage access</term>
<term>Streaming</term>
</keywords><keywords scheme="Pascal" xml:lang="fr"><term>Ordinateur central</term>
<term>Exécution programme</term>
<term>Structure gros grain</term>
<term>Accès mémoire</term>
<term>Accès aléatoire</term>
<term>Environnement programmation</term>
<term>Bibliothèque programme</term>
<term>Librairie SSCRAP</term>
<term>Transmission en continu</term>
</keywords><front><div type="abstract" xml:lang="en">We present an extension to SSCRAP, our C++ environment for the development of coarse grained algorithms, that allows for easy execution of programs in an external memory setting. Our environment is well suited for regular as well as irregular problems and scales from low end PCs to high end clusters and mainframe technology. It allows running algorithms designed on a high level of abstraction in one of the known coarse grained parallel models without modification in an external memory setting. The first tests presented here in this paper show a very efficient behavior in the context of out-of-core computation (mapping memory to disk files), and even some (marginal) speed up when used to reduced cache misses for in-core computation.</div>
</front><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01><fA05><s2>2667</s2>
</fA05><fA08 i1="01" i2="1" l="ENG"><s1>Towards realistic implementations of external memory algorithms using a coarse grained paradigm</s1>
</fA08><fA09 i1="01" i2="1" l="ENG"><s1>ICCSA 2003 : computational science and its applications : Montréal, 18-21 May 2003</s1>
</fA09><fA11 i1="01" i2="1"><s1>GUSTEDT (Jens)</s1>
</fA11><fA12 i1="01" i2="1"><s1>KUMAR (Vipin)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="02" i2="1"><s1>GAVRILOVA (Marina L.)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="03" i2="1"><s1>TAN (Chih Jeng Kenneth)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="04" i2="1"><s1>L'ECUYER (Pierre)</s1>
<s9>ed.</s9>
</fA12><fA14 i1="01"><s1>INRIA Lorraine & LORIA</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14><fA20><s2>Part II, 269-278</s2>
</fA20><fA21><s1>2003</s1>
</fA21><fA23 i1="01"><s0>ENG</s0>
</fA23><fA26 i1="01"><s0>3-540-40156-3</s0>
</fA26><fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000108546371390</s5>
</fA43><fA44><s0>0000</s0>
<s1>© 2003 INIST-CNRS. All rights reserved.</s1>
</fA44><fA45><s0>14 ref.</s0>
</fA45><fA47 i1="01" i2="1"><s0>03-0298151</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>We present an extension to SSCRAP, our C++ environment for the development of coarse grained algorithms, that allows for easy execution of programs in an external memory setting. Our environment is well suited for regular as well as irregular problems and scales from low end PCs to high end clusters and mainframe technology. It allows running algorithms designed on a high level of abstraction in one of the known coarse grained parallel models without modification in an external memory setting. The first tests presented here in this paper show a very efficient behavior in the context of out-of-core computation (mapping memory to disk files), and even some (marginal) speed up when used to reduced cache misses for in-core computation.</s0>
</fC01><fC02 i1="01" i2="X"><s0>001D02A07</s0>
</fC02><fC03 i1="01" i2="3" l="FRE"><s0>Ordinateur central</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="3" l="ENG"><s0>Mainframes</s0>
<s5>01</s5>
</fC03><fC03 i1="02" i2="X" l="FRE"><s0>Exécution programme</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="X" l="ENG"><s0>Program execution</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="X" l="SPA"><s0>Ejecución programa</s0>
<s5>02</s5>
</fC03><fC03 i1="03" i2="X" l="FRE"><s0>Structure gros grain</s0>
<s5>03</s5>
</fC03><fC03 i1="03" i2="X" l="ENG"><s0>Coarse grain structure</s0>
<s5>03</s5>
</fC03><fC03 i1="03" i2="X" l="SPA"><s0>Estructura grano grueso</s0>
<s5>03</s5>
</fC03><fC03 i1="04" i2="X" l="FRE"><s0>Accès mémoire</s0>
<s5>04</s5>
</fC03><fC03 i1="04" i2="X" l="ENG"><s0>Storage access</s0>
<s5>04</s5>
</fC03><fC03 i1="04" i2="X" l="SPA"><s0>Acceso memoria</s0>
<s5>04</s5>
</fC03><fC03 i1="05" i2="X" l="FRE"><s0>Accès aléatoire</s0>
<s5>05</s5>
</fC03><fC03 i1="05" i2="X" l="ENG"><s0>Random access</s0>
<s5>05</s5>
</fC03><fC03 i1="05" i2="X" l="SPA"><s0>Acceso aleatorio</s0>
<s5>05</s5>
</fC03><fC03 i1="06" i2="X" l="FRE"><s0>Environnement programmation</s0>
<s5>06</s5>
</fC03><fC03 i1="06" i2="X" l="ENG"><s0>Programming environment</s0>
<s5>06</s5>
</fC03><fC03 i1="06" i2="X" l="SPA"><s0>Medio ambiente programación</s0>
<s5>06</s5>
</fC03><fC03 i1="07" i2="X" l="FRE"><s0>Bibliothèque programme</s0>
<s5>07</s5>
</fC03><fC03 i1="07" i2="X" l="ENG"><s0>Program library</s0>
<s5>07</s5>
</fC03><fC03 i1="07" i2="X" l="SPA"><s0>Biblioteca programa</s0>
<s5>07</s5>
</fC03><fC03 i1="08" i2="X" l="FRE"><s0>Librairie SSCRAP</s0>
<s4>INC</s4>
<s5>82</s5>
</fC03><fC03 i1="09" i2="X" l="FRE"><s0>Transmission en continu</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03><fC03 i1="09" i2="X" l="ENG"><s0>Streaming</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03><fN21><s1>195</s1>
</fN21><fN82><s1>PSI</s1>
</fN82><pR><fA30 i1="01" i2="1" l="ENG"><s1>International conference on computational science and its applications</s1>
<s3>Montréal PQ CAN</s3>
<s4>2003-05-18</s4>
</fA30><server><NO>PASCAL 03-0298151 INIST</NO>
<ET>Towards realistic implementations of external memory algorithms using a coarse grained paradigm</ET>
<AU>GUSTEDT (Jens); KUMAR (Vipin); GAVRILOVA (Marina L.); TAN (Chih Jeng Kenneth); L'ECUYER (Pierre)</AU>
<AF>INRIA Lorraine & LORIA/France (1 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. 2667; Part II, 269-278; Bibl. 14 ref.</SO>
<LA>Anglais</LA>
<EA>We present an extension to SSCRAP, our C++ environment for the development of coarse grained algorithms, that allows for easy execution of programs in an external memory setting. Our environment is well suited for regular as well as irregular problems and scales from low end PCs to high end clusters and mainframe technology. It allows running algorithms designed on a high level of abstraction in one of the known coarse grained parallel models without modification in an external memory setting. The first tests presented here in this paper show a very efficient behavior in the context of out-of-core computation (mapping memory to disk files), and even some (marginal) speed up when used to reduced cache misses for in-core computation.</EA>
<CC>001D02A07</CC>
<FD>Ordinateur central; Exécution programme; Structure gros grain; Accès mémoire; Accès aléatoire; Environnement programmation; Bibliothèque programme; Librairie SSCRAP; Transmission en continu</FD>
<ED>Mainframes; Program execution; Coarse grain structure; Storage access; Random access; Programming environment; Program library; Streaming</ED>
<SD>Ejecución programa; Estructura grano grueso; Acceso memoria; Acceso aleatorio; Medio ambiente programación; Biblioteca programa</SD>
<LO>INIST-16343.354000108546371390</LO>
<ID>03-0298151</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 000789 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000789 | 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:03-0298151
|texte= Towards realistic implementations of external memory algorithms using a coarse grained paradigm
}}
| 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 |  |
