Skip Navigation

The Computer Journal 1974 17(3):224-228; doi:10.1093/comjnl/17.3.224
© 1974 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 Mullin, J. K.
Right arrow Articles by Stuart, G. F.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Optimum blocking factors for a mix of sequentially processed jobs

J. K. Mullin * and G. F. Stuart *

Department of Computer Science, The University of Western Ontario, London, Canada

This work involves techniques to determine optimal blocking arrangements for sequentially processed magnetic files. It is an extension to the work by Waters (1971), who presents a method of optimally blocking files in a single job. We consider a group of jobs, run with different frequencies, where constraints exist between jobs due to common files. Practical constraints on the maximum size of a physical record are also included. Two operating environments are considered. In the first the amount of storage available for a job is known. In the second environment, the amount of storage available for a job is not predetermined and is found by the minimisation of a cost function. A quadratic programming technique presented by Ravindran (1972) is employed in the solution.

Received November 1972.

* Department of Computer Science, The University of Western Ontario, London 72, Canada


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.