What is file allocation?, Operating System

Assignment Help:

What is File Allocation?

The structure that offers the FAT file system its name is the file allocation table. In order to know what this important table does, you should first understand how space on the hard disk is allocated under operating systems that use FAT family file systems (including DOS and most versions of Windows.)

Data is stored in solo 512-byte sectors on the hard disk. In theory it is possible for every file to be allocated to a number of individual sectors and this is actually done for some file systems (such as HPFS) though for performance reasons individual sectors are not allocated to files in the FAT system. The reason is that it would consume a lot of overhead (time and space) to keep track of pieces of files that were this small a 10 GB disk partition has (20,000,000 sectors) the hard disk is instead broken into larger pieces called clusters or alternatively allocation units. Every cluster contains a number of sectors. Usually, clusters vary in size (from 2,048 bytes to 32,768 bytes) which corresponds to 4 to 64 sectors the entire. The file allocation table FAT is where information about clusters is stored. Every cluster has an entry in the FAT that describes how it used. This is what tells the OS (operating system) which parts of the disk are currently used by files and which are free for use. The FAT entries are utilized by the operating system to chain together clusters to form files.

The file allocation tables FAT are stored in the area of the disk immediately following the volume boot sector. Every volume actually contains two identical copies of the FAT ostensibly; the second one is intended to be a backup of sorts in case of any damage to the first copy. Damage to the FAT is able to of course result in data loss since this is where the record is kept of which parts of the disk contain which files. The initiative behind the backup copy is that it could be used in the event that the primary becomes damaged.

In the conventional FAT system though, the backup FAT system does not work too well. The trouble is that the two copies are kept right next to each other on the disk, in order that if, for instance, bad sectors appear on the disk where the first copy of the FAT is stored, chances are pretty high that the second copy will be affected as well. Another trouble is that disk utilities often duplicate the primary FAT to the backup FAT location. This signifies that any corruption that arises in the primary FAT may be duplicated to the backup copy before it is noticed.

Under FAT32 some enhancement were made to the FAT backup scheme. First- either copy of the FAT is able to be designated the "primary" and either the "backup". Second Method- the process by which the FAT is copied from the primary to the backup location is able to be disabled and the combination of these features permits the second FAT to be used and protected in the event of problems with the first.


Related Discussions:- What is file allocation?

What is direct access, Normal 0 false false false EN-IN...

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

Can page tables be set up to replicate base registers, Q. We have an OS (o...

Q. We have an OS (operating system) for a machine that uses base and limit registers however we have modified the machine to provide a page table. Can the page tables be set up to

Explain wait for graph, Explain Wait for Graph a. Use a resource alloca...

Explain Wait for Graph a. Use a resource allocation graph to derive a wait-for graph.  b. Wait-for graph acquired by making an edge from p 1 to p 2 iff p 1 is waiting for

Explain the concept of reentrancy, Explain the concept of Reentrancy? I...

Explain the concept of Reentrancy? It is a useful, memory-saving method for multiprogrammed timesharing systems. A Reentrant Procedure is one in which many users can share a si

How can a user program disturb the normal operation, How can a user program...

How can a user program disturb the normal operation of the system? a) Issuing illegal I/O operation. b) By accessing memory locations within the OS itself. c) Refusing to

Threads, What is single and multithreading and thread pool?

What is single and multithreading and thread pool?

Define a state which is not a fundamental process state, Define a state whi...

Define a state which is not a fundamental process state Answer: Blocked state is not a fundamental process state

Use of c and c++, One reason to learn C and C++ is simply that so much soft...

One reason to learn C and C++ is simply that so much software is written in these languages. A related, butmore fundamental reason, is that C and C++ are relatively low-level, allo

Explain why sstf scheduling tends to favor middle cylinders, Explain why SS...

Explain why SSTF scheduling tends to favor middle cylinders over the innermost and outermost cylinders. The center of the disk is the location having the fewest average distanc

Illustrate example for segmentation, EXAMPLE FOR SEGMENTATION Consider ...

EXAMPLE FOR SEGMENTATION Consider an instance as given in the table and we have five segments numbered from 0 through 4 the segment is stock in the physical memory as shown. Th

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd