* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
Download Lecture 6 File Systems
Survey
Document related concepts
Object storage wikipedia , lookup
Library (computing) wikipedia , lookup
MTS system architecture wikipedia , lookup
Plan 9 from Bell Labs wikipedia , lookup
Windows NT startup process wikipedia , lookup
Commodore DOS wikipedia , lookup
Spring (operating system) wikipedia , lookup
Burroughs MCP wikipedia , lookup
Computer file wikipedia , lookup
Transcript
ADVANCED OPERATING SYSTEMS Lecture 6 File Systems by: Syed Imtiaz Ali 1 Introduction to the Topic • For most users, the file system is the most visible aspect of an operating system. • It provides the mechanism for on-line storage of and access to both data and programs of the operating system and all the users of the computer system. • The file system consists of two distinct parts: – a collection of files, each storing related data – a directory structure, which organizes and provides information about all the files in the system. 2 File Concept (1) • The operating system provides a uniform logical view of information storage. • The operating system abstracts from the physical properties of its storage devices to define a logical storage unit, the file. • Files are mapped by the operating system onto physical devices. • These storage devices are usually nonvolatile, so the contents are persistent through power failures and system reboots. 3 File Concept (2) • File is a named collection of related info that is recorded on secondary storage • From a user's perspective: – a file is the smallest allotment of logical secondary storage – data cannot be written to secondary storage unless they are within a file. • In general, a file is a sequence of bits, bytes, lines, or records, the meaning of which is defined by the file's creator and user. 4 Directory & Disk Structure (1) • A storage device can be used: – In its totality for a file system. – Subdivided for finer-grained control. • Example: a disk can be partitioned into quarters, and each quarter can hold a file system • Storage devices can also be collected together into RAID (redundant array of independent disks) sets – provides protection from failure of a single disk. • Sometimes, disks are subdivided and also collected into RAID sets. 5 Directory & Disk Structure (2) • Partitioning is useful for: – limiting the sizes of individual file systems – putting multiple file-system types on same device – leaving part of the device available for other uses, such as swap space or unformatted (raw) space. • Any entity containing a file system is generally known as a volume. • The volume may be: – a subset of a device – a whole device – multiple devices linked together into a RAID set. 6 Directory & Disk Structure (3) • Each volume can be thought of as a virtual disk • Volumes can also store multiple operating systems, allowing a system to boot and run more than one operating system. • Each volume that contains a file system must also contain information about the files – This information is kept in entries in a device directory or volume table of content – Device directory (more commonly known simply as directory) that records information for all files on that volume. 7 File System Mounting (1) • A file system must be mounted before it can be available to processes on the system. • The mount procedure is straightforward. – The operating system is given: • the name of the device • the mount point - the location within the file structure where the file system is to be attached. – Some operating systems: • require a file system type • inspect the structures of the device and determine the type of file system. • Typically, a mount point is an empty directory. 8 File System Mounting (2) • Next, the operating system verifies that the device contains a valid file system by: – asking the device driver to read device directory – verifying that directory has the expected format. • Finally, the operating system notes in its directory structure that a file system is mounted at the specified mount point. • This scheme enables the operating system to: – traverse its directory structure – switching among file systems, and even file systems of varying types 9 Protection • When information is stored in a computer system, we want to keep it safe from: – physical damage (the issue of reliability) – improper access (the issue of protection). • Reliability is generally provided by duplicate copies of files. • Protection can be provided in many ways. – For a small single-user system, we provide protection by physically removing the disks – In a multiuser system, however, other mechanisms are needed. 10 Access Control (1) • The most common approach to the protection problem is to make access dependent on the identity of the user. • Different users may need different types of access to a file or directory. • The most general scheme to implement identity-dependent access is to associate with each file and directory an Access-Control List (ACL) specifying user names and the types of access allowed for each user. 11 Access Control (2) • Main problem with access lists is their length. • If we want to allow everyone to read a file, we must list all users with read access. • This technique has two undesirable consequences: 1. Constructing such a list may be a tedious and unrewarding task, especially if we do not know in advance the list of users in the system. 2. The directory entry must be of variable size, resulting in more complicated space management. 12 Access Control (3) • These problems can be resolved by use of a condensed version of the access list. • To condense the length of the access-control list, many systems recognize three classifications of users in connection with each file: 1. Owner. The user who created the file is the owner. 2. Group. A set of users who are sharing the file and need similar access is a group, or work group. 3. Universe. All other users in the system constitute the universe. 13 File System Implementation (1) • Several on-disk and in-memory structures are used to implement a file system. • On-disk, the file system may contain information about: – – – – – how to boot an operating system stored there the total number of blocks the number and location of free blocks the directory structure individual files 14 File System Implementation (2) • In-memory information is used for: – file-system management – performance improvement via caching. • The in-memory data are: – loaded at mount time – updated during file-system operations – discarded at dismount 15 On-disk file structure information (1) 1. A boot control block (per volume): – It contains information needed by the system to boot an operating system from that volume. – If the disk does not contain an operating system, this block can be empty. – It is typically the first block of a volume. – In UFS, it is called the boot-block; in NTFS, it is the partition boot sector 16 On-disk file structure information (2) 2. A volume control block (per volume): – It contains volume (or partition) details such as • the number of blocks in the partition • the size of the blocks • a free-block count • free-block pointers – In UFS, this is called a superblock – In NTFS, it is stored in the master-file table 17 On-disk file structure information (3) 3. A directory structure (per file system) – It is used to organize the files. – In UFS, this includes file names and associated mode numbers. – In NTFS, it is stored in the master file table. 4. A per-file FCB (File Control Block) – It contains many details about the file. – It has a unique identifier number to allow association with a directory entry 18 In-memory file structure info (1) 1. An in-memory mount-table – It contains information about each mounted volume 2. An in-memory directory-structure cache – It holds the directory information of recently accessed directories. 3. The system-wide open-file table: – It contains a copy of the FCB of each open file, as well as other information 19 In-memory file structure info (2) 4. The per-process open-file table: – It contains a pointer to the appropriate entry in the system-wide open-file table, as well as other information. 5. Buffers: – It hold file-system blocks when they are being read from disk or written to disk. 20 A typical File Control Block (FCB) 21 New File Creation Activity • To create a new file, an application program calls the logical file system. – The logical file system knows the format of the directory structures. • A new FCB will be allocated. – Alternatively, if the file-system implementation creates all FCBs at file-system creation time, an FCB is allocated from the set of free FCBs. • The system then reads the appropriate directory into memory, updates it with the new file name and FCB, and writes it back to disk. 22 I/O Activity (1) • A created file it can be used for I/0 • First, it must be opened. • The open () call passes a file name to the logical file system. • It first searches the system-wide open-file table to see if the file is already in use by another process. • If it is, a per-process open-file table entry is created pointing to the existing system-wide open-file table. » continue on next slide 23 I/O Activity (2) » Continued from previous slide • This algorithm can save substantial overhead. • If the file is not already open, the directory structure is searched for the given file name. – Parts of the directory structure are usually cached in memory to speed directory operations. • Once the file is found, the FCB is copied into a system-wide open-file table in memory. – This table not only stores the FCB but also tracks the number of processes that have the file open. 24 I/O Activity (3) » Continued from previous slide • Next, an entry is made in the per-process openfile table, with a pointer to the entry in the system-wide open-file table – All file operations are then performed via this pointer. • The file name may not be part of the open-file table, as the system has no use for it once the appropriate FCB is located on disk. • It could be cached, though, to save time on subsequent opens of the same file. 25 I/O Activity (4) » Continued from previous slide • The name given to the entry varies. – UNIX systems refer to it as a file descriptor – Windows refers to it as a file handle • When a process closes the file: – the per-process table entry is removed – the system-wide entry's open count is decremented. • When all users that have opened the file close it, any updated metadata is copied back to the disk-based directory structure, and the systemwide open-file table entry is removed. 26 Virtual File System (1) • Modern operating systems must concurrently support multiple types of file systems. – how does an operating system allow multiple types of file systems to be integrated into a directory structure? – how can users seamlessly move between filesystem types as they navigate the file-system space? • An obvious method of implementing multiple types of file systems is to write directory and file routines for each type. 27 Virtual File System (2) • Most operating systems, including UNIX, use object-oriented techniques to simplify, organize, and modularize the implementation. • Data structures and procedures are used to isolate the basic system call functionality from the implementation details. 28 Layered File System Implementation(1) • The file-system implementation consists of three major layers – The first layer is the file-system interface, based on the open(), read(), write(), and close() calls and on file descriptors. • The second layer is called the virtual File System (VFS) layer. – The VFS layer serves two important functions: • It separates file-system-generic operations from their implementation by defining a clean VFS interface. • It provides a mechanism for uniquely representing a file throughout a network. 29 Layered File System Implementation(2) 30