• DocumentCode
    1921217
  • Title

    Communication avoiding algorithms

  • Author

    Demmel, J.

  • Author_Institution
    EECS Department, UC Berkeley, CA, USA
  • fYear
    2012
  • fDate
    10-16 Nov. 2012
  • Firstpage
    1942
  • Lastpage
    2000
  • Abstract
    This article consists of a collection of slides from the author´s conference presentation. Some of the specific areas/topics discussed include: To redesign algorithms to avoid communication between all memory hierarchy levels: L1 and L2 and DRAM and network, etc; To Attain lower bounds if possible (Current algorithms often far from lower bounds); Large speedups and energy savings are possible.
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    High Performance Computing, Networking, Storage and Analysis (SCC), 2012 SC Companion:
  • Conference_Location
    Salt Lake City, UT
  • Print_ISBN
    978-1-4673-6218-4
  • Type

    conf

  • DOI
    10.1109/SC.Companion.2012.351
  • Filename
    6496136
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1921217