基于机器学习的GPU实现三对角划分法最优CUDA流数研究
ML-Based Optimum Number of CUDA Streams for the GPU Implementation of the Tridiagonal Partition Method
AI总结:
本文提出一种启发式方法,通过现代AI导向方法中常用的工具,用于确定GPU实现三对角划分法的最优CUDA流数,建立了GPU实现划分法的时间复杂度模型,并进一步建立了在多个CUDA流上执行划分算法的细化时间复杂度模型,通过不同SLAE尺寸的计算实验确定了每个尺寸的最优CUDA流数,并基于收集的数据利用回归分析建立了非主导GPU操作总时间模型,创建了CUDA流创建的开销时间非线性拟合模型,对所有建立的模型进行了统计分析,提出了寻找最优CUDA流数的算法,并利用该算法和上述两个模型进行预测,通过与实际数据的比较,认为该算法效果良好。
摘要:
本文提出了一种启发式方法,通过现代AI导向方法中常用的工具,用于确定GPU实现三对角划分法的最优CUDA流数。建立了GPU实现划分法的时间复杂度模型。进一步,建立了在多个CUDA流上执行划分算法的细化时间复杂度模型。对不同SLAE尺寸进行了计算实验,并经验确定了每个尺寸的最优CUDA流数。基于收集的数据,利用回归分析建立了非主导GPU操作(参与流重叠)的总时间模型。创建了与CUDA流创建相关的开销时间的非线性拟合模型。对所有建立的模型进行了统计分析。提出了寻找最优CUDA流数的算法。利用该算法,结合上述两个模型,对最优CUDA流数进行了预测。通过将预测值与实际数据进行比较,认为该算法效果良好。
英文摘要:
This paper presents a heuristic for finding the optimum number of CUDA streams by using tools common to the modern AI-oriented approaches and applied to the parallel partition algorithm. A time complexity model for the GPU realization of the partition method is built. Further, a refined time complexity model for the partition algorithm being executed on multiple CUDA streams is formulated. Computational experiments for different SLAE sizes are conducted, and the optimum number of CUDA streams for each of them is found empirically. Based on the collected data a model for the sum of the times for the non-dominant GPU operations (that take part in the stream overlap) is formulated using regression analysis. A fitting non-linear model for the overhead time connected with the creation of CUDA streams is created. Statistical analysis is done for all the built models. An algorithm for finding the optimum number of CUDA streams is formulated. Using this algorithm, together with the two models mentioned above, predictions for the optimum number of CUDA streams are made. Comparing the predicted values with the actual data, the algorithm is deemed to be acceptably good.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。