1. Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition Chapter 10: File-System Interface

2. 10.2 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition Chapter 10: File-System Interface File Concept Access Methods Directory Structure File-System Mounting File Sharing Protection

3. 10.3 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition Objectives To explain the function of file systems To discuss file-system design tradeoffs, including access methods, file sharing, file locking, and directory structures To explore file-system protection

4. 10.4 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition File Concept A file is a named collection of related information is recorded on secondary storage. Files are mapped by the operating system onto physical devices Types: Data  numeric  alphabetic  binary Program

5. 10.5 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition File Structure Simple record structure Lines Fixed length Variable length Complex Structures Formatted document

6. 10.6 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition File Attributes Information about files are kept in the directory structure, which is resides on the disk File Attributes Nameonly information kept in human-readable form Identifierunique tag (number) identifies file within file system Typeneeded for systems that support different types Locationpointer to file location on device Sizecurrent file size Protectioncontrols who can do reading, writing, executing Time, date, and user identification data for protection, security, and usage monitoring

7. 10.7 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition File Operations File is an abstract data type File operations CreateTwo steps are necessary to create a file ReadDirectory is searched Write Reposition within filethe current-file-position pointer is repositioned to a given value Delete Truncate Open(F i )search the directory structure on disk for entry F i, and move the content of entry to memory Close(F i )move the content of entry F i in memory to directory structure on disk

8. 10.8 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition Open Files Several pieces of data are needed to manage open files: Open files File pointerpointer to last read/write location, per process that has the file open File-open countcounter 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 fileto locate the modified file on disk Access rightsper-process access mode information

9. 10.9 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition Open File Locking Provided by some operating systems and file systems Mandatory or advisory file locking mechanism: Mandatory – access is denied depending on locks held and requested Advisory – processes can find status of locks and decide what to do

10. 10.10 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition File Types – Name, Extension

11. 10.11 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition Access Methods Sequential AccessRecords are accessed one after another. A read operation reads the next record and a write operation appends a record to the last position written to. It makes a disk look like tape Direct Access (relative access) Records are accessed directly by reading the sector where they have been stored / writing to this sector directly. Instead of “read next” or “write next” is “read number” or “write number” where number refers to the sector number. After a sector is accessed, information within the sector must be accessed sequentially. Index accessBuild on the top of the direct access method. The index contains a key & the block number. The index is normally kept in main memory, so the search is fast

12. 10.12 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition Sequential-access File

13. 10.13 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition Simulation of Sequential Access on Direct-access File

14. 10.14 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition Example of Index and Relative Files

15. 10.15 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition 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 Backups of these two structures are kept on tapes

16. 10.16 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition A Typical File-system Organization

17. 10.17 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition Operations Performed on Directory Search for a fileSearch a directory structure to find the entry for particular file Create a fileNew file need to be created and added to the directory Delete a fileRemove from directory List a directoryList the files in the directory and the contents of the directory entry for each file in the list Rename a fileRenaming a file allow its position within the directory structure to be changed Traverse the file system Access to every directory and every file within a directory structure

18. 10.18 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition Organize the Directory (Logically) to Obtain 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, …)

19. 10.19 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition Single-Level Directory A single directory for all users Naming problem Grouping problem

20. 10.20 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition Two-Level Directory Separate directory for each user Path name Can have the same file name for different user Efficient searching No grouping capability

21. 10.21 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition Tree-Structured Directories Efficient searching Grouping Capability Current directory (working directory)

22. 10.22 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition 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 mail progcopyprtexpcount Deleting “mail”  deleting the entire subtree rooted by “mail”

23. 10.23 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition Acyclic-Graph Directories Have shared subdirectories and files

24. 10.24 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition Acyclic-Graph Directories (Cont.) An acyclic-Graph Directory structure is more flexible than is a simple tree structure, but it is also more complex Two different names (aliasing) If the file entry itself is deleted, the space is de-allocated  dangling pointer Solutions: Backpointers, so we can delete all pointers  Search is expensive Keep the pointers until reference is made Keep the file until all links are deleted Variable and large size of the file-reference list is a problem Entry-hold-count solution

25. 10.25 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition General Graph Directory

26. 10.26 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition 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

27. 10.27 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition File System Mounting A file system must be mounted before it can be accessed A unmounted file system (i.e., Fig. 11-11(b)) is mounted at a mount point

28. 10.28 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition (a) Existing (b) Unmounted Partition

29. 10.29 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition Mount Point

30. 10.30 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition 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

31. 10.31 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition File Sharing – Multiple Users User IDs identify users, allowing permissions and protections to be per-user Group IDs allow users to be in groups, permitting group access rights

32. 10.32 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition 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 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

33. 10.33 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition File Sharing – Failure Modes 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 include all information in each request, allowing easy recovery but less security

34. 10.34 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition File Sharing – Consistency Semantics Consistency semantics specify how multiple users are to access a shared file simultaneously Andrew File System (AFS) implemented complex remote file sharing semantics  Writes only visible to sessions starting after the file is closed  Once a file is closed, the changes made to it are visible only in sessions starting later 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

35. 10.35 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition Protection File owner/creator should be able to control: what can be done by whom Types of access Read Write Execute Append Delete List

36. 10.36 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition Access Lists and Groups Mode of access: read, write, execute Three classes of users RWX a) owner access 7  1 1 1 RWX b) group access 6  1 1 0 RWX c) public access1  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. ownergrouppublic chmod761game Attach a group to a file chgrp G game

37. 10.37 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition Windows XP Access-Control List Management

38. Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition End of Chapter 10