1 / 104

File-System Interface

File-System Interface. File Concept Access Methods Directory Structure File System Mounting File Sharing Protection. File Concept. Contiguous logical address space Types: Data numeric character binary Program. File Structure. None - sequence of words, bytes

aimon
Download Presentation

File-System Interface

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. File-System Interface File Concept Access Methods Directory Structure File System Mounting File Sharing Protection

  2. File Concept • Contiguous logical address space • Types: • Data • numeric • character • binary • Program

  3. File Structure • None - sequence of words, bytes • Simple record structure • Lines • Fixed length • Variable length

  4. File Structure • Complex Structures • Formatted document • Relocatable load file • Can simulate last two with first method by inserting appropriate control characters. • Who decides: • Operating system • Program

  5. 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.

  6. File Attributes • 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.

  7. File Operations • Create • Write • Read • Reposition within file – file seek • Delete

  8. File Operations • Truncate • Open(Fi) • search the directory structure on disk for entry Fi, • move the content of entry to memory. • Close (Fi) • move the content of entry Fi in memory to directory structure on disk.

  9. File Types – Name, Extension

  10. Access Methods • Sequential Access: • read next • write next • reset • no read after last write • (rewrite)

  11. Access Methods • Direct Access: read n write n position to n read next write next rewrite n n = relative block number

  12. Sequential-access File

  13. Simulation of Seq. Access on a Direct-access File

  14. Example of Index and Relative Files

  15. Directory Structure • A collection of nodes containing information about all files. Directory Files F 1 F 2 F 3 F 4 F n On disk: directory structure & files Backups of these two structures are kept on tapes.

  16. A Typical File-system Organization

  17. Information in a Device Directory • Name • Type • Address • Current length • Maximum length • Date last accessed (for archival) • Date last updated (for dump) • Owner ID (who pays) • Protection information (discuss later)

  18. Operations Performed on Directory • Search for a file • Create a file • Delete a file • List a directory • Rename a file • Traverse the file system

  19. Logical Directory Organization • Efficiency – locating a file quickly. • Naming – convenient to users. • Two users can have same name for different files. • The same file can have several different names. • Grouping – logical grouping of files by properties, (e.g., all Java programs, all games, …)

  20. Single-Level Directory • A single directory for all users. Naming problem Grouping problem

  21. Two-Level Directory • Separate directory for each user. • Path name • Can have the same file name for different user • Efficient searching • No grouping (only two levels!)

  22. Tree-Structured Directories

  23. Tree-Structured Directories (Cont.) • Efficient searching • Grouping Capability • Current directory (working directory) • cd /spell/mail/prog • type list

  24. Tree-Structured Directories (Cont.) • Absolute or relative path name • Creating a new file is done in current directory. • Delete a file rm <file-name>

  25. Tree-Structured Directories (Cont.) • Creating a new subdirectory is done in current directory. mkdir <dir-name> • Example: if in current directory /mail mkdir count mail prog copy prt exp count Deleting “mail”  deleting the entire subtree rooted by “mail”.

  26. Acyclic-Graph Directories • Have shared subdirectories and files.

  27. Acyclic-Graph Directories (Cont.) • Two different names (aliasing) • If dict deletes list  dangling pointer. • Solutions: • Backpointers, so we can delete all pointers.Variable size records a problem. • Backpointers using a daisy chain organization. • Entry-hold-count solution.

  28. General Graph Directory

  29. General Graph Directory (Cont.) • How do we guarantee no cycles? • Allow only links to files not subdirectories. • Garbage collection. • When new link is added: • use a cycle detection algorithm to determine whether it is OK.

  30. File System Mounting • A file system must be mounted before it can be accessed. • A unmounted file system (i.e., Fig. 11-11(b)) is mounted at a mount point.

  31. (a) Existing. (b) Unmounted Partition

  32. Mount Point

  33. File Sharing • File Sharing: • is desirable on multi-user systems. • may be done through a protection scheme. • On distributed systems, files may be shared across a network. • Network File System (NFS) is a common distributed file-sharing method.

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

  35. Access Lists and Groups • Mode of access: read, write, execute • Three classes of users RWX a) owner access 7  1 1 1 b) group access 6  1 1 0 c) public access 1  0 0 1 • Root creates 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. owner group public chmod 761 game Attach a group to a file: $ chgrp G game

  36. Windows Access Control List Mgmt

  37. Sample UNIX Directory Listing

  38. File System Implementation File System Structure File System Implementation Directory Implementation Allocation Methods Free-Space Management Efficiency and Performance Recovery Log-Structured File Systems NFS

  39. File-System Structure • File structure • Logical storage unit • Collection of related information • File system resides on secondary storage (disks). • File system organized into layers. • File control block • storage structure consisting of information about a file.

  40. Layered File System

  41. A Typical File Control Block

  42. In-Memory File System Structures • The following figure illustrates the necessary file system structures provided by the operating systems.

  43. In-Memory File System Structures

  44. Virtual File Systems • Virtual File Systems (VFS) provide an object-oriented way of implementing file systems. • VFS allows the same system call interface (the API) to be used for different types of file systems. • The API is to the VFS interface, rather than any specific type of file system.

  45. Schematic View of Virtual File System

  46. Directory Implementation • Linear list of file names with pointer to the data blocks. • simple to program • time-consuming to execute • Hash Table: linear list with hash data structure. • decreases directory search time • collisions – situations where two file names hash to the same location • fixed size

  47. Allocation Methods • An allocation method refers to how disk blocks are allocated for files: • Contiguous allocation • Linked allocation • Indexed allocation

  48. Contiguous Allocation • 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.

  49. Contiguous Allocation of Disk Space

  50. pointer block = Linked Allocation • Each file is a linked list of disk blocks: blocks may be scattered anywhere on the disk.

More Related