BEGIN:VCALENDAR
PRODID:-//Microsoft Corporation//Outlook MIMEDIR//EN
VERSION:1.0
BEGIN:VEVENT
DTSTART:20131121T210000Z
DTEND:20131121T213000Z
LOCATION:205/207
DESCRIPTION;ENCODING=QUOTED-PRINTABLE:ABSTRACT: Detecting strongly connected components (SCCs) in a directed graph is a fundamental graph analysis algorithm that is used in many science and engineering domains. Traditional approaches in parallel SCC detection, however, show limited performance and poor scaling behavior when applied to large real-world graph instances. In this paper, we investigate the shortcomings of the conventional approach and propose a series of extensions that consider the fundamental properties of real-world graphs, e.g. the small-world property. Our scalable implementation offers excellent performance on diverse, small-world graphs resulting in a 5.01x to 29.41x parallel speedup over the optimal sequential algorithm with 16 cores and 32 hardware threads.
SUMMARY:On Fast Parallel Detection of Strongly Connected Components (SCC) in Small-World Graphs
PRIORITY:3
END:VEVENT
END:VCALENDAR