Operating System-4 "File Management" by Adi.pdf

Introduction
to
Operating Systems - 4
PROF. DR. K. ADISESHA
File management

File management File Concepts
Access methods
Allocation methods
Disk Management
Scheduling methods
2
File management

Introduction
Prof. Dr. K. Adisesha
3
Introduction to File:
A file is a named collection of related information that is recorded on secondary
storage such as magnetic disks, magnetic tapes and optical disks.
➢ File is a collection of logically related entities
❖ A file has a certain defined structure according to its type.
❖ A text file is a sequence of characters organized into lines.
❖ A source file is a sequence of procedures and functions.
❖ An object file is a sequence of bytes organized into blocks that are understandable
by the machine.
➢ When operating system defines different file structures, it also contains the code to
support these file structure. Unix, MS-DOS support minimum number of file structure

Introduction
4
File Type:
File type refers to the ability of the operating system to distinguish different types of file
such as text files source files and binary files etc.
➢ Operating system like MS-DOS and UNIX have the following types of files.
➢ Ordinary files
❖ These are the files that contain user information.
❖ These may have text, databases or executable program.
➢ Directory files
❖ These files contain list of file names and other information related to these files.
➢ Special files
❖ These files are also known as device files.
❖ These files represent physical device like disks, terminals, printers, networks, tape drive etc.

Introduction
5
File Attributes:
file is a collection of logically related entities.
➢ Name – only information kept in human-readable form
➢ Identifier – unique tag (number) identifies file within file system
➢ Type – needed for systems that support different types
➢ Location – pointer to file location on device
➢ Size – current file size
➢ Protection – controls who can do reading, writing, executing
➢ Time, date, and user identification – data for protection, security, and usage
monitoring Information about files are kept in the directory structure, which is
maintained on the disk.

File Operation
6
Operation on a File:
The file contains information about the files name, including attributes, location and
ownership.
➢ Operation performed on file are.
❖ Create a file
❖ Delete a file
❖ Open a file
❖ Close a file
❖ Write – at write pointer location
❖ Read – at read pointer location
❖ Reposition within file - seek
❖ Truncate the file system

File Access Methods
7
File Structure:
There are several types of files structures depending on its size and allocation.
➢ None - sequence of words, bytes
➢ Simple record structure
❖ Lines
❖ Fixed length
❖ Variable length
➢ Complex Structures
❖ Formatted document
❖ Relocatable load file

File Access Methods
8
File Access Mechanisms:
There are several ways to access files.
➢ Operating system like MS-DOS and UNIX have the following types of files.
❖ Sequential access
❖ Direct/Random access
❖ Indexed sequential access.

File Access Methods
9
Sequential access:
A sequential access is that in which the data in the file are accessed in a sequential
order in which there are stored.
➢ A sequential access is that in which the records are accessed in some sequence, i.e., the
information in the file is processed in order, one record after the other.
➢ This access method is the most primitive one.
➢ Example: Compilers usually access files in this fashion.

File Access Methods
10
Direct/Random access:
Direct access is that in which the data in the file are accessed in a Random order in
which there are stored.
➢ Random access file organization provides, accessing the records directly.
➢ Each record has its own address on the file with by the help of which it can be directly
accessed for reading or writing.
➢ The records need not be in any sequence within the file and they need not be in
adjacent locations on the storage medium.

File Access Methods
11
Indexed sequential access:
Indexed sequential access is that in which the data in the file are accessed using
pointers to search sequentially in which there are stored.
➢ This mechanism is built up on base of sequential access.
➢ An index is created for each file which contains pointers to various blocks.
➢ Index is searched sequentially and its pointer is used to access the file directly.

File Allocation
12
File Space Allocation:
Directories need to be fast to search, insert, and delete, with a minimum of wasted disk
space.
➢ Files are allocated disk spaces by operating system..
❖ Contiguous Allocation
❖ Linked Allocation
❖ Indexed Allocation

File Allocation
13
Contiguous Allocation:
In Contiguous file allocation, files are allocated disk spaces by operating system:
➢ Each file occupies a contiguous address space on disk.
➢ Assigned disk address is in linear order.
➢ Easy to implement.
➢ External fragmentation is a major issue with
this type of allocation technique

File Allocation
14
Linked Allocation:
In Linked file allocation, files are allocated disk spaces by operating system:
➢ Each file carries a list of links to disk blocks.
➢ Directory contains link / pointer to first block of a file.
➢ No external fragmentation
➢ Effectively used in sequential access file.
➢ Inefficient in case of direct access file.

File Allocation
15
Indexed Allocation:
In Indexed file allocation, files are allocated disk spaces by operating system:
➢ Provides solutions to problems of contiguous and linked allocation.
➢ A index block is created having all pointers to files.
➢ Each file has its own index block which stores the addresses
of disk space occupied by the file.
➢ Directory contains the addresses of index blocks of files.

Space Management
16
Free-Space Management:
Important aspect of disk management is keeping track of and allocating free space:
➢ The optimal allocation method is different for sequential access files than for random
access files, and is also different for small files than for large files.
➢ Various methods for keeping track of and allocating free space are:
❖ Bit Vector
❖ Linked List
❖ Grouping
❖ Counting
❖ Space Maps
Assume the following are free. Rest are allocated:

Space Management
17
Bit Vector:
➢ One simple approach is to use a bit vector, in which each bit represents a disk block,
set to 1 if free or 0 if allocated.
➢ Fast algorithms exist for quickly finding contiguous blocks of a given size
➢ The down side is that a 40GB disk requires over 5MB just to store the bitmap. ( For
➢ example. )
0- if disk block is allocated
1- if disk block is free
0 0 0 1 0 1 1 0 ----- 1

Space Management
18
Linked List:
➢ A linked list can also be used to keep track of all free blocks.
➢ Traversing the list and/or finding a contiguous block of a given size are
tracked by the system just by adding and removing single blocks from
the beginning of the list.
➢ The FAT table keeps track of the free list as just one more linked list on
the table

Space Management
19
Grouping:
➢ A variation on linked list free lists is to use links of blocks of indices of free blocks.
➢ If a block holds up to N addresses, then the first block in the linked-list contains up to N-1
addresses of free blocks and a pointer to the next block of free addresses.
Counting:
➢ When there are multiple contiguous blocks of free space then the system can keep track of the
starting address of the group and the number of contiguous free blocks.
➢ As long as the average length of a contiguous group of free blocks is greater than two this offers a
savings in space needed for the free list.

File Directories
20
File Directories:
Collection of files is a file directory. The directory contains information about the files,
including attributes, location and ownership.
➢ Advantages of maintaining directories are:
❖ Efficiency: A file can be located more quickly.
❖ Naming: It becomes convenient for users as two users can have same name for
different files or may have different name for same file.
❖ Grouping: Logical grouping of files can be done by properties e.g. all java
programs, all games etc.

File Directories
21
File Directories:
➢ file is a collection of logically related entities.
❖ Name
❖ Type
❖ Address
❖ Current length
❖ Maximum length
❖ Date last accessed
❖ Date last updated
❖ Owner id
❖ Protection information

File Directories
22
File Directories Types:
➢ Various types of directories are:
❖ Single-level Directory.
❖ Two-level Directory.
❖ Tree-structured Directory.
❖ Graph Directory.

File Directories
23
Single-level Directory:
In this a single directory is maintained for all the users.
➢ Naming problem: Users cannot have same name for two files.
➢ Grouping problem: Users cannot group files according to their need:

File Directories
24
Two-level Directory:
In this separate directories for each user is maintained.
➢ Path name: Due to two levels there is a path name for every file to locate that file.
➢ Now, we can have same file name for different user.
➢ Searching is efficient in this method.
➢ No grouping capability

File Directories
25
Tree-structured Directory:
Directory is maintained in the form of a tree.
➢ Searching is efficient and also there is grouping capability. We have absolute or
relative path name for a file.

File Directories
26
Graph Directory:
Directory is maintained in the form of a graph.
➢ Searching is efficient and also there is grouping capability.
➢ Allow only links to file not subdirectories
➢ Every time a new link is added use a cycle detection algorithm to determine whether it
is OK
➢ Garbage collection

File Sharing
27
File Sharing:
Specify how multiple users are to access a shared file simultaneously.
➢ Sharing of files on multi-user systems is desirable
➢ Sharing may be done through a protection scheme
➢ On distributed systems, files may be shared across a network
➢ Network File System (NFS) is a common distributed file-sharing method
➢ If multi-user system
❖ User IDs identify users, allowing permissions and protections to be per-user
Group IDs allow users to be in groups, permitting group access rights
❖ Owner of a file / directory
❖ Group of a file / directory

File Sharing
28
File Sharing – Remote File Systems:
Specify how multiple users on networking to allow file system access between systems..
➢ Manually via programs like FTP automatically, seamlessly using distributed file
systems
➢ Semi automatically via the world wide web
➢ Client-server model allows clients to mount remote file systems from servers
➢ Server can serve multiple clients
➢ Client and user-on-client identification is insecure or complicated
➢ Standard operating system file calls are translated into remote calls
➢ Distributed Information Systems such as LDAP, DNS, NIS, Active Directory
implement unified access to information needed for remote computing

File Protection
29
File Protection:
Specify how file owner/creator should be able to specify control the usage of files by
other users such as what can be done and by whom.
➢ Mode of access: read, write, execute
➢ Three classes of users on Unix / Linux

Storage management
30
Storage management:
Storage management deals with the storage procedures in the computer system using
an operating system.
➢ Disks are the mainly used mass storage devices. They provide the bulk of secondary
storage in operating systems today
➢ Various mass devices are:
❖ Magnetic Tapes
❖ Magnetic Disks
❖ Optical Disks
❖ Solid-State Disks

Storage management
31
Magnetic Tapes:
Magnetic tapes were once used for common secondary storage before the days of hard
disk drives, but today are used primarily for backups.
➢ Accessing a particular spot on a magnetic tape can be slow, but once reading or writing
commences, access speeds are comparable to disk drives.
➢ Capacities of tape drives can range from 20 to 200 GB, and compression can double
that capacity.

Storage management
32
Magnetic Disks:
One or more platters in the form of disks covered with magnetic media. Hard disk
platters are made of rigid metal, while "floppy" disks are made of more flexible plastic.
➢ Floppy disks and Hard drives are normally removable mass devices.
➢ Traditional magnetic disks have the following basic structure:
❖ Each platter has two working surfaces.
❖ Each working surface is divided into a number of concentric rings called tracks.
❖ Each track is further divided into sectors, traditionally containing 512 bytes of data
each.
❖ The data on a hard drive is read by read-write heads.
❖ The storage capacity of a traditional disk drive is equal to the number of heads.

Storage management
33
Magnetic Disks:
Traditional magnetic disks have the following basic structure.
➢ In operation the disk rotates at high speed, such as 7200 rpm ( 120 revolutions per
second. ).
❖ The seek time or random access time is the time required to
move the heads from one cylinder to another.
❖ The rotational latency is the amount of time required for the
desired sector to rotate around and come under the read-
write head.
❖ The transfer rate, which is the time required to move the
data electronically from the disk to the computer.

Storage management
34
Solid-State Disks (SSD):
SSDs use memory technology as a small fast hard disk. Specific implementations may
use either flash memory or DRAM chips protected by a battery to sustain the
information through power cycles.
➢ Because SSDs have no moving parts they are much faster than traditional hard drives,
and certain problems such as the scheduling of disk accesses simply do not apply.
➢ SSDs are especially useful as a high-speed cache of hard-disk information that must be
accessed quickly.
➢ They are more expensive than hard drives, generally not as large, and may have shorter
life spans.
➢ SSDs are also used in laptops to make them smaller, faster, and lighter.

Disk Scheduling
35
Disk Scheduling:
The operating system is responsible for using hardware efficiently - for the disk drives,
this means having a fast access time and disk bandwidth.
➢ Various Disk-Scheduling Algorithm are:
❖ FCFS Scheduling
❖ SSTF Scheduling
❖ SCAN Scheduling
❖ C-SCAN Scheduling
❖ LOOK Scheduling

Disk Scheduling
36
FCFS Scheduling:
First-Come First-Serve is simple and intrinsically fair, but not very efficient..

Disk Scheduling
37
SSTF Scheduling:
Shortest Seek Time First scheduling is more efficient, but may lead to starvation if a
constant stream of requests arrives for the same general area of the disk.

Disk Scheduling
38
SCAN Scheduling:
SCAN algorithm Sometimes called the elevator algorithm moves back and forth from
one end of the disk to the other, similarly to an elevator processing requests in a tall
building.

Disk Scheduling
39
C-SCAN Scheduling:
The Circular-SCAN algorithm improves upon SCAN by treating all requests in a
circular queue fashion .
➢ Once the head reaches the end of the disk, it returns to the other end without
processing any requests, and then starts again from the beginning of the disk.

Disk Scheduling
40
LOOK Scheduling:
LOOK scheduling improves upon SCAN by looking ahead at the queue of pending
requests, and not moving the heads any farther towards the end of the disk than is
necessary.

Discussion
41
Queries ?
Prof. K. Adisesha
9449081542

Operating System-4 "File Management" by Adi.pdf

More Related Content

What's hot (20)

Similar to Operating System-4 "File Management" by Adi.pdf (20)

More from Prof. Dr. K. Adisesha (20)

Recently uploaded (20)

Operating System-4 "File Management" by Adi.pdf