Journal article
Minimizing synchronizations in sparse iterative solvers for distributed supercomputers
- Abstract:
-
Eliminating synchronizations is one of the important techniques related to minimizing communications for modern high performance computing. This paper discusses principles of reducing communications due to global synchronizations in sparse iterative solvers on distributed supercomputers. We demonstrates how to minimizing global synchronizations by rescheduling a typical Krylov subspace method. The benefit of minimizing synchronizations is shown in theoretical analysis and is verified by numer...
Expand abstract
Actions
Authors
Bibliographic Details
- Publication date:
- 2013-01-01
Item Description
- UUID:
-
uuid:f0b18bbb-cbc0-43ce-af98-a59446bf7afe
- Local pid:
- oai:eprints.maths.ox.ac.uk:1724
- Deposit date:
- 2013-07-30
Related Items
Terms of use
- Copyright date:
- 2013
If you are the owner of this record, you can report an update to it here: Report update to this record