基于GPU的多项式寻根Durand-Kerner算法并行实现

2014 International Conference on Advanced Networking Distributed Systems and Applications Pub Date : 2014-06-17 DOI:10.1109/INDS.2014.17

Kahina Ghidouche, Raphail Couturier, A. Sider

{"title":"基于GPU的多项式寻根Durand-Kerner算法并行实现","authors":"Kahina Ghidouche, Raphail Couturier, A. Sider","doi":"10.1109/INDS.2014.17","DOIUrl":null,"url":null,"abstract":"In this article we present a parallel implementation of the Durand-Kerner algorithm to find roots of polynomials of high degree on a GPU architecture (Graphics Processing Unit). We have implemented both a CPU version in and a GPU compatible version with CUDA. The main result of our work is a parallel implementation that is 10 times as fast as its sequential counterpart on a single CPU for high degree polynomials that is greater than about 48,000.","PeriodicalId":388358,"journal":{"name":"2014 International Conference on Advanced Networking Distributed Systems and Applications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"A Parallel Implementation of the Durand-Kerner Algorithm for Polynomial Root-Finding on GPU\",\"authors\":\"Kahina Ghidouche, Raphail Couturier, A. Sider\",\"doi\":\"10.1109/INDS.2014.17\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this article we present a parallel implementation of the Durand-Kerner algorithm to find roots of polynomials of high degree on a GPU architecture (Graphics Processing Unit). We have implemented both a CPU version in and a GPU compatible version with CUDA. The main result of our work is a parallel implementation that is 10 times as fast as its sequential counterpart on a single CPU for high degree polynomials that is greater than about 48,000.\",\"PeriodicalId\":388358,\"journal\":{\"name\":\"2014 International Conference on Advanced Networking Distributed Systems and Applications\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-06-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 International Conference on Advanced Networking Distributed Systems and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INDS.2014.17\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on Advanced Networking Distributed Systems and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INDS.2014.17","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 6

摘要

在本文中，我们提出了Durand-Kerner算法的并行实现，用于在GPU架构(图形处理单元)上查找高阶多项式的根。我们已经在CUDA中实现了CPU版本和GPU兼容版本。我们工作的主要结果是一个并行实现，对于大于约48,000的高次多项式，它的速度是单个CPU上顺序对应的10倍。

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

查看原文本刊更多论文

A Parallel Implementation of the Durand-Kerner Algorithm for Polynomial Root-Finding on GPU

In this article we present a parallel implementation of the Durand-Kerner algorithm to find roots of polynomials of high degree on a GPU architecture (Graphics Processing Unit). We have implemented both a CPU version in and a GPU compatible version with CUDA. The main result of our work is a parallel implementation that is 10 times as fast as its sequential counterpart on a single CPU for high degree polynomials that is greater than about 48,000.

求助全文

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

来源期刊

2014 International Conference on Advanced Networking Distributed Systems and Applications

自引率

0.00%

发文量