Abstract
This Paper deals with the allocation of records on a linear storage device to minimize the average access time when the request probabilities to the recores are not independent. For sequential access, algorithms to obtain optimal and approximate solutions are presented. The approximation algorithm is also used with little modification for direct access. The performance of the approximation algorithm is estimated.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
