ACM Letters on Programming Languages and Systems · 1992 · 14 citations · 17 references
ComputingComputer ScienceComputer SystemsData StructuresInformation RetrievalReal-time SystemsGarbage CollectionMemory HierarchyMemory Hierarchy DesignCollector LatencyGarbage Collection AlgorithmsGarbage Collection OverheadGarbage Collection Overhead AnalysisReal-time Garbage Collection
This paper shows how to make the latency of scanning a page in the Appel-Ellis-Li real-time garbage collector be proportional only to the number of object references on a page (the page size), instead of to the sum of the sizes of the objects referenced by the page. This makes the garbage collection algorithm much more suitable for real-time systems.
17
List processing in real time on a serial computer
Henry G. Baker · Communications of the ACM · 1978 · 592 citations · Full text
David Ungar · ACM SIGSOFT Software Engineering Notes · 1984 · 487 citations
A nonrecursive list compacting algorithm
C. J. Cheney · Communications of the ACM · 1970 · 392 citations · Full text
David Ungar · 1984 · 298 citations