The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Communications of the ACM
The Multics virtual memory: concepts and design
Communications of the ACM
A model and stack implementation of multiple environments
Communications of the ACM
A note on storage fragmentation and program segmentation
Communications of the ACM
On the time required for retention
HLLCA '73 Proceedings of the ACM-IEEE symposium on High-level-language computer architecture
Informal introduction to ALGOL 68
Informal introduction to ALGOL 68
Data structure models for programming languages
ACM SIGPLAN Notices
The contour model of block structured processes
ACM SIGPLAN Notices
A data structure model of the B6700 computer system
ACM SIGPLAN Notices
ACM SIGPLAN Notices
On The Advantages of Tagged Architecture
IEEE Transactions on Computers
Capability Based Tagged Architectures
IEEE Transactions on Computers
Hi-index | 0.01 |
A storage management scheme is described that supports the invalidation of addresses to freed storage and thus, in that sense, provides a secure system. Unlike previous virtual memory techniques, the allocated areas of our scheme can vary from the very large, requiring multiple pages of storage, to the very small, in which several can be contained on a single page. Special treatment is accorded procedure activation storage so as to provide increased effectiveness for this important case. The interaction of this deletion scheme with garbage collection techniques is also examined. Finally, the relative advantages of retention and deletion strategies of storage management are considered.