HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
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.
Document type :
Conference papers
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download

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


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Yongnan Li, Limin Xiao, Aihua Liang, Yao Zheng, Li Ruan. Fast Parallel Garner Algorithm for Chinese Remainder Theorem. 9th International Conference on Network and Parallel Computing (NPC), Sep 2012, Gwangju, South Korea. pp.164-171, ⟨10.1007/978-3-642-35606-3_19⟩. ⟨hal-01551339⟩



Record views


Files downloads