分布式求解平行结构类问题中重选区域的研究  

OVERLAPPING AREAS IN DISTRIBUTED SOLUTION OF FLAT-STRUCTURED PROBLEMS

作　　者：胡蓬[1] 苏伯珙[1] 石纯一[1] 

机构地区：[1]清华大学计算机科学与技术系,北京100084

出　　处：《计算机学报》1993年第6期442-450,共9页Chinese Journal of Computers

摘　　要：本文以平行结构类问题的形式化描述为基础,详细讨论了分布式求解平行结构类问题系统中相邻结点间重迭区域的作用,定义了最小重迭区域的概念,并提出一种新的设立重迭区域方法——“可变法”,最后在分布式运输调度系统上进行了试验研究,结果表明:〈1〉设置重迭区域是必要的;〈2〉最小重迭区域的定义是有意义的;〈3〉与美国麻省大学采用的“固定法”相比,“可变法”保证了求解质量,减少了冗余的计算与通信开销。Based on the formal description of flat-structured problems,this pape discusses the roles of overlapping area between adjacent agents in a distributed system for flat-structured problems,defines the concept of 'minimal overlapping area',an presents a new approach 'variable overlapping area method' for setting overlappin area.The experimental results show that,compared to the 'fixed overlapping are method',the 'variable overlapping area method' promises better problem solving qua: ity and less overheads of computation and communication.

关 键 词：分布式求解 重迭区域 平行结构类 

分 类 号：TP303[自动化与计算机技术—计算机系统结构]