4 citations · 5 across the 4 of their papers we have counts for
6 papers
MP-RW-LSH: An Efficient Multi-Probe LSH Solution to ANNS in Distance
Huayi Wang, Jingfan Meng, Long Gong +2
Approximate Nearest Neighbor Search (ANNS) is a fundamental algorithmic problem, with numerous applications in many areas of computer science. Locality-sensitive hashing (LSH) is o…
Sliding-Window QPS (SW-QPS): A Perfect Parallel Iterative Switching Algorithm for Input-Queued Switches
Jingfan Meng, Long Gong, Jun +1
In this work, we first propose a parallel batch switching algorithm called Small-Batch Queue-Proportional Sampling (SB-QPS). Compared to other batch switching algorithms, SB-QPS si…
Space- and Computationally-Efficient Set Reconciliation via Parity Bitmap Sketch (PBS)
Long Gong, Ziheng Liu, Liang Liu +3
Set reconciliation is a fundamental algorithmic problem that arises in many networking, system, and database applications. In this problem, two large sets A and B of objects (bitco…
QPS-r: A Cost-Effective Crossbar Scheduling Algorithm and Its Stability and Delay Analysis
Long Gong, Jun Xu, Liang Liu +1
In an input-queued switch, a crossbar schedule, or a matching between the input ports and the output ports needs to be computed in each switching cycle, or time slot. Designing swi…
Better Algorithms for Hybrid Circuit and Packet Switching in Data Centers
Liang Liu, Long Gong, Sen Yang +2
Hybrid circuit and packet switching for data center networking (DCN) has received considerable research attention recently. A hybrid-switched DCN employs a much faster circuit swit…
R(QPS-Serena) and R(QPS-Serenade): Two Novel Augmenting-Path Based Algorithms for Computing Approximate Maximum Weight Matching
Long Gong, Jun, Xu
In this addendum, we show that the switching algorithm QPS-SERENA can be converted R(QPS-SERENA), an algorithm for computing approximate Maximum Weight Matching (MWM). Empirically,…