Lecture Overview

• File systems
– User concepts
• File
• Directory
– Structure
• Protection
– File system structure
– Implementing files
– Implementing directories

Operating Systems - June 14, 2001

File Systems
• File systems are very important
– They provide online storage and access to both programs and data
– For users, the file system is one of the most visible aspects of the
operating system
• There are three essential requirements for a file
system
– It must be possible to store large amounts of information
– Information must survive the termination of the process using it
– Multiple processes must be able to access the information
concurrently
• First we examine the concepts of the user’s view of
a file system

1
File Concept
• Contiguous logical address space
• Types
– Data (e.g., numeric, character, binary)
– Program
• Structure
– None - sequence of words, bytes
– Simple record structure
• Lines, fixed length, variable length
– Complex Structures
• Formatted document
• Relocatable load file

File Concept
• File attributes
– Name – only information kept in human-readable form
– 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

2
File Concept
• File operations
– create
– write
– read
– reposition - move current read/write position within file
– delete
– truncate
– open(Fi) – search the directory structure on disk for entry Fi,
and move the content of entry to memory
– close (Fi) – move the content of entry Fi in memory to
directory structure on disk

Directory Concept
• A list of files and metadata about files
– Directories special files that are stored on the disk also

Directory

Files
F1 F2 F4
F3
Fn

3
Directory Concept
• Directory operations
– Search for a file
– Create a file
– Delete a file
– List a directory
– Rename a file
– Traverse the file system

• Directories are used to provide logical organization

Directory Concept
• Logical directory organization
– Single-level directory

• Naming problems
• Grouping problems

4
Directory Concept
• Logical directory organization
– Two-level directory (a directory for each user)

• Introduces path name

Directory Concept
• Logical directory organization
– Tree-structured directory

5
Directory Concept
• Logical directory organization
– Acyclic-graph directory (File and directory sharing)

Directory Concept
• Logical directory organization
– Acyclic-graph directory (File and directory sharing)
• Use linking
– Hard links - update reference count in directory data
– Soft links (symbolic links) -
• Two different names for same file (aliasing)
• Can create dangling pointers

6
File System Protection
• File owner/creator should be able to control
– What can be done
– By whom
• Types of access
– Read
– Write
– Execute
– Append
– Delete
– List

File System Protection

7
File System Structure
• Now that we have seen how the file system looks to
the user, how is this logical view mapped to the
physical storage device?
• General disk organization
– Most disks are divided into partitions
• One partition is marked as “active”
– Sector zero of the disk is called the master boot record (MBR)
which is used to boot the computer
• The end of the MBR contains the partition table
• When booting the BIOS reads and executes the MBR
– The MBR program locates the active partition and reads its first
block, called the boot block, and executes it (this program loads the
operating system)

Implementing Files
• 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

8
Implementing Files
• Linked allocation
– Each file is a linked list of disk blocks: blocks may be
scattered anywhere on the disk

Implementing Files
• Linked allocation
– Simple – need only starting address
– Free-space management system – no waste of space
– No random access
– Mapping
– File-allocation table (FAT)
• Variation of linked allocation
• Links are kept in a table at beginning of partition
• Disk-space allocation used by MS-DOS and OS/2

9
Implementing Files
• Indexed allocation
– Bring all pointers together into the index node (i-node)

Implementing Files
• Free space management
– Maintain a free space list
– Approaches
• Bit vectors - bit flag for each block
• Linked list - a list of free blocks
• Grouped linked list - a list of groups of contiguous free blocks
of the same size
• Counting - a list of groups of contiguous free blocks where the
size varies according to usage

10
Implementing Directories
• 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

11