Abstract
This paper investigates the time requirements for an implementation of retention block-structured languages that uses a garbage collector as its sole means for recovering inaccessible storage. The usual three-pass markcompactify-and-update garbage collector is optimized to eliminate the need for the third pass in the event that the executed program is lifetime well-stacking.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D. M. Berry, “The importance of implementation models in Algol 68 or how to discover the concept of necessary environment,”SIGPLAN Not.5:(9) (September, 1970).
D. M. Berry, “Introduction to Oregano,”DSIPL (1971).
D. M. Berry, “Block Structure: Retention vs. Deletion,”Proc. Third Symposium on Theory of Computation (1971).
D. M. Berry, “On the Design and Specification of the Programming Language Oregano,” UCLA-ENG-7388 Computer Science Department, UCLA (January 1974).
D. M. Berry, L. M. Chirica, J. B. Johnston, D. F. Martin, and A. Sorkin, “Time required for reference count management in retention block-structured languages,”Int. J. Comput. Inf. Sci. 7:11–64; 91–119 (1978).
P. Branquart and J. Lewi, “A scheme of storage allocation and garbage collection for ALGOL 68,” in Ref. 13 (1970).
L. M. Chirica, T. A. Dreisbach, D. F. Martin, J. G. Peetz, and A. Sorkin, “Two PARALLEL EULER Run Time Models: The Dangling Reference, Imposter Environment, and Label Problems,”Proc. ACM Symposium on High Level Language Computer Architecture, SIGPLAN Not.8:(11) (November, 1973).
M. J. Fischer, “Lambda Calculus Schemata,”Proc. ACM Conference on Proving Assertions about Programs, SIGPLAN Not.7:(1) (January, 1972).
J. B. Johnston, “The Contour Model of Block Structured Processes,”DSIPL (1971).
J. B. Johnston, D. M. Berry, and D. P. Murphy, “Expression Stack Management in Nested Declaration Computation,” Eighth Annual Princeton Conference on Information Science and Systems (March 1974).
D. Knuth,The Art of Computer Programming, Vol. 1, Chap. 2, (Addison-Wesley, Reading, Mass., 1968).
E. I. Organick,Computer Systems Organization (Academic Press, New York, 1973).
J. E. L. Peck (Ed.), ALGOL 68 Implementation (North Holland, Amsterdam, 1970).
B. Randall and L. J. Russell,ALGOL 60 Implementation (Academic Press, New York, 1964).
J. D. Reynolds, “GEDANKEN—A simple typeless language based on the principle of completeness and the reference concept,”Commun. ACM 13(5) (May 1970).
H. Schorr and W. M. Waite, “An efficient machine-independent procedure for garbage collection in various list structures,”Commun. ACM 10(8) (August 1967).
A. van Wijngaardenet al., “Report on the algorithmic language ALGOL 68,”Num. Math. 14:79–218 (1969).
A. van Wijngaardenet al., “Revised Report on the Algorithmic Language ALGOL 68,” Technical Report TR74-3, Computer Science Department, University of Alberta, Edmonton, Alberta (March 1974).
K. Walk,et al, Formal Definition of PL/I, ULD Version III (IBM, Vienna, 1969).
P. Wegner, “Data structure models for programming languages,”DSIPL (1971).
J. M. Wozencraft and A. Evans, “Notes on Programming Linguistics,” Electrical Engineering Department, Massachusetts Institute of Technology (1970).
Author information
Authors and Affiliations
Additional information
Supported (in part) by the United States Energy Research and Development Administration, Contract No. E(04-3)-34, PA 214, and (in part) by the National Science Foundation, Grant No. DCR75-08659.
Rights and permissions
About this article
Cite this article
Berry, D.M., Sorkin, A. Time required for garbage collection in retention block-structured languages. International Journal of Computer and Information Sciences 7, 361–404 (1978). https://doi.org/10.1007/BF00991820
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00991820