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.

Publications of SPCL

M. Besta, T. Hoefler:

 Towards high-performance processing, storage, and analytics of extreme-scale graphs

(Presentation - presented in Valencia, Spain, Jun. 2019, )
Invited talk at the 2019 International Congress on Industrial and Applied Mathematics (ICIAM'19)


Large graphs are behind many problems in today's processing landscape. The growing sizes of such graphs, reaching 12 trillion edges recently, require unprecedented amounts of compute power, storage, and energy. In this talk, we illustrate how to effectively process such extreme-scale graphs. Our solutions are related to various forms of graph compression, vectorizable graph representations, communication avoidance, effective utilization of massively parallel hardware, and others.


download slides:


  author={Maciej Besta and Torsten Hoefler},
  title={{Towards high-performance processing, storage, and analytics of extreme-scale graphs}},
  location={Valencia, Spain},