EECE.4810/EECE.5730: Operating Systems Spring 2017
|
|
- Jeffery Floyd
- 5 years ago
- Views:
Transcription
1 EECE.4810/EECE.5730: Operating Systems Spring (16 points) Storage devices Final Exam Solution Assume you have a magnetic hard disk with tracks numbered from 0-127, track 0 being the outermost track. As a simplifying assumption, assume all tracks have 64 sectors numbered Given the list of read requests to specific sectors listed below, show the order in which the sectors would be read using (a) shortest seek time first (SSTF) scheduling and (b) SCAN scheduling. Use the following assumptions: Given a sector, S, another sector in the same track as S will be closer (and therefore have a shorter seek time) than a sector in a different track. Seek time is directly proportional to the difference between track numbers. For example, moving from track 1 to track 2 would take half as long as moving from track 5 to track 7. Multiple sectors in the same track will be read in ascending order (lowest number first). The sequence should always start with the first request in the list (track 40, sector 5). Once that request has been serviced, all other requests can be serviced in any order. Request list: i. Track 40, sector 5 ii. Track 15, sector 60 iii. Track 100, sector 0 iv. Track 95, sector 12 v. Track 40, sector 63 vi. Track 0, sector 0 vii. Track 15, sector 59 viii. Track 127, sector 63 SOLUTION: The table below shows the ordering of requests for each of the two algorithms. The SCAN solution assumes the disk head starts by moving toward the center of the disk, toward higher track numbers. If you assume it starts by moving out, then the requests from track 15 are serviced first (once it completes servicing track 40), and the order will be the same as SSTF. SSTF SCAN 1 (i) T40, S5 (i) T40, S5 2 (v) T40, S63 (v) T40, S63 3 (vii) T15, S59 (iv) T95, S12 4 (ii) T15, S60 (iii) T100, S0 5 (vi) T0, S0 (viii) T127, S63 6 (iv) T95, S12 (vii) T15, S59 7 (iii) T100, S0 (ii) T15, S60 8 (viii) T127, S63 (vi) T0, S0 1
2 2. ( points) File system implementation a. (6 points) Operating systems often contain direct support for one specific file type but otherwise require applications to impose other types based on file structure. What one type must the operating system support, and why? SOLUTION: Operating systems must support executable files because loading and running a program requires intervention from the kernel. b. (6 points) The open-file table, which contains information about open files, is typically split into one centralized table and several per-process tables. Name one piece of information stored in the centralized table and explain why it is kept centrally, and name one piece of information stored in a per-process table and explain why it is kept on a per-process basis. SOLUTION: We discussed the following information in class and which table (central or perprocess) it is kept in. One thing from each list is sufficient for this problem. Central table o File open count (# processes accessing file) when this number reaches 0, file can be closed. A central copy is more space efficient and easier to synchronize access to than multiple per-process copies. o Disk location of the file the physical file location. Since every file access must go through the file system anyway, no need to keep multiple copies of this info. Per-process table o File pointer location at which current process may read/write file. May be different for every process. o Access rights allowed operations on this file for this process. Again, may be different for every process. c. (6 points) A file created on a Unix system should be readable to the public, readable and executable to its group, and readable, writeable, and executable to its owner. What 3-digit integer represents the access rights for this file? Briefly explain your answer. SOLUTION: When specifying Unix access rights using a single integer, each digit is a three bit value in which the leftmost bit enables read access (if it s set to 1), the middle bit enables write access, and the rightmost bit enables execute access. The digits are ordered as (left to right) owner, group, and public. Therefore, the access rights should be written as follows: Owner: R W X à = 7 Group: R X à = 5 Public: R à = 4 Therefore, the three-digit integer representing this file s access rights is
3 1 (continued) d. (6 points, EECE.5730 only) We discussed the different layers of a typical file system, from the logical file system down to the device drivers. Some of these layers deal with logical addresses within a file, while others deal with physical addresses. Explain how and when logical file addresses and physical file addresses are used. SOLUTION: Logical file addresses represent an offset within the file as a logical unit, a file is seen as a contiguous collection of blocks, starting with block 0. The application and logical file system use these addresses. Physical file addresses represent an actual block location on disk. Multiple blocks within the same file may have contiguous addresses or they may be scattered, depending on the block allocation scheme used. The basic file system and I/O control levels of the file system use these addresses. 3
4 3. ( points) Block allocation and free space management a. (6 points) Explain the difference between extent-based file allocation and linked file allocation. SOLUTION: Extent-based file allocation is a form of contiguous allocation in which a file is broken into multiple contiguous chunks (extents); linked file allocation typically allocates space in units of one block, although blocks can be clustered together for performance, and builds a linked list of blocks. The biggest difference is in how the addresses are stored. In an extent-based system, the file system stores the starting address and size of each extent as part of the file s metadata. In a linked file allocation system, the file system stores the address of the first file block as part of the metadata, and each block stores the address of the block that follows it in the linked list. b. (6 points) Explain the difference between basic linked allocation of file blocks and the file allocation table (FAT) block allocation scheme. SOLUTION: Both schemes maintain a linked list of file blocks. In basic linked allocation, each block contains the address of the block that follows it in the linked list. In a FAT block allocation scheme, the linked list is stored in a table (the FAT) within the file metadata. c. (6 points) The two most common methods for managing free space in a file system are bitmaps and linked free space lists. Give one benefit of a bitmap over a linked free space list, and one benefit of a linked free space list over a bitmap. SOLUTION: Bitmaps make it relatively simple to find free blocks, especially when contiguous groups of blocks are requested. A linked free space list is much more space efficient than a bitmap. 4
5 3 (continued) d. (9 points, EECE.5730 only) Recall our discussion of the Berkeley Fast File System (FFS), which organizes its inodes as shown below. Each inode contains 12 direct pointers to disk blocks, as well as three other pointers an indirect pointer, a doubly indirect pointer, and a triply indirect pointer. (Only the inode array and a single inode are shown not all pointers.) Assume each pointer is 32 bits and each disk block is 8 KB. If a file in this file system is 16 GB, how much space is allocated to store all of the pointers (whether direct or indirect) required to access all blocks in that file? Show all of your work for full credit. Inode Array Inode Triple Indirect Blocks Double Indirect Blocks Indirect Blocks Data Blocks File Metadata Direct Pointer Direct Pointer Indirect Pointer Dbl. Indirect Ptr. Tripl. Indirect Ptr. SOLUTION: What the original picture didn t show is how the pointers are used each pointer goes to a single 8 KB disk block. The first 12 blocks those accessed by the direct pointers contain data, while the other blocks contain more pointers to more blocks. The number of additional levels of block pointers depends on the level of indirection. (Full picture above) To determine the amount of space required to store the block pointers, consider the following: The file is 16 GB = 2 34 bytes, while each block is 8 KB = 2 13 bytes. So, the file is composed of 2 34 / 2 13 = 2 21 blocks, each of which requires its own pointer. Each indirect block contains 2 13 / 2 2 = 2 11 pointers, since a pointer is 4 = 2 2 bytes. The necessary pointers are organized as follows: o Direct pointers account for 12 blocks o The indirect pointer points to one indirect block, which points to 2 11 blocks. o That leaves blocks unaccounted for (the 12 blocks handled by the direct pointers are insignificant in this calculation) o = 2 11 * (2 10 1) à since each indirect block points to 2 11 blocks, we need of the indirect blocks that the doubly-indirect block points to. o The triply-indirect pointer is unused (but still takes up space) So, the total amount of pointer space is the sum of the space in the inode, indirect block, doublyindirect block, and indirect blocks pointed to by the doubly-indirect block: (15 * 4 bytes) + (8 KB) + (8 KB) + ((2 10 1) * 8 KB = = bytes = bytes 5
6 (12 points) Reliability a. (6 points) Explain why methods for ensuring reliability in file systems center on operations that write a single sector. SOLUTION: Writing a single sector is the only atomic operation disks support, so methods for reliability in file systems preventing loss of data aim to make multi-step changes to the file system reliant on that one atomic operation. b. (6 points) A Linux variant called TxOS, developed at the University of Texas, supports transactions with shadowing by decomposing inodes into two parts: a header that contains infrequently modified data about each file, and a data component holding fields that are commonly modified by system calls. The header contains a pointer to the related data component, and the data component contains a pointer to the header. Explain how this inode organization makes it relatively easy to implement shadowing for changes to a file s metadata. SOLUTION: Shadowing requires the file system to create a shadow copy of any data to be changed while maintaining a pointer to the current version. Changes are made to the shadow copy and committed by changing the pointer from the current version to the shadow copy. By splitting the metadata into a header and data section, creating a shadow copy of the frequently changed data without copying the header is simple. The pointer within the header section can be pointed to the shadow copy of the data once changes to it are complete. 6
7 4. (21 points) Distributed systems a. (6 points) In a distributed system, a process running on one node sends a byte stream to another node; the byte stream is split into several messages. How will the system recognize and handle (i) messages received out of order and (ii) dropped messages? In your answer, specify which process (sender or receiver) is responsible for detecting each of these issues. SOLUTION: (i) The header of each message contains a sequence number. The receiving process can use this number to place messages in the correct order. (ii) The sending process waits for acknowledgement that each message has been received. If that acknowledgement is not received within a predefined amount of time, the sending process assumes the message was dropped and retransmits it. b. (6 points) Distributed file systems often allow nodes to cache local copies of shared data, using either write-through or write-back policies to handle changes to those data. List one benefit of using write-through file caching, and one benefit of using write-back file caching. SOLUTION: Write-through caching provides good reliability, as every change to a cached copy is written to the permanent state of the file. Write-back caching provides better performance, as multiple repeated writes are significantly slower than only writing data back when strictly necessary. c. (9 points) A client process uses a binary search tree to store a set of 32-bit integers, one integer per node. The 32-bit address of the tree s root node is passed as the only argument to a remote procedure call to be executed in a server process. If the binary search tree contains 15 values, what is the minimum amount of space required to marshal the parameter or parameters of this function such that the remote procedure can access the entire binary search tree stored by the client? Show your work for full credit. SOLUTION: The amount of space required for the binary search tree is dependent on the organization of data within it, but a complete binary tree one in which every level is full can be efficiently stored in an array, with the root of the tree in the first array location, its in the next two locations, and so on. The number of nodes should be passed at the beginning of the array so the tree can be unpacked at the server. A sample array organization is shown below # nodes root of root of 4 of 12 of 2 of 6 of 10 of 14 Each integer in the array takes up 4 bytes, while the number of nodes can potentially be stored in just a single byte. The minimum amount of space required to store this tree is therefore: (15 nodes) * (4 bytes/node) + (1 byte for # nodes) = = 61 bytes 7
8 5. ( points) Protection and security a. (9 points) Given the access matrix below, answer questions (i)-(iii). Objects Domains F 1 F 2 F 3 D 1 D 2 D 3 D 4 read* D 1 write control write* D 2 owner read D 3 read* owner D 4 write write control i. Can a process in domain D 1 grant read privileges for object F 3 to a process in domain D 2? Why or why not? SOLUTION: Yes D 1 has control rights for D 2. ii. Can a process in domain D 3 revoke the write privileges of a process in domain D 1 for object F 3? Why or why not? SOLUTION: No D 3 would need owner rights for F 3 to revoke privileges in another domain. iii. Can a process in domain D 2 give read, write, and execute privileges for object F 2 to a process in domain D 3? Why or why not? SOLUTION: Yes D 2 has owner rights for F 2. 8
9 6 (continued) b. (6 points) Two professors are discussing the security of a distributed system in which the key used to encrypt messages is known. Professor A claims that knowing the encryption key will allow him to decrypt any message sent between nodes in the system once he determines the type of cryptography used, thus making the system insecure. Professor B claims it is possible for the system to be secure, depending on what method is used to encrypt messages. Which professor is right, and why? SOLUTION: Professor B is correct. Asymmetric encryption schemes use two different keys a public key for encryption and private keys for decryption. Since the type of encryption used is not specified, it s possible the system is using asymmetric encryption and is therefore secure. c. (5 points, EECE.5730 only) Briefly explain how default access rights are implemented in an access list. SOLUTION: An access list is a per-object collection of access rights, organized as pairs of domains and their associated access rights. A default domain can be added to the access list any domain that is not explicitly listed in the access list will use the rights associated with the default domain. 9
Operating Systems. Week 9 Recitation: Exam 2 Preview Review of Exam 2, Spring Paul Krzyzanowski. Rutgers University.
Operating Systems Week 9 Recitation: Exam 2 Preview Review of Exam 2, Spring 2014 Paul Krzyzanowski Rutgers University Spring 2015 March 27, 2015 2015 Paul Krzyzanowski 1 Exam 2 2012 Question 2a One of
More informationMain Points. File layout Directory layout
File Systems Main Points File layout Directory layout File System Design Constraints For small files: Small blocks for storage efficiency Files used together should be stored together For large files:
More informationCOMP 530: Operating Systems File Systems: Fundamentals
File Systems: Fundamentals Don Porter Portions courtesy Emmett Witchel 1 Files What is a file? A named collection of related information recorded on secondary storage (e.g., disks) File attributes Name,
More informationFile Systems. Kartik Gopalan. Chapter 4 From Tanenbaum s Modern Operating System
File Systems Kartik Gopalan Chapter 4 From Tanenbaum s Modern Operating System 1 What is a File System? File system is the OS component that organizes data on the raw storage device. Data, by itself, is
More informationFile System Implementation. Sunu Wibirama
File System Implementation Sunu Wibirama File-System Structure Outline File-System Implementation Directory Implementation Allocation Methods Free-Space Management Discussion File System Structure File
More informationCS 550 Operating Systems Spring File System
1 CS 550 Operating Systems Spring 2018 File System 2 OS Abstractions Process: virtualization of CPU Address space: virtualization of memory The above to allow a program to run as if it is in its own private,
More informationOperating Systems Design Exam 2 Review: Spring 2011
Operating Systems Design Exam 2 Review: Spring 2011 Paul Krzyzanowski pxk@cs.rutgers.edu 1 Question 1 CPU utilization tends to be lower when: a. There are more processes in memory. b. There are fewer processes
More informationOperating Systems Design Exam 2 Review: Spring 2012
Operating Systems Design Exam 2 Review: Spring 2012 Paul Krzyzanowski pxk@cs.rutgers.edu 1 Question 1 Under what conditions will you reach a point of diminishing returns where adding more memory may improve
More informationCS 416: Opera-ng Systems Design March 23, 2012
Question 1 Operating Systems Design Exam 2 Review: Spring 2011 Paul Krzyzanowski pxk@cs.rutgers.edu CPU utilization tends to be lower when: a. There are more processes in memory. b. There are fewer processes
More informationFile Systems: Fundamentals
File Systems: Fundamentals 1 Files! What is a file? Ø A named collection of related information recorded on secondary storage (e.g., disks)! File attributes Ø Name, type, location, size, protection, creator,
More informationOperating Systems. Operating Systems Professor Sina Meraji U of T
Operating Systems Operating Systems Professor Sina Meraji U of T How are file systems implemented? File system implementation Files and directories live on secondary storage Anything outside of primary
More informationFile Systems: Fundamentals
1 Files Fundamental Ontology of File Systems File Systems: Fundamentals What is a file? Ø A named collection of related information recorded on secondary storage (e.g., disks) File attributes Ø Name, type,
More informationFile Systems. CS170 Fall 2018
File Systems CS170 Fall 2018 Table of Content File interface review File-System Structure File-System Implementation Directory Implementation Allocation Methods of Disk Space Free-Space Management Contiguous
More informationFile System Internals. Jo, Heeseung
File System Internals Jo, Heeseung Today's Topics File system implementation File descriptor table, File table Virtual file system File system design issues Directory implementation: filename -> metadata
More informationCSE 120: Principles of Operating Systems. Lecture 10. File Systems. November 6, Prof. Joe Pasquale
CSE 120: Principles of Operating Systems Lecture 10 File Systems November 6, 2003 Prof. Joe Pasquale Department of Computer Science and Engineering University of California, San Diego 2003 by Joseph Pasquale
More informationFile Systems. ECE 650 Systems Programming & Engineering Duke University, Spring 2018
File Systems ECE 650 Systems Programming & Engineering Duke University, Spring 2018 File Systems Abstract the interaction with important I/O devices Secondary storage (e.g. hard disks, flash drives) i.e.
More informationOperating Systems. File Systems. Thomas Ropars.
1 Operating Systems File Systems Thomas Ropars thomas.ropars@univ-grenoble-alpes.fr 2017 2 References The content of these lectures is inspired by: The lecture notes of Prof. David Mazières. Operating
More informationDisk Scheduling COMPSCI 386
Disk Scheduling COMPSCI 386 Topics Disk Structure (9.1 9.2) Disk Scheduling (9.4) Allocation Methods (11.4) Free Space Management (11.5) Hard Disk Platter diameter ranges from 1.8 to 3.5 inches. Both sides
More informationECE 650 Systems Programming & Engineering. Spring 2018
ECE 650 Systems Programming & Engineering Spring 2018 File Systems Tyler Bletsch Duke University Slides are adapted from Brian Rogers (Duke) File Systems Disks can do two things: read_block and write_block
More informationwe are here I/O & Storage Layers Recall: C Low level I/O Recall: C Low Level Operations CS162 Operating Systems and Systems Programming Lecture 18
I/O & Storage Layers CS162 Operating Systems and Systems Programming Lecture 18 Systems April 2 nd, 2018 Profs. Anthony D. Joseph & Jonathan Ragan-Kelley http://cs162.eecs.berkeley.edu Application / Service
More informationMain Points. File layout Directory layout
File Systems Main Points File layout Directory layout File System Design Constraints For small files: Small blocks for storage efficiency Files used together should be stored together For large files:
More informationFile Systems. Before We Begin. So Far, We Have Considered. Motivation for File Systems. CSE 120: Principles of Operating Systems.
CSE : Principles of Operating Systems Lecture File Systems February, 6 Before We Begin Read Chapters and (File Systems) Prof. Joe Pasquale Department of Computer Science and Engineering University of California,
More informationI/O and file systems. Dealing with device heterogeneity
I/O and file systems Abstractions provided by operating system for storage devices Heterogeneous -> uniform One/few storage objects (disks) -> many storage objects (files) Simple naming -> rich naming
More informationMidterm Exam #3 Solutions November 30, 2016 CS162 Operating Systems
University of California, Berkeley College of Engineering Computer Science Division EECS Fall 2016 Anthony D. Joseph Midterm Exam #3 Solutions November 30, 2016 CS162 Operating Systems Your Name: SID AND
More informationFilesystem. Disclaimer: some slides are adopted from book authors slides with permission
Filesystem Disclaimer: some slides are adopted from book authors slides with permission 1 Recap Directory A special file contains (inode, filename) mappings Caching Directory cache Accelerate to find inode
More informationLecture S3: File system data layout, naming
Lecture S3: File system data layout, naming Review -- 1 min Intro to I/O Performance model: Log Disk physical characteristics/desired abstractions Physical reality Desired abstraction disks are slow fast
More informationCSE 120: Principles of Operating Systems. Lecture 10. File Systems. February 22, Prof. Joe Pasquale
CSE 120: Principles of Operating Systems Lecture 10 File Systems February 22, 2006 Prof. Joe Pasquale Department of Computer Science and Engineering University of California, San Diego 2006 by Joseph Pasquale
More informationUNIX File Systems. How UNIX Organizes and Accesses Files on Disk
UNIX File Systems How UNIX Organizes and Accesses Files on Disk Why File Systems File system is a service which supports an abstract representation of the secondary storage to the OS A file system organizes
More information22 File Structure, Disk Scheduling
Operating Systems 102 22 File Structure, Disk Scheduling Readings for this topic: Silberschatz et al., Chapters 11-13; Anderson/Dahlin, Chapter 13. File: a named sequence of bytes stored on disk. From
More informationFile System Implementation. Jin-Soo Kim Computer Systems Laboratory Sungkyunkwan University
File System Implementation Jin-Soo Kim (jinsookim@skku.edu) Computer Systems Laboratory Sungkyunkwan University http://csl.skku.edu Implementing a File System On-disk structures How does file system represent
More informationCIS Operating Systems File Systems. Professor Qiang Zeng Spring 2018
CIS 3207 - Operating Systems File Systems Professor Qiang Zeng Spring 2018 Previous class I/O subsystem: hardware aspect Terms: controller, bus, port Addressing: port-mapped IO and memory-mapped IO I/O
More informationOutlook. File-System Interface Allocation-Methods Free Space Management
File System Outlook File-System Interface Allocation-Methods Free Space Management 2 File System Interface File Concept File system is the most visible part of an OS Files storing related data Directory
More informationFILE SYSTEMS, PART 2. CS124 Operating Systems Fall , Lecture 24
FILE SYSTEMS, PART 2 CS124 Operating Systems Fall 2017-2018, Lecture 24 2 Last Time: File Systems Introduced the concept of file systems Explored several ways of managing the contents of files Contiguous
More informationFILE SYSTEM IMPLEMENTATION. Sunu Wibirama
FILE SYSTEM IMPLEMENTATION Sunu Wibirama File-System Structure Outline File-System Implementation Directory Implementation Allocation Methods Free-Space Management Discussion File-System Structure Outline
More informationCS 537 Fall 2017 Review Session
CS 537 Fall 2017 Review Session Deadlock Conditions for deadlock: Hold and wait No preemption Circular wait Mutual exclusion QUESTION: Fix code List_insert(struct list * head, struc node * node List_move(struct
More informationwe are here Page 1 Recall: How do we Hide I/O Latency? I/O & Storage Layers Recall: C Low level I/O
CS162 Operating Systems and Systems Programming Lecture 18 Systems October 30 th, 2017 Prof. Anthony D. Joseph http://cs162.eecs.berkeley.edu Recall: How do we Hide I/O Latency? Blocking Interface: Wait
More informationOperating Systems Design Exam 2 Review: Fall 2010
Operating Systems Design Exam 2 Review: Fall 2010 Paul Krzyzanowski pxk@cs.rutgers.edu 1 1. Why could adding more memory to a computer make it run faster? If processes don t have their working sets in
More informationCIS Operating Systems File Systems. Professor Qiang Zeng Fall 2017
CIS 5512 - Operating Systems File Systems Professor Qiang Zeng Fall 2017 Previous class I/O subsystem: hardware aspect Terms: controller, bus, port Addressing: port-mapped IO and memory-mapped IO I/O subsystem:
More informationFile Management By : Kaushik Vaghani
File Management By : Kaushik Vaghani File Concept Access Methods File Types File Operations Directory Structure File-System Structure File Management Directory Implementation (Linear List, Hash Table)
More informationFile System Concepts File Allocation Table (FAT) New Technology File System (NTFS) Extended File System (EXT) Master File Table (MFT)
File System Concepts File Allocation Table (FAT) New Technology File System (NTFS) Extended File System (EXT) Master File Table (MFT) 1 FILE SYSTEM CONCEPTS: FILE ALLOCATION TABLE (FAT) Alex Applegate
More informationComputer Systems Laboratory Sungkyunkwan University
File System Internals Jin-Soo Kim (jinsookim@skku.edu) Computer Systems Laboratory Sungkyunkwan University http://csl.skku.edu Today s Topics File system implementation File descriptor table, File table
More informationFile System Implementation
File System Implementation Jinkyu Jeong (jinkyu@skku.edu) Computer Systems Laboratory Sungkyunkwan University http://csl.skku.edu SSE3044: Operating Systems, Fall 2016, Jinkyu Jeong (jinkyu@skku.edu) Implementing
More informationIntroduction. Secondary Storage. File concept. File attributes
Introduction Secondary storage is the non-volatile repository for (both user and system) data and programs As (integral or separate) part of an operating system, the file system manages this information
More informationOperating Systems. Lecture File system implementation. Master of Computer Science PUF - Hồ Chí Minh 2016/2017
Operating Systems Lecture 7.2 - File system implementation Adrien Krähenbühl Master of Computer Science PUF - Hồ Chí Minh 2016/2017 Design FAT or indexed allocation? UFS, FFS & Ext2 Journaling with Ext3
More information19 File Structure, Disk Scheduling
88 19 File Structure, Disk Scheduling Readings for this topic: Silberschatz et al., Chapters 10 11. File: a named collection of bytes stored on disk. From the OS standpoint, the file consists of a bunch
More informationFile Systems. Chapter 11, 13 OSPP
File Systems Chapter 11, 13 OSPP What is a File? What is a Directory? Goals of File System Performance Controlled Sharing Convenience: naming Reliability File System Workload File sizes Are most files
More informationFILE SYSTEMS. CS124 Operating Systems Winter , Lecture 23
FILE SYSTEMS CS124 Operating Systems Winter 2015-2016, Lecture 23 2 Persistent Storage All programs require some form of persistent storage that lasts beyond the lifetime of an individual process Most
More informationFile System Internals. Jin-Soo Kim Computer Systems Laboratory Sungkyunkwan University
File System Internals Jin-Soo Kim (jinsookim@skku.edu) Computer Systems Laboratory Sungkyunkwan University http://csl.skku.edu Today s Topics File system implementation File descriptor table, File table
More informationFile System Internals. Jin-Soo Kim Computer Systems Laboratory Sungkyunkwan University
File System Internals Jin-Soo Kim (jinsookim@skku.edu) Computer Systems Laboratory Sungkyunkwan University http://csl.skku.edu Today s Topics File system implementation File descriptor table, File table
More informationCS 318 Principles of Operating Systems
CS 318 Principles of Operating Systems Fall 2017 Lecture 16: File Systems Examples Ryan Huang File Systems Examples BSD Fast File System (FFS) - What were the problems with the original Unix FS? - How
More informationFinal Exam Solutions May 17, 2013 CS162 Operating Systems
University of California, Berkeley College of Engineering Computer Science Division EECS Spring 2013 Anthony D. Joseph May 17, 2013 CS162 Operating Systems Your Name: SID AND 162 Login: TA Name: Discussion
More informationPage 1. Recap: File System Goals" Recap: Linked Allocation"
Recap: File System Goals" CS162 Operating Systems and Systems Programming Lecture 14 File Systems (cont d), Key Value Storage Systems" Maximize sequential performance Efiicient random access to file Easy
More informationChapter 11: Implementing File Systems
Silberschatz 1 Chapter 11: Implementing File Systems Thursday, November 08, 2007 9:55 PM File system = a system stores files on secondary storage. A disk may have more than one file system. Disk are divided
More informationFile Systems. File system interface (logical view) File system implementation (physical view)
File Systems File systems provide long-term information storage Must store large amounts of data Information stored must survive the termination of the process using it Multiple processes must be able
More informationCS 318 Principles of Operating Systems
CS 318 Principles of Operating Systems Fall 2018 Lecture 16: Advanced File Systems Ryan Huang Slides adapted from Andrea Arpaci-Dusseau s lecture 11/6/18 CS 318 Lecture 16 Advanced File Systems 2 11/6/18
More informationThe UNIX Time- Sharing System
The UNIX Time- Sharing System Dennis M. Ritchie and Ken Thompson Bell Laboratories Communications of the ACM July 1974, Volume 17, Number 7 UNIX overview Unix is a general-purpose, multi-user, interactive
More informationDa-Wei Chang CSIE.NCKU. Professor Hao-Ren Ke, National Chiao Tung University Professor Hsung-Pin Chang, National Chung Hsing University
Chapter 11 Implementing File System Da-Wei Chang CSIE.NCKU Source: Professor Hao-Ren Ke, National Chiao Tung University Professor Hsung-Pin Chang, National Chung Hsing University Outline File-System Structure
More informationTable 12.2 Information Elements of a File Directory
Table 12.2 Information Elements of a File Directory Basic Information File Name File Type File Organization Name as chosen by creator (user or program). Must be unique within a specific directory. For
More informationCSCI 350 Ch. 13 File & Directory Implementations. Mark Redekopp Michael Shindler & Ramesh Govindan
1 CSCI 35 Ch. 13 File & Directory Implementations Mark Redekopp Michael Shindler & Ramesh Govindan 2 Introduction File systems primarily map filenames to the disk blocks that contain the file data File
More informationPage 1. Review: Storage Performance" SSD Firmware Challenges" SSD Issues" CS162 Operating Systems and Systems Programming Lecture 14
Review: Storage Performance" Hard (Magnetic) Disk Performance: CS162 Operating Systems and Systems Programming Lecture 14 Latency = Queuing time + Controller + Seek + Rotational + Transfer Rotational latency:
More informationCS162 Operating Systems and Systems Programming Lecture 14 File Systems (Part 2)"
CS162 Operating Systems and Systems Programming Lecture 14 File Systems (Part 2)" March 17, 2014! Anthony D. Joseph! http://inst.eecs.berkeley.edu/~cs162! Review: Storage Performance" Hard (Magnetic) Disk
More informationChapter 11: File System Implementation. Objectives
Chapter 11: File System Implementation Objectives To describe the details of implementing local file systems and directory structures To describe the implementation of remote file systems To discuss block
More informationCS 162 Operating Systems and Systems Programming Professor: Anthony D. Joseph Spring Lecture 18: Naming, Directories, and File Caching
CS 162 Operating Systems and Systems Programming Professor: Anthony D. Joseph Spring 2004 Lecture 18: Naming, Directories, and File Caching 18.0 Main Points How do users name files? What is a name? Lookup:
More informationCS 162 Operating Systems and Systems Programming Professor: Anthony D. Joseph Spring Lecture 18: Naming, Directories, and File Caching
CS 162 Operating Systems and Systems Programming Professor: Anthony D. Joseph Spring 2002 Lecture 18: Naming, Directories, and File Caching 18.0 Main Points How do users name files? What is a name? Lookup:
More informationChapter 14: File-System Implementation
Chapter 14: File-System Implementation Directory Implementation Allocation Methods Free-Space Management Efficiency and Performance Recovery 14.1 Silberschatz, Galvin and Gagne 2013 Objectives To describe
More informationSecondary Storage (Chp. 5.4 disk hardware, Chp. 6 File Systems, Tanenbaum)
Secondary Storage (Chp. 5.4 disk hardware, Chp. 6 File Systems, Tanenbaum) Secondary Stora Introduction Secondary storage is the non volatile repository for (both user and system) data and programs. As
More informationFinal Exam Preparation Questions
EECS 678 Spring 2013 Final Exam Preparation Questions 1 Chapter 6 1. What is a critical section? What are the three conditions to be ensured by any solution to the critical section problem? 2. The following
More informationFile System Implementation
File System Implementation Last modified: 16.05.2017 1 File-System Structure Virtual File System and FUSE Directory Implementation Allocation Methods Free-Space Management Efficiency and Performance. Buffering
More informationCS4411 Intro. to Operating Systems Final Fall points 10 pages
CS44 Intro. to Operating Systems Final Exam Fall 9 CS44 Intro. to Operating Systems Final Fall 9 points pages Name: Most of the following questions only require very short answers. Usually a few sentences
More informatione-pg Pathshala Subject: Computer Science Paper: Operating Systems Module 35: File Allocation Methods Module No: CS/OS/35 Quadrant 1 e-text
e-pg Pathshala Subject: Computer Science Paper: Operating Systems Module 35: File Allocation Methods Module No: CS/OS/35 Quadrant 1 e-text 35.1 Introduction File system is the most visible part of the
More informationEI 338: Computer Systems Engineering (Operating Systems & Computer Architecture)
EI 338: Computer Systems Engineering (Operating Systems & Computer Architecture) Dept. of Computer Science & Engineering Chentao Wu wuct@cs.sjtu.edu.cn Download lectures ftp://public.sjtu.edu.cn User:
More informationRicardo Rocha. Department of Computer Science Faculty of Sciences University of Porto
Ricardo Rocha Department of Computer Science Faculty of Sciences University of Porto Slides based on the book Operating System Concepts, 9th Edition, Abraham Silberschatz, Peter B. Galvin and Greg Gagne,
More informationSegmentation with Paging. Review. Segmentation with Page (MULTICS) Segmentation with Page (MULTICS) Segmentation with Page (MULTICS)
Review Segmentation Segmentation Implementation Advantage of Segmentation Protection Sharing Segmentation with Paging Segmentation with Paging Segmentation with Paging Reason for the segmentation with
More informationFile Layout and Directories
COS 318: Operating Systems File Layout and Directories Jaswinder Pal Singh Computer Science Department Princeton University (http://www.cs.princeton.edu/courses/cos318/) Topics File system structure Disk
More informationDepartment of Computer Engineering University of California at Santa Cruz. File Systems. Hai Tao
File Systems Hai Tao File System File system is used to store sources, objects, libraries and executables, numeric data, text, video, audio, etc. The file system provide access and control function for
More informationFile. File System Implementation. Operations. Permissions and Data Layout. Storing and Accessing File Data. Opening a File
File File System Implementation Operating Systems Hebrew University Spring 2007 Sequence of bytes, with no structure as far as the operating system is concerned. The only operations are to read and write
More informationChapter 12: File System Implementation
Chapter 12: File System Implementation Silberschatz, Galvin and Gagne 2013 Chapter 12: File System Implementation File-System Structure File-System Implementation Allocation Methods Free-Space Management
More informationV. File System. SGG9: chapter 11. Files, directories, sharing FS layers, partitions, allocations, free space. TDIU11: Operating Systems
V. File System SGG9: chapter 11 Files, directories, sharing FS layers, partitions, allocations, free space TDIU11: Operating Systems Ahmed Rezine, Linköping University Copyright Notice: The lecture notes
More informationSMD149 - Operating Systems - File systems
SMD149 - Operating Systems - File systems Roland Parviainen November 21, 2005 1 / 59 Outline Overview Files, directories Data integrity Transaction based file systems 2 / 59 Files Overview Named collection
More informationECE 598 Advanced Operating Systems Lecture 18
ECE 598 Advanced Operating Systems Lecture 18 Vince Weaver http://web.eece.maine.edu/~vweaver vincent.weaver@maine.edu 5 April 2016 Homework #7 was posted Project update Announcements 1 More like a 571
More informationW4118 Operating Systems. Instructor: Junfeng Yang
W4118 Operating Systems Instructor: Junfeng Yang File systems in Linux Linux Second Extended File System (Ext2) What is the EXT2 on-disk layout? What is the EXT2 directory structure? Linux Third Extended
More informationFrequently asked questions from the previous class survey
CS 370: OPERATING SYSTEMS [FILE SYSTEMS] Shrideep Pallickara Computer Science Colorado State University L28.1 Frequently asked questions from the previous class survey How are files recovered if the drive
More informationFile System: Interface and Implmentation
File System: Interface and Implmentation Two Parts Filesystem Interface Interface the user sees Organization of the files as seen by the user Operations defined on files Properties that can be read/modified
More informationCS3600 SYSTEMS AND NETWORKS
CS3600 SYSTEMS AND NETWORKS NORTHEASTERN UNIVERSITY Lecture 11: File System Implementation Prof. Alan Mislove (amislove@ccs.neu.edu) File-System Structure File structure Logical storage unit Collection
More informationLocal File Stores. Job of a File Store. Physical Disk Layout CIS657
Local File Stores CIS657 Job of a File Store Recall that the File System is responsible for namespace management, locking, quotas, etc. The File Store s responsbility is to mange the placement of data
More informationFilesystem. Disclaimer: some slides are adopted from book authors slides with permission 1
Filesystem Disclaimer: some slides are adopted from book authors slides with permission 1 Storage Subsystem in Linux OS Inode cache User Applications System call Interface Virtual File System (VFS) Filesystem
More informationChe-Wei Chang Department of Computer Science and Information Engineering, Chang Gung University
Che-Wei Chang chewei@mail.cgu.edu.tw Department of Computer Science and Information Engineering, Chang Gung University Chapter 10: File System Chapter 11: Implementing File-Systems Chapter 12: Mass-Storage
More informationLecture 19: File System Implementation. Mythili Vutukuru IIT Bombay
Lecture 19: File System Implementation Mythili Vutukuru IIT Bombay File System An organization of files and directories on disk OS has one or more file systems Two main aspects of file systems Data structures
More informationFall COMP3511 Review
Outline Fall 2015 - COMP3511 Review Monitor Deadlock and Banker Algorithm Paging and Segmentation Page Replacement Algorithms and Working-set Model File Allocation Disk Scheduling Review.2 Monitors Condition
More informationChapter 8: Filesystem Implementation
ADRIAN PERRIG & TORSTEN HOEFLER ( 252-0062-00 ) Networks and Operating Systems Chapter 8: Filesystem Implementation source: xkcd.com Access Control 1 Protection File owner/creator should be able to control:
More informationCS370 Operating Systems
CS370 Operating Systems Colorado State University Yashwant K Malaiya Spring 2018 Lecture 22 File Systems Slides based on Text by Silberschatz, Galvin, Gagne Various sources 1 1 Disk Structure Disk can
More informationCS370: System Architecture & Software [Fall 2014] Dept. Of Computer Science, Colorado State University
Frequently asked questions from the previous class survey CS 370: SYSTEM ARCHITECTURE & SOFTWARE [FILE SYSTEMS] Interpretation of metdata from different file systems Error Correction on hard disks? Shrideep
More informationCS370: Operating Systems [Spring 2017] Dept. Of Computer Science, Colorado State University
Frequently asked questions from the previous class survey CS 370: OPERATING SYSTEMS [FILE SYSTEMS] Shrideep Pallickara Computer Science Colorado State University If you have a file with scattered blocks,
More informationChapter 6: File Systems
Chapter 6: File Systems File systems Files Directories & naming File system implementation Example file systems Chapter 6 2 Long-term information storage Must store large amounts of data Gigabytes -> terabytes
More informationMidterm II December 4 th, 2006 CS162: Operating Systems and Systems Programming
Fall 2006 University of California, Berkeley College of Engineering Computer Science Division EECS John Kubiatowicz Midterm II December 4 th, 2006 CS162: Operating Systems and Systems Programming Your
More informationQuestion Points Score Total 100
Midterm #2 CMSC 412 Operating Systems Fall 2005 November 22, 2004 Guidelines This exam has 7 pages (including this one); make sure you have them all. Put your name on each page before starting the exam.
More informationCS 416: Opera-ng Systems Design May 2, 2012
Question 1 Under what conditions will you reach a point of diminishing returns where adding more memory may improve performance only a little? Operating Systems Design Exam 2 Review: Spring 2012 When there
More informationWindows File System. File allocation table (FAT) NTFS - New Technology File System. used in Windows 95, and MS-DOS
Windows File System Windows File System File allocation table (FAT) used in Windows 95, and MS-DOS NTFS - New Technology File System 2 Key features of NTFS NTFS uses clusters(rather than sectors) as units
More informationFile. File System Implementation. File Metadata. File System Implementation. Direct Memory Access Cont. Hardware background: Direct Memory Access
File File System Implementation Operating Systems Hebrew University Spring 2009 Sequence of bytes, with no structure as far as the operating system is concerned. The only operations are to read and write
More informationChapter 12: File System Implementation
Chapter 12: File System Implementation Virtual File Systems. Allocation Methods. Folder Implementation. Free-Space Management. Directory Block Placement. Recovery. Virtual File Systems An object-oriented
More information