CS计算机代考程序代写 cache scheme algorithm Java distributed system database FTP file system Chapter 11: File-System Interface

Chapter 11: File-System Interface

Chapter 11:
File-System Interface

1

Chapter 11: File-System Interface
File Concept
Access Methods
Disk and Directory Structure
File-System Mounting
File Sharing
Protection

3

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

4

What is a File?
Contiguous logical address space
Types:
Data
numeric
character
binary
Program
Contents defined by file’s creator
Many types
Consider text file, source file, executable file for starters

5

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
Information kept in the directory structure

6

File info Window on Mac OS X

7

File Operations

Create
Write – at write pointer location
Read – at read pointer location
Reposition within file – seek
Delete
Truncate
Open(Fi) – search the directory structure on disk for entry Fi, and move the contents of entry to the open-file table
Close (Fi) – (not so simple when multiple processes may open the file simultaneously)

8

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 process closes it
Disk location of the file: cache of data access information
Access rights: per-process access mode information

9

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

10

File Locking Example – Java API
import java.io.*;
import java.nio.channels.*;
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(“file.txt”, “rw”);
// get the channel for the file
FileChannel ch = raf.getChannel();
// this locks the first half of the file – exclusive
exclusiveLock = ch.lock(0, raf.length()/2, EXCLUSIVE);
/** Now modify the data . . . */
// release the lock
exclusiveLock.release();

11

File Locking Example – Java API (Cont.)
// this locks the second half of the file – shared
sharedLock = ch.lock(raf.length()/2+1, raf.length(), SHARED);
/** Now read the data . . . */
// release the lock
sharedLock.release();
} catch (java.io.IOException ioe) {
System.err.println(ioe);
}finally {
if (exclusiveLock != null)
exclusiveLock.release();
if (sharedLock != null)
sharedLock.release();
}
}
}

12

File Types – Name, Extension

99 CAD
62 Database
68 Raster Graphics
76 Document
76 3D-Graphics
en.wikipedia.org/wiki/List_of_file_formats

13

File Structure
None – sequence of words, bytes
Simple record structure
Lines
Fixed length
Variable length
Complex Structures
Formatted document
Relocatable load file

14

Sequential-access File

15

Access Methods
Sequential Access
read next
write next
reset
no read after last write
(rewrite)
Direct Access – file is fixed length logical records
read n
write n
position to n
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 Ch 12

16

Disk Structure
Disk can be subdivided into partitions
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

17

Simulation of Sequential Access on Direct-access File

18

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)
IBM Indexed Sequential-access Method (ISAM)
Small master index, points to disk blocks of secondary index
File kept sorted on a defined key
Indices can be created on any field in the file
All done by the OS
VMS operating system provides index and relative files as another example (see next slide)

19

ISAM Index Structure

Example of Index and Relative Files

21

Directories

Directory Structure
A collection of nodes containing information about all files

F 1
F 2
F 3
F 4
F n

Directory
Files
Both the directory structure and the files reside on disk

23

A Typical File-system Organization

24

Types of File Systems
We mostly talk of general-purpose file systems
But systems frequently have may file systems, some general- and some special- purpose

25

Operations Performed on Directory
Search for a file

Create a file

Delete a file

List a directory

Rename a file

Traverse the file system

26

Directory Organization
Efficiency – locating a file quickly
Naming – convenient to users
Two users can have same name for different files
The same file can have several different names
Grouping – logical grouping of files by properties, (e.g., all Java programs, all games, …)
The directory is organized logically to obtain
MS-DOS FAT file system: 8.3 file names

Windows FAT and NTFS: long file name support
https://tinyurl.com/y4u2pb88
11

27

Single-Level Directory
A single directory for all users

Naming problem
Grouping problem

28

Two-Level Directory
Separate directory for each user
Path name
Can have the same file name for different user
Efficient searching
No grouping capability

29

Tree-Structured Directories

30

Tree-Structured Directories (Cont.)
Efficient searching

Grouping Capability

Current directory (working directory)
cd /spell/mail/prog
type list

31

Tree-Structured Directories (Cont)
Absolute or relative path name
Creating a new file is done in current directory
Delete a file
rm
Creating a new subdirectory is done in current directory
mkdir
Example: if in current directory /mail
mkdir count
Deleting “mail”  deleting the entire subtree rooted by “mail”

32

Acyclic-Graph Directories
Have shared subdirectories and files

33

Acyclic-Graph Directories (Cont.)
New directory entry type
Link – another name (pointer – either a relative or absolute path name) to an existing file
Resolve the link – follow pointer to locate the file
Another strategy is to duplicate all information about the file in all sharing directories.
A major problem is maintaining consistency when a file is modified.
Files may have multiple absolute path names.
Not a big deal unless you are gather file usage stats or doing backups

34

Acyclic-Graph Directories (Cont.)
Another problem involves deletion
When can the space allocated to a shared file be deallocated and reused?
Whenever anyone deletes it? But what happens to the dangling pointers in the other directories..
And what if there is an actual disk address in the other directories and the space is reused for other files?
One solution is to maintain a file-reference count.
Each time a reference to the file is added, we increment the count. And we decrement it when a reference is deleted.
The actual file is not deleted until the reference count =0

35

Acyclic-Graph Directories (Cont.)
Deletion is not an issue with symbolic links
If a directory just has a link then it can be deleted without affecting anything else
If the actual file entry is deleted, then worst case is we have dangling pointers that will be discovered when someone attempts to use them.
UNIX leaves symbolic links in place when a file is deleted, and it is up to the user to realize that the original file is gone or has been replaced.

36

General Graph Directory

37

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

38

File System Mounting
A file system must be mounted before it can be accessed
A unmounted file system (i.e., Fig. 11-14(b)) is mounted at a mount point

39

Mount Point

40

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
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

41

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

42

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 v3 include all information in each request, allowing easy recovery but less security

43

File Sharing – Consistency Semantics
Specify how multiple users are to access a shared file simultaneously
Similar to Ch 5 process synchronization algorithms
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
Unix file system (UFS) implements:
Writes to an open file visible immediately to other users of the same open file
Sharing file pointer to allow multiple users to read and write concurrently
AFS has session semantics
Writes only visible to sessions starting after the file is closed

44

Protection
File owner/creator should be able to control:
what can be done
by whom
Types of access
Read
Write
Execute
Append
Delete
List

45

Access Lists and Groups
Mode of access: read, write, execute
Three classes of users on Unix / Linux
RWX
a) owner access 7  1 1 1
RWX
b) group access 6  1 1 0
RWX
c) public access 1  0 0 1
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

46

Windows 7 Access-Control List Management

47

A Sample UNIX Directory Listing

48

End of Chapter 11

49

k.11.eps

users

/

bill fred

help

sue jane

prog
doc

(a) (b)