SC is the International Conference for
 High Performnance Computing, Networking, Storage and Analysis

SCHEDULE: NOV 13-19, 2010

Multithreaded Asynchronous Graph Traversal for In-Memory and Semi-External Memory

SESSION: Graph Algorithms

EVENT TYPE: Paper

TIME: 11:00AM - 11:30AM

SESSION CHAIR: George Biros

AUTHOR(S):Roger Pearce, Maya Gokhale, Nancy M. Amato

ROOM:393

ABSTRACT:
Processing large graphs is becoming increasingly important for many domains such as social networks, bioinformatics, etc. Unfortunately, many algorithms and implementations do not scale with increasing graph sizes. As a result, researchers have attempted to meet the growing data demands using parallel and external memory techniques. We present a novel asynchronous approach to compute Breadth-First-Search (BFS), Single-Source-Shortest-Paths, and Connected Components for large graphs in shared memory. Our highly parallel asynchronous approach hides data latency due to both poor locality and delays in the underlying graph data storage. We present an experimental study applying our technique to both In-Memory and Semi-External Memory graphs utilizing multi-core processors and solid-state memory devices. Our experiments using synthetic and real-world datasets show that our asynchronous approach is able to overcome data latencies and provide significant speedup over alternative approaches. For example, on billion vertex graphs our asynchronous BFS scales up to 14x on 16-cores.

Chair/Author Details:

George Biros (Chair) - Georgia Institute of Technology

Roger Pearce - Texas A&M University

Maya Gokhale - Lawrence Livermore National Laboratory

Nancy M. Amato - Texas A&M University

Add to iCal  Click here to download .ics calendar file

Add to Outlook  Click here to download .vcs calendar file

Add to Google Calendarss  Click here to add event to your Google Calendar

The full paper can be found in the ACM Digital Library and IEEE Computer Society

   Sponsors    IEEE    ACM