This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Compile Time Memory Allocation for Parallel Processes
November 1978 (vol. 4 no. 6)
pp. 517-520
G.V. Bochmann, D?partement d'Informatique et de Recherche Operationnelle, Universit? de Montreal
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, Nov. 1978, doi:10.1109/TSE.1978.234137
Usage of this product signifies your acceptance of the Terms of Use.