跳到主要导航 跳到搜索 跳到主要内容

Fast parallel garner algorithm for Chinese remainder theorem

  • Beihang University

科研成果: 书/报告/会议事项章节 › 会议稿件 › 同行评审

摘要

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.

源语言英语
主期刊名Network and Parallel Computing - 9th IFIP International Conference, NPC 2012, Proceedings
页164-171
页数8
DOI
出版状态已出版 - 2012
活动9th IFIP International Conference on Network and Parallel Computing, NPC 2012 - Gwangju, 韩国
期限: 6 9月 2012 → 8 9月 2012

丛书

姓名Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
卷7513 LNCS
ISSN(印刷版)0302-9743
ISSN(电子版)1611-3349

会议

会议9th IFIP International Conference on Network and Parallel Computing, NPC 2012
国家/地区韩国
市Gwangju
时期6/09/12 → 8/09/12

学术指纹

探究 'Fast parallel garner algorithm for Chinese remainder theorem' 的科研主题。它们共同构成独一无二的学术指纹。

引用此