BEGIN:VCALENDAR
PRODID:-//Microsoft Corporation//Outlook MIMEDIR//EN
VERSION:2.0
BEGIN:VEVENT
DTSTART:20151117T231500Z
DTEND:20151118T010000Z
LOCATION:Level 4 - Lobby
DESCRIPTION;ENCODING=QUOTED-PRINTABLE:ABSTRACT: Recently, architecture designers tend to integrate CPUs and raphics Processing Units(GPUs) on the same chip to produce energy-efficient designs. On the other hand, graph applications are becoming increasingly important for big data analysis. Among the graph analysis algorithms, Breadth-First Search=0A(BFS) is the most representative one and also an important building block for other algorithms. Despite previous efforts, it remains an important problem to get optimal performance for BFS on integrated architectures. =0AIn this paper, we propose an adaptive algorithm to atomically find the optimal algorithm on the suitable devices, which can get 1.6X speedup compared with the state-of-the-art algorithms in an energy consumption index, namely TEPS/Watt(Traversed Edges Per Second =0Aevery Watt).
SUMMARY:Energy-Efficient Graph Traversal on Integrated CPU-GPU Architecture
PRIORITY:3
END:VEVENT
END:VCALENDAR