An efficient incremental marshaling framework for distributed systems

Authors:
K. Popov;V. Vlassov;P. Brand;S. Haridi
Affiliations:
Swedish Institute of Computer Science (SICS), Kista, Sweden;Department of Microelectronics and Information Technology, Royal Institute of Technology, Kista, Sweden;Swedish Institute of Computer Science (SICS), Kista, Sweden;Department of Microelectronics and Information Technology, Royal Institute of Technology, Kista, Sweden
Venue:
Future Generation Computer Systems - Special issue: Parallel computing technologies
Year:
2005

Citing 3
Cited 0

MPI: a message passing interface

Proceedings of the 1993 ACM/IEEE conference on Supercomputing
Concurrent programming in ERLANG (2nd ed.)

Concurrent programming in ERLANG (2nd ed.)
Concepts, Techniques, and Models of Computer Programming

Concepts, Techniques, and Models of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an efficient and incremental (un)marshaling framework designed for distributed applications. 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.