Barzan Mozafari, Department of Computer Science and Engineering
University of Michigan
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.
Amol Deshpande, Department of Computer Science
University of Maryland
Rumi Chunara, Computer Science and in Global Public Health
New York University
Aditya Parameswaran, Department of Computer Science
University of Illinois-Urbana Champaign
Heng Ji, Rensselaer Polytechnic Institute
Patrick Valduriez
Inria and Biology Computational Institute (IBC)
Abstract: The blooming of different cloud data management infrastructures, specialized for different kinds of data and tasks, has led to a wide diversification of DBMS interfaces and the loss of a common programming paradigm.