Scribd
Upload
20 views20 pages

CH 11

The document discusses various aspects of file system implementation including file structure, allocation methods, free space management, directory implementation, efficiency and performance, and recovery. It covers topics such as contiguous allocation, linked allocation, indexed allocation, free space management using bit vectors and free lists, directory implementation using linear lists and hash tables, techniques for improving efficiency like caching, and methods for recovery including consistency checking and backing up data.

Uploaded by

Samson chinthenga
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
20 views20 pages

CH 11

The document discusses various aspects of file system implementation including file structure, allocation methods, free space management, directory implementation, efficiency and performance, and recovery. It covers topics such as contiguous allocation, linked allocation, indexed allocation, free space management using bit vectors and free lists, directory implementation using linear lists and hash tables, techniques for improving efficiency like caching, and methods for recovery including consistency checking and backing up data.

Uploaded by

Samson chinthenga
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 20

File-System Implementation

• File-System Structure
• Allocation Methods
• Free-Space Management
• Directory Implementation
• Efficiency and Performance
• Recovery

Operating System Concepts 11.1 Silberschatz and Galvin1999


File-System Structure

• File structure
– Logical storage unit
– Collection of related information
• File system resides on secondary storage (disks).
• File system organized into layers.
• File control block – storage structure consisting of
information about a file.

Operating System Concepts 11.2 Silberschatz and Galvin1999


Contiguous Allocation

• Each file occupies a set of contiguous blocks on the disk.


• Simple – only starting location (block #) and length
(number of blocks) are required.
• Random access.
• Wasteful of space (dynamic storage-allocation problem).
• Files cannot grow.
• Mapping from logical to physical.
Q
LA/512
R
– Block to be accessed = ! + starting address
– Displacement into block = R

Operating System Concepts 11.3 Silberschatz and Galvin1999


Linked Allocation

• Each file is a linked list of disk blocks: blocks may


be scattered anywhere on the disk.

block = pointer

Operating System Concepts 11.4 Silberschatz and Galvin1999


• Allocate as needed, link together; e.g., file starts at block
9

Operating System Concepts 11.5 Silberschatz and Galvin1999


Linked Allocation (Cont.)

• Simple – need only starting address


• Free-space management system – no waste of space
• No random access
• Mapping
Q
LA/511
R

– Block to be accessed is the Qth block in the


linked chain of blocks representing the file.
– Displacement into block = R + 1
• File-allocation table (FAT) – disk-space allocation
used by MS-DOS and OS/2.

Operating System Concepts 11.6 Silberschatz and Galvin1999


Indexed Allocation

• Brings all pointers together into the index block.


• Logical view.

index table

Operating System Concepts 11.7 Silberschatz and Galvin1999


Example of Indexed Allocation

Operating System Concepts 11.8 Silberschatz and Galvin1999


Indexed Allocation (Cont.)

• Need index table


• Random access
• Dynamic access without external fragmentation, but
have overhead of index block.
• Mapping from logical to physical in a file of
maximum size of 256K words and block size of 512
words. We need only 1 block for index table.

Q
LA/512
R
– Q = displacement into index table
– R = displacement into block

Operating System Concepts 11.9 Silberschatz and Galvin1999


Indexed Allocation – Mapping
(Cont.)

• Mapping from logical to physical in a file of


unbounded length (block size of 512 words).
• Linked scheme – Link blocks of index table (no limit
on size).
Q1
LA / (512 x 511)
R1
– Q1 = block of index table
– R1 is used as follows:
Q2
R1 / 512
R2

– Q2 = displacement into block of index table


– R2 displacement into block of file:

Operating System Concepts 11.10 Silberschatz and Galvin1999


Indexed Allocation – Mapping
(Cont.)

• Two-level index (maximum file size is 512 3)


Q1
LA / (512 x 512)
R1

– Q1 = displacement into outer-index


– R1 is used as follows:
Q2
R1 / 512
R2

– Q2 = displacement into block of index table


– R2 displacement into block of file:

Operating System Concepts 11.11 Silberschatz and Galvin1999


Indexed Allocation – Mapping
(Cont.)

outer-index

index table file

Operating System Concepts 11.12 Silberschatz and Galvin1999


Combined Scheme: UNIX (4K bytes per
block)

Operating System Concepts 11.13 Silberschatz and Galvin1999


Free-Space Management

• Bit vector (n blocks)


0 1 2 n-1
…

0  block[i] free
bit[i] =

1  block[i] occupied

• Block number calculation


(number of bits per word) *
(number of 0-value words) +
offset of first 1 bit

Operating System Concepts 11.14 Silberschatz and Galvin1999


Free-Space Management (Cont.)

• Bit map requires extra space. Example:


block size = 212 bytes
disk size = 230 bytes (1 gigabyte)
n = 230/212 = 218 bits (or 32K bytes)
• Easy to get contiguous files
• Linked list (free list)
– Cannot get contiguous space easily
– No waste of space
• Grouping
• Counting

Operating System Concepts 11.15 Silberschatz and Galvin1999


Free-Space Management (Cont.)

• Need to protect:
– Pointer to free list
– Bit map
 Must be kept on disk
 Copy in memory and disk may differ.
 Cannot allow for block[i] to have a situation
where bit[i] = 1 in memory and bit[i] = 0 on
disk.
– Solution:
 Set bit[i] = 1 in disk.
 Allocate block[i]
 Set bit[i] = 1 in memory

Operating System Concepts 11.16 Silberschatz and Galvin1999


Directory Implementation

• Linear list of file names with pointer to the data


blocks.
– simple to program
– time-consuming to execute
• Hash Table – linear list with hash data structure.
– decreases directory search time
– collisions – situations where two file names
hash to the same location
– fixed size

Operating System Concepts 11.17 Silberschatz and Galvin1999


Efficiency and Performance

• Efficiency dependent on:


– disk allocation and directory algorithms
– types of data kept in file’s directory entry
• Performance
– disk cache – separate section of main memory
for frequently sued blocks
– free-behind and read-ahead – techniques to
optimize sequential access
– improve PC performance by dedicating section
of memroy as virtual disk, or RAM disk.

Operating System Concepts 11.18 Silberschatz and Galvin1999


Various Disk-Caching Locations

Operating System Concepts 11.19 Silberschatz and Galvin1999


Recovery

• Consistency checker – compares data in directory


structure with data blocks on disk, and tries to fix
inconsistencies.
• Use system programs to back up data from disk to
another storage device (floppy disk, magnetic tape).
• Recover lost file or disk by restoring data from
backup.

Operating System Concepts 11.20 Silberschatz and Galvin1999

You might also like