CUMODP: a CUDA library for modular polynomial computation

S. A. Haque, X. Li, Farnam Mansouri, M. M. Maza, Davood Mohajerani, W. Pan
{"title":"CUMODP: a CUDA library for modular polynomial computation","authors":"S. A. Haque, X. Li, Farnam Mansouri, M. M. Maza, Davood Mohajerani, W. Pan","doi":"10.1145/3177795.3177799","DOIUrl":null,"url":null,"abstract":"The CUDA Modular Polynomial (CUMODP) Library implements arithmetic operations for dense matrices and dense polynomials, primarily with modular integer coefficients. Some operations are available for integer or floating point coefficients. Similar to other software libraries, like CuBLAS 1 targeting Graphics Processing Units (GPUs), CUMODP focuses on efficiency-critical routines and provides them in the form of device functions and CUDA kernels. Hence, these routines are primarily designed to offer GPU support to polynomial system solvers. A bivariate system solver is part of the library, as a proof-of-concept. Its implementation is presented in [10] and it is integrated in Maple's Triangularize command2, since the release 18 of Maple.","PeriodicalId":7093,"journal":{"name":"ACM Commun. Comput. Algebra","volume":"27 1","pages":"89-91"},"PeriodicalIF":0.0000,"publicationDate":"2018-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Commun. Comput. Algebra","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3177795.3177799","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The CUDA Modular Polynomial (CUMODP) Library implements arithmetic operations for dense matrices and dense polynomials, primarily with modular integer coefficients. Some operations are available for integer or floating point coefficients. Similar to other software libraries, like CuBLAS 1 targeting Graphics Processing Units (GPUs), CUMODP focuses on efficiency-critical routines and provides them in the form of device functions and CUDA kernels. Hence, these routines are primarily designed to offer GPU support to polynomial system solvers. A bivariate system solver is part of the library, as a proof-of-concept. Its implementation is presented in [10] and it is integrated in Maple's Triangularize command2, since the release 18 of Maple.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
cudmod:一个用于模多项式计算的CUDA库
CUDA模块化多项式库实现了密集矩阵和密集多项式的算术运算,主要使用模块化整数系数。有些操作可用于整型或浮点型系数。与其他软件库类似,如CuBLAS 1针对图形处理单元(gpu), cudmod侧重于效率关键例程,并以设备功能和CUDA内核的形式提供它们。因此,这些例程主要用于为多项式系统求解器提供GPU支持。二元系统求解器是库的一部分,作为概念验证。它的实现在[10]中给出,并且从Maple的第18版开始集成到Maple的Triangularize命令2中。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Multivariate ore polynomials in SageMath Certifying operator identities via noncommutative Gröbner bases A Kenzo interface for algebraic topology computations in SageMath The conference "computer algebra" in Moscow Computing generic bivariate Gröbner bases with Mathemagix
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1