MozartV1, Main, Merge, bibRecord, 002191

An efficient marshaling framework for distributed systems

Identifieur interne : 002191 ( Main/Merge ); précédent : 002190; suivant : 002192

An efficient marshaling framework for distributed systems

Auteurs : Konstantin Popov [Suède] ; Vladimir Vlassov [Suède] ; Per Brand [Suède] ; Seif Haridi [Suède]

Source :

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

RBID : Pascal:04-0191822

Descripteurs français

Pascal (Inist)
- Système réparti, Réseau télécommunication, Simultanéité informatique, Internet, Stockage, Latence, Paradigme, Implémentation, Réseau web, Algorithme réparti.
Wicri :
- topic : Stockage.

English descriptors

KwdEn :
- Concurrency, Distributed algorithm, Distributed system, Implementation, Internet, Latency, Paradigm, Storage, Telecommunication network, World wide web.

Abstract

An efficient (un)marshaling framework is presented. It is designed for distributed applications implemented in languages such as C++. A marshaler/unmarshaler pair converts arbitrary structured data between its host and network representations. This technology can also be used for persistent storage. Our framework simplifies the design of efficient and flexible marshalers. The network latency is reduced by concurrent execution of (un)marshaling and network operations. The framework is actually used in Mozart, a distributed programming system that implements Oz, a multi-paradigm concurrent language. Mozart, including the implementation of the framework, is available at www.mozart-oz.org.

Links toward previous steps (curation, corpus...)

to stream PascalFrancis, to step Corpus: 000195
to stream PascalFrancis, to step Curation: 000022
to stream PascalFrancis, to step Checkpoint: 000118

Links to Exploration step

Pascal:04-0191822

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">An efficient marshaling framework for distributed systems</title>
<author><name sortKey="Popov, Konstantin" sort="Popov, Konstantin" uniqKey="Popov K" first="Konstantin" last="Popov">Konstantin Popov</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Swedish Institute of Computer Science (SICS)</s1>
<s2>Kista</s2>
<s3>SWE</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>Suède</country>
<wicri:noRegion>Swedish Institute of Computer Science (SICS)</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Vlassov, Vladimir" sort="Vlassov, Vladimir" uniqKey="Vlassov V" first="Vladimir" last="Vlassov">Vladimir Vlassov</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Department of Microelectronics and Information Technology, Royal Institute of Technology</s1>
<s2>Kista</s2>
<s3>SWE</s3>
<sZ>2 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>Suède</country>
<wicri:noRegion>Kista</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Brand, Per" sort="Brand, Per" uniqKey="Brand P" first="Per" last="Brand">Per Brand</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Swedish Institute of Computer Science (SICS)</s1>
<s2>Kista</s2>
<s3>SWE</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>Suède</country>
<wicri:noRegion>Swedish Institute of Computer Science (SICS)</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Haridi, Seif" sort="Haridi, Seif" uniqKey="Haridi S" first="Seif" last="Haridi">Seif Haridi</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Department of Microelectronics and Information Technology, Royal Institute of Technology</s1>
<s2>Kista</s2>
<s3>SWE</s3>
<sZ>2 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>Suède</country>
<wicri:noRegion>Kista</wicri:noRegion>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">04-0191822</idno>
<date when="2003">2003</date>
<idno type="stanalyst">PASCAL 04-0191822 INIST</idno>
<idno type="RBID">Pascal:04-0191822</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000195</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000022</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000118</idno>
<idno type="wicri:doubleKey">0302-9743:2003:Popov K:an:efficient:marshaling</idno>
<idno type="wicri:Area/Main/Merge">002191</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">An efficient marshaling framework for distributed systems</title>
<author><name sortKey="Popov, Konstantin" sort="Popov, Konstantin" uniqKey="Popov K" first="Konstantin" last="Popov">Konstantin Popov</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Swedish Institute of Computer Science (SICS)</s1>
<s2>Kista</s2>
<s3>SWE</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>Suède</country>
<wicri:noRegion>Swedish Institute of Computer Science (SICS)</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Vlassov, Vladimir" sort="Vlassov, Vladimir" uniqKey="Vlassov V" first="Vladimir" last="Vlassov">Vladimir Vlassov</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Department of Microelectronics and Information Technology, Royal Institute of Technology</s1>
<s2>Kista</s2>
<s3>SWE</s3>
<sZ>2 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>Suède</country>
<wicri:noRegion>Kista</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Brand, Per" sort="Brand, Per" uniqKey="Brand P" first="Per" last="Brand">Per Brand</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Swedish Institute of Computer Science (SICS)</s1>
<s2>Kista</s2>
<s3>SWE</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>Suède</country>
<wicri:noRegion>Swedish Institute of Computer Science (SICS)</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Haridi, Seif" sort="Haridi, Seif" uniqKey="Haridi S" first="Seif" last="Haridi">Seif Haridi</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Department of Microelectronics and Information Technology, Royal Institute of Technology</s1>
<s2>Kista</s2>
<s3>SWE</s3>
<sZ>2 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>Suède</country>
<wicri:noRegion>Kista</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>Concurrency</term>
<term>Distributed algorithm</term>
<term>Distributed system</term>
<term>Implementation</term>
<term>Internet</term>
<term>Latency</term>
<term>Paradigm</term>
<term>Storage</term>
<term>Telecommunication network</term>
<term>World wide web</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Système réparti</term>
<term>Réseau télécommunication</term>
<term>Simultanéité informatique</term>
<term>Internet</term>
<term>Stockage</term>
<term>Latence</term>
<term>Paradigme</term>
<term>Implémentation</term>
<term>Réseau web</term>
<term>Algorithme réparti</term>
</keywords>
<keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Stockage</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">An efficient (un)marshaling framework is presented. It is designed for distributed applications implemented in languages such as C++. A marshaler/unmarshaler pair converts arbitrary structured data between its host and network representations. This technology can also be used for persistent storage. Our framework simplifies the design of efficient and flexible marshalers. The network latency is reduced by concurrent execution of (un)marshaling and network operations. The framework is actually used in Mozart, a distributed programming system that implements Oz, a multi-paradigm concurrent language. Mozart, including the implementation of the framework, is available at www.mozart-oz.org.</div>
</front>
</TEI>
<affiliations><list><country><li>Suède</li>
</country>
</list>
<tree><country name="Suède"><noRegion><name sortKey="Popov, Konstantin" sort="Popov, Konstantin" uniqKey="Popov K" first="Konstantin" last="Popov">Konstantin Popov</name>
</noRegion>
<name sortKey="Brand, Per" sort="Brand, Per" uniqKey="Brand P" first="Per" last="Brand">Per Brand</name>
<name sortKey="Haridi, Seif" sort="Haridi, Seif" uniqKey="Haridi S" first="Seif" last="Haridi">Seif Haridi</name>
<name sortKey="Vlassov, Vladimir" sort="Vlassov, Vladimir" uniqKey="Vlassov V" first="Vladimir" last="Vlassov">Vladimir Vlassov</name>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Musique/explor/MozartV1/Data/Main/Merge

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002191 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 002191 | SxmlIndent | more

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

{{Explor lien
   |wiki=    Wicri/Musique
   |area=    MozartV1
   |flux=    Main
   |étape=   Merge
   |type=    RBID
   |clé=     Pascal:04-0191822
   |texte=   An efficient marshaling framework for distributed systems
}}

This area was generated with Dilib version V0.6.20.
Data generation: Sun Apr 10 15:06:14 2016. Site generation: Tue Feb 7 15:40:35 2023

	Serveur d'exploration sur Mozart
	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 Mozart

An efficient marshaling framework for distributed systems

An efficient marshaling framework for distributed systems

Source :

Descripteurs français

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

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