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.
There is a more recent version of this eprint available. Click here to view it.
Full text available as:
 | PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 244 Kb |
Abstract
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.
| Item Type: | MIMS Preprint |
|---|---|
| Uncontrolled Keywords: | Asynchronous parallel algorithms, Jacobi's method, case studies |
| Subjects: | MSC 2000 > 15 Linear and multilinear algebra; matrix theory MSC 2000 > 68 Computer science |
| MIMS number: | 2011.82 |
| Deposited By: | Dr Nicholas Dingle |
| Deposited On: | 18 October 2011 |
Available Versions of this Item
- Investigating the Performance of Asynchronous Jacobi's Method for Solving Systems of Linear Equations (deposited 02 December 2011)
- Investigating the Performance of Asynchronous Jacobi's Method for Solving Systems of Linear Equations (deposited 18 October 2011) [Currently Displayed]
Download Statistics: last 4 weeks
Repository Staff Only: edit this item