請用此 Handle URI 來引用此文件: http://hdl.handle.net/11455/38470
標題: Record Allocation for Minimizing Expected Seek Delay Time
作者: U.I.Gupta
D.T.Lee
J.Y.T.Leung
J.W.Pruitt
C.K.Wong
摘要: Given a set of variable length records and their access probabilities, we address the problem of allocating these records on a linear storage device so as to minimize the expected seek time. A partial characterization of the optimal arrangement is given and the general problem of finding an optimal solution is shown to be NP-hard. Next, two heuristics are considered and performance bounds are derived for them. Although these bounds are not very encouraging, both heuristics are found to perform well in practice.
URI: http://hdl.handle.net/11455/38470
顯示於類別:資訊科學與工程學系所

文件中的檔案:
沒有與此文件相關的檔案。


在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。