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?

Operating system design, You are required to study the important system com...

You are required to study the important system components, including important data structures, important functions and algorithms, and the various organizational, structural, logi

What is a path name, What is a path name? A pathname is the path from t...

What is a path name? A pathname is the path from the root by all subdirectories to a specified file. In a two-level directory structure a user name and a file name explain a pa

Explanation of modern cpu architectures, Your CTO liked your proposal from ...

Your CTO liked your proposal from Unit 2 so much he only trusts you to explain complex concepts to his managers. He now wants you to write him a four page paper explaining the CPU,

Explain threads for executing concurrent application code, Explain Threads ...

Explain Threads for Executing Concurrent Application Code The thread has been introduced in many operating systems as an efficient mechanism for executing concurrent applicatio

Explain the per thread scoping, Explain the Per Thread Scoping Thread-l...

Explain the Per Thread Scoping Thread-level programming introduces new twists for application-level variable scoping. Threads are commonly used in one of two ways. To ex

What do you mean by reference counts, Q. If each the access rights to an o...

Q. If each the access rights to an object are deleted the object can no longer be accessed. At this stage the object should also be deleted and the space it occupies should be ret

Explain the overlay structured program, Overlay structured program: A p...

Overlay structured program: A program consisting of overlays is referred as overlay structured program in which an overlay is a part of program which has similar load origin as

Differences among user-level threads and kernel-level thread, Q. What are t...

Q. What are two differences among user-level threads and kernel-level threads? Under what situations is one type better than the other? Answer: (1) User-level threads are un

Prevention of a data race in a parallelised program, Present your own fully...

Present your own fully documented and tested programming example illustrating the prevention of a data race in a parallelised program. This is an example where total number of p

What are the benefits of multithreaded programming, What are the benefits o...

What are the benefits of multithreaded programming? The advantages of multithreaded programming can be broken down into four main categories: Responsiveness Resourc

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