Skip Navigation

The Computer Journal 1986 29(1):47-51; doi:10.1093/comjnl/29.1.47
© 1986 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 (4)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Bassiouni, M. A.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

System and Program Models of Storage Allocation for Reducing Seek Delay

M. A. Bassiouni *

Department of Computer Science, University of Central Florida, Orlando, Florida 32816, USA

Two models for the storage and placement of files on disk storage devices are presented. Both models assume knowledge of certain aspects of the I/O behaviour in the system. The models are based on the system viewpoint and the program viewpoint, respectively, of I/O measurements and they both use the seek delay time as the performance measure to be optimised. The underlying analytic problem in each case is NP-hard. Efficient heuristic algorithms are presented and numerically tested.


Received May 1984.

* Department of Computer Science, University of Central Florida, Orlando, Florida 32816, USA


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.