Orchestrating Computations on the World-Wide-Web

在万维网上编排计算

• 批准号: 0204323
• 负责人: Jayadev Misra
• 金额: $ 16万
• 依托单位: University of Texas at Austin
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2002
• 资助国家: 美国
• 起止时间: 2002-09-01 至 2005-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0204323&HistoricalAwards=false
• 关键词: Orchestrating; Computations; World; Wide; Web

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.

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