Dijkstra算法在多核处理器上的加速

2018 International Conference on Electronics, Information, and Communication (ICEIC) Pub Date : 1900-01-01 DOI:10.23919/ELINFOCOM.2018.8330701

Abhay Prasad, Sukruth Kumar Krishnamurthy, Youngsoo Kim

{"title":"Dijkstra算法在多核处理器上的加速","authors":"Abhay Prasad, Sukruth Kumar Krishnamurthy, Youngsoo Kim","doi":"10.23919/ELINFOCOM.2018.8330701","DOIUrl":null,"url":null,"abstract":"The Single Source Shortest Path (SSSP) problem has been solved using various algorithms. We focus on accelerating a well known SSSP algorithm, the Dijkstra's algorithm using a multi-core CPU. We achieve acceleration by using the iParallel kernel, a hybrid kernel that runs on the sequential as well as parallel kernels intelligently. Our experimental results help find an optimal threshold to exploit parallelism for different sizes of the search terrain. We have achieved an overall acceleration of −48% and −51% on a dual-core ARM A9 processor and a 16-core Epiphany co-processor respectively.","PeriodicalId":413646,"journal":{"name":"2018 International Conference on Electronics, Information, and Communication (ICEIC)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Acceleration of Dijkstra's algorithm on multi-core processors\",\"authors\":\"Abhay Prasad, Sukruth Kumar Krishnamurthy, Youngsoo Kim\",\"doi\":\"10.23919/ELINFOCOM.2018.8330701\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Single Source Shortest Path (SSSP) problem has been solved using various algorithms. We focus on accelerating a well known SSSP algorithm, the Dijkstra's algorithm using a multi-core CPU. We achieve acceleration by using the iParallel kernel, a hybrid kernel that runs on the sequential as well as parallel kernels intelligently. Our experimental results help find an optimal threshold to exploit parallelism for different sizes of the search terrain. We have achieved an overall acceleration of −48% and −51% on a dual-core ARM A9 processor and a 16-core Epiphany co-processor respectively.\",\"PeriodicalId\":413646,\"journal\":{\"name\":\"2018 International Conference on Electronics, Information, and Communication (ICEIC)\",\"volume\":\"51 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 International Conference on Electronics, Information, and Communication (ICEIC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23919/ELINFOCOM.2018.8330701\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 International Conference on Electronics, Information, and Communication (ICEIC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/ELINFOCOM.2018.8330701","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

单源最短路径(SSSP)问题已经用各种算法解决了。我们专注于加速著名的SSSP算法，Dijkstra算法使用多核CPU。我们通过使用iParallel内核来实现加速，这是一个智能地在顺序和并行内核上运行的混合内核。我们的实验结果有助于找到一个最优阈值来利用不同大小的搜索地形的并行性。我们在双核ARM A9处理器和16核Epiphany协处理器上分别实现了- 48%和- 51%的总体加速。

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

查看原文本刊更多论文

Acceleration of Dijkstra's algorithm on multi-core processors

The Single Source Shortest Path (SSSP) problem has been solved using various algorithms. We focus on accelerating a well known SSSP algorithm, the Dijkstra's algorithm using a multi-core CPU. We achieve acceleration by using the iParallel kernel, a hybrid kernel that runs on the sequential as well as parallel kernels intelligently. Our experimental results help find an optimal threshold to exploit parallelism for different sizes of the search terrain. We have achieved an overall acceleration of −48% and −51% on a dual-core ARM A9 processor and a 16-core Epiphany co-processor respectively.

求助全文

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

来源期刊

2018 International Conference on Electronics, Information, and Communication (ICEIC)

自引率

0.00%

发文量