| Hoare CAR (1974) Optimization of store size for garbage collection, Info. Processing Letters 2(6)165-66. |
....a real memory computer would use, should give both a fast CONS and a tolerable working set size. The parameter k can also be dynamically adjusted to optimize either running time (including paging) or cost according to some pricing policy by following an analysis similar to that of Hoare and others [2,10,21]. 3) A Database Management System. We conceive of a huge database having millions of records, which may contain pointers to other records, being managed by our algorithm. Examples of such databases are a bill of materials database for the Apollo Project, or a complete semantic dictionary and ....
Hoare, C.A.R. Optimization of store size for garbage collection. Inform. Processing Letters 2 (1974), 165166.
No context found.
Hoare CAR (1974) Optimization of store size for garbage collection, Info. Processing Letters 2(6)165-66.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC