Abstract
This paper is oriented to algorithm architecture for computation of polynomials. The algorithm is based on “divide and conquer” method and performed in terms of a model of fine-grained parallelism - Parallel Substitution Algorithm.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
S. Achasova, O. Bandman, V. Markova, S. Piskunov. Parallel Substitution Algorithm. Theory and Application. World Scientific. Singapore. 1994. 220 p.
V. Markova, S. Piskunov, Yu. Pogudin. Formal Methods and Tools for Design of Cellular Algorithms and Architectures. Programmirovanie, 4, 1996, pp. 24–36. (in Russian)
T. Cormen, C. Leiserson, R. Rivest. Introduction to Algorithms. The MIT Press. Cambridge. 1990. 960 p.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Markova, V. (2001). Cellular-Pipelined Algorithm Architecture for Polynomial Computing. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2001. Lecture Notes in Computer Science, vol 2127. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44743-1_7
Download citation
DOI: https://doi.org/10.1007/3-540-44743-1_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42522-9
Online ISBN: 978-3-540-44743-6
eBook Packages: Springer Book Archive