论文信息 - A protocol for distributed reference counting

A protocol for distributed reference counting

In this article a protocol for distributed reference counting is developed and proved correct. It is pointed out, how it can be used to detect instemces where update in place is allowed. An implementation scheme is presented that requires bookkeeping messages only for tire copying of references across processor boundaries and for the deletion of references copied in this way. Synchronization is only necessary for the deletion of these references.

Dieter Maurer | Claus-Werner Lermen | C. Lermen | D. Maurer

[1] Jacques Cohen,et al. Garbage Collection of Linked Data Structures , 1981, CSUR.

[2] John Darlington,et al. ALICE a multi-processor reduction machine for the parallel evaluation CF applicative languages , 1981, FPCA '81.

[3] M. F.,et al. Bibliography , 1985, Experimental Gerontology.

[4] Henry G. Baker,et al. List processing in real time on a serial computer , 1978, CACM.

[5] David R. Brownbridge. Cyclic Reference Counting for Combinator Machines , 1985, FPCA.

[6] Paul Hudak,et al. Garbage collection and task deletion in distributed applicative processing systems , 1982, LFP '82.

[7] Patrick Cousot,et al. Semantic foundations of program analysis , 1981 .

[8] Rex L. Page,et al. Deleting Irrelevant Tasks in an Expression-Oriented Multiprocessor System , 1981, TOPL.

[9] Jack B. Dennis,et al. First version of a data flow procedure language , 1974, Symposium on Programming.

[10] Henry Lieberman,et al. A real-time garbage collector based on the lifetimes of objects , 1983, CACM.