• DOI:10.1145/359460.359470
Corpus ID: 17661259

List processing in real time on a serial computer

@article{Baker1978ListPI,
  title={List processing in real time on a serial computer},
  author={H. G. Baker},
  journal={Commun. ACM},
  year={1978},
  volume={21},
  pages={280-294}
}

H. G. Baker

Published 1978

Computer Science

Commun. ACM

A real-time list processing system is one in which the time required by the elementary list operations (e.g. CONS, CAR, CDR, RPLACA, RPLACD, EQ, and ATOM in LISP) is bounded by a (small) constant. Classical implementations of list processing systems lack this property because allocating a list cell from the heap may cause a garbage collection, which process requires time proportional to the heap size to finish. A real-time list processing system is presented which continuously reclaims garbage… CONTINUE READING

View on ACM

dspace.mit.edu

Save to Library

Create Alert

Cite

Launch Research Feed