Scribd
Upload
10 views43 pages

Distributed Files Ys

DIstributed files system notes

Uploaded by

makaujane64
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
10 views43 pages

Distributed Files Ys

DIstributed files system notes

Uploaded by

makaujane64
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 43

File Systems

6.1 Files
6.2 Directories
6.3 File system implementation
6.4 Example file systems

1
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

2
File Naming

Typical file extensions.


3
File Structure

• Three kinds of files


– byte sequence
– record sequence
– tree

4
File Types

(a) An executable file (b) An archive 5


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

6
File Attributes

Possible file attributes 7


File Operations

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

8
Directories
Single-Level Directory Systems

• A single level directory system


– contains 4 files
– owned by 3 different people, A, B, and C

9
Two-level Directory Systems

Letters indicate owners of the directories and files

10
Hierarchical Directory Systems

A hierarchical directory system

11
Path Names

A UNIX directory tree


12
Directory Operations

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

13
File System Implementation

A possible file system layout

14
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
15
Implementing Files (2)

Storing a file as a linked list of disk blocks

16
Implementing Files (3)

Linked list allocation using a file allocation table in RAM


17
Implementing Files (4)

An example i-node
18
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
19
Implementing Directories (2)

• Two ways of handling long file names in directory


– (a) In-line
– (b) In a heap 20
Shared Files (1)

File system containing a shared file


21
Shared Files (2)

(a) Situation prior to linking


(b) After the link is created
(c)After the original owner removes the file
22
Disk Space Management (1)

Block size

• Dark line (left hand scale) gives data rate of a disk


• Dotted line (right hand scale) gives disk space efficiency
• All files 2KB

23
Disk Space Management (2)

(a) Storing the free list on a linked list


(b) A bit map
24
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
25
Disk Space Management (4)

Quotas for keeping track of each user’s disk use


26
File System Reliability (1)

File that has


not changed

• 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 27
File System Reliability (2)

Bit maps used by the logical dumping algorithm


28
File System Reliability (3)

• File system states


(a) consistent
(b) missing block
(c) duplicate block in free list
(d) duplicate data block

29
File System Performance (1)

The block cache data structures

30
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

31
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

32
Example File Systems
CD-ROM File Systems

The ISO 9660 directory entry

33
The CP/M File System (1)

Memory layout of CP/M


34
The CP/M File System (2)

The CP/M directory entry format

35
The MS-DOS File System (1)

The MS-DOS directory entry

36
The MS-DOS File System (2)

• Maximum partition for different block sizes


• The empty boxes represent forbidden combinations
37
The Windows 98 File System (1)

Bytes

The extended MOS-DOS directory entry used in Windows 98

38
The Windows 98 File System (2)

Bytes

Checksum

An entry for (part of) a long file name in Windows 98

39
The Windows 98 File System (3)

An example of how a long name is stored in Windows 98

40
The UNIX V7 File System (1)

A UNIX V7 directory entry

41
The UNIX V7 File System (2)

A UNIX i-node
42
The UNIX V7 File System (3)

The steps in looking up /usr/ast/mbox


43

You might also like