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
| Identifer | oai:union.ndltd.org:ORGSU/oai:ir.library.oregonstate.edu:1957/38147 |
| Date | 27 September 1990 |
| Creators | Al-Rabeh, Raed H. |
| Contributors | Rathja, Roy |
| Source Sets | Oregon State University |
| Language | en_US |
| Detected Language | English |
| Type | Thesis/Dissertation |
Page generated in 0.0018 seconds