Skip to main content
Log in

Access mechanisms in block structured environments

  • Part I Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

Statistics from dynamic analysis of programs are used to compare the efficiency of different methods to access global variables. The method where static links are used for access is shown to be at least as efficient as the display method. The use of the linked list method also leads to a simpler runtime system and allows separately compiled modules to execute at any level in the resulting program. The results of the dynamic analysis are presented in a form which allows comparison of the access methods in language implementations on specific computers. Experience with using two different access methods in an implementation of Simula67 concludes the paper.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Reference Manual for the Ada Programming Language. US Department of Defence, July 1981.

  2. A. V. Aho and J. D. Ullman,Principles of Compiler Design. Addison-Wesley 1977.

  3. S. Arnborg,Storage administration in a virtual memory Simula system. BIT 12 (1972), 125–141.

    Google Scholar 

  4. S. Arnborg,Simula user program semantics and code generation effectiveness. FOA C 8498-M3 (E5), June, 1974.

  5. K. Babcicky,Simula programming efficiency considerations. (Paper presented at ASU Workshop Dec. 1978), NCC, Oslo, Norway.

    Google Scholar 

  6. P. Brinch Hansen,The programming language Concurrent Pascal. IEEE Trans. Software Eng. 1, 2 (June 1975), 199–207.

    Google Scholar 

  7. O.-J. Dahl, B. Myhrhaug and K. Nygaard,Simula 67 Common Base Language, Publication S-22, Norwegian Computing Centre, Oslo, Norway.

  8. O.-J. Dahl and B. Myhrhaug,Simula 67 Implementation Guide. Publication S-9, Norwegian Computing Centre, Oslo, Norway.

  9. O.-J. Dahl and C. A. R. Hoare,Hierarchical Program Structures, inStructured Programming, Academic Press, London 1972.

    Google Scholar 

  10. E. W. Dijkstra,Recursive programming, Num. Math. 2 (1960), 312–318.

    Google Scholar 

  11. E. W. Dijkstra,ALGOL-60 translation. Algol Bulletin Supplement nr. 10, Nov. 1961.

  12. Holm et al.,Simula for Data General Eclipse, Users Manual. Dept. of Computer Science, Lund Institute of Technology, Sweden, Feb. 1981.

    Google Scholar 

  13. M. Löfgren and B. Magnusson,Evaluation of Implementations of Access Mechanisms in Block Structured Languages. Dept. of Computer Science, Lund Institute of Technology, Sweden, Aug. 1982.

    Google Scholar 

  14. P. Naur (Ed.),Revised report on the algorithmic language Algol 60, Comp. Journal. 5, 349–367.

  15. M. Shimasaki et al.,An analysis of Pascal programming in compiler writing. Software — Practice and Experience, vol. 10 (1980), pp. 149–157.

    Google Scholar 

  16. B. A. Wichmann,Algol 60 — Compilation and Assessment, Academic Press, London 1973.

    Google Scholar 

  17. N. Wirth,The Programming Language Pascal, Acta Informatica, 1, 1971, 35–63.

    Google Scholar 

  18. N. Wirth,The design of a Pascal compiler. Software — Practice and Experience, vol. 1 (1971), pp. 309–333.

    Google Scholar 

  19. N. Wirth,On “Pascal”, code generation and the CDC 6000 computer. STAN CS-72-257, Feb. 1972.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Löfgren, M., Magnusson, B. Access mechanisms in block structured environments. BIT 22, 419–436 (1982). https://doi.org/10.1007/BF01934407

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01934407

Keywords

Navigation