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.
James J. Park; Albert Zomaya; Sang-Soo Yeo; Sartaj Sahni. 9th International Conference on Network and Parallel Computing (NPC), Sep 2012, Gwangju, South Korea. Springer, Lecture Notes in Computer Science, LNCS-7513, pp.164-171, 2012, Network and Parallel Computing. 〈10.1007/978-3-642-35606-3_19〉
https://hal.inria.fr/hal-01551339
Contributeur : Hal Ifip
<>
Soumis le : vendredi 30 juin 2017 - 10:35:52
Dernière modification le : vendredi 1 décembre 2017 - 01:09:59
Document(s) archivé(s) le : lundi 22 janvier 2018 - 21:22:04
Yongnan Li, Limin Xiao, Aihua Liang, Yao Zheng, Li Ruan. Fast Parallel Garner Algorithm for Chinese Remainder Theorem. James J. Park; Albert Zomaya; Sang-Soo Yeo; Sartaj Sahni. 9th International Conference on Network and Parallel Computing (NPC), Sep 2012, Gwangju, South Korea. Springer, Lecture Notes in Computer Science, LNCS-7513, pp.164-171, 2012, Network and Parallel Computing. 〈10.1007/978-3-642-35606-3_19〉. 〈hal-01551339〉
