Skip to main content

Improving the vector performance via algorithmic domain decomposition

  • Efficient Use Of Vector Processors
  • Conference paper
  • First Online:
CONPAR 90 — VAPP IV (VAPP 1990, CONPAR 1990)

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

  • 122 Accesses

Abstract

To use the full potential of a local memory vector computer, algorithms have to comply with the memory hierarchy. Using the IBM 3090 as a paradigm we give a fairly complete account of its cache storage which turns out to play a crucial rôle in vector processing. On the basis of these results we are able to improve the vector performance of algorithms by decomposing the data domain.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • A. Agarwal, J. Hennessy and M. Horowitz: Cache performance of operating system and multiprogramming workloads. ACM Transact. Computer Systems 6 (1988) 393–431.

    Article  Google Scholar 

  • M. Bessenrodt-Weberpals and H. Weberpals: A fast vector algorithm for solving tridiagonal linear equations. Parallel Computing 9 (1988/89) 367–372.

    Article  Google Scholar 

  • W. Buchholz: The IBM System/370 vector architecture. IBM Systems J. 25 (1986) 51–62.

    Google Scholar 

  • O. Buneman: A compact non-iterative Poisson solver. Report 294, Stanford Univ. Inst. Plasma Research (1969).

    Google Scholar 

  • R. S. Clark and T. L. Wilson: Vector system performance of the IBM 3090. IBM Systems J. 25 (1986) 63–82.

    Google Scholar 

  • M. D. Hill and A. J. Smith: Evaluating associativity in CPU caches. IEEE Transact. Computers 38 (1989) 1612–1630.

    Article  Google Scholar 

  • K. Hwang and F. A. Briggs: Computer architecture and parallel processing. McGraw-Hill, New York (1984).

    Google Scholar 

  • B. Liu and N. Strother: Programming in VS FORTRAN on the IBM 3090 for maximum vector performance. IEEE Computer 21 (1988) 65–76.

    Google Scholar 

  • A. Padegs, B. B. Moore, R. M. Smith, and W. Buchholz: The IBM System/370 vector architecture: Design considerations. IEEE Transact. Computers 37 (1988) 509–520.

    Article  Google Scholar 

  • R. Reuter: Solving tridiagonal systems of linear equations on the IBM 3090 VF. Parallel Computing 8 (1988) 371–376.

    Article  Google Scholar 

  • K. So and R. N. Rechtschaffen: Cache operations by MRU change. IEEE Transact. Computers 37 (1988) 700–709.

    Article  Google Scholar 

  • H. S. Stone: High-performance computer architecture. Addison-Wesley, Reading (1987).

    Google Scholar 

  • K. Stüben and U. Trottenberg: Multigrid methods: Fundamental algorithms, model problem analysis and applications. In: W. Hackbusch and U. Trottenberg (eds.): Multigrid methods. Springer, Berlin (1982) pp. 1–176.

    Google Scholar 

  • S. G. Tucker: The IBM 3090 system: An overview. IBM Systems J. 25 (1986) 4–19.

    Google Scholar 

  • H. Weberpals: Architectural approach to the IBM 3090E vector performance. Parallel Computing 13 (1990) 47–59.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Helmar Burkhart

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Weberpals, H. (1990). Improving the vector performance via algorithmic domain decomposition. In: Burkhart, H. (eds) CONPAR 90 — VAPP IV. VAPP CONPAR 1990 1990. Lecture Notes in Computer Science, vol 457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53065-7_124

Download citation

  • DOI: https://doi.org/10.1007/3-540-53065-7_124

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53065-7

  • Online ISBN: 978-3-540-46597-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics