基于一般逻辑拓扑结构的广播通信研究和实现  

STUDY AND IMPLEMENTATION OF BROADCASTS BASED ON GENERAL LOGIC TOPOLOGY STRUCTURES

作　　者：熊玉庆[1] 张祥[1] 

机构地区：[1]中国科学院计算技术研究所,北京100080

出　　处：《计算机研究与发展》2000年第3期300-306,共7页Journal of Computer Research and Development

摘　　要：在分布存储并行计算消息传递系统中，许多广播通信中的消息传递路径是对程序员透明的，程序员不能改变消息传递路径．但应用程序运行时的情况很复杂．程序员根据计算环境及应用程序特性选择消息传递路径，有助于提高广播通信的效能．在通信过程中，消息标志是用来区分消息的，以便接受进程能正确接受消息．然而，消息标志易导致应用程序出错，而且消息标志增加编制程序的复杂性．文中首先给出了逻辑拓扑结构的形式定义及基本性质，提出了一个基于一般逻辑拓扑结构的无消息标志广播通信算法．这里的逻辑拓扑结构不是指物理网络拓扑结构，而是指控制数据流向的机制，它决定一个进程何时及向何处接受或发送消息．由于一般逻辑拓扑结构的抽象性，该算法实际上提供了一个无消息标志广播通信算法框架，从而为解决上述问题提供了一个可能的途径．In message passing systems for distributed memory parallel computing, the routes of message passing in many broadcasts are transparent to programmers, and the programmers can not change the routes of message passing. However, the status of application runtimes is rather complicated. It will help to improve the efficiency of broadcasts for programmers to choose the routes of message passing according to computing environment and application characteristics. Message tags are used to distinguish messages in communications so that a receiving process can receive messages correctly. Nevertheless, message tags are prone to cause applications errors. Furthermore, message tags add complexity of programming. In this paper, the formal definitions of a general logic topology structure and its fundamental features are givern firstly, and then an algorithm of broadcasts without message tags is proposed based on the general logic topology structure. Here topology structures are a kind of mechanisms which determin how the messages in a distributed operation are sent. Since the general logic topology structure is abstract, the algorithm is in fact an algorithmic framework for broadcasts without message tags. Therefore, this provides a new possible approach to solving the above problems.

关 键 词：并行计算 广播通信 逻辑拓扑结构 算法 油藏模拟 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构] TE319[自动化与计算机技术—计算机科学与技术]