Orchestrating Computations on the World-Wide-Web

在Internet上执行分布式应用程序涉及对远程对象和协调任务的方法调用。该建议通过以下方式解决任务协调问题：(1)将计算模型限制为树结构并发；(2)假设存在一个环境，该环境提供分布式对象上的远程方法调用、持久存储和使用标准函数库进行计算的功能。树形结构的并发只允许任务之间有限制的通信：一个任务可以产生子任务，所有的通信都在父任务和它们的子任务之间进行。可以证明，这种结构通信虽然不如进程网络中的交互强大，但足以解决大多数感兴趣的问题，并且它们避免了与并发相关的许多问题。这项研究的更广泛的影响将是：(1)为受限类并发计算设计一个理论，它仍然显示出解决各种任务协调问题的能力；(2)开发原型实现，使非程序员能够轻松地在互联网上开发分布式应用程序。

Execution of distributed applications over the Internet involves method invocations on remote objects and coordination tasks. This proposal addresses the task coordination problem by (1) limiting the model of computation to tree structured concurrency, and (2) assuming that there is an environment that provides sacilities for remote method invocation on distributted objects, persistent storage,and computation using standard function library. Tree structured concurrency permits only restricted communications among the tasks: a task may spawn children task and all communications are between parents and their children. It can be shown that such structure communication, though less powerful than interactions in process networks, are sufficient to solve most problems of interest, and they avoid many of the problems associated with concurrency. The broader impact of this research will be to (1) design a theory for restricted class of concurrent computing, which still exhibits the power to solve a variety of task coordination problems, and (2) develop prototype implementations that allow non-programmers to develop with ease distributed applications on the Internet.