首页> 外文学位 >Performance improvements of common sparse numerical linear algebra computations.
【24h】

Performance improvements of common sparse numerical linear algebra computations.

机译:普通稀疏数值线性代数计算的性能改进。

获取原文
获取原文并翻译 | 示例

摘要

Manufacturers of computer hardware are able to continuously sustain an unprecedented pace of progress in computing speed of their products, partially due to increased clock rates but also because of ever more complicated chip designs. With new processor families appearing every few years, it is increasingly harder to achieve high performance rates in sparse matrix computations. This research proposes new methods for sparse matrix factorizations and applies in an iterative code generalizations of known concepts from related disciplines.; The proposed solutions and extensions are implemented in ways that tend to deliver efficiency while retaining ease of use of existing solutions. The implementations are thoroughly timed and analyzed using a commonly accepted set of test matrices. The tests were conducted on modern processors that seem to have gained an appreciable level of popularity and are fairly representative for a wider range of processor types that are available on the market now or in the near future.; The new factorization technique formally introduced in the early chapters is later on proven to be quite competitive with state of the art software currently available. Although not totally superior in all cases (as probably no single approach could possibly be), the new factorization algorithm exhibits a few promising features.; In addition, an all-embracing optimization effort is applied to an iterative algorithm that stands out for its robustness. This also gives satisfactory results on the tested computing platforms in terms of performance improvement. The same set of test matrices is used to enable an easy comparison between both investigated techniques, even though they are customarily treated separately in the literature.; Possible extensions of the presented work are discussed. They range from easily conceivable merging with existing solutions to rather more evolved schemes dependent on hard to predict progress in theoretical and algorithmic research.
机译:计算机硬件制造商能够在其产品的计算速度上持续保持空前的进步速度,部分原因是时钟速率提高,而且芯片设计越来越复杂。随着每隔几年出现新的处理器系列,在稀疏矩阵计算中实现高性能的难度就越来越大。这项研究提出了稀疏矩阵分解的新方法,并应用于相关学科中已知概念的迭代代码概括。提出的解决方案和扩展的实现方式倾向于在保持现有解决方案易用性的同时提高效率。使用一组普遍接受的测试矩阵对实现进行全面计时并进行分析。这些测试是在现代处理器上进行的,这些处理器似乎已经获得了一定程度的普及,并且可以代表目前或不久将来在市场上出售的各种处理器类型。后来在前几章中正式介绍的新分解技术被证明与当前可用的最新软件相比具有相当的竞争力。尽管并不是在所有情况下都完全优越(因为可能没有单一方法可能),但是新的分解算法具有一些有希望的功能。另外,将一种无所不包的优化工作应用于以其鲁棒性突出的迭代算法。就性能改进而言,这也可以在经过测试的计算平台上提供令人满意的结果。即使在文献中习惯上将它们分开处理,也使用相同的测试矩阵集来轻松比较这两种研究的技术。讨论了本文工作的可能扩展。它们的范围很广,从容易想到的与现有解决方案的合并到相当复杂的方案(取决于难以预测的理论和算法研究进展)。

著录项

  • 作者

    Luszczek, Piotr Rafal.;

  • 作者单位

    The University of Tennessee.;

  • 授予单位 The University of Tennessee.;
  • 学科 Computer Science.
  • 学位 Ph.D.
  • 年度 2003
  • 页码 93 p.
  • 总页数 93
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 自动化技术、计算机技术;
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号