Fast Parallel Garner Algorithm for Chinese Remainder Theorem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Fast Parallel Garner Algorithm for Chinese Remainder Theorem

Yongnan Li
  • Function : Author
  • PersonId : 1011246
Limin Xiao
  • Function : Author
  • PersonId : 1006934
Aihua Liang
  • Function : Author
  • PersonId : 1011247
Yao Zheng
  • Function : Author
  • PersonId : 1011248
Li Ruan
  • Function : Author
  • PersonId : 1006932


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.
Fichier principal
Vignette du fichier
978-3-642-35606-3_19_Chapter.pdf (693.41 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01551339 , version 1 (30-06-2017)





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⟩
160 View
767 Download



Gmail Facebook Twitter LinkedIn More