Skip to main content

Cellular-Pipelined Algorithm Architecture for Polynomial Computing

  • Conference paper
  • First Online:
  • 332 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2127))

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Achasova, O. Bandman, V. Markova, S. Piskunov. Parallel Substitution Algorithm. Theory and Application. World Scientific. Singapore. 1994. 220 p.

    Google Scholar 

  2. 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)

    Google Scholar 

  3. T. Cormen, C. Leiserson, R. Rivest. Introduction to Algorithms. The MIT Press. Cambridge. 1990. 960 p.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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

Publish with us

Policies and ethics