并行稀疏多元多项式除法

Proceedings of the 2015 International Workshop on Parallel Symbolic Computation Pub Date : 2015-07-10 DOI:10.1145/2790282.2790285

M. Gastineau, J. Laskar

{"title":"并行稀疏多元多项式除法","authors":"M. Gastineau, J. Laskar","doi":"10.1145/2790282.2790285","DOIUrl":null,"url":null,"abstract":"We present a scalable algorithm for dividing two sparse multivariate polynomials represented in a distributed format on shared memory multicore computers. The scalability on the large number of cores is ensured by the lack of synchronizations during the main parallel step. The merge and sorting operations are based on binary heap or tree data structures.","PeriodicalId":384227,"journal":{"name":"Proceedings of the 2015 International Workshop on Parallel Symbolic Computation","volume":"50 4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Parallel sparse multivariate polynomial division\",\"authors\":\"M. Gastineau, J. Laskar\",\"doi\":\"10.1145/2790282.2790285\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a scalable algorithm for dividing two sparse multivariate polynomials represented in a distributed format on shared memory multicore computers. The scalability on the large number of cores is ensured by the lack of synchronizations during the main parallel step. The merge and sorting operations are based on binary heap or tree data structures.\",\"PeriodicalId\":384227,\"journal\":{\"name\":\"Proceedings of the 2015 International Workshop on Parallel Symbolic Computation\",\"volume\":\"50 4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-07-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2015 International Workshop on Parallel Symbolic Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2790282.2790285\",\"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 of the 2015 International Workshop on Parallel Symbolic Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2790282.2790285","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 10

摘要

本文提出了一种在共享内存多核计算机上以分布式格式表示的两个稀疏多元多项式除法的可扩展算法。通过在主并行步骤期间缺乏同步，确保了在大量核心上的可伸缩性。合并和排序操作基于二进制堆或树数据结构。

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

查看原文本刊更多论文

Parallel sparse multivariate polynomial division

We present a scalable algorithm for dividing two sparse multivariate polynomials represented in a distributed format on shared memory multicore computers. The scalability on the large number of cores is ensured by the lack of synchronizations during the main parallel step. The merge and sorting operations are based on binary heap or tree data structures.

求助全文

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

来源期刊

Proceedings of the 2015 International Workshop on Parallel Symbolic Computation

自引率

0.00%

发文量