IDPS:一个大规模并行启发式搜索算法

A. Mahanti, C. J. Daniels
{"title":"IDPS:一个大规模并行启发式搜索算法","authors":"A. Mahanti, C. J. Daniels","doi":"10.1109/IPPS.1992.223042","DOIUrl":null,"url":null,"abstract":"Presents an efficient SIMD parallel algorithm, called IDPS (iterative deepening parallel search). The performance of four variants of IDPS is studied through experiments conducted on the well known test-bed problem for search algorithms, the 15-puzzle. During the experiments, data were gathered under two different static load-balancing schemes. Under the first scheme, an average efficiency of approximately /sup 3///sub 4/ was obtained for 4 K, 8 K, and 16 K processors. Under the second scheme, average efficiencies of 0.92 and 0.76 were obtained for 8 K and 16 K processors, respectively. It is also shown that for admissible search, linear or superlinear average speedup can be obtained for problems of significant size.<<ETX>>","PeriodicalId":340070,"journal":{"name":"Proceedings Sixth International Parallel Processing Symposium","volume":"21 5","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"IDPS: a massively parallel heuristic search algorithm\",\"authors\":\"A. Mahanti, C. J. Daniels\",\"doi\":\"10.1109/IPPS.1992.223042\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Presents an efficient SIMD parallel algorithm, called IDPS (iterative deepening parallel search). The performance of four variants of IDPS is studied through experiments conducted on the well known test-bed problem for search algorithms, the 15-puzzle. During the experiments, data were gathered under two different static load-balancing schemes. Under the first scheme, an average efficiency of approximately /sup 3///sub 4/ was obtained for 4 K, 8 K, and 16 K processors. Under the second scheme, average efficiencies of 0.92 and 0.76 were obtained for 8 K and 16 K processors, respectively. It is also shown that for admissible search, linear or superlinear average speedup can be obtained for problems of significant size.<<ETX>>\",\"PeriodicalId\":340070,\"journal\":{\"name\":\"Proceedings Sixth International Parallel Processing Symposium\",\"volume\":\"21 5\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Sixth International Parallel Processing Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IPPS.1992.223042\",\"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 Sixth International Parallel Processing Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPPS.1992.223042","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

提出了一种高效的SIMD并行算法IDPS(迭代深化并行搜索)。通过在著名的搜索算法测试台问题15-puzzle上进行的实验,研究了四种IDPS变体的性能。在实验中,采用两种不同的静态负载均衡方案收集数据。在第一种方案下,4 K、8 K和16 K处理器的平均效率约为/sup 3/// //sub 4/。在第二种方案下,8k和16k处理器的平均效率分别为0.92和0.76。对于可容许搜索,对于显著大小的问题,可以得到线性或超线性的平均加速
本文章由计算机程序翻译,如有差异,请以英文原文为准。
IDPS: a massively parallel heuristic search algorithm
Presents an efficient SIMD parallel algorithm, called IDPS (iterative deepening parallel search). The performance of four variants of IDPS is studied through experiments conducted on the well known test-bed problem for search algorithms, the 15-puzzle. During the experiments, data were gathered under two different static load-balancing schemes. Under the first scheme, an average efficiency of approximately /sup 3///sub 4/ was obtained for 4 K, 8 K, and 16 K processors. Under the second scheme, average efficiencies of 0.92 and 0.76 were obtained for 8 K and 16 K processors, respectively. It is also shown that for admissible search, linear or superlinear average speedup can be obtained for problems of significant size.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信