Skip Navigation

The Computer Journal 1968 11(1):17-21; doi:10.1093/comjnl/11.1.17
© 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 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 Knight, D. C.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

An algorithm for scheduling storage on a non-paged computer

D. C. Knight *

National Physical Laboratory, Teddington, UK

A method is described of allocating core storage on a computer without paging facilities, working in a time-shared environment. The algorithm includes techniques for the dynamic repositioning of program segments, and the dumping of segments to a secondary store, in order to enlarge and consolidate unused portions of the core store. The paper also gives the results obtained from the random simulation of a system requiring the scheduling algorithm, to check out the logic, and to provide patterns of behaviour.

First received July 1967. revised form November 1967.

* National Physical Laboratory, Teddington, Middlesex, England (which on leave of absence from the Computing Research Section, C.S.I.R.O., Australia); now at King's College, Strand, London, W.C.2.


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.