EXAGRAPH: Graph and combinatorial methods for enabling exascale applications. (November 2021)
- Record Type:
- Journal Article
- Title:
- EXAGRAPH: Graph and combinatorial methods for enabling exascale applications. (November 2021)
- Main Title:
- EXAGRAPH: Graph and combinatorial methods for enabling exascale applications
- Authors:
- Acer, Seher
Azad, Ariful
Boman, Erik G
Buluç, Aydın
Devine, Karen D.
Ferdous, SM
Gawande, Nitin
Ghosh, Sayan
Halappanavar, Mahantesh
Kalyanaraman, Ananth
Khan, Arif
Minutoli, Marco
Pothen, Alex
Rajamanickam, Sivasankaran
Selvitopi, Oguz
Tallent, Nathan R
Tumeo, Antonino - Other Names:
- Germann Tim guest-editor.
- Abstract:
- Combinatorial algorithms in general and graph algorithms in particular play a critical enabling role in numerous scientific applications. However, the irregular memory access nature of these algorithms makes them one of the hardest algorithmic kernels to implement on parallel systems. With tens of billions of hardware threads and deep memory hierarchies, the exascale computing systems in particular pose extreme challenges in scaling graph algorithms. The codesign center on combinatorial algorithms, ExaGraph, was established to design and develop methods and techniques for efficient implementation of key combinatorial (graph) algorithms chosen from a diverse set of exascale applications. Algebraic and combinatorial methods have a complementary role in the advancement of computational science and engineering, including playing an enabling role on each other. In this paper, we survey the algorithmic and software development activities performed under the auspices of ExaGraph from both a combinatorial and an algebraic perspective. In particular, we detail our recent efforts in porting the algorithms to manycore accelerator (GPU) architectures. We also provide a brief survey of the applications that have benefited from the scalable implementations of different combinatorial algorithms to enable scientific discovery at scale. We believe that several applications will benefit from the algorithmic and software tools developed by the ExaGraph team.
- Is Part Of:
- International journal of high performance computing applications. Volume 35:Number 6(2021)
- Journal:
- International journal of high performance computing applications
- Issue:
- Volume 35:Number 6(2021)
- Issue Display:
- Volume 35, Issue 6 (2021)
- Year:
- 2021
- Volume:
- 35
- Issue:
- 6
- Issue Sort Value:
- 2021-0035-0006-0000
- Page Start:
- 553
- Page End:
- 571
- Publication Date:
- 2021-11
- Subjects:
- Graph algorithms -- combinatorial optimization -- algebraic approach -- parallel computing
High performance computing -- Periodicals
Supercomputers -- Periodicals
004.1105 - Journal URLs:
- http://hpc.sagepub.com ↗
http://www.uk.sagepub.com/home.nav ↗
http://firstsearch.oclc.org ↗ - DOI:
- 10.1177/10943420211029299 ↗
- Languages:
- English
- ISSNs:
- 1094-3420
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - BLDSS-3PM
British Library HMNTS - ELD Digital store - Ingest File:
- 18250.xml