Friday, April 20, 2018

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.

S M T W T F S
29
30
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
1
2
  1. 2019 (18)
    1. October (1)
    2. September (1)
    3. August (2)
    4. July (1)
    5. June (1)
    6. May (4)
    7. April (4)
    8. March (1)
    9. February (2)
    10. January (1)
  2. 2018 (26)
    1. December (3)
    2. November (4)
    3. October (3)
    4. September (2)
    5. July (3)
    6. June (1)
    7. May (3)
    8. April (3)
    9. March (3)
    10. January (1)
  3. 2017 (15)
  4. 2016 (25)
  5. 2015 (19)
  6. 2014 (34)