Parallel algorithms for corner stitching

作     者：Mehta, DP Wilson, ED 

作者机构：Univ Tennessee Inst Space Dept Comp Sci Tullahoma TN 37388 USA IBM Global Serv Roanoke TX 76262 USA 

出 版 物：《CONCURRENCY-PRACTICE AND EXPERIENCE》 (并行学和计算：实践与经验)

年 卷 期：1998年第10卷第15期

页      面：1317-1341页

核心收录：

学科分类：08[工学] 0835[工学-软件工程] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：Parallel algorithms 

摘      要：Corner stitching is the underlying data structure that is used to represent rectangular objects in interactive VLSI layout editing systems such as Magic and Tailor, In this paper we develop efficient algorithms for basic corner stitching operations under the message-passing paradigm. These algorithms were implemented using C and PVM on a distributed network composed of SUN workstations, Experimental results show that significant speed-ups were obtained. (C) 1998 John Wiley & Sons, Ltd.