Skip Navigation

The Computer Journal 1970 13(1):40-47; doi:10.1093/comjnl/13.1.40
© 1970 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 Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Blake, L. F.
Right arrow Articles by Yuille, I. M.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A ring processing package for use with FORTRAN or a similar high-level language

L. F. Blake, R. E. Lawson and I. M. Yuille *

Admiralty Research Laboratory, Teddington, UK

Many applications of a computer, particularly in engineering design, utilise relationships between blocks of data and require a facility for building and manipulating data structures which permit the expression of these associative relationships. This paper describes a software package that enables associative data structures to be represented in a computer store by means of rings of address pointers connecting blocks of data in an orderly manner. The package has been implemented on a KDF9 computer with a disc store operated by the Egdon 3 system. The software is written in machine code but by means of a set of small auxiliary routines operations may be carried out by calling FORTRAN subroutines. By this means manipulations of associative data occupying up to two million words may be included in FORTRAN programs. By writing different auxiliary routines the package could be used in ALGOL or another high level language. Implementation on another computer would not be difficult.

Received April 1969.

* Admiralty Research Laboratory, Teddington, Middlesex


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.