The performance of synchronous parallel polynomial root extraction on a ring multicomputer-Reference-Cited by-同舟云学术

The performance of synchronous parallel polynomial root extraction on a ring multicomputer

Published:2007-03-15 Issue:2 Volume:10 Page:167-174
ISSN:1386-7857
Container-title:Cluster Computing
language:en
Short-container-title:Cluster Comput

Author:

Sarbazi-Azad Hamid

Publisher

Springer Science and Business Media LLC

Subject

Computer Networks and Communications,Software

Link

http://link.springer.com/content/pdf/10.1007/s10586-007-0013-z.pdf

Reference16 articles.

1. Cosnard, M., Fraigniaud, P.: Analysis of asynchronous polynomial root finding methods on a distributed memory multicomputer. IEEE Trans. Parallel Distributed Syst. 5: 639–648 (1994)

2. Couturier, R., Canalda, P., Spies, F.: Iterative algorithms on network computing: parallel polynomial root extracting. In: Proceedings of IEEE HiPC 2002, 10–12 Dec. 2002, India. LNCS 2552, pp. 283–291

3. Eager, D.L., Zahorjan, J., Lazowska, E.D.: Speed versus efficiency in parallel systems. IEEE Trans. Comput. 38: 408–423 (1989)

4. Oberman, S.: Design issues in high performance floating point arithmetic units. PhD thesis, Stanford Univ. (Nov. 1996)

5. Zhong, L.: Modular exponentiation algorithm analysis for energy consumption and performance, Technical Report CE-01-ZJL, Department of Electrical Engineering, Princeton University, USA, 2000

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Efficient high degree polynomial root finding using GPU;Journal of Computational Science;2017-01

2. Parallel algorithms for finding polynomial Roots on OTIS-torus;The Journal of Supercomputing;2009-07-07