课题基金 / 基金详情

Research Initiation: Graph Abstractions for Concurrent Processing

Research Initiation: Graph Abstractions for Concurrent Processing
研究启动:并发处理的图抽象
批准号:
8809479
负责人:
Simon Kaplan
金额:
$5.45万
依托单位国家:
美国
项目类别:
Standard Grant
财政年份:
1988
资助国家:
美国
项目状态:
已结题
起止时间:
1988-06-01 至 1990-11-30

项目摘要

项目成果

相似基金

相关文献

中文摘要
翻译
具有动态进程间拓扑的并发系统在计算机程序设计中提出了一个新的控制问题。目前,程序员被迫在类似于指针或GOTO语句的级别上描述拓扑。研究人员提出使用一种基于图文法的技术来以高级别、抽象的方式控制互连。我们系统中的计算代理通过多组端口进行通信。每个端口都连接到一组其他代理。图文法用于指定合法拓扑的类别,可通过使用文法中的结果重写来更改。这可能会改变代理的连接性。采用高级选择机制来使代理能够选择连接到特定端口的代理子集以进行通信。代理由一组方法组成;当接收到消息时,将调用用于处理该消息的适当方法。这项拨款下的研究涉及调查基于图文法的并发编程方法所需的语言特征和编程环境支持,在共享内存和消息传递体系结构上实现该系统,以及调查将逻辑图形拓扑映射到物理处理器拓扑的算法。
英文摘要
Concurrent systems with dynamic interprocess topology present a new control problem in computer programming. Currently programmers are forced to describe topologies at a level analogous to that of the pointer or the goto statement. The investigator proposes the use of a technology based on graph grammars to control interconnections in a high-level, abstract manner. The computational agents in our system communicate through sets of ports. Each port is connected to a set of other agents. A graph grammar is used to specify the class of legal topologies, which may be altered by rewriting using a production in the grammar. This may change the connectivity of agents. A high-level selection mechanism is employed to enable an agent to select subsets of agents connected to particular ports for communication. Agents consist of a set of methods; when a message is received the appropriate method for processing that message is invoked. The research under this grant involves the investigation of language features and programming environment support necessary for a graph- grammar based approach to concurrent programming, the implementation of the system both on shared-memory and message-passing architectures, and the investigation of algorithms for the mapping of logical graph topologies onto physical processor topologies.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
海外基金