file systems
DESCRIPTION
File Systems. 6.1 Files 6.2 Directories 6.3 File system implementation 6.4 Example file systems . Chapter 6. Long-term Information Storage. Must store large amounts of data Information stored must survive the termination of the process using it - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/1.jpg)
1
File Systems
Chapter 6
6.1 Files 6.2 Directories 6.3 File system implementation 6.4 Example file systems
![Page 2: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/2.jpg)
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
![Page 3: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/3.jpg)
3
File Naming
Typical file extensions.
![Page 4: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/4.jpg)
4
File Structure
• Three kinds of files– byte sequence– record sequence– tree
![Page 5: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/5.jpg)
5
File Types
(a) An executable file (b) An archive
![Page 6: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/6.jpg)
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
![Page 7: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/7.jpg)
7
File Attributes
Possible file attributes
![Page 8: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/8.jpg)
8
File Operations
1. Create2. Delete3. Open4. Close5. Read6. Write
7. Append8. Seek9. Get attributes10.Set Attributes11.Rename
![Page 9: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/9.jpg)
9
An Example Program Using File System Calls (1/2)
![Page 10: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/10.jpg)
10
An Example Program Using File System Calls (2/2)
![Page 11: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/11.jpg)
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
![Page 12: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/12.jpg)
12
DirectoriesSingle-Level Directory Systems
• A single level directory system– contains 4 files– owned by 3 different people, A, B, and C
![Page 13: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/13.jpg)
13
Two-level Directory Systems
Letters indicate owners of the directories and files
![Page 14: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/14.jpg)
14
Hierarchical Directory Systems
A hierarchical directory system
![Page 15: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/15.jpg)
15
A UNIX directory tree
Path Names
![Page 16: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/16.jpg)
16
Directory Operations
1. Create2. Delete3. Opendir4. Closedir
5. Readdir6. Rename7. Link8. Unlink
![Page 17: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/17.jpg)
17
File System Implementation
A possible file system layout
![Page 18: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/18.jpg)
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
![Page 19: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/19.jpg)
19
Implementing Files (2)
Storing a file as a linked list of disk blocks
![Page 20: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/20.jpg)
20
Implementing Files (3)
Linked list allocation using a file allocation table in RAM
![Page 21: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/21.jpg)
21
Implementing Files (4)
An example i-node
![Page 22: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/22.jpg)
22
Implementing Directories (1)
(a) A simple directoryfixed size entriesdisk addresses and attributes in directory entry
(b) Directory in which each entry just refers to an i-node
![Page 23: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/23.jpg)
23
Implementing Directories (2)
• Two ways of handling long file names in directory– (a) In-line– (b) In a heap
![Page 24: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/24.jpg)
24
Shared Files (1)
File system containing a shared file
![Page 25: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/25.jpg)
25
Shared Files (2)
(a) Situation prior to linking(b) After the link is created(c)After the original owner removes the file
![Page 26: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/26.jpg)
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
![Page 27: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/27.jpg)
27
Disk Space Management (2)
(a) Storing the free list on a linked list(b) A bit map
![Page 28: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/28.jpg)
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
![Page 29: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/29.jpg)
29
Disk Space Management (4)
Quotas for keeping track of each user’s disk use
![Page 30: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/30.jpg)
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 hasnot changed
![Page 31: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/31.jpg)
31
File System Reliability (2)
Bit maps used by the logical dumping algorithm
![Page 32: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/32.jpg)
32
File System Reliability (3)
• File system states(a) consistent(b) missing block(c) duplicate block in free list(d) duplicate data block
![Page 33: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/33.jpg)
33
File System Performance (1)
The block cache data structures
![Page 34: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/34.jpg)
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
![Page 35: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/35.jpg)
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.
![Page 36: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/36.jpg)
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
![Page 37: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/37.jpg)
37
FCFSIllustration shows total head movement of 640 cylinders.
![Page 38: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/38.jpg)
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.
![Page 39: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/39.jpg)
39
SSTF (Cont.)
![Page 40: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/40.jpg)
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.
![Page 41: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/41.jpg)
41
SCAN/Elevator (Cont.)
![Page 42: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/42.jpg)
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.
![Page 43: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/43.jpg)
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.
![Page 44: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/44.jpg)
44
C-SCAN (Cont.)
![Page 45: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/45.jpg)
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.
![Page 46: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/46.jpg)
46
C-LOOK (Cont.)
![Page 47: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/47.jpg)
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.
![Page 48: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/48.jpg)
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
![Page 49: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/49.jpg)
49
Example File Systems CD-ROM File Systems
The ISO 9660 directory entry
![Page 50: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/50.jpg)
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
![Page 51: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/51.jpg)
51
The CP/M File System (2)
The CP/M directory entry format
![Page 52: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/52.jpg)
52
The MS-DOS File System (1)
The MS-DOS directory entry
![Page 53: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/53.jpg)
53
The MS-DOS File System (2)
• Maximum partition for different block sizes• The empty boxes represent forbidden combinations
![Page 54: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/54.jpg)
54
The Windows 98 File System (1)
The extended MOS-DOS directory entry used in Windows 98
Bytes
![Page 55: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/55.jpg)
55
The Windows 98 File System (2)
An entry for (part of) a long file name in Windows 98
Bytes
Checksum
![Page 56: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/56.jpg)
56
The Windows 98 File System (3)
An example of how a long name is stored in Windows 98
![Page 57: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/57.jpg)
57
The UNIX V7 File System (1)
A UNIX V7 directory entry
![Page 58: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/58.jpg)
58
The UNIX V7 File System (2)
A UNIX i-node
![Page 59: File Systems](https://reader035.vdocuments.us/reader035/viewer/2022070503/56815d41550346895dcb4755/html5/thumbnails/59.jpg)
59
The UNIX V7 File System (3)
The steps in looking up /usr/ast/mbox