菊池洋一裁判官の殺人強奪幇助の誤判が認められる

菊池洋一裁判官の殺人強奪幇助の誤判が認められるat FUTURE

菊池洋一裁判官の殺人強奪幇助の誤判が認められる - 暇つぶし2ch■コピペモード
□スレを通常表示
□オプションモード
□このｽﾚｯﾄﾞのURL
■項目テキスト

17:YAMAGUTIseisei
 19/11/10 16:30:58.02 2xdpBNeP2
1
Introduction

This paper presents our design of parallel quicksort algorithm on SW26010, the heterogeneous manycore processor making the Sunway TaihuLight supercomputer currently Top-One in the world [4].
SW26010 features a cache-less design with two methods of memory access: DMA (transfer between scratchpad memory (SPM) and main memory) and Gload (transfer between register and main memory).
The aggressive design of SW26010 results in an impressive performance of 3.06 TFlops, while also complicating programming design and performance optimizations.

Sorting has always been a extensively studied topic [6].
On heterogeneous architectures, prior works focus on GPGPUs.
For instance, Satish et al.[9] compared several sorting algorithms on NVIDIA GPUs, including radix sort, normal quicksort, sample sort, bitonic sort and merge sort.
GPU-quicksort [2] and its improvement CUDA-quicksort [8] used a double pass algorithm for parallel partition to minimize the need for communication.
Leischner et al.[7] ported samplesort (a version of parallel quicksort) to GPUs, claiming significant speed improvement over GPU quicksort.

Prior works give us insights on parallel sorting algorithm, but cannot directly satisfy our need for two reasons.
First, the Gload overhead is extremely high so that all the accessed memory have to be prefetched to SPM via DMA.
At the same time, the capacity of SPM is highly limited (64KiB).
Second, SW26010 provides a customized on-chip communication mechanism, which opens new opportunities for optimization.

次ページ