Name
Abstract | ||
|---|---|---|
If we process large-integers on the computer, they are represented by multiple-length integer. Multiple-length multiplication is widely used in areas such as scientific computation and cryptography processing. However, the computation cost is very high since CPU does not support a multiple-length integer. In this paper, we present a GPU implementation of bulk multiple-length multiplications. The idea of our GPU implementation is to adopt warp-synchronous programming. We assign each multiple-length multiplication to one warp that consists of 32 threads. In parallel processing using multiple threads, usually, it is costly to synchronize execution of threads and communicate within threads. In warp-synchronous programming, however, execution of threads in a warp can be synchronized instruction by instruction without any barrier synchronous operations. Also, inter-thread communication can be performed by warp shuffle functions without accessing shared memory. The experimental results show that our GPU implementation on NVIDIA GeForce GTX 980 attains a speed-up factor of 62 for 1024-bit multiple-length multiplication over the single CPU implementation. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/CANDAR.2015.13 | CANDAR |
Keywords | Field | DocType |
Multiple-length multiplication, GPU, GPGPU, Parallel processing, warp-synchronous programming | Integer,Synchronization,Shared memory,Cryptography,Computer science,Parallel computing,Thread (computing),Multiplication,General-purpose computing on graphics processing units,Computation | Conference |
ISSN | Citations | PageRank |
2379-1888 | 0 | 0.34 |
References | Authors | |
9 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Takumi Honda | 1 | 4 | 3.22 |
| Yasuaki Ito | 2 | 511 | 60.47 |
| Koji Nakano | 3 | 1165 | 118.13 |