Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Comment on Cheney's list-compaction algorithm

Comment on Cheney's list-compaction algorithm C.J. Cheney 2 implicitly assumes that cells of list storage are self-identifying. Cheney needs this assumption so that his algorithm, when linearly scanning the memory containing a copy of a list, can determine whether particular bit patterns within that memory are pointers to other list structure. The assumption is strong, and its effect is contrary to that of the list compaction which is his algorithm's purpose. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Communications of the ACM Association for Computing Machinery

Comment on Cheney's list-compaction algorithm

Communications of the ACM , Volume 14 (9) – Sep 1, 1971

Loading next page...
 
/lp/association-for-computing-machinery/comment-on-cheney-s-list-compaction-algorithm-0snZn0BhOw

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 1971 by ACM Inc.
ISSN
0001-0782
DOI
10.1145/362663.362754
Publisher site
See Article on Publisher Site

Abstract

C.J. Cheney 2 implicitly assumes that cells of list storage are self-identifying. Cheney needs this assumption so that his algorithm, when linearly scanning the memory containing a copy of a list, can determine whether particular bit patterns within that memory are pointers to other list structure. The assumption is strong, and its effect is contrary to that of the list compaction which is his algorithm's purpose.

Journal

Communications of the ACMAssociation for Computing Machinery

Published: Sep 1, 1971

There are no references for this article.