David C. Walden – Communications of the ACM

Research and Advances Apr 1 1972

A system for interprocess communication in a resource sharing computer network

A system of communication between processes in a time-sharing system is described and the communication system is extended so that it may be used between processes distributed throughout a computer network. The hypothetical application of the system to an existing network is discussed.

Author Archives

Research and Advances Apr 1 1972

A note on Cheney’s nonrecursive list-compacting algorithm

Research and Advances Apr 1 1972

A note on Cheney’s nonrecursive list-compacting algorithm

Cheney's list-compacting algorithm [1] goes into an infinite loop when it traces a circular list consisting exclusively of non-items. While it may be reasonable to say that such lists should not exist, it would be very difficult to legislate out of existence programs which illegally create such lists because of bugs, and it would not do for the garbage collector to break down in this instance.

Shape the Future of Computing

ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.

Get Involved