Semantics for parameter passing in a type-complete persistent RPC

Proceedings of 16th International Conference on Distributed Computing Systems Pub Date : 1996-05-27 DOI:10.1109/ICDCS.1996.507989

M. Silva, M. Atkinson, A. Black

引用次数: 18

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.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

在类型完整的持久化RPC中传递参数的语义

当前用于持久化语言的RPC机制要么是通过引用传递(在这种情况下，它们不能扩展)，要么是通过复制传递(在这种情况下，它们复制对象并破坏共享关系)。在本文中，我们认为，要构建非常大的分布式持久应用程序，需要在这两种机制之间折衷。我们研究的最终目标是构建一个可伸缩的持久RPC，同时仍然保持对象共享类型安全性、类型完整性和易于被应用程序程序员理解的语义。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Proceedings of 16th International Conference on Distributed Computing Systems

自引率

0.00%

发文量

期刊最新文献

An extended network scheduling model Distributed priority queues on hypercube architectures An embeddable and extendable language for large-scale programming on the Internet Conservative garbage collection on distributed shared memory systems Optimal deadlock detection in distributed systems based on locally constructed wait-for graphs