求解布局模型的并行矩阵算法研究

A PARALLEL MATRIX ALGORITHM FOR THE LAYOUT MODEL SOLVING

布局设计通常要建立抽象状态空间模型．求解布局模型，实现从模型状态到坐标图的转化，是计算机辅助布局设计的重要研究内容之一．本文在简要介绍一种层次布局模型ＨＬＭ１的基础上，引入了模型的解的概念；研究了ＨＬＭ１的子模型——层次约束图解的存在条件；提出了求解层次约束图，实现从模型到坐标图转化以及检测约束矛盾的一种并行矩阵算法，并给出了一个计算实例．

Usually, the abstract layout model is needed in computer aided layout design.The layout model solving that transforms the layout model state into the coordinate graph is one of the keys in computer aided layout design.At first in the paper,a hierarchical layout model HLM1 which contains several sub models is briefly described.One of the sub models is the hierarchical constraint graph.After that,the model solution concept is introduced;the solution existence condition of the hierarchical constraint graph is given.Then,a parallel matrix algorithm that can solve the model and transform the model state to the coordinate graph is presented.The constraint contradiction can be checked by the matrix algorithm.A case study is given at the last part of the paper.