Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Electrical Engineering | en_US |
| dc.creator | Tian, Ye | - |
| dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/6456 | - |
| dc.language | English | en_US |
| dc.publisher | Hong Kong Polytechnic University | - |
| dc.rights | All rights reserved | en_US |
| dc.title | Investigation on the use of GPGPU for fast sparse matrix factorization | en_US |
| dcterms.abstract | In power system analysis, solution for network equations is frequently encountered. As the system size becomes larger, time consumed in network solution becomes a dominant factor in the overall time cost. One distinct and most important feature of the network admittance matrix is that it is highly sparse. Over the years, different methods have been developed to exploit the sparsity of matrix. LU factorization is a fundamental process in the solution for the network linear equations. One technique to improve the LU factorization time is parallel computation, with which data processing can be divided into different tasks and implemented simultaneously. However, up to now, efficiency of parallel computation algorithm implemented on multi-processor systems is adversely affected by the data communication latency between processors. In this paper, parallel computing power of the contemporary Graphic Processing Units (GPU) is exploited and sparse technique for LU factorization implemented on GPU is designed. Parallel LU factorization algorithm of partitioned matrix is proposed. To better cater for dense data formats suitability of GPU, Cholesky factorization with a supernodal approach is implemented where supernodes are computed on GPU. All algorithms are implemented on the Computer Unified Device Architecture (CUDA) of the NVIDIA GPU. Performance and factors affecting performance are studied and analyzed. Revisions are made to some existing algorithms and new ideas are proposed for future study. | en_US |
| dcterms.extent | v, 70 leaves : ill. (some col.) ; 30 cm. | en_US |
| dcterms.isPartOf | PolyU Electronic Theses | en_US |
| dcterms.issued | 2010 | en_US |
| dcterms.educationalLevel | All Master | en_US |
| dcterms.educationalLevel | M.Sc. | en_US |
| dcterms.LCSH | Graphics processing units -- Programming. | en_US |
| dcterms.LCSH | Parallel programming (Computer science) | en_US |
| dcterms.LCSH | Computer algorithms. | en_US |
| dcterms.LCSH | Hong Kong Polytechnic University -- Dissertations | en_US |
| dcterms.accessRights | restricted access | en_US |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| b24630536.pdf | For All Users (off-campus access for PolyU Staff & Students only) | 2.68 MB | Adobe PDF | View/Open |
Copyright Undertaking
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item:
https://theses.lib.polyu.edu.hk/handle/200/6456