.png){kind=icon}
.png){kind=icon}
Return
An efficient incremental marshaling framework for distributed systems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.future.2004.05.012.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (c) 2004 Elsevier B.V. All rights reserved.
Keywords:
distributed computing
marshaling
concurrency
latency
throughput
Journal
F
IF:
6.1
Papers:
6.8K
Citations:
2.3W
Organization
No organization information available