File SyStemS

File systems are crucial for managing how data is stored,

organized, and accessed on storage devices. They serve as
the interface between the operating system and the data
stored on disks or other storage media. Understanding file
systems is essential for both efficient data management
and optimal system performance. This comprehensive
overview will cover file support, access methods, and
allocation methods, including contiguous, linked, and
indexed allocation.
1. File Support
File support refers to the features and functionalities
provided by a file system to manage files. It encompasses
various aspects, including file creation, deletion,
organization, and access control.
Key Components of File Support
• File Structure: Files can be structured in different ways,
including text files, binary files, and special files (like
device files). The file system manages these structures
and ensures appropriate handling.
• File Metadata: Each file is associated with metadata,
which includes information such as file name, type, size,
creation date, modification date, and access
permissions. This metadata is crucial for managing file
attributes and security.
• File Directories: File systems organize files into
directories or folders. This hierarchical structure helps
users easily navigate and manage files.
• Access Control: File systems implement mechanisms to
control access to files. Permissions can be set for users
or groups to read, write, or execute files, enhancing
security.
• File Naming Conventions: File systems often have
specific rules for naming files, including character
restrictions and maximum lengths. These conventions
can vary between operating systems.
2. Access Methods
Access methods define how data is read from or written to a
file. The choice of access method can significantly impact
the performance and usability of a file system. The primary
access methods include:
a) Sequential Access
In sequential access, data is read or written in a linear
fashion. This means that the system processes data in the
order it is stored.

• Advantages:
o Simple implementation. o Efficient for processing
large volumes of data, such as in batch processing.
• Disadvantages:
o Inefficient for accessing specific records since the
system must read through the data sequentially.
b) Direct Access
Direct access (also known as random access) allows data to
be read or written at any location within the file. This
method enables quick retrieval of data without needing to
process preceding records.

• Advantages:
o Faster access to specific data since the system
can jump directly to the required location. o
Suitable for applications that require frequent
access to various records.
• Disadvantages:
o More complex to implement than sequential
access. o Requires additional overhead for
managing pointers or indices.
c) Indexed Access
Indexed access combines aspects of both sequential and
direct access. In this method, an index structure is created
that maintains pointers to the actual data records, enabling
quick lookups.

• Advantages:
o Provides fast access to data while maintaining
the organization of records. o Facilitates efficient
searching and retrieval of specific records.
• Disadvantages:
o Requires additional storage for the index. o
Overhead in maintaining the index structure,
especially during updates.
3. Allocation Methods
Allocation methods determine how files are stored on disk.
The choice of allocation method can influence system
performance, storage efficiency, and file access times. The
main allocation methods are:

a) Contiguous Allocation
In contiguous allocation, files are stored in a single,
continuous block of disk space. The file occupies
consecutive disk blocks, which can enhance access speed.
 • Advantages:
o Simple to implement, as the file’s location is easily
determined (starting block and length). o Fast access
times due to minimal seeking; the read/write head
moves a short distance.
• Disadvantages:
o External fragmentation can occur, leading to
wasted space as files are created and deleted. o
Difficult to allocate space for large files if sufficient
contiguous blocks are not available.

b) Linked Allocation
Linked allocation addresses some limitations of contiguous
allocation by linking file blocks using pointers. Each block
contains a pointer to the next block in the file, forming a
linked list.
• Advantages:
o Eliminates external fragmentation, as blocks can
be scattered across the disk. o Flexible space
allocation; files can grow easily without needing
contiguous space.
 • Disadvantages:
o Access times can be slower due to the need to
follow pointers to read a file, resulting in increased
seek time. o Requires additional space for storing
pointers within each block.

c) Indexed Allocation
Indexed allocation involves creating an index block for each
file, which contains pointers to the actual data blocks. This
method combines features of both contiguous and linked
allocation.
• Advantages:
o Allows for direct access to any block,
improving read times compared to linked
allocation. o Reduces fragmentation since data
blocks can be scattered across the disk.
• Disadvantages:
o Requires extra storage for the index blocks. o
Complexity in managing the index structure,
particularly for large files that require multiple
index blocks.
Comparison of Allocation Methods

Allocation Advantages Disadvantages

Method

Contiguous Fast access, simple External

management fragmentation,
inflexible

Linked Flexible, eliminates Slower access times

fragmentation

Indexed Direct access, reduces Extra storage for index

fragmentation

Directory SyStemS anD

DeaDlock management

In the study of operating systems, directory systems and

deadlock management are essential topics that influence how
files are organized and how resources are allocated. This unit
delves into directory structures, file protection mechanisms, and
the intricacies of deadlock, including its characterization,
prevention, avoidance, and recovery strategies.
1. Directory Systems
A directory system is crucial for organizing files within a file
system. It provides a hierarchical structure that allows users to
manage and navigate their files efficiently. The design of the
directory system can significantly impact usability and
performance.
1.1 Single Level Directory
In a single level directory system, all files are stored in a single
directory. This structure is straightforward and easy to
implement, but it has several limitations:

• Simplicity: It's simple to navigate and understand.

• Scalability Issues: As the number of files increases, it
becomes challenging to manage them. Users may have
difficulty locating specific files due to a lack of organization.
 • Naming Conflicts: Since all files reside in the same
directory, file names must be unique, leading to potential
conflicts.
1.2 Tree Structured Directory
The tree structured directory organizes files in a hierarchical
tree-like structure. This model enhances file organization and
navigation:
• Hierarchical Organization: Directories can contain

subdirectories, allowing for a nested structure. This makes

it easier for users to categorize and locate files.
• Path Navigation: Users can traverse the directory using

paths that reflect the hierarchical structure (e.g.,

root/subdirectory/file).
• Reduced Naming Conflicts: Subdirectories allow for the

same file names to exist in different directories, reducing

conflicts.
1.3 Acyclic Graph Directory
An acyclic graph directory allows for more flexibility in file
management by permitting shared subdirectories:
• Shared Structures: Files and directories can be linked,

allowing multiple paths to the same file. This feature is

useful for collaborative environments where files need to
be accessed from different locations.
• Simplified Management: Users can navigate through

various paths to reach the same file, making it easier to

manage related documents.
1.4 General Graph Directory
The general graph directory allows cycles and more complex
relationships between directories and files:
• Complex Relationships: Files can point to multiple

directories, leading to intricate navigational structures.

• Increased Flexibility: While this structure allows for

maximum flexibility, it complicates file management and

increases the risk of navigation issues, such as infinite
loops.
1.5 File Protection
File protection is essential to maintain the integrity and security
of data within a file system. Various methods are employed to
safeguard files:

• Access Control Lists (ACLs): ACLs specify permissions for

users and groups, determining who can read, write, or
execute files. This method allows for fine-grained control
over file access.
 • File Permissions: Operating systems use permission
settings (read, write, execute) to restrict access based on
user roles. This is typically categorized into owner, group,
and others.
• Encryption: Encrypting files protects sensitive information

from unauthorized access. Only users with the appropriate

decryption keys can access the content.
2. Deadlock
Deadlock occurs in computing when two or more processes are
unable to proceed because each is waiting for the other to
release resources. This situation can lead to significant
inefficiencies within a system, necessitating effective
management strategies.

2.1 Deadlock Characterization

Deadlock can be characterized by four necessary conditions,
often referred to as the Coffman conditions:
 1. Mutual Exclusion: Resources cannot be shared; at least
one resource must be held in a non-shareable mode.
2. Hold and Wait: A process holding at least one resource is
waiting to acquire additional resources held by other
processes.
3. No Pre-emption: Resources cannot be forcibly taken from a
process; they must be voluntarily released.
4. Circular Wait: A set of processes exists, each waiting for a
resource held by the next process in the cycle, creating a
loop.
2.2 Deadlock Prevention
Deadlock prevention strategies aim to ensure that at least one
of the Coffman conditions is violated:
 • Eliminating Mutual Exclusion: Making resources sharable
when feasible.
• Avoiding Hold and Wait: Requiring processes to request all

necessary resources upfront, preventing them from holding

resources while waiting for others.
• Allowing Pre-emption: Enabling the system to forcibly take

resources from processes when necessary.

• Preventing Circular Wait: Implementing a strict ordering

for resource allocation to avoid circular dependencies.

2.3 Deadlock Avoidance
Deadlock avoidance techniques dynamically assess resource
allocation to prevent deadlock. One of the most notable
methods is the Banker's Algorithm:
• Banker’s Algorithm: This algorithm evaluates the current

state of resource allocation and determines whether a

request will lead the system into a safe or unsafe state. A
safe state allows all processes to complete without
deadlock.
2.4 Deadlock Recovery
If deadlock occurs, recovery strategies must be employed to
resolve the situation:
• Process Termination: Killing one or more processes
involved in the deadlock can free up resources. This can be
done by terminating all deadlocked processes or selectively
terminating them based on priority.
• Resource Pre-emption: Forcibly taking resources from one
or more processes involved in the deadlock. This requires
careful management to ensure the pre-empted processes
can be restarted safely.
• Wait-Die and Wound-Wait Schemes: These strategies
manage the priorities of processes in deadlock situations.
In the wait-die scheme, older processes may wait for
 younger ones, while younger processes may be pre-
empted by older ones.
Visual Aids
1. Directory System Diagram: A graphical representation of
different directory structures, including single level, tree
structured, acyclic graph, and general graph.
2. Deadlock Condition Flowchart: A diagram illustrating the
Coffman conditions and their relationships in characterizing
deadlock.
3. Deadlock Prevention Strategies Table: A comparison of
various deadlock prevention methods and their
effectiveness.
4. Banker’s Algorithm Illustration: A step-by-step depiction of
how the Banker’s Algorithm assesses resource requests.
5. Deadlock Recovery Methods Chart: A summary of
strategies used to recover from deadlock situations,
detailing process termination and resource preemption.