Linked allocation:

There are 3 typical file allocation methods:

1. contagious allocation.

2. Linked allocation.

3. Indexed allocation.

Linked allocation is also called chain allocation o.s keeps on ordered list of free blocks. file descriptor stores pointers to the front block and each block stores printer to the next block.

Above list shows linked allocation. The disk block mag |x anywhere on the disk the directory contains a pointer to front and last block of the file.

• No space is lot to disk fragmentation and creation of new file in easy by simply creating a new entry in the directory.

• Reading a file in straight forward as here user simply read block by following pointer from block to block.

• There is no extend fragmentation with linked allocation.

• To create the file system, find a free block and this new block is written to and linked to the end of the file.

• while creating a new file, it is not necessary to declare the size of the file. a file can contagious to grow as long as free block are available.

• Can action can be used so that block os one file are located continuously on the disk and it optimizes disk access.

• Following are characteristics of linked allocation.

1. it support fixed size portions.

2. pre allocation is possible.

3. File allocation table is one entry for a file.

4. Allocation frequency is low to high.

Advantages:

1. There is no extend fragmentation.

2. It is never necessary to compact disk space.

3. Pre allocation is not required.

Disadvantages:

1. File can be succeed only sequentially.

2. Space is required for printer.

3. Reliability is not so good.

4. It cannot support direct access to files.