The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.06 - November (1978 vol.4)
pp: 517-520
G.V. Bochmann , D?partement d'Informatique et de Recherche Operationnelle, Universit? de Montreal
ABSTRACT
This paper discusses the problem of allocating storage for the activation records of procedure calls within a system of parallel processes. A compile time storage allocation scheme is given, which determines the relative address within the memory segment of a process for the activation records of all procedures called by the process. This facilitates the generation of an efficient run-time code. The allocation scheme applies to systems in which data and procedures can be shared among several processes. However, recursive procedure calls are not supported.
INDEX TERMS
storage allocation, Code optimization, efficient variable access mechanism, memory allocation for activation records, overlays, parallel processes
CITATION
G.V. Bochmann, "Compile Time Memory Allocation for Parallel Processes", IEEE Transactions on Software Engineering, vol.4, no. 6, pp. 517-520, November 1978, doi:10.1109/TSE.1978.234137
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool