Home Publications all years 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 theses techreports presentations edited volumes conferences Awards Research Teaching BLOG Miscellaneous Full CV [pdf]
Events
Past Events

Publications of Torsten Hoefler
Copyright Notice:
The documents distributed by this server have been provided by the
contributing authors as a means to ensure timely dissemination of
scholarly and technical work on a noncommercial basis. Copyright and all
rights therein are maintained by the authors or by other copyright
holders, notwithstanding that they have offered their works here
electronically. It is understood that all persons copying this
information will adhere to the terms and constraints invoked by each
author's copyright. These works may not be reposted without the explicit
permission of the copyright holder.
E. Solomonik, G. Ballard, J. Demmel, T. Hoefler:
  A CommunicationAvoiding Parallel Algorithm for the Symmetric Eigenvalue Problem
(Nr. 11, In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'17), presented in Washington, DC, USA, pages 111121, ACM, ISBN: 9781450345934, Jun. 2017)
AbstractMany largescale scientific computations require eigenvalue solvers in a scaling regime where efficiency is limited by data movement. We introduce a parallel algorithm for computing the eigenvalues of a dense symmetric matrix, which performs asymptotically less communication than previously known approaches. We provide analysis in the Bulk Synchronous Parallel (BSP) model with additional consideration for communication between a local memory and cache. Given sufficient memory to store c copies of the symmetric matrix, our algorithm requires \Theta(\sqrt{c}) less interprocessor communication than previously known algorithms, for any c\leq p^{1/3} when using p processors. The algorithm first reduces the dense symmetric matrix to a banded matrix with the same eigenvalues. Subsequently, the algorithm employs successive reduction to O(\log p) thinner banded matrices. We employ two new parallel algorithms that achieve lower communication costs for the fulltoband and bandtoband reductions. Both of these algorithms leverage a novel QR factorization algorithm for rectangular matrices.
Documentsdownload article:   BibTeX  @inproceedings{solomonikcommavsymmeigenvalue, author={E. Solomonik and G. Ballard and J. Demmel and T. Hoefler}, title={{A CommunicationAvoiding Parallel Algorithm for the Symmetric Eigenvalue Problem}}, year={2017}, month={Jun.}, pages={111121}, number={11}, booktitle={Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'17)}, location={Washington, DC, USA}, publisher={ACM}, isbn={9781450345934}, source={http://www.unixer.de/~htor/publications/}, } 

