English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 62572/95237 (66%)
造訪人次 : 2549139      線上人數 : 311
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/80754

    題名: Accelerating Volkov's Hybrid Implementation of Cholesky Factorization on a Fermi GPU
    作者: Wei, Shih-chieh;Huang, Bormin
    貢獻者: 淡江大學資訊管理學系
    關鍵詞: parallel computing;Cholesky factorization;general purpose graphics processing unit
    日期: 2012-12
    上傳時間: 2013-03-04 16:32:16 (UTC+8)
    出版者: Singapore: Nanyang Tenhnological University
    摘要: In linear algebra, Cholesky factorization is useful in solving a system of equations with a symmetric positive definite coefficient matrix. Cholesky factorization is roughly twice as fast relative to LU factorization which applies to general matrices. In recent years, with advances in technology, a Fermi GPU card can accommodate hundreds of cores compared to the small number of 8 or 16 cores on CPU. Therefore a trend is seen to use the graphics card as a general purpose graphics processing unit (GPGPU) for parallel computation. In this work, Volkov's hybrid implementation of Cholesky factorization is evaluated on the new Fermi GPU with others and then some improvement strategies were proposed. After experiments, compared to the CPU version using Intel Math Kernel Library (MKL), our proposed GPU improvement strategy can achieve a speedup of 3.85x on Cholesky factorization of a square matrix of dimension 10,000.
    關聯: Proceeding of 2012 IEEE 18th International Conference on Parallel and Distributed Systems, pp.896-900
    DOI: 10.1109/ICPADS.2012.147
    顯示於類別:[資訊管理學系暨研究所] 專書之單篇





    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回饋