Skip to main content

Part of the book series: Frontiers of Computer Science ((FCOS))

  • 93 Accesses

Abstract

In the early 1970s, computers began to appear that consisted of a number of separate processors operating in parallel or that had hardware instructions for operating on vectors. The latter type of computer we will call a vector computer (or processor) while the former we will call a parallel computer (or processor).

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References and Extensions 1.3

  1. Hockney, R., and Jesshope, C. [1981]. Parallel Computers: Architecture, Programming and Algorithms, Adam Hilger, Ltd., Bristol.

    MATH  Google Scholar 

  2. Dongarra, J., Gustayson, F., and Karp, A. [1984]. “Implementing Linear Algebra Algorithms for Dense Matrices on a Vector Pipeline Machine,” SIAM Rev. 26, 91–112.

    Article  MathSciNet  MATH  Google Scholar 

  3. Sorensen, D. [1984]. “Buffering for Vector Performance on a Pipelined MIMD Machine,” Parallel Comput. 1, 143–164.

    Article  MATH  Google Scholar 

  4. Madsen, N., Rodrigue, G., and Karush, J. [1976]. “Matrix Multiplication by Diagonals on a Vector/Parallel Processor,” Inf. Proc. Lett. 5, 41–45.

    Article  MathSciNet  MATH  Google Scholar 

  5. McBryan, O., and van de Velde, E. [1985]. “Parallel Algorithms for Elliptic Equations,” Commun. Pure Appl. Math. 38, 769–795.

    Article  MATH  Google Scholar 

  6. McBryan, O., and van de Velde, E. [1986a]. “Elliptic Equation Algorithms on Parallel Computers,” Commun. Appl. Numer. Methods 2, 311–316.

    Article  MATH  Google Scholar 

  7. McBryan, O., and van de Velde, E. [1986b]. “Hypercube Programs for Computational Fluid Dynamics,” in Heath [1986], pp. 221–243.

    Google Scholar 

  8. McBryan, O., and van de Velde, E. [1987a]. “Hypercube Algorithms and Implementations,” SIAM J. Sci. Stat. Comput. 8, 227–287.

    Article  Google Scholar 

  9. Melhem, R. [1987a]. “Determination of Stripe Structures for Finite Element Matrices,” SIAM J. Numer. Anal. 24, 1419–1433.

    Article  MathSciNet  MATH  Google Scholar 

  10. Melhem, R..[1987b]. “Parallel Solution of Linear Systems with Striped Sparse Matrices,” Parallel Comput, to appear.

    Google Scholar 

  11. Hayes, L., and Devloo, P. [1986]. “A Vectorized Version of a Sparse Matrix-Vector Multiply,” Int. J. Num. Met. Eng. 23, 1043–1056.

    Article  MATH  Google Scholar 

  12. Fox, G., and Furmanski, W. [1987]. “Communication Algorithms for Regular Convolutions and Matrix Problems on the Hupercube,” in Heath [1987], pp. 223–238.

    Google Scholar 

  13. Jalby, W., and Meier, U. [1986]. “Optimizing Matrix Operations on a Parallel Multiprocessor with a Memory Hierarchy,” Center for Supercomputing Research and Development Report No. 555, University of Illinois.

    Google Scholar 

  14. Cheng, K., and Sahni, S. [1987] “VLSI Systems for Band Matrix Multiplication,” Parallel Comput. 4, 239–258.

    Article  MATH  Google Scholar 

  15. Reed, D., and Patrick, M. [1984]. “A Model of Asynchronous Iterative Algorithms for Solving Large Sparse Linear Systems,” Proc. 1984 Int. Conf. Parallel Processing, pp. 402–409.

    Google Scholar 

  16. Reed, D., and Patrick, M. [1985a]. “Parallel Iterative Solution of Sparse Linear Systems: Models and Architectures,” Parallel Comput. 2, 45–67.

    Article  MathSciNet  MATH  Google Scholar 

  17. Reed, D., and Patrick, M. [1985b]. “Iterative Solution of Large Sparse Linear Systems on a Static Data Flow Architecture: Performance Studies,” IEEE Trans. Comput. 34, 874–881.

    Article  Google Scholar 

  18. Dongarra, J., and Hinds, A. [1979]. “Unrolling Loops in FORTRAN,” Software Pract. Exper. 9, 219–229.

    Article  MATH  Google Scholar 

  19. Cowell, W., and Thompson, C. [1986]. “Transforming Fortran DO Loops to Improve Performance on Vector Architectures,” ACM Trans. Math. Software 12, 324–353.

    Article  Google Scholar 

  20. Louter-Nool, M. [1987]. “Basic Linear Algebra Subprograms (BLAS) on the CDC CYBER 205,” Parallel Comput. 4, 143–166.

    Article  MATH  Google Scholar 

  21. Dongarra, J., and Johnsson, L. [1987]. “Solving Banded Systems on a Parallel Processor,” Parallel Comput. 5, 219–246.

    Article  MathSciNet  MATH  Google Scholar 

  22. Dave, A., and Duff, I. [1987]. “Sparse Matrix Calculations on the CRAY-2,” Parallel Comput. 5, 55–64.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer Science+Business Media New York

About this chapter

Cite this chapter

Ortega, J.M. (1988). Introduction. In: Introduction to Parallel and Vector Solution of Linear Systems. Frontiers of Computer Science. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-2112-3_1

Download citation

  • DOI: https://doi.org/10.1007/978-1-4899-2112-3_1

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4899-2114-7

  • Online ISBN: 978-1-4899-2112-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics