Thursday, April 26, 2018 10:30 AM EDT
Rachel Pottinger, Department of Computer Science
University of British Columbia
Users are faced with an increasing onslaught of data, whether it's in their choices of movies to watch, assimilating data from multiple sources, or finding information relevant to their lives on open data registries.
Monday, April 23, 2018 10:30 AM EDT
Barzan Mozafari, Department of Computer Science and Engineering
University of Michigan
Friday, April 20, 2018 10:30 PM EDT
Lei Zou, Institute of Computer Science and Technology
Peking University
In this talk, I focus on accelerating a widely employed computing pattern — set intersection, to boost a group of relevant graph algorithms. Graph’s adjacency-lists can be naturally considered as node sets, thus set intersection is a primitive operation in many graph algorithms. We propose QFilter, a set intersection algorithm using SIMD instructions. QFilter adopts a merge-based framework and compares two blocks of elements iteratively by SIMD instructions.
