1. 1 Operating Systems Chapter 7-File-System File Concept Access Methods Directory Structure Protection File-System Structure Allocation Methods Free-Space Management Directory Implementation Efficiency and Performance Recovery

2. 2 Operating Systems File Concept Contiguous logical address space Types: –Data  numeric  character  binary –Program

3. 3 Operating Systems File Structure None - sequence of words, bytes Simple record structure –Lines –Fixed length –Variable length Complex Structures –Formatted document –Relocatable load file Can simulate last two with first method by inserting appropriate control characters. Who decides: –Operating system –Program

4. 4 Operating Systems 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. Etc..

5. 5 Operating Systems File Operations create write read reposition within file – file seek 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.

6. 6 Operating Systems File Types – name, extension

7. 7 Operating Systems Access Methods Sequential Access read next write next reset no read after last write (rewrite) Direct Access read n write n position to n read next write next rewrite n n = relative block number

8. 8 Operating Systems Tree-Structured Directories

9. 9 Operating Systems Acyclic-Graph Directories Have shared subdirectories and files.

10. 10 Operating Systems General Graph Directory

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

12. 12 Operating Systems Access Lists and Groups Mode of access: read, write, execute Three classes of users RWX a) owner access 7  1 1 1 RWX b) groups 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

13. 13 Operating Systems Allocation: Contiguous 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. LA/512 Q R –Block to be accessed = ! + starting address –Displacement into block = R

14. 14 Operating Systems Allocation: Linked list Each file is a linked list of disk blocks: blocks may be scattered anywhere on the disk.

15. 15 Operating Systems Linked Allocation (Cont.) Simple – need only starting address Free-space management system – no waste of space No random access Mapping –Block to be accessed is the Qth block in the linked chain of blocks representing the file. –Displacement into block = R + 1 File-allocation table (FAT) – disk-space allocation used by MS- DOS and OS/2. LA/511 Q R

16. 16 Operating Systems Allocation: Indexed

17. 17 Operating Systems Indexed Allocation (Cont.) Need index table Random access Dynamic access without external fragmentation, but have overhead of index block. Mapping from logical to physical in a file of maximum size of 256K words and block size of 512 words. We need only 1 block for index table. LA/512 Q R –Q = displacement into index table –R = displacement into block

18. 18 Operating Systems Indexed Allocation – Mapping (Cont.) Mapping from logical to physical in a file of unbounded length (block size of 512 words). Linked scheme – Link blocks of index table (no limit on size). LA / (512 x 511) Q1Q1 R1R1 –Q 1 = block of index table –R 1 is used as follows: R 1 / 512 Q2Q2 R2R2 –Q 2 = displacement into block of index table –R 2 displacement into block of file:

19. 19 Operating Systems Indexed Allocation – Mapping (Cont.) Two-level index (maximum file size is 512 3 ) LA / (512 x 512) Q1Q1 R1R1 –Q 1 = displacement into outer-index –R 1 is used as follows: R 1 / 512 Q2Q2 R2R2 –Q 2 = displacement into block of index table –R 2 displacement into block of file:

20. 20 Operating Systems Combined Scheme: UNIX (4K bytes per block)

21. 21 Operating Systems Free-Space Management Bit vector (n blocks) … 012n-1 bit[i] =  0  block[i] free 1  block[i] occupied Bit map requires extra space. Example: block size = 2 12 bytes disk size = 2 30 bytes (1 gigabyte) n = 2 30 /2 12 = 2 18 bits (or 32K bytes) Easy to get contiguous files

22. 22 Operating Systems MS-DOS scheme FAT-File Access Table contains indices of the blocks allocated to all the files. VTOC: Volume Table of Content is used to contain the highest level directory content, in the form of the file name and the index of its first block in the FAT Each entry of a directory contains attributes such as file name, extension, attributes, time, date, size, and the first block number. CP/M had one directory for all the files, where each of this directory entry contained all the attributes, with all allocated blocs listed in the same entry Directory implementation: –Linear list of file names with pointer to the data blocks. –Hash Table – linear list with hash data structure.

23. 23 Operating Systems File System Reliability Bad block management –hw solution; allocate a special sector to hold bad blocka and spare blocks to replace them –sw solution: keep a list of bad blocks in a file and remove them from the list of free blocks File system reliability –caused by system crash before modified data is written to the disk –there must be an effective utility program, such as fsck in UNIX, to reestablish the inconsistencies –a consistency check involves  a block is allocated to more than one file  a block appears more than once in the free list  file attributes, such as various counters are consistent

24. 24 Operating Systems Efficiency and Performance Factors effecting efficiency –disk allocation and directory algorithms –types of data kept in file’s directory entry –frequency of refreshment (flushing memory copies of blocks) Performance increasing measures –disk cache – separate section of main memory for frequently sued blocks –free-behind and read-ahead – techniques to optimize sequential access –improve performance by dedicating section of memory as virtual disk, or RAM disk. –Use virtual memory for file I/O  use page replacement like algorithm in flushing/reclaiming the data blocks in use: order the blocks to be flushed in LRU order!

25. 25 Operating Systems Recovery Consistency checker – compares data in directory structure with data blocks on disk, and tries to fix inconsistencies. Use system programs to back up data from disk to another storage device (floppy disk, magnetic tape). Recover lost file or disk by restoring data from backup.