Semantics for parameter passing in a type-complete persistent RPC

Authors:
Affiliations:
Venue:
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
Year:
1996

Citing 0
Cited 4

Electronic contract negotiation as an application niche for mobile agents

EDOC '97 Proceedings of the 1st International Conference on Enterprise Distributed Object Computing
A Component Framework for Dynamic Reconfiguration of Distributed Systems

CD '02 Proceedings of the IFIP/ACM Working Conference on Component Deployment
Supporting transparent model update in distributed CASE tool integration

Proceedings of the 2006 ACM symposium on Applied computing
Lazy argument passing in Java RMI

Proceedings of the 6th international symposium on Principles and practice of programming in Java

Quantified Score

Hi-index	0.00

Visualization

Abstract

Current RPC mechanisms for persistent languages are either pass by reference-in which case they do not scale-or pass by copy-in which case they duplicate objects and destroy sharing relationships. In this paper we argue that to build very large distributed persistent applications a compromise between these two mechanisms is needed. The ultimate goal of our research is to build a scalable persistent RPC while still maintaining object sharing type safety, type completeness and semantics that are readily understood by application programmers.