IT332_CharlesTidwell_Unit_7_Assignment.docx Unit 7Assignment IT332 - 01 Purdue University Global Many physical storage mediums are used in the computing world today. A few examples of physical storage mediums are a
...
IT332_CharlesTidwell_Unit_7_Assignment.docx Unit 7Assignment IT332 - 01 Purdue University Global Many physical storage mediums are used in the computing world today. A few examples of physical storage mediums are a hard drive, flash drive, DVD, and tape. While these mediums use different file allocation methods and size constraints, they also suffer from fragmentation. This paper will discuss the different mediums and how fragmentation works, how to avoid fragmentation, and how to correct the fragmented space to speed things back up. A contiguous allocation is a type of file allocation that allows the data to be written or stored throughoccupying concurrent blocks on the disk. By using this type of file allocation, a single directory pointer is needed to locate an entire file. Due to only needing one directory pointer, it is quicker to recover a file for use. The file manager can request for a block to read a file which will only require one pass. Contiguous allocation supports random access but has a hard time when dealing with growing files, due to space needing to be pre-allocated which wastes disk space. When files are deleted or moved, it creates gaps within the storage medium which leads to the disk being fragmented. Non-contiguous allocation is a file allocation that writes data to various disk spaces because of limited space in a certain area. Due to the way the data is written, data can easily grow over time with no complications. Unlike contiguous allocation, the non-contiguous allocation has a reducti. . . . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . .. .. . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
[Show More]
