Skip to main content
SpringerLink
Log in

Access patterns: A usefull concept in vector programming

  • Session 4B: Compilers And Restructuring Techniques II
  • Conference paper
  • First Online:
Supercomputing (ICS 1987)

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

Included in the following conference series:

  • 136 Accesses

Abstract

Many programs written in Hellena have been run on a simulated array architecture as well as on OPSILA. The experiments show the adequacy of the access patterns in vector programming. By avoiding many unnecessary loops and indexing notations, the programs are more understandable and compact. The application domain of subroutines and functions is extended to numerous submatrices and, thus, allows an easier program structure and a more general library subroutine definition. The access pattern concept appears to be fundamental in programming methodology.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Auguin M., Boery F., The OPSILA Computer, Colloque International Algorithmes et Architectures Parallèles, 14–18 Avril 1986, Luminy.

    Google Scholar 

  2. Burroughs Co., ”BSP: Overview Perspective, and Architecture,” document No. 61391, Feb. 1978a.

    Google Scholar 

  3. Cray Research, Inc., CRAY-1 Computer System Hardware Reference Manual, Bloomington, Minn., pub. No. 2240004, 1977.

    Google Scholar 

  4. Hwang K., Briggs F.A., Computer Architecture and Parallel Processing, McGraw-Hill, New York, 1984.

    Google Scholar 

  5. Jégou, Y., Le Language Vectoriel Hellena, to be pubished in Rapports de recherche INRIA, France.

    Google Scholar 

  6. Miura, K., and Uchida, K., ”FACOM Vector Processor VP-100/VP-200,” Proc. NATO Advanced Reasearch Workshop on High-Speed Computing, Julish, W. Germany, Springer-Verlag, June 20–22, 1983.

    Google Scholar 

  7. Paul, G., and Wilson, M.W., The VECTRAN Language: An Experimental Language for Vector/Matrix Array Processing, IBM Palo Alto Scientific Center Report 6320-3334, Aug.1975.

    Google Scholar 

  8. Perrott, R.H., ”A Language for Array and Vector Processors,” ACM Trans. on Programming Languages and Systems, vol.1, No.2, Oct.1979, pp.177–195.

    Google Scholar 

  9. Wagener, J.L., SIGNUM Newslett. 19 (1984) 3; FORTEC Forum 3 ACM (1984) 2.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IRISA / INRIA Campus Universitaire de Beaulieu, 35042, Rennes Cedex, France

    Yvon Jegou

Authors
  1. Yvon Jegou
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

E. N. Houstis T. S. Papatheodorou C. D. Polychronopoulos

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jegou, Y. (1988). Access patterns: A usefull concept in vector programming. In: Houstis, E.N., Papatheodorou, T.S., Polychronopoulos, C.D. (eds) Supercomputing. ICS 1987. Lecture Notes in Computer Science, vol 297. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18991-2_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-18991-2_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18991-6

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation