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 busy waiting?, What is busy waiting? When strict alteration is ...

What is busy waiting? When strict alteration is done there may take place situation like two processes setting their flag as true. Therefore both of the processes have equal pr

BARBER SHOP PROBLEM, a) The barber shop has one barber, one barber chair, a...

a) The barber shop has one barber, one barber chair, and n chairs for waiting customers, to sit on. If there are no customers present, the barber sits down in the barber chair and

First-in-first-out (fifo), FIFO is named as 'named pipes'. FIFO (first-in-...

FIFO is named as 'named pipes'. FIFO (first-in-first-out) is a special file which is laid to be data transient. Once data is load from named pipe, it cannot be load again. Also, da

How does a program execution take place in multiprogramming?, How does a pr...

How does a program execution take place in multiprogramming? While the processor is dealing with a number of programs, the sequence with which programs are implemented will de

Mention some attractive properties of semaphore?, Mention some attractive p...

Mention some attractive properties of semaphore?              The Semaphores aren't provided by hardware. However they have numerous attractive properties: Machine indep

Define page fault, Page fault is a trap to the software gained by the har...

Page fault is a trap to the software gained by the hardware when a process accesses a page that is goes in the virtual address space, but not added in physical memory. In the har

Define seek time and latency time, Define seek time and latency time. T...

Define seek time and latency time. The time taken by the head to move to the appropriate cylinder or track is known as seek time. Once the head is at right track, it must wait

What is thrashing, What is thrashing? It is a method in virtual memory...

What is thrashing? It is a method in virtual memory schemes when the processor spends most of its time swapping pages, rather than implementing instructions. This is because o

Explain the alphabet and string, Explain the Alphabet and String A fini...

Explain the Alphabet and String A finite set of symbols is known as alphabet. An alphabet is frequently denoted by sigma, yet can be given any name. B = {0, 1} says B is an

List disadvantages of using a single directory, List disadvantages of using...

List disadvantages of using a single directory. Users have no privacy. Users must be careful in choosing file names, to avoid names used by others. Users may destroy each othe

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