摘要
很多分布式程序由一组分散在不同处理器结点上的松散耦合的进程协作完成某项任务．这些进程底层的逻辑结构可以用一个图来表示，进程间的通信和同步关系可以用图上的操作来表示．该文描述了面向图结构的模型GOM（Graph-oriented Model）以及它的实现GOS（Graph-ori-ented System）．在GOM层，一个分布式程序由一个概念图以及由消息激活的若干函数构成．这些函数提供了图结构上的各种操作，如通信和同步、子图操作、修改操作、查询操作等．GOS则向用户提供高层的、基于图结构的分布式程序设计环境．
Many distributed programs consist of a set of decentralized and looselycoupled processes located on different processor nodes cooperating to fulfill a task.The underlying logical construct of these processes can often be modeled by agraph. Also, communication and synchronization among the processes can be mod-eled as operations on the graph. This paper describes graph-oriented model for dis-tributed programming and its implementation, graph-oriented system (GOS). Onthe level of GOM, a distributed program consists of a conceptual graph and somefunctions lnvoked by message traversing. The conceptual graph defines how the lo-cal processes is mapped to a logical node, and further, a host. The functions sup-plies various operations based on a logical graph construct such as communicationand synchronization, subgraph operations, update operations, inquiry operations,ect.. GOS offers the user a high-level, graph-based distributed programming envi-ronment,which is based on PVM. GOS mainly includes three modules: a daemon,a library and a set of subtasks. Daemon is the kernel part of the whole system. Itmanages the graphs distributed over the different nodes. The library is a interfacebetween the user and the system. Subtasks are the real part to really process graphoperations and can do them parallely.
出处
《计算机学报》
EI
CSCD
北大核心
1998年第1期18-25,共8页
Chinese Journal of Computers
基金
香港城市大学计算机科学系合作项目
关键词
分布式
程序设计
图
GOM
Distributed programming, graph, message
