Chapter 10.

A:
File-System Interface

Operating System Concepts Silberschatz, Galvin and Gagne ©2018

 Chapter 10.A: Outline

 File Concept

 Access Methods

 Disk and Directory Structure

 File-System Mounting

 File Sharing

 Protection

Operating System Concepts 2 Silberschatz, Galvin and Gagne ©2018

 Objectives

 To explain the function of file systems

 To describe the interfaces to file systems

 To discuss file-system design tradeoffs, including access methods,

file sharing, file locking, and directory structures

 To explore file-system protection

Operating System Concepts 3 Silberschatz, Galvin and Gagne ©2018

 File Concept

 Contiguous logical address space

 Types:
 Data
4 complex
4 numeric
4 character
4 binary
 Program
 Contents defined by file’s creator
 Many types
4 Text file
4 Source file
4 Executable file

Operating System Concepts 4 Silberschatz, Galvin and Gagne ©2018

 File Attributes

 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
 Many variations, including extended file attributes such as file
checksum

Operating System Concepts 5 Silberschatz, Galvin and Gagne ©2018

 A window of file info on Mac OS X

Operating System Concepts 6 Silberschatz, Galvin and Gagne ©2018

 File Operations

 File is an abstract data type

 Create

 Write – at write pointer location

 Read – at read pointer location

 Reposition within file (or seek)

 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

Operating System Concepts 7 Silberschatz, Galvin and Gagne ©2018

 Open Files

 Several pieces of data are needed to manage open files:

 Open-file table: tracks open files

 File pointer: pointer to last read/write location, per process that has the
file open

 File-open count: counter of number of times a file is open – to allow

removal of data from open-file table when last processes closes it

 Disk location of the file: cache of data access information

 Access rights: per-process access mode information

Operating System Concepts 8 Silberschatz, Galvin and Gagne ©2018

 Open File Locking

 Provided by some operating systems and file systems

 Similar to reader-writer locks

 Shared lock similar to reader lock – several processes can acquire

concurrently

 Exclusive lock similar to writer lock

 Mediates access to a file

 Mandatory or advisory:

 Mandatory – access is denied depending on locks held and requested

 Advisory – processes can find status of locks and decide what to do

Operating System Concepts 9 Silberschatz, Galvin and Gagne ©2018

 File Locking Example – Java API

import [Link].*;
import [Link].*;
public class LockingExample {
public static final boolean EXCLUSIVE = false;
public static final boolean SHARED = true;
public static void main(String arsg[]) throws IOException {
FileLock sharedLock = null;
FileLock exclusiveLock = null;
try {
RandomAccessFile raf = new RandomAccessFile("[Link]",
"rw");
// get the channel for the file
FileChannel ch = [Link]();
// this locks the first half of the file - exclusive
exclusiveLock = [Link](0, [Link]()/2, EXCLUSIVE);
/** Now modify the data . . . */
// release the lock
[Link]();

Operating System Concepts 10 Silberschatz, Galvin and Gagne ©2018

 File Locking Example – Java API (Cont.)

// this locks the second half of the file - shared

sharedLock = [Link]([Link]()/2+1,
[Link](), SHARED);
/** Now read the data . . . */
// release the lock
[Link]();
} catch ([Link] ioe) {
[Link](ioe);
}finally {
if (exclusiveLock != null)
[Link]();
if (sharedLock != null)
[Link]();
}
}
}

Operating System Concepts 11 Silberschatz, Galvin and Gagne ©2018

 File Types – Name, Extension

Operating System Concepts 12 Silberschatz, Galvin and Gagne ©2018

 File Structure

 None - sequence of words or bytes

 Simple record structures
 Lines
 Fixed length
 Variable length
 Complex structures
 Formatted document
 Relocatable load file (i.e., executable file)
 Can simulate last two with first method by inserting appropriate
control characters
 Who decides:
 Operating system
 Program

Operating System Concepts 13 Silberschatz, Galvin and Gagne ©2018

 Sequential-Access File

Operating System Concepts 14 Silberschatz, Galvin and Gagne ©2018

 Access Methods

 Sequential Access  Direct Access – file is fixed-

read next length logical records
write next read n
reset write n
no read after last write position to n
(rewrite) read next
write next
rewrite n

n = relative block number

 Relative block numbers allow
OS to decide where file should
be placed
 See allocation problem in Chapter
12

Operating System Concepts 15 Silberschatz, Galvin and Gagne ©2018

 Simulation of Sequential-Access on Direct-
Access File

Operating System Concepts 16 Silberschatz, Galvin and Gagne ©2018

 Other Access Methods

 Can be built on top of base methods

 General involve creation of an index for the file

 Keep index in memory for fast determination of location of data to be

operated on (consider UPC code plus record of data about that item)

 If too large, index (in memory) of the index (on disk)

 E.g., IBM Indexed Sequential-Access Method (ISAM)

 Small master index, points to disk blocks of secondary index

 File kept sorted on a defined key

 All done by the OS

 VMS operating system provides index and relative files as another

example (see next slide)

Operating System Concepts 17 Silberschatz, Galvin and Gagne ©2018

 Example of Index and Relative Files

Operating System Concepts 18 Silberschatz, Galvin and Gagne ©2018

 Directory Structure

 A collection of nodes containing information about all files

Directory

Files
F1 F2 F4
F3
Fn

Both the directory structure and the files reside on disk

Operating System Concepts 19 Silberschatz, Galvin and Gagne ©2018

 Disk Structure

 Disk can be subdivided into partitions

 Disks or partitions can be RAID protected against failure

 Disk or partition can be used raw – without a file system, or formatted

with a file system

 Partitions also known as minidisks, slices

 Entity containing file system known as a volume

 Each volume containing file system also tracks that file system’s info in
device directory or volume table of contents

 As well as general-purpose file systems there are many special-

purpose file systems, frequently all within the same operating system
or computer

Operating System Concepts 20 Silberschatz, Galvin and Gagne ©2018

 A Typical File-System Organization

Operating System Concepts 21 Silberschatz, Galvin and Gagne ©2018

 Types of File Systems

 We mostly talk of general-purpose file systems

 But systems frequently have many file systems, some general- and
some special- purpose

 E.g., Solaris has

 tmpfs – memory-based volatile FS for fast, temporary I/O

 objfs – interface into kernel memory to get kernel symbols for debugging

 ctfs – contract file system for managing daemons

 lofs – loopback file system allows one FS to be accessed in place of

another

 procfs – kernel interface to process structures

 ufs, zfs – general purpose file systems

Operating System Concepts 22 Silberschatz, Galvin and Gagne ©2018

 Operations Performed on Directory

 Search for a file

 Create a file

 Delete a file

 List a directory

 Rename a file

 Traverse the file system

Operating System Concepts 23 Silberschatz, Galvin and Gagne ©2018

 Directory Organization

 The directory is organized logically to obtain

 Efficiency – locating a file quickly

 Naming – convenient to users

4 Two users can have same name for different files

4 The same file can have several different names

 Grouping – logical grouping of files by properties, (e.g., all Java

programs, all games, …)

Operating System Concepts 24 Silberschatz, Galvin and Gagne ©2018

 Single-Level Directory

 A single directory for all users

 Naming problem

 Grouping problem

Operating System Concepts 25 Silberschatz, Galvin and Gagne ©2018

 Two-Level Directory

 Separate directory for each user

 Master file directory (MFD)
 User file directory (UFD)

 Path name
 Can have the same file name for different user
 Efficient searching
 No grouping capability

Operating System Concepts 26 Silberschatz, Galvin and Gagne ©2018

 Tree-Structured Directories

Operating System Concepts 27 Silberschatz, Galvin and Gagne ©2018

 Tree-Structured Directories (Cont.)

 Efficient searching

 Grouping Capability

 Current directory (or working directory)

 E.g., For Linux OS,

cd /spell/mail/prog

type list

Operating System Concepts 28 Silberschatz, Galvin and Gagne ©2018

 Tree-Structured Directories (Cont.)

 Using absolute or relative path name

 Creating a new file is done in current directory

 Delete a file

rm <file-name>

 Creating a new subdirectory is done in current directory

mkdir <dir-name>

 Example: if in current directory /mail

mkdir count

Operating System Concepts 29 Silberschatz, Galvin and Gagne ©2018

 Acyclic-Graph Directories

 Have shared subdirectories

and files
 Two different names (aliasing)

4 If dict deletes list Þ dangling

pointer.

 Solutions:
4 Backpointers, so we can delete
all pointers
Variable size records a
problem

– Backpointers using a daisy

chain organization

4 Entry-hold-count solution

Operating System Concepts 30 Silberschatz, Galvin and Gagne ©2018

 Acyclic-Graph Directories (Cont.)

 New directory entry type

 Link – another name (pointer) to an existing file

 Resolve the link – follow pointer to locate the file

Operating System Concepts 31 Silberschatz, Galvin and Gagne ©2018

 General Graph Directory

Operating System Concepts 32 Silberschatz, Galvin and Gagne ©2018

 General Graph Directory (Cont.)

 How do we guarantee no cycles?

 Allow only links to file not subdirectories

 Garbage collection

 Every time a new link is added use a cycle detection algorithm to

determine whether it is OK

Operating System Concepts 33 Silberschatz, Galvin and Gagne ©2018

 File System Mounting

 A file system must be mounted before it can be accessed

 A unmounted file system (i.e., Fig. (b)) is mounted at a mount point

users

bill fred sue jane

help doc
prog

(a) (b)

Operating System Concepts 34 Silberschatz, Galvin and Gagne ©2018

 Mount Point

Operating System Concepts 35 Silberschatz, Galvin and Gagne ©2018

 File Sharing

 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

 Owner of a file / directory

4 User IDs identify users, allowing permissions and protections to be per-user

 Group of a file / directory

4 Group IDs allow users to be in groups, permitting group access rights

Operating System Concepts 36 Silberschatz, Galvin and Gagne ©2018

 File Sharing – Remote File Systems

 Uses 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
 NFS is standard UNIX client-server file sharing protocol
 CIFS is standard Windows protocol
 Standard operating system file calls are translated into remote calls
 Distributed Information Systems (distributed naming services) such
as LDAP, DNS, NIS, Active Directory implement unified access to
information needed for remote computing
Operating System Concepts 37 Silberschatz, Galvin and Gagne ©2018
 File Sharing – Failure Modes

 All file systems have failure modes

 For example corruption of directory structures or other non-user data,

called metadata

 Remote file systems add new failure modes, due to network failure,
server failure

 Recovery from failure can involve state information about status of

each remote request

 Stateless protocols such as NFS v.3 include all information in each

request, allowing easy recovery but less security

Operating System Concepts 38 Silberschatz, Galvin and Gagne ©2018

 File Sharing – Consistency Semantics

 Specify how multiple users are to access a shared file simultaneously

 Similar to Ch. 5 process synchronization algorithms

4 Tend to be less complex due to disk I/O and network latency (for remote file
systems

 Andrew File System (AFS) implemented complex remote file sharing

semantics

4 AFS has session semantics

– Writes only visible to sessions starting after the file is closed

 Unix file system (UFS) implements:

4 Writes to an open file visible immediately to other users of the same open file

4 Sharing file pointer to allow multiple users to read and write concurrently

Operating System Concepts 39 Silberschatz, Galvin and Gagne ©2018

 Protection

 File owner/creator should be able to control:

 what can be done

 by whom

 Types of access

 Read

 Write

 Execute

 Append

 Delete

 List

Operating System Concepts 40 Silberschatz, Galvin and Gagne ©2018

 Access Lists and Groups

 Mode of access: read (R), write (W), execute (X)

 Three classes of users on Unix / Linux

RWX
a) owner access 7 Þ 111
RWX
b) group access 6 Þ 110
RWX
c) public access 1 Þ 001
 Ask manager to create a group (unique name), say G, and add some
users to the group.
 For a particular file (say game) or subdirectory, define an appropriate
access.
Attach a group to a file
chgrp G game

Operating System Concepts 41 Silberschatz, Galvin and Gagne ©2018

 Windows 7 Access-Control List
Management

Operating System Concepts 42 Silberschatz, Galvin and Gagne ©2018

 A Sample UNIX Directory Listing

Operating System Concepts 43 Silberschatz, Galvin and Gagne ©2018

 Summary

 A file is an abstract data type defined and implemented by the

operating system. It is a sequence of logical records. A logical record
may be a byte, a line (of fixed or variable length), or a more complex
data item. The operating system may specifically support various
record types or may leave that support to the application program.
 A major task for the operating system is to map the logical file
concept onto physical storage devices such as hard disk or NVM
device. Since the physical record size of the device may not be the
same as the logical record size, it may be necessary to order logical
records into physical records. Again, this task may be supported by
the operating system or left for the application program.

Operating System Concepts 44 Silberschatz, Galvin and Gagne ©2018

 Summary (Cont.)

 Within a file system, it is useful to create directories to allow files to

be organized. A single-level directory in a multiuser system causes
naming problems, since each file must have a unique name. A two-
level directory solves this problem by creating a separate directory for
each user’s files. The directory lists the files by name and includes
the file’s location on the disk, length, type, owner, time of creation,
time of last use, ...
 The natural generalization of a two-level directory is a tree-structured
directory. A tree-structured directory allows a user to create
subdirectories to organize files. Acyclic-graph directory structures
enable users to share subdirectories and files but complicate
searching and deletion. A general graph structure allows complete
flexibility in the sharing of files and direc- tories but sometimes
requires garbage collection to recover unused disk space.

Operating System Concepts 45 Silberschatz, Galvin and Gagne ©2018

 Summary (Cont.)

 Remote file systems present challenges in reliability, performance,

and security. Distributed information systems maintain user, host, and
access information so that clients and servers can share state
information to man- age use and access.
 Since files are the main information-storage mechanism in most
computer systems, file protection is needed on multiuser systems.
Access to files can be controlled separately for each type of access
— read, write, execute, append, delete, list directory, and so on. File
protection can be provided by access lists, passwords, or other
techniques.

Operating System Concepts 46 Silberschatz, Galvin and Gagne ©2018

 End of Chapter 10.A.

Operating System Concepts Silberschatz, Galvin and Gagne ©2018