메뉴 건너뛰기




Volumn , Issue , 2010, Pages 769-773

Solving k-nearest neighbor problem on multiple graphics processors

Author keywords

[No Author keywords available]

Indexed keywords

EFFECTIVE ALGORITHMS; GPU ALGORITHMS; GRAPHICS PROCESSOR; GRAPHICS PROCESSOR UNITS; K-NEAREST NEIGHBORS; LOW COSTS; MEMORY ACCESS; N BODY PROBLEM; NEAREST VECTORS; RECOMMENDATION SYSTEMS; SHARED MEMORIES; SOFTWARE SYSTEMS; SORT ALGORITHM;

EID: 77954893884     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCGRID.2010.47     Document Type: Conference Paper
Times cited : (32)

References (10)
  • 1
    • 84888776407 scopus 로고    scopus 로고
    • Amazon.com, http://www.amazon.com.
    • Amazon.com
  • 2
  • 6
    • 84873478761 scopus 로고    scopus 로고
    • NVIDIA, "CUDA Zone, " http://www.nvidia.com/object/cuda-home. html.
    • CUDA Zone
  • 7
    • 44849094749 scopus 로고    scopus 로고
    • Fast n-body simulation with CUDA
    • NVIDIA
    • L. Nyland, M. Harris, and J. Prins, "Fast n-body simulation with CUDA, " in GPU Gems III. NVIDIA, 2007, pp. 677-695.
    • (2007) GPU Gems III , pp. 677-695
    • Nyland, L.1    Harris, M.2    Prins, J.3
  • 10
    • 77953086053 scopus 로고    scopus 로고
    • NVIDIA, "CUDA 2.1 programming guide, " http://www.nvidia.com/ object/cuda-develop.html, 2008.
    • (2008) CUDA 2.1 Programming Guide


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.