Disk space fragmentation is the proliferation of small and unusable gaps. This problem is considered within the context of IBM's VM operating system. Facing this problem, researchers resorted to using algorithms based on memory management techniques, such as placement strategies (first-fit, best-fit, and worst-fit). Solutions based on these algorithms do not yield optimum results. Furthermore, in many cases, their efficiency and cost effectiveness are questionable. This work proposes a new method to address the disk fragmentation problem using improved I/0 techniques. Optimum results and efficiency are some of the qualities that contribute to the superiority of this approach. The algorithm was implemented and test figures were compared with calculated figures. The results clearly favor this new algorithm. / Graduation date: 1991

Thesis (M.S. in Computer Science)--Naval Postgraduate School, June 2003. / Thesis advisor(s): Cynthia E. Irvine, Roger R. Schell. Includes bibliographical references (p. 83-92). Also available online.

Thesis (M.S. in Computer Science)--Naval Postgraduate School, June 2003. / Thesis advisor(s): Cynthia E. Irvine, Roger R. Schell. Includes bibliographical references (p. 105-107). Also available online.

No description available.

No description available.

No description available.

Includes bibliography. / 246 p. : ill. ; 30 cm. / Title page, contents and abstract only. The complete thesis in print form is available from the University Library. / This thesis explores the implementation of orthogonally persistent systems that make direct use of the attributes of paged virtual memory found in the majority of conventional computing platforms. These attributes are exploited to support object movement for persistent storage to addressable memory, to aid in garbage collection, to provide the illusion of larger storage spaces than the underlying architecture allows, and to provide distribution of the persistent system. It also explores the different models of distribution, communication mechanisms between federated spaces and the problem of maintaining consistency between separate persistent spaces in a manner which ensures both a reliable and resilient computational environment. / Thesis (Ph.D.)--University of Adelaide, Dept. of Computer Science,1995

Includes bibliography. / 246 p. : ill. ; 30 cm. / Title page, contents and abstract only. The complete thesis in print form is available from the University Library. / This thesis explores the implementation of orthogonally persistent systems that make direct use of the attributes of paged virtual memory found in the majority of conventional computing platforms. These attributes are exploited to support object movement for persistent storage to addressable memory, to aid in garbage collection, to provide the illusion of larger storage spaces than the underlying architecture allows, and to provide distribution of the persistent system. It also explores the different models of distribution, communication mechanisms between federated spaces and the problem of maintaining consistency between separate persistent spaces in a manner which ensures both a reliable and resilient computational environment. / Thesis (Ph.D.)--University of Adelaide, Dept. of Computer Science,1995

Thesis (M.Comp.)--Unitec New Zealand, 2009. / Includes bibliographical references (leaves 106-112).

Thesis (Ph. D.)--OGI School of Science & Engineering at OHSU, 2004. / Includes bibliographical references (leaves 351-358).