157K - views

Buffer d Trees Processing Massive Nearest Neighbor Queries on GPUs Fabian Gieseke FABIAN GIESEKE DIKU DK Department of Computer Science University of Copenhagen Universitetsparken Copenhagen Denmark

It is well known that a di rect combination of these tools leads to a non satisfying performance due to conditional com putations and suboptimal memory accesses To alleviate these problems we propose a variant of the classical d tree data structure

Tags : well known
Embed :
Pdf Download Link

Download Pdf - The PPT/PDF document "Buffer d Trees Processing Massive Neares..." is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.

Buffer d Trees Processing Massive Nearest Neighbor Queries on GPUs Fabian Gieseke FABIAN GIESEKE DIKU DK Department of Computer Science University of Copenhagen Universitetsparken Copenhagen Denmark






Presentation on theme: "Buffer d Trees Processing Massive Nearest Neighbor Queries on GPUs Fabian Gieseke FABIAN GIESEKE DIKU DK Department of Computer Science University of Copenhagen Universitetsparken Copenhagen Denmark"— Presentation transcript: