所有极大等间距共线集和所有极大正则格的并行算法

[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation Pub Date : 1992-10-19 DOI:10.1109/FMPC.1992.234905

L. Boxer, R. Miller

{"title":"所有极大等间距共线集和所有极大正则格的并行算法","authors":"L. Boxer, R. Miller","doi":"10.1109/FMPC.1992.234905","DOIUrl":null,"url":null,"abstract":"The authors present parallel solutions to the AMESCS (all maximal equally-spaced collinear subset) and AMRSS (all maximal regularly-spaced subset) problems and show how their solutions to the latter generalize to the AMRSDLS (all maximal regularly-spaced D-dimensional lattice subsets) problem. Their algorithms differ significantly from the optimal sequential algorithms presented in A.B. Kahng and G. Robins (1991), which do not scale well to (massively) parallel machines. The optimality of the authors' Arbitrary CRCW PRAM (parallel random access machine) algorithms is open; however, the algorithms they present are within a logarithmic factor of optimal. Further, the algorithms are optimal for the mesh-connected computer.<<ETX>>","PeriodicalId":117789,"journal":{"name":"[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation","volume":"247 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Parallel algorithms for all maximal equally-spaced collinear sets and all maximal regular lattices\",\"authors\":\"L. Boxer, R. Miller\",\"doi\":\"10.1109/FMPC.1992.234905\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors present parallel solutions to the AMESCS (all maximal equally-spaced collinear subset) and AMRSS (all maximal regularly-spaced subset) problems and show how their solutions to the latter generalize to the AMRSDLS (all maximal regularly-spaced D-dimensional lattice subsets) problem. Their algorithms differ significantly from the optimal sequential algorithms presented in A.B. Kahng and G. Robins (1991), which do not scale well to (massively) parallel machines. The optimality of the authors' Arbitrary CRCW PRAM (parallel random access machine) algorithms is open; however, the algorithms they present are within a logarithmic factor of optimal. Further, the algorithms are optimal for the mesh-connected computer.<<ETX>>\",\"PeriodicalId\":117789,\"journal\":{\"name\":\"[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation\",\"volume\":\"247 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-10-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FMPC.1992.234905\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FMPC.1992.234905","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

作者给出了AMESCS(所有极大等间距共线子集)和AMRSS(所有极大规则间距子集)问题的并行解，并展示了他们对后者的解如何推广到AMRSDLS(所有极大规则间距d维晶格子集)问题。他们的算法与A.B. Kahng和G. Robins(1991)提出的最优顺序算法有很大不同，后者不能很好地扩展到(大规模)并行机器。作者的任意CRCW并行随机存取机(PRAM)算法的最优性是开放的;然而，他们提出的算法是在一个对数因子的最优。此外，该算法对于网格连接计算机是最优的。

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

查看原文本刊更多论文

Parallel algorithms for all maximal equally-spaced collinear sets and all maximal regular lattices

The authors present parallel solutions to the AMESCS (all maximal equally-spaced collinear subset) and AMRSS (all maximal regularly-spaced subset) problems and show how their solutions to the latter generalize to the AMRSDLS (all maximal regularly-spaced D-dimensional lattice subsets) problem. Their algorithms differ significantly from the optimal sequential algorithms presented in A.B. Kahng and G. Robins (1991), which do not scale well to (massively) parallel machines. The optimality of the authors' Arbitrary CRCW PRAM (parallel random access machine) algorithms is open; however, the algorithms they present are within a logarithmic factor of optimal. Further, the algorithms are optimal for the mesh-connected computer.<>

求助全文

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

来源期刊

[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation

自引率

0.00%

发文量