NDLI: NUMA-aware Scalable Graph Traversal on SGI UV Systems

Please wait, while we are loading the content...

A Comparative Study on Exact Triangle Counting Algorithms on the GPU

Towards Next-Generation Graph Processing and Management Platform

NUMA-aware Scalable Graph Traversal on SGI UV Systems

Betweenness Centrality in an HSA-enabled System

Distributed Incremental Pattern Matching on Streaming Graphs

Parallel Shortest-Path Queries in Planar Graphs

Graph Topology Abstraction for Distributed Path Queries

BLADYG: A Novel Block-Centric Framework for the Analysis of Large Dynamic Graphs

NUMA-aware Scalable Graph Traversal on SGI UV Systems

Content Provider	ACM Digital Library
Author	Goh, Eng Lim Sugiura, Atsushi Baron, John Yasui, Yuichiro Fujisawa, Katsuki Uchiyama, Takashi
Abstract	Breadth-first search (BFS) is one of the most fundamental processing algorithms in graph theory. We previously presented a scalable BFS algorithm based on Beamer's direction-optimizing algorithm for non-uniform memory access (NUMA)-based systems, in which the NUMA architecture was carefully considered. This paper presents our new implementation that reduces remote memory access in a top-down direction of direction-optimizing algorithm. We also discuss numerical results obtained on the SGI UV 2000 and UV 300 systems, which are shared-memory supercomputers based on a cache coherent (cc)-NUMA architecture that can handle thousands of threads on a single operating system. Our implementation has achieved performance rates of 219 billion edges per second on a Kronecker graph with 234 vertices and 238 edges on a rack of an SGI UV 300 system with 1,152 threads. This result exceeds the fastest entry for a shared-memory system on the current Graph500 list presented in November 2015, which includes our previous implementation.
Starting Page	19
Ending Page	26
Page Count	8
File Format	PDF
ISBN	9781450343503
DOI	10.1145/2915516.2915522
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2016-05-31
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Numa-aware Graph algorithm Graph500 benchmark
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in