Loosely-Coupled Processes

大规模分布式编程，其中进程进行通信 通过消息，是一个现实，而大规模的共享变量 方案拟订仍然是一项不为人所理解的活动。 据推测 这两个类之间的区别是 在前一种情况下是纪律性的，在后一种情况下是任意性的。 后一种情况。 此外，共享变量的实现 具有单独高速缓存的多处理器上的系统提出了几个 问题，包括缓存一致性。 这项工作试图强加给 共享变量编程的某些学科， 系统设计变得可行，并且实现避免了大多数 与缓存一致性相关的问题。 研究计划是确定一个实质性的类 共享变量系统具有以下优点： 分布式（即，消息传递）系统。 这些系统将被 约束到一个称为松耦合的类，其中 不同过程的计算在很大程度上是互不干扰的， 尽管它们共享变量。 松散耦合系统将获得 某些属性--例如没有“竞争条件”--通常 与分布式系统相关。 松耦合设计 这些系统将在没有对各种情况进行广泛分析的情况下完成 基于执行序列、进程交互或死锁。 将开发此类系统的组成证明理论， 这种系统在多存储器上有效实现 将指示多处理器体系结构。

Large-scale distributed programming, where processes communicate via messages, is a reality whereas large-scale shared variable programming remains an ill-understood activity. It is postulated that the distinction between these two classes is the type of communication-it is disciplined in the former case and arbitrary in the latter case. Furthermore, implementations of shared-variable systems on multiprocessors with individual caches pose several problems, including cache-coherence. This work attempts to impose certain disciplines on shared variable programming so that large-scale system design becomes feasible and the implementations avoid most of the issues associated with cache coherence. The plan of research is to identify a substantial class of shared-variable systems that enjoy some of the advantages of distributed (i.e., message-passing) systems. The systems will be constrained to a class called loosely-coupled, in which the computations of different processes are largely non-interfering even though they share variables. Loosely-coupled systems will acquire certain properties-such as absence of "race conditions" -normally associated with distributed systems. Designs of loosely-coupled systems will be accomplished without extensive analysis of scenarios based on execution sequences, process interactions or deadlock. Compositional proof theories for such systems will be developed and the efficient implementation of such a system on multiple-memory multiprocessor architectures will be indicated.