1. 1 File Systems Chapter 6 6.1 Files 6.2 Directories 6.3 File system implementation 6.4 Example file systems

2. 2 Long-term Information Storage 1.Must store large amounts of data 2.Information stored must survive the termination of the process using it 3.Multiple processes must be able to access the information concurrently

3. 3 File Naming Typical file extensions.

4. 4 File Structure Three kinds of files –byte sequence –record sequence –tree

5. 5 File Types (a) An executable file (b) An archive

6. 6 File Access Sequential access –read all bytes/records from the beginning –cannot jump around, could rewind or back up –convenient when medium was mag tape Random access –bytes/records read in any order –essential for data base systems –read can be … move file marker (seek), then read or … read and then move file marker

7. 7 File Attributes Possible file attributes

8. 8 File Operations 1.Create 2.Delete 3.Open 4.Close 5.Read 6.Write 7.Append 8.Seek 9.Get attributes 10.Set Attributes 11.Rename

9. 9 An Example Program Using File System Calls (1/2)

10. 10 An Example Program Using File System Calls (2/2)

11. 11 Memory-Mapped Files (a) Segmented process before mapping files into its address space (b) Process after mapping existing file abc into one segment creating new segment for xyz

12. 12 Directories Single-Level Directory Systems A single level directory system –contains 4 files –owned by 3 different people, A, B, and C

13. 13 Two-level Directory Systems Letters indicate owners of the directories and files

14. 14 Hierarchical Directory Systems A hierarchical directory system

15. 15 A UNIX directory tree Path Names

16. 16 Directory Operations 1.Create 2.Delete 3.Opendir 4.Closedir 5.Readdir 6.Rename 7.Link 8.Unlink

17. 17 File System Implementation A possible file system layout

18. 18 Implementing Files (1) (a) Contiguous allocation of disk space for 7 files (b) State of the disk after files D and E have been removed

19. 19 Implementing Files (2) Storing a file as a linked list of disk blocks

20. 20 Implementing Files (3) Linked list allocation using a file allocation table in RAM

21. 21 Implementing Files (4) An example i-node

22. 22 Implementing Directories (1) (a) A simple directory fixed size entries disk addresses and attributes in directory entry (b) Directory in which each entry just refers to an i-node

23. 23 Implementing Directories (2) Two ways of handling long file names in directory –(a) In-line –(b) In a heap

24. 24 Shared Files (1) File system containing a shared file

25. 25 Shared Files (2) (a) Situation prior to linking (b) After the link is created (c)After the original owner removes the file

26. 26 Disk Space Management (1) Dark line (left hand scale) gives data rate of a disk Dotted line (right hand scale) gives disk space efficiency All files 2KB Block size

27. 27 Disk Space Management (2) (a) Storing the free list on a linked list (b) A bit map

28. 28 Disk Space Management (3) (a) Almost-full block of pointers to free disk blocks in RAM - three blocks of pointers on disk (b) Result of freeing a 3-block file (c) Alternative strategy for handling 3 free blocks - shaded entries are pointers to free disk blocks

29. 29 Disk Space Management (4) Quotas for keeping track of each user’s disk use

30. 30 File System Reliability (1) A file system to be dumped –squares are directories, circles are files –shaded items, modified since last dump –each directory & file labeled by i-node number File that has not changed

31. 31 File System Reliability (2) Bit maps used by the logical dumping algorithm

32. 32 File System Reliability (3) File system states (a) consistent (b) missing block (c) duplicate block in free list (d) duplicate data block

33. 33 File System Performance (1) The block cache data structures

34. 34 File System Performance (2) I-nodes placed at the start of the disk Disk divided into cylinder groups –each with its own blocks and i-nodes

35. 35 Disk Scheduling The operating system is responsible for using hardware efficiently — for the disk drives, this means having a fast access time and disk bandwidth. Access time has two major components –Seek time is the time for the disk are to move the heads to the cylinder containing the desired sector. –Rotational latency is the additional time waiting for the disk to rotate the desired sector to the disk head. Minimize seek time Seek time  seek distance Disk bandwidth is the total number of bytes transferred, divided by the total time between the first request for service and the completion of the last transfer.

36. 36 Disk Scheduling (Cont.) Several algorithms exist to schedule the servicing of disk I/O requests. We illustrate them with a request queue (0- 199). 98, 183, 37, 122, 14, 124, 65, 67 Head pointer 53

37. 37 FCFS Illustration shows total head movement of 640 cylinders.

38. 38 SSTF Selects the request with the minimum seek time from the current head position. SSTF scheduling is a form of SJF scheduling; may cause starvation of some requests. Illustration shows total head movement of 236 cylinders.

39. 39 SSTF (Cont.)

40. 40 SCAN/Elevator The disk arm starts at one end of the disk, and moves toward the other end, servicing requests until it gets to the other end of the disk, where the head movement is reversed and servicing continues. Sometimes called the elevator algorithm. Illustration shows total head movement of 208 cylinders.

41. 41 SCAN/Elevator (Cont.)

42. 42 LOOK/Elevator Version of SCAN Arm only goes as far as the last request in each direction, then reverses direction immediately, without first going all the way to the end of the disk.

43. 43 C-SCAN Provides a more uniform wait time than SCAN. The head moves from one end of the disk to the other. servicing requests as it goes. When it reaches the other end, however, it immediately returns to the beginning of the disk, without servicing any requests on the return trip. Treats the cylinders as a circular list that wraps around from the last cylinder to the first one.

44. 44 C-SCAN (Cont.)

45. 45 C-LOOK Version of C-SCAN Arm only goes as far as the last request in each direction, then reverses direction immediately, without first going all the way to the end of the disk.

46. 46 C-LOOK (Cont.)

47. 47 Selecting a Disk-Scheduling Algorithm SSTF is common and has a natural appeal SCAN and C-SCAN perform better for systems that place a heavy load on the disk. Performance depends on the number and types of requests. Requests for disk service can be influenced by the file- allocation method. The disk-scheduling algorithm should be written as a separate module of the operating system, allowing it to be replaced with a different algorithm if necessary. Either SSTF or LOOK/Elevator is a reasonable choice for the default algorithm.

48. 48 Log-Structured File Systems With CPUs faster, memory larger –disk caches can also be larger –increasing number of read requests can come from cache –thus, most disk accesses will be writes LFS Strategy structures entire disk as a log –have all writes initially buffered in memory –periodically write these to the end of the disk log –when file opened, locate i-node, then find blocks

49. 49 Example File Systems CD-ROM File Systems The ISO 9660 directory entry

50. 50 The CP/M File System (1) Memory layout of CP/M BIOS had 17 I/O calls, OS in 3584 bytes, Shell in 2K, Zero page for h/w interrupt handling

51. 51 The CP/M File System (2) The CP/M directory entry format

52. 52 The MS-DOS File System (1) The MS-DOS directory entry

53. 53 The MS-DOS File System (2) Maximum partition for different block sizes The empty boxes represent forbidden combinations

54. 54 The Windows 98 File System (1) The extended MOS-DOS directory entry used in Windows 98 Bytes

55. 55 The Windows 98 File System (2) An entry for (part of) a long file name in Windows 98 Bytes Checksum

56. 56 The Windows 98 File System (3) An example of how a long name is stored in Windows 98

57. 57 The UNIX V7 File System (1) A UNIX V7 directory entry

58. 58 The UNIX V7 File System (2) A UNIX i-node

59. 59 The UNIX V7 File System (3) The steps in looking up /usr/ast/mbox