• Title/Summary/Keyword: Bitonic sort

Search Result 3, Processing Time 0.017 seconds

Fast Access Method of Neighboring Particles Using Bitonic Sort Based GPU Hashing, and Its Applications (바이토닉 정렬 기반의 GPU 해싱을 이용한 인접 입자의 빠른 접근 기법과 그 응용 사례)

  • Lee, SuBin;Kim, Jong-Hyun
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2022.01a
    • /
    • pp.357-360
    • /
    • 2022
  • 본 논문에서는 대용량 데이터에서 빠르게 주변 데이터를 접근하기 위한 자료구조인 최근접 이웃 탐색(Nearest neighbor search, NNS) 문제를 빠르게 풀 수 있는 바이토닉 정렬(Bitonic sort) 기반 해시 테이블을 GPU기반에서 설계하는 방법과 이를 통해 입자 기반 물리 시뮬레이션을 고속화할 수 있는 방법에 대해 살펴본다. 본 논문에서는 CUDA 아키텍처를 이용하여 해시 테이블을 설계하였으며, 계산양이 가장 큰 데이터 정렬부분을 최적화함으로써 NVIDIA에서 제공하는 CUDA 해시 테이블보다 빠른 결과를 얻을 수 있으며, 이 자료구조를 입자 기반 시뮬레이션에 통합함으로써 고성능 시뮬레이션을 쉽게 제작할 수 있다.

  • PDF

Conncetiveity of X-Hypercubes and Its Applications (X-Hypercubes의 연결성과 그 응용)

  • Gwon, Gyeong-Hui
    • The Transactions of the Korea Information Processing Society
    • /
    • v.1 no.1
    • /
    • pp.92-98
    • /
    • 1994
  • The hypercube-like interconncetion network,X-hypercubes,has the same number of nodes and edges as conventional hypercubes.By slightly changing the interconneton way between nodes,however,X-hypercubes reduces the diameter by almost half.Thus the communication delay in X-hypercubes can be expected to be much lower than that in hypercubes. This paper gives a new definition of X-hypercubes establishing clear-cut condition of connection between two nodes.As appliction examples of the new definition,this paper presents simple embeddings of hypercubes in X-hypercubes and vice versa.This means that any programs written for hypercubes can be transported onto X-hypercubes and vice versa with minimal overhead.This paper also present bitonic merge sort for X-hypercubes by simulation that for hypercubes.

  • PDF

Designing a Bitonic Sorting Algorithm for Shared-Memory Parallel Computers and an Efficient Implementation of its Communication (공유 메모리 병렬 컴퓨터 환경에서 Bitonic Sorting 알고리즘 설계와 효율적인 통신의 구현)

  • Lee, Jae-Dong;Kwon, Kyung-Hee;Park, Yong-Beom
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.11
    • /
    • pp.2690-2700
    • /
    • 1997
  • This paper presents parallel sorting algorithm, SHARED-MEMORY-BS and REDUCED-BS, which are implemented on shared-memory parallel computers. These algorithm sort N keys in $O(log^2N)$ time. REDUCED-BS users a parity strategy which gives an idea for the efficient usage of the local memory associated with each processor. By taking advantage of the local memory associated with each processor, the communication of REDUCED-BS is decreased by approximately half that of SHARED-MEMORY-BS. On the basis of alleviating the communication, the algorithm REDUCED-BS results in a significant improvement of performance.

  • PDF