Intersection of sorted inverted lists is an important operation in the web search engines. Various algorithms to improve the performance of this operation have been introduced in the literature [1, 3, 5]. Previous research works mainly focused on single-core or multi-core CPU platform and did not consider the query traffic problem arises in the actual systems. Modern graphics processing units (GPUs) give a new way to solve the problem. Wu et al. [6] presented a CPU-GPU cooperative model which can dynamically switch between the asynchronous mode and the synchronous mode. Under light query traffic, asynchronous mode is triggered, each newly arriving query is serviced by an independent thread. Under heavy query traffic, synchronous mode is triggered, all active threads are blocked and a single thread takes control of query processing. Queries are grouped into batches at CPU end, and each batch is processed by GPU threads in parallel. We summarize that putting the operations on GPU has two advantages: The massive on-chip parallelism of GPU may greatly reduce the processing time of lists intersection; A great part of work on CPU is offloaded to GPU. Overall the GPU will significantly increase throughput and reduce average response time in the synchronous mode. In this paper we consider techniques for improving the performance of the GPU batched algorithm proposed in [6] assuming sufficient queries at the CPU end.
[1]
Erik D. Demaine,et al.
Experiments on Adaptive Set Intersections for Text Retrieval Systems
,
2001,
ALENEX.
[2]
Jérémy Barbay,et al.
Faster Set Intersection Algorithms for Text Searching ? University of Waterloo Technical Report CS-2007-13
,
2007
.
[3]
Burton H. Bloom,et al.
Space/time trade-offs in hash coding with allowable errors
,
1970,
CACM.
[4]
Alejandro López-Ortiz,et al.
An experimental investigation of set intersection algorithms for text searching
,
2010,
JEAL.
[5]
William Pugh,et al.
Skip Lists: A Probabilistic Alternative to Balanced Trees
,
1989,
WADS.
[6]
Sudipto Guha,et al.
Improving the Performance of List Intersection
,
2009,
Proc. VLDB Endow..
[7]
Gang Wang,et al.
Efficient lists intersection by CPU-GPU cooperative computing
,
2010,
2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW).