角点拼接的并行算法

Concurr. Pract. Exp. Pub Date : 1998-12-25 DOI:10.1002/(SICI)1096-9128(19981225)10:15%3C1317::AID-CPE419%3E3.0.CO;2-4

D. Mehta, E. D. Wilson

{"title":"角点拼接的并行算法","authors":"D. Mehta, E. D. Wilson","doi":"10.1002/(SICI)1096-9128(19981225)10:15%3C1317::AID-CPE419%3E3.0.CO;2-4","DOIUrl":null,"url":null,"abstract":"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. 1998 John Wiley & Sons, Ltd.","PeriodicalId":199059,"journal":{"name":"Concurr. Pract. Exp.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Parallel algorithms for corner stitching\",\"authors\":\"D. Mehta, E. D. Wilson\",\"doi\":\"10.1002/(SICI)1096-9128(19981225)10:15%3C1317::AID-CPE419%3E3.0.CO;2-4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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. 1998 John Wiley & Sons, Ltd.\",\"PeriodicalId\":199059,\"journal\":{\"name\":\"Concurr. Pract. Exp.\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-12-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Concurr. Pract. Exp.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/(SICI)1096-9128(19981225)10:15%3C1317::AID-CPE419%3E3.0.CO;2-4\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurr. Pract. Exp.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/(SICI)1096-9128(19981225)10:15%3C1317::AID-CPE419%3E3.0.CO;2-4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

角拼接是用于在交互式VLSI布局编辑系统(如Magic和Tailor)中表示矩形对象的底层数据结构。在消息传递范式下，我们开发了基本角拼接操作的高效算法。这些算法在一个由SUN工作站组成的分布式网络上使用C语言和PVM实现。实验结果表明，得到了显著的加速。1998 John Wiley & Sons, Ltd

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Parallel algorithms for corner stitching

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. 1998 John Wiley & Sons, Ltd.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Concurr. Pract. Exp.

自引率

0.00%

发文量