MeDLey : An abstract approach to Message Passing
Identifieur interne :
000C77 ( PascalFrancis/Corpus );
précédent :
000C76;
suivant :
000C78
MeDLey : An abstract approach to Message Passing
Auteurs : E. Dillon ;
J. Guyard ;
G. WantzSource :
-
Lecture notes in computer science [ 0302-9743 ] ; 1996.
RBID : Pascal:97-0166889
Descripteurs français
- Pascal (Inist)
- Système parallèle,
Système multiprocesseur mémoire répartie,
Réseau ordinateur,
Mémoire partagée,
Communication,
Modélisation,
Langage C++,
Langage C,
Algorithme parallèle,
Implémentation,
Performance algorithme,
Portabilité,
Abstract approach.
English descriptors
- KwdEn :
- Algorithm performance,
C language,
C++ language,
Communication,
Computer network,
Distributed memory multiprocessor system,
Implementation,
Modeling,
Parallel algorithm,
Parallel system,
Portability,
Shared memory.
Abstract
Message Passing has become one of the most popular parallel programming paradigms because of its ease of use. Conversely, using it efficiently often requires lots of efforts, when designing a distributed application. Finally, such an application often requires optimization, since performances are not always as good as expected. With MeDLey, we propose an abstract approach to message passing. The basic idea is to provide a language that might be used to specify all communications within a distributed application. With this specification, the user does not have to care about the implementation any more, and leaves it to the compiler's charge. Finally, the aim of this approach is to achieve more efficiency by generating specific communication primitives rather than using generic message passing libraries. MeDLey has followed two main steps: MeDLey-0 was the first version of the compiler. It was able to generate C++ and MPI communications primitives, mainly to help the user in the design process. MeDLey-1 now tries to gain more efficiency by implementing communications with dedicated devices like shared-memory or AAL5 for ATM-based clusters of workstations.
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 1184 |
|---|
| A08 | 01 | 1 | ENG | @1 MeDLey : An abstract approach to Message Passing |
|---|
| A09 | 01 | 1 | ENG | @1 Applied parallel computing : industrial computation and optimization : Lyngby, August 18-21, 1996 |
|---|
| A11 | 01 | 1 | | @1 DILLON (E.) |
|---|
| A11 | 02 | 1 | | @1 GUYARD (J.) |
|---|
| A11 | 03 | 1 | | @1 WANTZ (G.) |
|---|
| A12 | 01 | 1 | | @1 WASNIEWSKI (Jerzy) @9 ed. |
|---|
| A12 | 02 | 1 | | @1 DONGARRA (Jack) @9 ed. |
|---|
| A12 | 03 | 1 | | @1 MADSEN (Kaj) @9 ed. |
|---|
| A12 | 04 | 1 | | @1 OLESEN (Dorte) @9 ed. |
|---|
| A14 | 01 | | | @1 CRIN/INRIA, 615, rue du jardin botanique @2 54602 Villers-les-Nancy @3 FRA @Z 1 aut. @Z 2 aut. |
|---|
| A14 | 02 | | | @1 CRP-CU @2 Luxembourg @3 LUX @Z 3 aut. |
|---|
| A20 | | | | @1 196-203 |
|---|
| A21 | | | | @1 1996 |
|---|
| A23 | 01 | | | @0 ENG |
|---|
| A43 | 01 | | | @1 INIST @2 16343 @5 354000062189610210 |
|---|
| A44 | | | | @0 0000 @1 © 1997 INIST-CNRS. All rights reserved. |
|---|
| A45 | | | | @0 5 ref. |
|---|
| A47 | 01 | 1 | | @0 97-0166889 |
|---|
| 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 Message Passing has become one of the most popular parallel programming paradigms because of its ease of use. Conversely, using it efficiently often requires lots of efforts, when designing a distributed application. Finally, such an application often requires optimization, since performances are not always as good as expected. With MeDLey, we propose an abstract approach to message passing. The basic idea is to provide a language that might be used to specify all communications within a distributed application. With this specification, the user does not have to care about the implementation any more, and leaves it to the compiler's charge. Finally, the aim of this approach is to achieve more efficiency by generating specific communication primitives rather than using generic message passing libraries. MeDLey has followed two main steps: MeDLey-0 was the first version of the compiler. It was able to generate C++ and MPI communications primitives, mainly to help the user in the design process. MeDLey-1 now tries to gain more efficiency by implementing communications with dedicated devices like shared-memory or AAL5 for ATM-based clusters of workstations. |
|---|
| C02 | 01 | X | | @0 001D02B04 |
|---|
| C02 | 02 | X | | @0 001D02A05 |
|---|
| C02 | 03 | X | | @0 001D02B07C |
|---|
| 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 Réseau ordinateur @5 03 |
|---|
| C03 | 03 | X | ENG | @0 Computer network @5 03 |
|---|
| C03 | 03 | X | SPA | @0 Red ordenador @5 03 |
|---|
| C03 | 04 | X | FRE | @0 Mémoire partagée @5 04 |
|---|
| C03 | 04 | X | ENG | @0 Shared memory @5 04 |
|---|
| C03 | 04 | X | SPA | @0 Memoria compartida @5 04 |
|---|
| C03 | 05 | X | FRE | @0 Communication @5 05 |
|---|
| C03 | 05 | X | ENG | @0 Communication @5 05 |
|---|
| C03 | 05 | X | SPA | @0 Comunicación @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 Langage C++ @5 07 |
|---|
| C03 | 07 | X | ENG | @0 C++ language @5 07 |
|---|
| C03 | 07 | X | SPA | @0 Lenguaje C++ @5 07 |
|---|
| C03 | 08 | X | FRE | @0 Langage C @5 08 |
|---|
| C03 | 08 | X | ENG | @0 C language @5 08 |
|---|
| C03 | 08 | X | SPA | @0 Lenguaje C @5 08 |
|---|
| C03 | 09 | X | FRE | @0 Algorithme parallèle @5 09 |
|---|
| C03 | 09 | X | ENG | @0 Parallel algorithm @5 09 |
|---|
| C03 | 09 | X | SPA | @0 Algoritmo paralelo @5 09 |
|---|
| C03 | 10 | X | FRE | @0 Implémentation @5 10 |
|---|
| C03 | 10 | X | ENG | @0 Implementation @5 10 |
|---|
| C03 | 10 | X | SPA | @0 Ejecución @5 10 |
|---|
| C03 | 11 | X | FRE | @0 Performance algorithme @5 11 |
|---|
| C03 | 11 | X | ENG | @0 Algorithm performance @5 11 |
|---|
| C03 | 11 | X | SPA | @0 Resultado algoritmo @5 11 |
|---|
| C03 | 12 | X | FRE | @0 Portabilité @5 12 |
|---|
| C03 | 12 | X | ENG | @0 Portability @5 12 |
|---|
| C03 | 12 | X | GER | @0 Transportfaehigkeit @5 12 |
|---|
| C03 | 12 | X | SPA | @0 Portabilidad @5 12 |
|---|
| C03 | 13 | X | FRE | @0 Abstract approach @4 INC @5 73 |
|---|
| N21 | | | | @1 076 |
|---|
|
|---|
| pR |
| A30 | 01 | 1 | ENG | @1 PARA '96. International workshop @2 3 @3 Lyngby DNK @4 1996-08-18 |
|---|
|
|---|
Format Inist (serveur)
| NO : | PASCAL 97-0166889 INIST |
|---|
| ET : | MeDLey : An abstract approach to Message Passing |
|---|
| AU : | DILLON (E.); GUYARD (J.); WANTZ (G.); WASNIEWSKI (Jerzy); DONGARRA (Jack); MADSEN (Kaj); OLESEN (Dorte) |
|---|
| AF : | CRIN/INRIA, 615, rue du jardin botanique/54602 Villers-les-Nancy/France (1 aut., 2 aut.); CRP-CU/Luxembourg/Luxembourg (3 aut.) |
|---|
| DT : | Publication en série; Congrès; Niveau analytique |
|---|
| SO : | Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 1996; Vol. 1184; Pp. 196-203; Bibl. 5 ref. |
|---|
| LA : | Anglais |
|---|
| EA : | Message Passing has become one of the most popular parallel programming paradigms because of its ease of use. Conversely, using it efficiently often requires lots of efforts, when designing a distributed application. Finally, such an application often requires optimization, since performances are not always as good as expected. With MeDLey, we propose an abstract approach to message passing. The basic idea is to provide a language that might be used to specify all communications within a distributed application. With this specification, the user does not have to care about the implementation any more, and leaves it to the compiler's charge. Finally, the aim of this approach is to achieve more efficiency by generating specific communication primitives rather than using generic message passing libraries. MeDLey has followed two main steps: MeDLey-0 was the first version of the compiler. It was able to generate C++ and MPI communications primitives, mainly to help the user in the design process. MeDLey-1 now tries to gain more efficiency by implementing communications with dedicated devices like shared-memory or AAL5 for ATM-based clusters of workstations. |
|---|
| CC : | 001D02B04; 001D02A05; 001D02B07C |
|---|
| FD : | Système parallèle; Système multiprocesseur mémoire répartie; Réseau ordinateur; Mémoire partagée; Communication; Modélisation; Langage C++; Langage C; Algorithme parallèle; Implémentation; Performance algorithme; Portabilité; Abstract approach |
|---|
| ED : | Parallel system; Distributed memory multiprocessor system; Computer network; Shared memory; Communication; Modeling; C++ language; C language; Parallel algorithm; Implementation; Algorithm performance; Portability |
|---|
| GD : | Transportfaehigkeit |
|---|
| SD : | Sistema paralelo; Sistema multiprocesador memoria distribuida; Red ordenador; Memoria compartida; Comunicación; Modelización; Lenguaje C++; Lenguaje C; Algoritmo paralelo; Ejecución; Resultado algoritmo; Portabilidad |
|---|
| LO : | INIST-16343.354000062189610210 |
|---|
| ID : | 97-0166889 |
|---|
Links to Exploration step
Pascal:97-0166889
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">MeDLey : An abstract approach to Message Passing</title>
<author><name sortKey="Dillon, E" sort="Dillon, E" uniqKey="Dillon E" first="E." last="Dillon">E. Dillon</name>
<affiliation><inist:fA14 i1="01"><s1>CRIN/INRIA, 615, rue du jardin botanique</s1>
<s2>54602 Villers-les-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14><author><name sortKey="Guyard, J" sort="Guyard, J" uniqKey="Guyard J" first="J." last="Guyard">J. Guyard</name>
<affiliation><inist:fA14 i1="01"><s1>CRIN/INRIA, 615, rue du jardin botanique</s1>
<s2>54602 Villers-les-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14><author><name sortKey="Wantz, G" sort="Wantz, G" uniqKey="Wantz G" first="G." last="Wantz">G. Wantz</name>
<affiliation><inist:fA14 i1="02"><s1>CRP-CU</s1>
<s2>Luxembourg</s2>
<s3>LUX</s3>
<sZ>3 aut.</sZ>
</inist:fA14><publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">97-0166889</idno>
<date when="1996">1996</date>
<idno type="stanalyst">PASCAL 97-0166889 INIST</idno>
<idno type="RBID">Pascal:97-0166889</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000C77</idno>
</publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">MeDLey : An abstract approach to Message Passing</title>
<author><name sortKey="Dillon, E" sort="Dillon, E" uniqKey="Dillon E" first="E." last="Dillon">E. Dillon</name>
<affiliation><inist:fA14 i1="01"><s1>CRIN/INRIA, 615, rue du jardin botanique</s1>
<s2>54602 Villers-les-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14><author><name sortKey="Guyard, J" sort="Guyard, J" uniqKey="Guyard J" first="J." last="Guyard">J. Guyard</name>
<affiliation><inist:fA14 i1="01"><s1>CRIN/INRIA, 615, rue du jardin botanique</s1>
<s2>54602 Villers-les-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14><author><name sortKey="Wantz, G" sort="Wantz, G" uniqKey="Wantz G" first="G." last="Wantz">G. Wantz</name>
<affiliation><inist:fA14 i1="02"><s1>CRP-CU</s1>
<s2>Luxembourg</s2>
<s3>LUX</s3>
<sZ>3 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="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 performance</term>
<term>C language</term>
<term>C++ language</term>
<term>Communication</term>
<term>Computer network</term>
<term>Distributed memory multiprocessor system</term>
<term>Implementation</term>
<term>Modeling</term>
<term>Parallel algorithm</term>
<term>Parallel system</term>
<term>Portability</term>
<term>Shared memory</term>
</keywords><keywords scheme="Pascal" xml:lang="fr"><term>Système parallèle</term>
<term>Système multiprocesseur mémoire répartie</term>
<term>Réseau ordinateur</term>
<term>Mémoire partagée</term>
<term>Communication</term>
<term>Modélisation</term>
<term>Langage C++</term>
<term>Langage C</term>
<term>Algorithme parallèle</term>
<term>Implémentation</term>
<term>Performance algorithme</term>
<term>Portabilité</term>
<term>Abstract approach</term>
</keywords><front><div type="abstract" xml:lang="en">Message Passing has become one of the most popular parallel programming paradigms because of its ease of use. Conversely, using it efficiently often requires lots of efforts, when designing a distributed application. Finally, such an application often requires optimization, since performances are not always as good as expected. With MeDLey, we propose an abstract approach to message passing. The basic idea is to provide a language that might be used to specify all communications within a distributed application. With this specification, the user does not have to care about the implementation any more, and leaves it to the compiler's charge. Finally, the aim of this approach is to achieve more efficiency by generating specific communication primitives rather than using generic message passing libraries. MeDLey has followed two main steps: MeDLey-0 was the first version of the compiler. It was able to generate C++ and MPI communications primitives, mainly to help the user in the design process. MeDLey-1 now tries to gain more efficiency by implementing communications with dedicated devices like shared-memory or AAL5 for ATM-based clusters of workstations.</div>
</front><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01><fA05><s2>1184</s2>
</fA05><fA08 i1="01" i2="1" l="ENG"><s1>MeDLey : An abstract approach to Message Passing</s1>
</fA08><fA09 i1="01" i2="1" l="ENG"><s1>Applied parallel computing : industrial computation and optimization : Lyngby, August 18-21, 1996</s1>
</fA09><fA11 i1="01" i2="1"><s1>DILLON (E.)</s1>
</fA11><fA11 i1="02" i2="1"><s1>GUYARD (J.)</s1>
</fA11><fA11 i1="03" i2="1"><s1>WANTZ (G.)</s1>
</fA11><fA12 i1="01" i2="1"><s1>WASNIEWSKI (Jerzy)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="02" i2="1"><s1>DONGARRA (Jack)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="03" i2="1"><s1>MADSEN (Kaj)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="04" i2="1"><s1>OLESEN (Dorte)</s1>
<s9>ed.</s9>
</fA12><fA14 i1="01"><s1>CRIN/INRIA, 615, rue du jardin botanique</s1>
<s2>54602 Villers-les-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</fA14><fA14 i1="02"><s1>CRP-CU</s1>
<s2>Luxembourg</s2>
<s3>LUX</s3>
<sZ>3 aut.</sZ>
</fA14><fA20><s1>196-203</s1>
</fA20><fA21><s1>1996</s1>
</fA21><fA23 i1="01"><s0>ENG</s0>
</fA23><fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000062189610210</s5>
</fA43><fA44><s0>0000</s0>
<s1>© 1997 INIST-CNRS. All rights reserved.</s1>
</fA44><fA45><s0>5 ref.</s0>
</fA45><fA47 i1="01" i2="1"><s0>97-0166889</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>Message Passing has become one of the most popular parallel programming paradigms because of its ease of use. Conversely, using it efficiently often requires lots of efforts, when designing a distributed application. Finally, such an application often requires optimization, since performances are not always as good as expected. With MeDLey, we propose an abstract approach to message passing. The basic idea is to provide a language that might be used to specify all communications within a distributed application. With this specification, the user does not have to care about the implementation any more, and leaves it to the compiler's charge. Finally, the aim of this approach is to achieve more efficiency by generating specific communication primitives rather than using generic message passing libraries. MeDLey has followed two main steps: MeDLey-0 was the first version of the compiler. It was able to generate C++ and MPI communications primitives, mainly to help the user in the design process. MeDLey-1 now tries to gain more efficiency by implementing communications with dedicated devices like shared-memory or AAL5 for ATM-based clusters of workstations.</s0>
</fC01><fC02 i1="01" i2="X"><s0>001D02B04</s0>
</fC02><fC02 i1="02" i2="X"><s0>001D02A05</s0>
</fC02><fC02 i1="03" i2="X"><s0>001D02B07C</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>Réseau ordinateur</s0>
<s5>03</s5>
</fC03><fC03 i1="03" i2="X" l="ENG"><s0>Computer network</s0>
<s5>03</s5>
</fC03><fC03 i1="03" i2="X" l="SPA"><s0>Red ordenador</s0>
<s5>03</s5>
</fC03><fC03 i1="04" i2="X" l="FRE"><s0>Mémoire partagée</s0>
<s5>04</s5>
</fC03><fC03 i1="04" i2="X" l="ENG"><s0>Shared memory</s0>
<s5>04</s5>
</fC03><fC03 i1="04" i2="X" l="SPA"><s0>Memoria compartida</s0>
<s5>04</s5>
</fC03><fC03 i1="05" i2="X" l="FRE"><s0>Communication</s0>
<s5>05</s5>
</fC03><fC03 i1="05" i2="X" l="ENG"><s0>Communication</s0>
<s5>05</s5>
</fC03><fC03 i1="05" i2="X" l="SPA"><s0>Comunicación</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>Langage C++</s0>
<s5>07</s5>
</fC03><fC03 i1="07" i2="X" l="ENG"><s0>C++ language</s0>
<s5>07</s5>
</fC03><fC03 i1="07" i2="X" l="SPA"><s0>Lenguaje C++</s0>
<s5>07</s5>
</fC03><fC03 i1="08" i2="X" l="FRE"><s0>Langage C</s0>
<s5>08</s5>
</fC03><fC03 i1="08" i2="X" l="ENG"><s0>C language</s0>
<s5>08</s5>
</fC03><fC03 i1="08" i2="X" l="SPA"><s0>Lenguaje C</s0>
<s5>08</s5>
</fC03><fC03 i1="09" i2="X" l="FRE"><s0>Algorithme parallèle</s0>
<s5>09</s5>
</fC03><fC03 i1="09" i2="X" l="ENG"><s0>Parallel algorithm</s0>
<s5>09</s5>
</fC03><fC03 i1="09" i2="X" l="SPA"><s0>Algoritmo paralelo</s0>
<s5>09</s5>
</fC03><fC03 i1="10" i2="X" l="FRE"><s0>Implémentation</s0>
<s5>10</s5>
</fC03><fC03 i1="10" i2="X" l="ENG"><s0>Implementation</s0>
<s5>10</s5>
</fC03><fC03 i1="10" i2="X" l="SPA"><s0>Ejecución</s0>
<s5>10</s5>
</fC03><fC03 i1="11" i2="X" l="FRE"><s0>Performance algorithme</s0>
<s5>11</s5>
</fC03><fC03 i1="11" i2="X" l="ENG"><s0>Algorithm performance</s0>
<s5>11</s5>
</fC03><fC03 i1="11" i2="X" l="SPA"><s0>Resultado algoritmo</s0>
<s5>11</s5>
</fC03><fC03 i1="12" i2="X" l="FRE"><s0>Portabilité</s0>
<s5>12</s5>
</fC03><fC03 i1="12" i2="X" l="ENG"><s0>Portability</s0>
<s5>12</s5>
</fC03><fC03 i1="12" i2="X" l="GER"><s0>Transportfaehigkeit</s0>
<s5>12</s5>
</fC03><fC03 i1="12" i2="X" l="SPA"><s0>Portabilidad</s0>
<s5>12</s5>
</fC03><fC03 i1="13" i2="X" l="FRE"><s0>Abstract approach</s0>
<s4>INC</s4>
<s5>73</s5>
</fC03><fN21><s1>076</s1>
</fN21><pR><fA30 i1="01" i2="1" l="ENG"><s1>PARA '96. International workshop</s1>
<s2>3</s2>
<s3>Lyngby DNK</s3>
<s4>1996-08-18</s4>
</fA30><server><NO>PASCAL 97-0166889 INIST</NO>
<ET>MeDLey : An abstract approach to Message Passing</ET>
<AU>DILLON (E.); GUYARD (J.); WANTZ (G.); WASNIEWSKI (Jerzy); DONGARRA (Jack); MADSEN (Kaj); OLESEN (Dorte)</AU>
<AF>CRIN/INRIA, 615, rue du jardin botanique/54602 Villers-les-Nancy/France (1 aut., 2 aut.); CRP-CU/Luxembourg/Luxembourg (3 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 1996; Vol. 1184; Pp. 196-203; Bibl. 5 ref.</SO>
<LA>Anglais</LA>
<EA>Message Passing has become one of the most popular parallel programming paradigms because of its ease of use. Conversely, using it efficiently often requires lots of efforts, when designing a distributed application. Finally, such an application often requires optimization, since performances are not always as good as expected. With MeDLey, we propose an abstract approach to message passing. The basic idea is to provide a language that might be used to specify all communications within a distributed application. With this specification, the user does not have to care about the implementation any more, and leaves it to the compiler's charge. Finally, the aim of this approach is to achieve more efficiency by generating specific communication primitives rather than using generic message passing libraries. MeDLey has followed two main steps: MeDLey-0 was the first version of the compiler. It was able to generate C++ and MPI communications primitives, mainly to help the user in the design process. MeDLey-1 now tries to gain more efficiency by implementing communications with dedicated devices like shared-memory or AAL5 for ATM-based clusters of workstations.</EA>
<CC>001D02B04; 001D02A05; 001D02B07C</CC>
<FD>Système parallèle; Système multiprocesseur mémoire répartie; Réseau ordinateur; Mémoire partagée; Communication; Modélisation; Langage C++; Langage C; Algorithme parallèle; Implémentation; Performance algorithme; Portabilité; Abstract approach</FD>
<ED>Parallel system; Distributed memory multiprocessor system; Computer network; Shared memory; Communication; Modeling; C++ language; C language; Parallel algorithm; Implementation; Algorithm performance; Portability</ED>
<GD>Transportfaehigkeit</GD>
<SD>Sistema paralelo; Sistema multiprocesador memoria distribuida; Red ordenador; Memoria compartida; Comunicación; Modelización; Lenguaje C++; Lenguaje C; Algoritmo paralelo; Ejecución; Resultado algoritmo; Portabilidad</SD>
<LO>INIST-16343.354000062189610210</LO>
<ID>97-0166889</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 000C77 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000C77 | 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:97-0166889
|texte= MeDLey : An abstract approach to Message Passing
}}
| 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 |  |
