| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Fast Parallel Garner Algorithm for Chinese Remainder Theorem
Abstract : This paper presents a fast parallel garner algorithm for Chinese remainder theorem. The variables in garner algorithm are divided into public parameters that are constants for fixed module and private parameters that represent random input integers. We design the parallel garner algorithm by analyzing the data dependencies of these arithmetic operations for computing public variables and private variables. Time complexities and speedup ratios of the parallel algorithm and the sequential algorithm are calculated to make the quantitative comparison based on our previous work about some fundamental parallel algorithms. The performance evaluation shows high efficiency of the proposed parallel algorithm compared to the sequential one.
Cited literature [11 references]
https://hal.inria.fr/hal-01551339
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Friday, June 30, 2017 - 10:35:52 AM
Last modification on : Wednesday, October 13, 2021 - 7:16:03 PM
Long-term archiving on: : Monday, January 22, 2018 - 9:22:04 PM
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Friday, June 30, 2017 - 10:35:52 AM
Last modification on : Wednesday, October 13, 2021 - 7:16:03 PM
Long-term archiving on: : Monday, January 22, 2018 - 9:22:04 PM
File
978-3-642-35606-3_19_Chapter.p...
Files produced by the author(s)
Licence
Distributed under a Creative Commons Attribution 4.0 International License