Filters








21,702 Hits in 15.0 sec

On the time required for retention

D. M. Berry, L. Chirica, J. B. Johnston, D. F. Martin, A. Sorkin
1973 Proceedings of the ACM-IEEE symposium on High-level-language computer architecture -  
The main idea is to take the run time overhead required for LSM's lifetime checks (which prevent potential dangling references in the context of deletion) and use this time to do some reference count management  ...  Each block or procedure entry requires a constant time for setting the reference count of the new contour and a potentially unbounded time for searching for a free block large enough. 8.  ...  Our handling of reference counts does not count pointers pointing to the cell in which they reside so knots of one cell do not bother the implementation.  ... 
doi:10.1145/800121.803943 fatcat:a6wcf3u6fjchlpmhbwzcwyu4zi

On the time required for retention

D. M. Berry, L. Chirica, J. B. Johnston, D. F. Martin, A. Sorkin
1973 Proceedings of a symposium on High-level-language computer architecture - SIGPLAN '73  
The main idea is to take the run time overhead required for LSM's lifetime checks (which prevent potential dangling references in the context of deletion) and use this time to do some reference count management  ...  Each block or procedure entry requires a constant time for setting the reference count of the new contour and a potentially unbounded time for searching for a free block large enough. 8.  ...  Our handling of reference counts does not count pointers pointing to the cell in which they reside so knots of one cell do not bother the implementation.  ... 
doi:10.1145/953144.953169 fatcat:6l7dusco4ndstl3llus7r2wooe

On the time required for retention

D. M. Berry, L. Chirica, J. B. Johnston, D. F. Martin, A. Sorkin
1973 Proceedings of a symposium on High-level-language computer architecture - SIGPLAN '73  
The main idea is to take the run time overhead required for LSM's lifetime checks (which prevent potential dangling references in the context of deletion) and use this time to do some reference count management  ...  Each block or procedure entry requires a constant time for setting the reference count of the new contour and a potentially unbounded time for searching for a free block large enough. 8.  ...  Our handling of reference counts does not count pointers pointing to the cell in which they reside so knots of one cell do not bother the implementation.  ... 
doi:10.1145/953166.953169 fatcat:er7lo5xdpjhfvimchv77z667jm

On the time required for retention

D. M. Berry, L. Chirica, J. B. Johnston, D. F. Martin, A. Sorkin
1973 SIGPLAN notices  
The main idea is to take the run time overhead required for LSM's lifetime checks (which prevent potential dangling references in the context of deletion) and use this time to do some reference count management  ...  Each block or procedure entry requires a constant time for setting the reference count of the new contour and a potentially unbounded time for searching for a free block large enough. 8.  ...  Our handling of reference counts does not count pointers pointing to the cell in which they reside so knots of one cell do not bother the implementation.  ... 
doi:10.1145/953171.953169 fatcat:givqv3pvovfyfknhq2by7jjk2i

Fast conservative garbage collection

Rifat Shahriyar, Stephen M. Blackburn, Kathryn S. McKinley
2014 Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications - OOPSLA '14  
We explore conservative collectors for managed languages, with ambiguous stacks and registers.  ...  These findings show that for managed languages, conservative collection is compatible with high performance.  ...  We examine conservative garbage collection for managed languages. 2.  ... 
doi:10.1145/2660193.2660198 dblp:conf/oopsla/ShahriyarBM14 fatcat:3ibbrfchirexxk37apcuojcjsq

Fast conservative garbage collection

Rifat Shahriyar, Stephen M. Blackburn, Kathryn S. McKinley
2014 SIGPLAN notices  
We explore conservative collectors for managed languages, with ambiguous stacks and registers.  ...  These findings show that for managed languages, conservative collection is compatible with high performance.  ...  We examine conservative garbage collection for managed languages. 2.  ... 
doi:10.1145/2714064.2660198 fatcat:qqr7iyokqfhkzpgyyaswar45ja

Page 2089 of Mathematical Reviews Vol. 58, Issue 3 [page]

1979 Mathematical Reviews  
Time required for reference count management in retention block-structured languages. I. Internat. J. Comput. Information Sci. 7 (1978), no. 1, 11-64.  ...  From the summary: “Two implementations of generalized block- structured languages are presented and their time requirements compared.  ... 

Referencing and Retention in Block-Structured Coroutines

Gary Lindstrom, Mary Lou Soffa
1981 ACM Transactions on Programming Languages and Systems  
We say a language has block-structured coroutines (BSCRs) when static nesting considerations govern the usage of this control combination.  ...  The first uses a special form of scopesensitive reference counting, and the second does mark-sweep garbage collection, again exploiting static program structure.  ...  Similar conventions are now being advocated for exception handling in block-structured languages.  ... 
doi:10.1145/357139.357143 fatcat:5qt6q7urmfehrd2ktvaqjnn5ju

Database implementation

1984 Data Processing  
Appendix B can be consulted for references about the systems named in this chapter. The exact syntax of examples based on these systems has been modified at times in order to provide continuity.  ...  maintained package which implements the required degree of data and structure description.  ...  In a network references are an inherent part of the structure. We will refer to these structural references as links.  ... 
doi:10.1016/0011-684x(84)90341-1 fatcat:e3ttvlctqrd6bfxmz4xcuzhfmm

Garbage collection in an uncooperative environment

Hans-Juergen Boehm, Mark Weiser
1988 Software, Practice & Experience  
required for garbage collection.  ...  We describe a technique for storage allocation and garbage collection in the absence of significant cooperation from the code using the allocator.T his limits garbage collection overhead to the time actually  ...  Acknowledgements This research was supported in part by NSF grant DCR-8607200.  ... 
doi:10.1002/spe.4380180902 fatcat:czmovrj7abcfvhauyxhrxhexlq

A principled approach to nondeferred reference-counting garbage collection

Pramod G. Joisha
2008 Proceedings of the fourth ACM SIGPLAN/SIGOPS international conference on Virtual execution environments - VEE '08  
Nondeferred reference counting is one of the original forms of automatic resource management.  ...  Section 2 presents the algorithm for implementing one form of nondeferred RC collection.  ...  Smart pointers are a language aid for easing the management of dynamically allocated resources.  ... 
doi:10.1145/1346256.1346275 dblp:conf/vee/Joisha08 fatcat:jvvdmak6urf5jgu357zzsdr47u

TILT: A GDPR-Aligned Transparency Information Language and Toolkit for Practical Privacy Engineering [article]

Elias Grünewald, Frank Pallas
2020 arXiv   pre-print
We provide a detailed analysis of transparency obligations from the GDPR to identify the expressiveness required for a formal transparency language intended to meet respective legal requirements.  ...  In this paper, we present TILT, a transparency information language and toolkit explicitly designed to represent and process transparency information in line with the requirements of the GDPR and allowing  ...  The building blocks as worked out in table 2 might be extended or changed over time, since a new iteration of GDPR is about to come.  ... 
arXiv:2012.10431v1 fatcat:4wdf4ec7srefzh3zkxamvefil4

Safe manual memory management

David Gay, Rob Ennals, Eric Brewer
2007 Proceedings of the 6th international symposium on Memory management - ISMM '07  
Porting programs for use with HeapSafe typically requires little effort (on average 0.6% of lines change), adds an average 11% time overhead (84% in the worst case), and increases space usage by an average  ...  We present HeapSafe, a tool that uses reference counting to dynamically verify the soundness of manual memory management of C programs.  ...  in other parts of the same data structure that will soon be freed.  ... 
doi:10.1145/1296907.1296911 dblp:conf/iwmm/GayEB07 fatcat:ojdzbvl76fakxaym4rtd2dwwpe

Inventorying Magnetic-Media Records

Everett Alldredge
1972 The American Archivist  
In 1968 the National Archives and Records Service thought it time to begin work on an inventory theory and began a project to find out what information existed in machine language form in the Federal Government  ...  Over a much shorter period, records management specialists have established a doctrine on what constitutes an adequate minimal inventory of records in the creating and maintaining establishment.  ...  The author, a Fellow and past President of the Society, retired in 1971 from the National Archives and Records Service as Assistant Archivist for Records Management, after 31 years of Government service  ... 
doi:10.17723/aarc.35.3-4.x4511081x176w482 fatcat:4f67qfxfordlfmqcvnys7ihdtm

Compacting garbage collection with ambiguous roots

Joel F. Bartlett
1988 ACM SIGPLAN Lisp Pointers  
Like other languages for the Titan, it uses the Mahler intermediate language as its target.  ...  A Scheme implementation has been done for the Digital WRL Titan processor which uses a garbage collector based on this "mostly copying" algorithm.  ...  Acknowledgements Wendy Bartlett read and criticized several drafts of this paper, each time substantially improving the presentation.  ... 
doi:10.1145/1317224.1317225 fatcat:kbtdes5jqfgy5ejxscbosn3udi
« Previous Showing results 1 — 15 out of 21,702 results