Skip Navigation

The Computer Journal 1968 10(4):338-346; doi:10.1093/comjnl/10.4.338
© 1968 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (3)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Wiseman, N. E.
Right arrow Articles by Hiles, J. O.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A ring structure processor for a small computer

N. E. Wiseman and J. O. Hiles *

University Mathematical Laboratory, Corn Exchange Street, Cambridge, UK

A low-level data structure package for the PDP7 computer is described. Its principal features are the compact form in which given structures may be set up and the wide range of formats permitted. Ring structures are regarded as special cases of general list structures, and the package permits the generation and processing of all legal list structures. It is, however, specifically oriented to a certain class of uni-directional list and ring formats, and achieves particularly good space utilization when they are used. Space statistics for the package are presented which, when compared with the performance of more conventional schemes, show typical savings of about 30%.


* University Mathematical Laboratory, Corn Exchange Street, Cambridge.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.