重新审视并行处理组合对象的模式

2013 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum Pub Date : 2013-05-20 DOI:10.1109/IPDPSW.2013.123

C. Trefftz, J. Scripps

{"title":"重新审视并行处理组合对象的模式","authors":"C. Trefftz, J. Scripps","doi":"10.1109/IPDPSW.2013.123","DOIUrl":null,"url":null,"abstract":"The unrank pattern to process combinatorial objects in parallel is revisited. The pattern is applied to find, in parallel, solutions to a restricted version of the community finding problem on small graphs. Performance results obtained on a shared memory machine, a cluster of workstations and a Graphical Processing Unit (GPU) are included.","PeriodicalId":234552,"journal":{"name":"2013 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Revisiting a Pattern for Processing Combinatorial Objects in Parallel\",\"authors\":\"C. Trefftz, J. Scripps\",\"doi\":\"10.1109/IPDPSW.2013.123\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The unrank pattern to process combinatorial objects in parallel is revisited. The pattern is applied to find, in parallel, solutions to a restricted version of the community finding problem on small graphs. Performance results obtained on a shared memory machine, a cluster of workstations and a Graphical Processing Unit (GPU) are included.\",\"PeriodicalId\":234552,\"journal\":{\"name\":\"2013 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-05-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IPDPSW.2013.123\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPDPSW.2013.123","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

重新审视了并行处理组合对象的无序模式。该模式用于在小图上并行地查找社区查找问题的受限版本的解决方案。包括在共享内存机器、工作站集群和图形处理单元(GPU)上获得的性能结果。

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

查看原文本刊更多论文

Revisiting a Pattern for Processing Combinatorial Objects in Parallel

The unrank pattern to process combinatorial objects in parallel is revisited. The pattern is applied to find, in parallel, solutions to a restricted version of the community finding problem on small graphs. Performance results obtained on a shared memory machine, a cluster of workstations and a Graphical Processing Unit (GPU) are included.

求助全文

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

来源期刊

2013 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum

自引率

0.00%

发文量