Eager Reclamation

Reclamation policies are presented which permit the reuse of storage for procedure instances before the procedures terminate. These eager reclamation policies are applicable under certain conditions and can reduce the total amount of memory needed for the execution of a program. The policies essenti...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on software engineering 1985-04, Vol.SE-11 (4), p.437-439
Main Authors: Ching-Chy Wang, Soffa, M.L.
Format: Article
Language:English
Subjects:
Applied sciences
Automatic control
Computer programming
Computer science
Computer science
control theory
systems
Data processing. List processing. Character string processing
Exact sciences and technology
Implementation
Iterative algorithms
Iterative methods
Mathematical models
Memory organisation. Data processing
Microprocessors
optimization
Optimizing compilers
procedure reclamation
Program processors
Programming profession
reclamation
Registers
Runtime
Software
Software engineering
storage management
Theory
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Reclamation policies are presented which permit the reuse of storage for procedure instances before the procedures terminate. These eager reclamation policies are applicable under certain conditions and can reduce the total amount of memory needed for the execution of a program. The policies essentially differ in the amount of run-time checks needed and the reclamation opportunities. This eager reclamation strategy would be particularly useful when instances are implemented using register banks or in a microprocessor environment.
ISSN:0098-5589
1939-3520
DOI:10.1109/TSE.1985.232232