2011.82: Investigating the Performance of Asynchronous Jacobi's Method for Solving Systems of Linear Equations
2011.82: Iain Bethune, J. Mark Bull, Nicholas J. Dingle and Nicholas J. Higham (2011) Investigating the Performance of Asynchronous Jacobi's Method for Solving Systems of Linear Equations. To appear in International Journal of High Performance Computing Applications.
This is the latest version of this eprint.
Full text available as:
|PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader|
Ever-increasing core counts create the need to develop parallel algorithms that avoid closely-coupled execution across cores. In this paper we present two case studies investigating the performance of several parallel asynchronous implementations of Jacobi's method for solving systems of linear equations. Although conditions for the convergence of asynchronous Jacobi are well known, what drives its rate of convergence is less well understood. The first case study investigates the algorithm's performance when executed on large numbers of processors on a Cray XE6, while the second explores the effect of varying the number of synchronous and asynchronous processors. We observe that the performance of parallel asynchronous Jacobi is highly implementation, problem and architecture-dependent.
|Uncontrolled Keywords:||Asynchronous parallel algorithms, Jacobi's method, case studies|
|Subjects:||MSC 2000 > 15 Linear and multilinear algebra; matrix theory|
MSC 2000 > 65 Numerical analysis
MSC 2000 > 68 Computer science
|Deposited By:||Dr Nicholas Dingle|
|Deposited On:||03 June 2013|
Available Versions of this Item
- Investigating the Performance of Asynchronous Jacobi's Method for Solving Systems of Linear Equations (deposited 03 June 2013) [Currently Displayed]