Date

September 1985

Document Type

Thesis

Degree Name

M.S.

Department

Dept. of Computer Science and Engineering

Institution

Oregon Graduate Center

Abstract

Dynamic, list-structure memory provides direct hardware support for list processing systems; it facilitates concurrent evaluation and memory management that requires little explicit cooperation between the evaluator and memory management processors. This thesis reviews the suitability of present concurrent garbage-collection schemes, and introduces a new scheme that provides incremental, parallel collection. A memory architecture to support the new algorithm is also described. A multi-process simulation of the architecture and the new algorithm show that this model will support intensive list-structure operations of applicative language evaluators under development.

Identifier

doi:10.6083/M44F1NN9

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.