Operating Systems 2010/2011
|
|
- Erika Barker
- 6 years ago
- Views:
Transcription
1 Operating Systems 2010/2011 Input/Output Systems part 2 (ch13, ch12) Shudong Chen 1
2 Recap Discuss the principles of I/O hardware and its complexity Explore the structure of an operating system s I/O subsystem application I/O interface 2
3 Layered view on i/o kernel API listen/accept/bind/ connect/send/receive driver standardizes device interface + seek raw device driver level layered protocol stack 3
4 Agenda I/O Hardware Application I/O Interface Kernel I/O Subsystem Transforming I/O Requests to Hardware Operations Streams Performance (disk scheduling) RAID TU/e Computer Science, System Architecture and Networking 04/01/2011 4
5 I/O subsystems (services) Scheduling Buffering Caching Spooling Device reservation Error handling Protection 5
6 I/O scheduling Scheduling determine a good order in which to execute a set of I/O requests improve overall system performance share device access fairly among processes reduce the average waiting time for I/O to complete Example: disk scheduling, see later I/O scheduler Some I/O request ordering via per-device queue OS maintains a wait queue of requests for each device When an I/O system call is issued, the request is placed on the queue for that device I/O scheduler rearrange the order of the queue to improve the overall system efficiency and the average response time of the request Some OSs try fairness so that no one application receives especially poor service Some OSs give priority service for delay-sensitive request e.g., requests from virtual memory subsystem take priority over application requests the essence of I/O scheduling 6
7 Device-status Table To keep track of many I/O request at the same time OS attach the wait queue to a devicestatus table Contains an entry for each I/O device Each entry indicates the device s type, address, and state The type of request with parameters are stored in the table entry for that device 7
8 Buffering, motivation A buffer is a memory area that stores data being transferred between two devices or between a device and an application. General efficiency To cope with device speed mismatch, e.g., storing a file which is received from a modem on a hard disk A modem is slower than a hard disk Bytes are accumulated in a modem buffer With a full buffer, the data is written to the disk in a single operation To cope with device transfer size mismatch fragmentation and reassembly of network messages Large messages are fragmented for small packets for sending At the receiving side: they are placed in a reassembly buffer to form an image of the source data. To maintain copy semantics Write() system call use kernel buffer to store application data Disk write is performed from the kernel buffer Subsequent changes to the application buffer have no effect 8
9 Buffering alternatives picture from Stallings, Operating Systems Principles 9
10 Buffer use schemes for producer/consumer No buffering either party provides buffer address at least that party may not be swapped out even though the operation may be queued or delayed can relax to: the (shared) buffer must not be swapped out producer and consumer must be in same context during transfer (or: must share this buffer context) no concurrency One buffer can swap process out needs management buffers become internal kernel data structures notice: swapping the process makes no sense if pending operation is input from same io device (disk) as swapping is onto 10
11 Schemes for producer/consumer Two buffers (buffer swapping) admit concurrency in producer and consumer e.g. interrupt handler and data usage copying the other buffer from kernel to user space running the application two processors running consumer and producer concurrently including their kernel activities disadvantage: latency, proportional to buffer size More buffers the general consumer/producer scheme implementation: circular buffers (fixed in size) & buffer queues (extensible) admits bursts 11
12 Caching, Spooling and Device Reservation Caching - fast memory holding copies of data Always just a copy, e.g., Shared files among applications Rapidly written and reread files Key to performance Access to the cached copy is more efficient than access to the original If cache available in main memory, then physical I/O can be avoided the delaying writes strategy: accumulate writes in buffer and allow large transfer Spooling - hold output for a device If device can serve only one request at a time, i.e., printing Each application s output is spooled to a separate disk file After one printing finishes, the spooling system queues the corresponding spool file for output to the printer Device reservation - provides exclusive access to a device System calls for idle device allocation and deallocation Watch out for deadlock Enforce a limit of one open file handle to such a device Provide functions that enable processes to coordinate exclusive access among themselves 12
13 Error Handling Devices and I/O transfers can fail in many ways transient reasons: overloaded network permanent reasons: a defective disk controller OS can recover from transient failures disk read() failure a read() retry network send() error a resend() Most return an error number or code when I/O request fails errno in Unix --- to applications detailed error information provided by hardware --- hidden to applications System error logs hold problem reports 13
14 I/O Protection User process may accidentally or purposefully attempt to disrupt normal operation via illegal I/O instructions All I/O instructions defined to be privileged Users cannot issue I/O instructions directly They can only do it through the OS I/O must be performed via system calls Memory-mapped and I/O port memory locations must be protected too Use of a System Call to Perform I/O 14
15 The kernel keeps state information for I/O components, including open file tables network connections character device state Many, many complex data structures to track buffers, memory allocation, dirty blocks Kernel Data Structures Unix encapsulates these differences within a uniform structure using an object-oriented technique The open-file record contains a dispatch table that holds pointers to the appropriate routines, depending on the type of file UNIX I/O kernel structure Windows NT uses a message-passing implementation for I/O I/O requests are converted into messages, sent to the I/O manager and then to the device driver. Pros and Cons: simplifies the structure and design of the I/O system and adds flexibility add overhead 15
16 Agenda I/O Hardware Application I/O Interface Kernel I/O Subsystem Transforming I/O Requests to Hardware Operations Streams Performance (disk scheduling) RAID TU/e Computer Science, System Architecture and Networking 04/01/
17 Basic handshaking between host & controller Handshaking example (output operation) --- the following loop is repeated for each byte 1. The host repeatedly reads the busy bit until that bit becomes clear 2. The host sets the write bit in the command register and writes a byte into the data-out register 3. The host sets the command-ready bit CPU is busy-waiting or polling 4. When the controller notices that the command-ready bit is set, it sets the busy bit 5. The controller reads the command register and sees the write command. It reads the data-out register to get the byte and does the I/O to the device 6. The controller clears the command-ready bit, clears the error bit in the status register to indicate that the device I/O succeeded, and clears the busy bit to indicate that it is finished TU/e Computer Science, System Architecture and Networking 04/01/
18 Transforming I/O requests to hardware operations Consider reading a file from disk for a process: Determine the device holding the file Translate the file name to a device representation The application refers to the data by a file name. Within a disk, FS maps from the file name through the FS descriptors to obtain the space allocation of the file. OSs obtain flexibility from the multiple stages of lookup tables in the path between a request and a physical device controller. Physically read data from disk into buffer Make data available to requesting process Return control to process 18
19 Life cycle of a blocking I/O request 19
20 Agenda I/O Hardware Application I/O Interface Kernel I/O Subsystem Transforming I/O Requests to Hardware Operations Streams Performance (disk scheduling) RAID TU/e Computer Science, System Architecture and Networking 04/01/
21 STREAMS STREAM a full-duplex communication channel between a user-level process and a device in Unix System V and beyond A STREAM consists of: STREAM head interfaces with the user process driver end interfaces with the device zero or more STREAM modules between them Each module contains a read queue and a write queue Message passing is used to communicate between queues in adjacent modules Functionalities of STREAMS ioctl (): to push modules onto a stream write() or putmsg() : to write data to a device read() or getmsg() : to read data from the stream head the STREAMS structure 21
22 Agenda I/O Hardware Application I/O Interface Kernel I/O Subsystem Transforming I/O Requests to Hardware Operations Streams Performance (disk scheduling) RAID TU/e Computer Science, System Architecture and Networking 04/01/
23 Performance I/O is a major factor in system performance: demands CPU to execute device driver, kernel I/O code results in context switches due to interrupts load down memory bus during data copying network traffic is especially stressful causes high context switch rate Improving performance reduce the number of context switches reduce the number of times of data copying reduce the frequency of interrupts by using large transfers, smart controllers, polling (if busy waiting can be minimized) use DMA or channel to offload simple data copying from the CPU balance CPU, memory, bus, and I/O performance for the highest throughput 23
24 Scheduling example: rotating disk Information is stored on platters by recording it magnetically. A read-write head flies above each platter. The heads are attached to a disk arm that moves all the heads as a unit. The surface is logically divided into circular tracks, which are subdivided into sectors. The set of tracks that are at one arm position makes up a cylinder. Most disks rotate 60 to 200 times per second. Tracks and sectors per surface numbering takes head movement into account; two or more sides 24
25 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 (positioning time) has two major components Seek time is the time for the disk 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. Optimize disk access time for a series of requests: minimize seek time Disk bandwidth (transfer rate) 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. We can improve both the access time and the bandwidth by managing the order in which disk I/O requests are serviced. 25
26 Disk scheduling (Cont.) Several algorithms exist to schedule the servicing of disk I/O requests. We illustrate them with a request queue for I/O to blocks on cylinders: 98, 183, 37, 122, 14, 124, 65, 67 Head starts at 53 26
27 FCFS (first-come, first-served) Intrinsically fair But does not provide the fastest service Illustration shows total head movement of 640 cylinders 27
28 SSTF (shortest-seek-time-first) 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. 28
29 SCAN 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. 29
30 C-SCAN (circular SCAN) Treats the cylinders as a circular list that wraps around from the last cylinder to the first one. 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. Provides a more uniform wait time than SCAN. 30
31 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. 31
32 Selecting a disk-scheduling algorithm SSTF is common and has a natural appeal It increases performance over FCFS. SCAN and C-SCAN perform better for systems that place a heavy load on the disk. They are less likely to cause a starvation problem. Requests for disk service can be influenced by the file-allocation method. Reading a contiguously allocated file may results in less head movement than reading a linked or indexed file. The location of directory and index blocks is also important caching can help 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 is a reasonable choice for the default algorithm. 32
33 Agenda I/O Hardware Application I/O Interface Kernel I/O Subsystem Transforming I/O Requests to Hardware Operations Streams Performance (disk scheduling) RAIDs (Redundant Arrays of Independent Disks) TU/e Computer Science, System Architecture and Networking 04/01/
34 Availability and Reliability System reliability: the ability of a system or component to perform its required functions under stated conditions for a specified period of time (IEEE definition) identified by the mean time to failure (MTTF) formally: the probability to function for a period t: reliability (t) = exp (-t/mttf) (negative exponential distribution with expected value MTTF) alternatively: the expected time until the system fails System availability the degree to which a system or component is operational and accessible when required for use (IEEE) formally: the probability that the system is functioning equivalently: the fraction of time it is functioning 34
35 Relationship Can a system be: highly available while unreliable? yes, assume it fails every second, while recovering in 0.01 second highly reliable while unavailable? yes, take a MTTF of a year and no recovery Hence, the (mean) time to repair (MTTR) plays a role Formally, Availability = MTTF / (MTTF + MTTR) Increasing MTTF improves both reliability and availability 35
36 How to increase MTTF Generally, increasing the number of components decreases reliability of a system more opportunities of failing MTTF(N disks) = MTTF(1 disk) / N only particular organizations and combinations increase reliability RAID: combine a series of disks to improve average data access times total throughput reliability, through redundancy and replication based on a paper by Patterson et. al. Patterson, Gibs and Katz, A case for redundant arrays of inexpensive disks, Proc. of the 1988 ACM SIGMOD international conference on Management of data, as opposed to SLED single large expensive disks Inexpensive since then superseded by independent 36
37 RAID terminology Raid levels: levels indicate particular approaches, not monotonic improvements Stripes (or strips): logical units of data, fragments size dependent on RAID level Striping, Striped the mapping of stripes to disks defined by the RAID level 37
38 Level 0: increase performance Level 0: distribute a single logical disk by a round-robin mapping of stripes concurrent access of consecutive strips high transfer rate concurrent handling of independent requests short response time pictures taken from Wikipedia 38
39 Level 1: mirror Level 1: make a full copy of a disk (or of another RAID level system) concurrent read requests double writes (slight penalty for synchronization) simple recovery 39
40 Level 2: error correcting codes Level 2: use error correcting codes over small strips bit level the ECC bits go to separate disks Properties all disks involved in all reading, writing less space wasted than level 1 regarded as overkill does not take the failure model into account (= single disk failing, not just a bit) 40
41 Levels 3+4: parity strip Level 3: strip is one byte, or bit Level 4: strip is one block Parities stored on an extra disk this serves as a backup disk for an arbitrary failing disk can recompute the values in the missing disk Properties concurrent access of stripes high transfer rate for large transfers level 4 allows independent transactions as well extra disk becomes write hotspot 41
42 Parity computation Parity of two bits: P(b0, b1) = (b0 b1) parity is one iff the bits are unequal exclusive or, xor Assume X4 = X3 xor X2 xor X1 xor X0 Modify X1 to X1 X4 = X3 xor X2 xor X1 xor X0 = X3 xor X2 xor X1 xor X0 xor X1 xor X1 = X3 xor X2 xor X1 xor X0 xor X1 xor X1 = X4 xor X1 xor X1 42
43 Levels 5+6: distributed parity Level 5: just distribute the RAID 4 parity addresses the hotspot problem Level 6: add two redundancy bits of different data-check algorithms published one year later ( 89) allows two drive failures 43
44 RAID (0 + 1) and (1 + 0) RAID 0 + 1: a set of disks are striped, and then the stripe is mirrored to another, equivalent stripe RAID 1 + 0: disks are mirrored as pairs, and then these mirrored pairs are striped has theoretical advantages over RAID single disk failure will not lead to an entire stripe inaccessible 44
45 Exercises Ch12 2, 8 Check website TU/e Computer Science, System Architecture and Networking 04/01/
Chapter 13: I/O Systems
Chapter 13: I/O Systems I/O Hardware Application I/O Interface Kernel I/O Subsystem Transforming I/O Requests to Hardware Operations Streams Performance Objectives Explore the structure of an operating
More informationChapter 13: I/O Systems
Chapter 13: I/O Systems Chapter 13: I/O Systems I/O Hardware Application I/O Interface Kernel I/O Subsystem Transforming I/O Requests to Hardware Operations Streams Performance 13.2 Silberschatz, Galvin
More informationChapter 13: I/O Systems
Chapter 13: I/O Systems Chapter 13: I/O Systems I/O Hardware Application I/O Interface Kernel I/O Subsystem Transforming I/O Requests to Hardware Operations Streams Performance 13.2 Silberschatz, Galvin
More informationChapter 13: I/O Systems. Chapter 13: I/O Systems. Objectives. I/O Hardware. A Typical PC Bus Structure. Device I/O Port Locations on PCs (partial)
Chapter 13: I/O Systems Chapter 13: I/O Systems I/O Hardware Application I/O Interface Kernel I/O Subsystem Transforming I/O Requests to Hardware Operations Streams Performance 13.2 Silberschatz, Galvin
More informationChapter 13: I/O Systems
Chapter 13: I/O Systems DM510-14 Chapter 13: I/O Systems I/O Hardware Application I/O Interface Kernel I/O Subsystem Transforming I/O Requests to Hardware Operations STREAMS Performance 13.2 Objectives
More informationChapter 13: I/O Systems
Chapter 13: I/O Systems Chapter 13: I/O Systems I/O Hardware Application I/O Interface Kernel I/O Subsystem Transforming I/O Requests to Hardware Operations Streams Performance 13.2 Silberschatz, Galvin
More informationChapter 12: I/O Systems
Chapter 12: I/O Systems Chapter 12: I/O Systems I/O Hardware! Application I/O Interface! Kernel I/O Subsystem! Transforming I/O Requests to Hardware Operations! STREAMS! Performance! Silberschatz, Galvin
More informationChapter 13: I/O Systems
Chapter 13: I/O Systems Chapter 13: I/O Systems I/O Hardware Application I/O Interface Kernel I/O Subsystem Transforming I/O Requests to Hardware Operations STREAMS Performance Silberschatz, Galvin and
More informationChapter 12: I/O Systems. Operating System Concepts Essentials 8 th Edition
Chapter 12: I/O Systems Silberschatz, Galvin and Gagne 2011 Chapter 12: I/O Systems I/O Hardware Application I/O Interface Kernel I/O Subsystem Transforming I/O Requests to Hardware Operations STREAMS
More informationCSC Operating Systems Spring Lecture - XIX Storage and I/O - II. Tevfik Koşar. Louisiana State University.
CSC 4103 - Operating Systems Spring 2007 Lecture - XIX Storage and I/O - II Tevfik Koşar Louisiana State University April 10 th, 2007 1 RAID Structure As disks get cheaper, adding multiple disks to the
More informationRAID Structure. RAID Levels. RAID (cont) RAID (0 + 1) and (1 + 0) Tevfik Koşar. Hierarchical Storage Management (HSM)
CSC 4103 - Operating Systems Spring 2007 Lecture - XIX Storage and I/O - II Tevfik Koşar RAID Structure As disks get cheaper, adding multiple disks to the same system provides increased storage space,
More informationModule 13: Secondary-Storage Structure
Module 13: Secondary-Storage Structure Disk Structure Disk Scheduling Disk Management Swap-Space Management Disk Reliability Stable-Storage Implementation Operating System Concepts 13.1 Silberschatz and
More informationRef: Chap 12. Secondary Storage and I/O Systems. Applied Operating System Concepts 12.1
Ref: Chap 12 Secondary Storage and I/O Systems Applied Operating System Concepts 12.1 Part 1 - Secondary Storage Secondary storage typically: is anything that is outside of primary memory does not permit
More informationModule 12: I/O Systems
Module 12: I/O Systems I/O hardwared Application I/O Interface Kernel I/O Subsystem Transforming I/O Requests to Hardware Operations Performance 12.1 I/O Hardware Incredible variety of I/O devices Common
More informationDevice-Functionality Progression
Chapter 12: I/O Systems I/O Hardware I/O Hardware Application I/O Interface Kernel I/O Subsystem Transforming I/O Requests to Hardware Operations Incredible variety of I/O devices Common concepts Port
More informationChapter 12: I/O Systems. I/O Hardware
Chapter 12: I/O Systems I/O Hardware Application I/O Interface Kernel I/O Subsystem Transforming I/O Requests to Hardware Operations I/O Hardware Incredible variety of I/O devices Common concepts Port
More informationI/O SYSTEMS. Sunu Wibirama
I/O SYSTEMS Sunu Wibirama Are you surely IT class member? Then you should know these pictures... Introduction Main job of computer : I/O and processing (the latter is rarely happened) Browsing: read and
More informationI/O Systems. Amir H. Payberah. Amirkabir University of Technology (Tehran Polytechnic)
I/O Systems Amir H. Payberah amir@sics.se Amirkabir University of Technology (Tehran Polytechnic) Amir H. Payberah (Tehran Polytechnic) I/O Systems 1393/9/15 1 / 57 Motivation Amir H. Payberah (Tehran
More informationDisk Scheduling. Based on the slides supporting the text
Disk Scheduling Based on the slides supporting the text 1 User-Space I/O Software Layers of the I/O system and the main functions of each layer 2 Disk Structure Disk drives are addressed as large 1-dimensional
More informationI/O, Disks, and RAID Yi Shi Fall Xi an Jiaotong University
I/O, Disks, and RAID Yi Shi Fall 2017 Xi an Jiaotong University Goals for Today Disks How does a computer system permanently store data? RAID How to make storage both efficient and reliable? 2 What does
More informationChapter 10: Mass-Storage Systems
Chapter 10: Mass-Storage Systems Silberschatz, Galvin and Gagne Overview of Mass Storage Structure Magnetic disks provide bulk of secondary storage of modern computers Drives rotate at 60 to 200 times
More informationI/O Handling. ECE 650 Systems Programming & Engineering Duke University, Spring Based on Operating Systems Concepts, Silberschatz Chapter 13
I/O Handling ECE 650 Systems Programming & Engineering Duke University, Spring 2018 Based on Operating Systems Concepts, Silberschatz Chapter 13 Input/Output (I/O) Typical application flow consists of
More informationCSE325 Principles of Operating Systems. Mass-Storage Systems. David P. Duggan. April 19, 2011
CSE325 Principles of Operating Systems Mass-Storage Systems David P. Duggan dduggan@sandia.gov April 19, 2011 Outline Storage Devices Disk Scheduling FCFS SSTF SCAN, C-SCAN LOOK, C-LOOK Redundant Arrays
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 informationby I.-C. Lin, Dept. CS, NCTU. Textbook: Operating System Concepts 8ed CHAPTER 13: I/O SYSTEMS
by I.-C. Lin, Dept. CS, NCTU. Textbook: Operating System Concepts 8ed CHAPTER 13: I/O SYSTEMS Chapter 13: I/O Systems I/O Hardware Application I/O Interface Kernel I/O Subsystem Transforming I/O Requests
More informationSilberschatz and Galvin Chapter 12
Silberschatz and Galvin Chapter 12 I/O Systems CPSC 410--Richard Furuta 3/19/99 1 Topic overview I/O Hardware Application I/O Interface Kernel I/O Subsystem Transforming I/O requests to hardware operations
More informationChapter 13: I/O Systems
Chapter 13: I/O Systems I/O Hardware Application I/O Interface Kernel I/O Subsystem Transforming I/O Requests to Hardware Operations Streams Performance I/O Hardware Incredible variety of I/O devices Common
More informationChapter 13: I/O Systems. Operating System Concepts 9 th Edition
Chapter 13: I/O Systems Silberschatz, Galvin and Gagne 2013 Chapter 13: I/O Systems Overview I/O Hardware Application I/O Interface Kernel I/O Subsystem Transforming I/O Requests to Hardware Operations
More informationCSCI-GA Operating Systems. I/O : Disk Scheduling and RAID. Hubertus Franke
CSCI-GA.2250-001 Operating Systems I/O : Disk Scheduling and RAID Hubertus Franke frankeh@cs.nyu.edu Disks Scheduling Abstracted by OS as files A Conventional Hard Disk (Magnetic) Structure Hard Disk
More informationDisk Scheduling. Chapter 14 Based on the slides supporting the text and B.Ramamurthy s slides from Spring 2001
Disk Scheduling Chapter 14 Based on the slides supporting the text and B.Ramamurthy s slides from Spring 2001 1 User-Space I/O Software Layers of the I/O system and the main functions of each layer 2 Disks
More informationModule 12: I/O Systems
Module 12: I/O Systems I/O Hardware Application I/O Interface Kernel I/O Subsystem Transforming I/O Requests to Hardware Operations Performance Operating System Concepts 12.1 Silberschatz and Galvin c
More informationCHAPTER 12 AND 13 - MASS-STORAGE STRUCTURE & I/O- SYSTEMS
CHAPTER 12 AND 13 - MASS-STORAGE STRUCTURE & I/O- SYSTEMS OBJECTIVES Describe physical structure of secondary storage devices and its effects on the uses of the devices Explain the performance char. of
More informationCS420: Operating Systems. Kernel I/O Subsystem
Kernel I/O Subsystem James Moscola Department of Physical Sciences York College of Pennsylvania Based on Operating System Concepts, 9th Edition by Silberschatz, Galvin, Gagne A Kernel I/O Structure 2 Kernel
More informationLecture 9. I/O Management and Disk Scheduling Algorithms
Lecture 9 I/O Management and Disk Scheduling Algorithms 1 Lecture Contents 1. I/O Devices 2. Operating System Design Issues 3. Disk Scheduling Algorithms 4. RAID (Redundant Array of Independent Disks)
More informationV. Mass Storage Systems
TDIU25: Operating Systems V. Mass Storage Systems SGG9: chapter 12 o Mass storage: Hard disks, structure, scheduling, RAID Copyright Notice: The lecture notes are mainly based on modifications of the slides
More informationLecture 13 Input/Output (I/O) Systems (chapter 13)
Bilkent University Department of Computer Engineering CS342 Operating Systems Lecture 13 Input/Output (I/O) Systems (chapter 13) Dr. İbrahim Körpeoğlu http://www.cs.bilkent.edu.tr/~korpe 1 References The
More informationChapter 10: Mass-Storage Systems. Operating System Concepts 9 th Edition
Chapter 10: Mass-Storage Systems Silberschatz, Galvin and Gagne 2013 Chapter 10: Mass-Storage Systems Overview of Mass Storage Structure Disk Structure Disk Attachment Disk Scheduling Disk Management Swap-Space
More informationCS 471 Operating Systems. Yue Cheng. George Mason University Fall 2017
CS 471 Operating Systems Yue Cheng George Mason University Fall 2017 Review: Disks 2 Device I/O Protocol Variants o Status checks Polling Interrupts o Data PIO DMA 3 Disks o Doing an disk I/O requires:
More informationChapter 14: Mass-Storage Systems. Disk Structure
1 Chapter 14: Mass-Storage Systems Disk Structure Disk Scheduling Disk Management Swap-Space Management RAID Structure Disk Attachment Stable-Storage Implementation Tertiary Storage Devices Operating System
More informationChapter 10: Mass-Storage Systems
Chapter 10: Mass-Storage Systems Silberschatz, Galvin and Gagne 2013 Chapter 10: Mass-Storage Systems Overview of Mass Storage Structure Disk Structure Disk Attachment Disk Scheduling Disk Management Swap-Space
More informationOperating System 1 (ECS-501)
Operating System 1 (ECS-501) 1. Mass Storage Structure: 1.1 Disk Structure: Unit- V I/O Management & Disk Scheduling A. Magnetic disks provide bulk of secondary storage of modern computers Drives rotate
More informationUNIT 4 Device Management
UNIT 4 Device Management (A) Device Function. (B) Device Characteristic. (C) Disk space Management. (D) Allocation and Disk scheduling Methods. [4.1] Device Management Functions The management of I/O devices
More informationCSE380 - Operating Systems. Communicating with Devices
CSE380 - Operating Systems Notes for Lecture 15-11/4/04 Matt Blaze (some examples by Insup Lee) Communicating with Devices Modern architectures support convenient communication with devices memory mapped
More informationUNIT-7. Overview of Mass Storage Structure
Overview of Mass Storage Structure UNIT-7 Magnetic disks provide bulk of secondary storage of modern computers Drives rotate at 60 to 200 times per second Transfer rate is rate at which data flow between
More informationChapter 12: Mass-Storage Systems. Operating System Concepts 8 th Edition,
Chapter 12: Mass-Storage Systems, Silberschatz, Galvin and Gagne 2009 Chapter 12: Mass-Storage Systems Overview of Mass Storage Structure Disk Structure Disk Scheduling 12.2 Silberschatz, Galvin and Gagne
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 l Chapter 10: File System l Chapter 11: Implementing File-Systems l Chapter 12: Mass-Storage
More informationMass-Storage Structure
CS 4410 Operating Systems Mass-Storage Structure Summer 2011 Cornell University 1 Today How is data saved in the hard disk? Magnetic disk Disk speed parameters Disk Scheduling RAID Structure 2 Secondary
More informationThe control of I/O devices is a major concern for OS designers
Lecture Overview I/O devices I/O hardware Interrupts Direct memory access Device dimensions Device drivers Kernel I/O subsystem Operating Systems - June 26, 2001 I/O Device Issues The control of I/O devices
More informationChapter-6. SUBJECT:- Operating System TOPICS:- I/O Management. Created by : - Sanjay Patel
Chapter-6 SUBJECT:- Operating System TOPICS:- I/O Management Created by : - Sanjay Patel Disk Scheduling Algorithm 1) First-In-First-Out (FIFO) 2) Shortest Service Time First (SSTF) 3) SCAN 4) Circular-SCAN
More informationCS3600 SYSTEMS AND NETWORKS
CS3600 SYSTEMS AND NETWORKS NORTHEASTERN UNIVERSITY Lecture 9: Mass Storage Structure Prof. Alan Mislove (amislove@ccs.neu.edu) Moving-head Disk Mechanism 2 Overview of Mass Storage Structure Magnetic
More informationChapter 12: Secondary-Storage Structure. Operating System Concepts 8 th Edition,
Chapter 12: Secondary-Storage Structure, Silberschatz, Galvin and Gagne 2009 Chapter 12: Secondary-Storage Structure Overview of Mass Storage Structure Disk Structure Disk Attachment Disk Scheduling Disk
More informationChapter 13: I/O Systems
COP 4610: Introduction to Operating Systems (Spring 2015) Chapter 13: I/O Systems Zhi Wang Florida State University Content I/O hardware Application I/O interface Kernel I/O subsystem I/O performance Objectives
More informationChapter 12: Mass-Storage
Chapter 12: Mass-Storage Systems Chapter 12: Mass-Storage Systems Revised 2010. Tao Yang Overview of Mass Storage Structure Disk Structure Disk Attachment Disk Scheduling Disk Management Swap-Space Management
More informationChapter 13: Mass-Storage Systems. Disk Scheduling. Disk Scheduling (Cont.) Disk Structure FCFS. Moving-Head Disk Mechanism
Chapter 13: Mass-Storage Systems Disk Scheduling Disk Structure Disk Scheduling Disk Management Swap-Space Management RAID Structure Disk Attachment Stable-Storage Implementation Tertiary Storage Devices
More informationChapter 13: Mass-Storage Systems. Disk Structure
Chapter 13: Mass-Storage Systems Disk Structure Disk Scheduling Disk Management Swap-Space Management RAID Structure Disk Attachment Stable-Storage Implementation Tertiary Storage Devices Operating System
More informationTape pictures. CSE 30341: Operating Systems Principles
Tape pictures 4/11/07 CSE 30341: Operating Systems Principles page 1 Tape Drives The basic operations for a tape drive differ from those of a disk drive. locate positions the tape to a specific logical
More informationUC Santa Barbara. Operating Systems. Christopher Kruegel Department of Computer Science UC Santa Barbara
Operating Systems Christopher Kruegel Department of Computer Science http://www.cs.ucsb.edu/~chris/ Input and Output Input/Output Devices The OS is responsible for managing I/O devices Issue requests Manage
More informationDisk scheduling Disk reliability Tertiary storage Swap space management Linux swap space management
Lecture Overview Mass storage devices Disk scheduling Disk reliability Tertiary storage Swap space management Linux swap space management Operating Systems - June 28, 2001 Disk Structure Disk drives are
More informationChapter 13: I/O Systems
Chapter 13: I/O Systems Silberschatz, Galvin and Gagne 2013! Chapter 13: I/O Systems I/O Hardware" Application I/O Interface" Kernel I/O Subsystem" Transforming I/O Requests to Hardware Operations" STREAMS"
More informationCSE 380 Computer Operating Systems
CSE 380 Computer Operating Systems Instructor: Insup Lee University of Pennsylvania Fall 2003 Lecture Note on Disk I/O 1 I/O Devices Storage devices Floppy, Magnetic disk, Magnetic tape, CD-ROM, DVD User
More informationOPERATING SYSTEMS CS3502 Spring Input/Output System Chapter 9
OPERATING SYSTEMS CS3502 Spring 2018 Input/Output System Chapter 9 Input/Output System Major objectives: An application s I/O requests are sent to the I/O device. Take whatever response comes back from
More informationChapter 14 Mass-Storage Structure
Chapter 14 Mass-Storage Structure 1 Outline Disk Structure Disk Scheduling Disk Management Swap-Space Management RAID Structure Disk Attachment Stable-Storage Implementation Tertiary Storage Devices 2
More informationI/O Management and Disk Scheduling. Chapter 11
I/O Management and Disk Scheduling Chapter 11 Categories of I/O Devices Human readable used to communicate with the user video display terminals keyboard mouse printer Categories of I/O Devices Machine
More informationCHAPTER 12: MASS-STORAGE SYSTEMS (A) By I-Chen Lin Textbook: Operating System Concepts 9th Ed.
CHAPTER 12: MASS-STORAGE SYSTEMS (A) By I-Chen Lin Textbook: Operating System Concepts 9th Ed. Chapter 12: Mass-Storage Systems Overview of Mass-Storage Structure Disk Structure Disk Attachment Disk Scheduling
More informationPart IV I/O System. Chapter 12: Mass Storage Structure
Part IV I/O System Chapter 12: Mass Storage Structure Disk Structure Three elements: cylinder, track and sector/block. Three types of latency (i.e., delay) Positional or seek delay mechanical and slowest
More informationChapter 11. I/O Management and Disk Scheduling
Operating System Chapter 11. I/O Management and Disk Scheduling Lynn Choi School of Electrical Engineering Categories of I/O Devices I/O devices can be grouped into 3 categories Human readable devices
More information操作系统概念 13. I/O Systems
OPERATING SYSTEM CONCEPTS 操作系统概念 13. I/O Systems 东南大学计算机学院 Baili Zhang/ Southeast 1 Objectives 13. I/O Systems Explore the structure of an operating system s I/O subsystem Discuss the principles of I/O
More informationI/O Systems. 04/16/2007 CSCI 315 Operating Systems Design 1
I/O Systems Notice: The slides for this lecture have been largely based on those accompanying the textbook Operating Systems Concepts with Java, by Silberschatz, Galvin, and Gagne (2007). Many, if not
More informationOperating Systems. V. Input / Output
Operating Systems V. Input / Output Ludovic Apvrille ludovic.apvrille@telecom-paristech.fr Eurecom, office 470 http://soc.eurecom.fr/os/ @OS Eurecom Devices of a Computer System Applications OS CPU Memory
More informationModule 13: Secondary-Storage
Module 13: Secondary-Storage Disk Structure Disk Scheduling Disk Management Swap-Space Management Disk Reliability Stable-Storage Implementation Tertiary Storage Devices Operating System Issues Performance
More informationI/O Systems and Storage Devices
CSC 256/456: Operating Systems I/O Systems and Storage Devices John Criswell! University of Rochester 1 I/O Device Controllers I/O devices have both mechanical component & electronic component! The electronic
More informationChapter 14: Mass-Storage Systems
Chapter 14: Mass-Storage Systems Disk Structure Disk Scheduling Disk Management Swap-Space Management RAID Structure Disk Attachment Stable-Storage Implementation Tertiary Storage Devices Operating System
More informationCSE 120. Overview. July 27, Day 8 Input/Output. Instructor: Neil Rhodes. Hardware. Hardware. Hardware
CSE 120 July 27, 2006 Day 8 Input/Output Instructor: Neil Rhodes How hardware works Operating Systems Layer What the kernel does API What the programmer does Overview 2 Kinds Block devices: read/write
More informationInput/Output Systems
CSE325 Principles of Operating Systems Input/Output Systems David P. Duggan dduggan@sandia.gov April 2, 2013 Input/Output Devices Output Device Input Device Processor 4/2/13 CSE325 - I/O Systems 2 Why
More informationOutline. Operating Systems: Devices and I/O p. 1/18
Outline Diversity of I/O devices block and character devices Organization of I/O subsystem of kernel device drivers Common hardware characteristics of device I/O subsystem tasks Operating Systems: Devices
More informationChapter 10: Mass-Storage Systems
COP 4610: Introduction to Operating Systems (Spring 2016) Chapter 10: Mass-Storage Systems Zhi Wang Florida State University Content Overview of Mass Storage Structure Disk Structure Disk Scheduling Disk
More informationCS370 Operating Systems
CS370 Operating Systems Colorado State University Yashwant K Malaiya Spring 2018 Lecture 24 Mass Storage, HDFS/Hadoop Slides based on Text by Silberschatz, Galvin, Gagne Various sources 1 1 FAQ What 2
More informationChapter 12: Mass-Storage
hapter 12: Mass-Storage Systems hapter 12: Mass-Storage Systems To explain the performance characteristics of mass-storage devices To evaluate disk scheduling algorithms To discuss operating-system services
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: Mass-Storage
hapter 12: Mass-Storage Systems hapter 12: Mass-Storage Systems Overview of Mass Storage Structure Disk Structure Disk Attachment Disk Scheduling Disk Management RAID Structure Objectives Moving-head Disk
More informationChapter 7: Mass-storage structure & I/O systems. Operating System Concepts 8 th Edition,
Chapter 7: Mass-storage structure & I/O systems, Silberschatz, Galvin and Gagne 2009 Mass-storage structure & I/O systems Overview of Mass Storage Structure Disk Structure Disk Attachment Disk Scheduling
More informationOPERATING SYSTEMS CS3502 Spring Input/Output System Chapter 9
OPERATING SYSTEMS CS3502 Spring 2017 Input/Output System Chapter 9 Input/Output System Major objectives: An application s I/O requests are sent to the I/O device. Take whatever response comes back from
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 l Chapter 10: File System l Chapter 11: Implementing File-Systems l Chapter 12: Mass-Storage
More informationDisc Allocation and Disc Arm Scheduling?
CSE 2431: Introduction to Operating Systems Disc Allocation and Disc Arm Scheduling? Study: 9 th (12.4, 12.5, 10.4) 10 th (14.4, 14.5, 11.2) 11-29-2018 Presentation K Gojko Babić Moving-Head Disk Mechanism
More informationInput Output (IO) Management
Input Output (IO) Management Prof. P.C.P. Bhatt P.C.P Bhatt OS/M5/V1/2004 1 Introduction Humans interact with machines by providing information through IO devices. Manyon-line services are availed through
More informationOperating Systems. V. Input / Output. Eurecom
Operating Systems V. Input / Output Ludovic Apvrille ludovic.apvrille@telecom-paristech.fr Eurecom, office 470 http://soc.eurecom.fr/os/ @OS Eurecom Issues OS manages devices Protection Sharing Ease-of-use
More informationFree Space Management
CSC 4103 - Operating Systems Spring 2007 Lecture - XVI File Systems - II Tevfik Koşar Louisiana State University March 22 nd, 2007 1 Free Space Management Disk space limited Need to re-use the space from
More informationOperating System: Chap13 I/O Systems. National Tsing-Hua University 2016, Fall Semester
Operating System: Chap13 I/O Systems National Tsing-Hua University 2016, Fall Semester Outline Overview I/O Hardware I/O Methods Kernel I/O Subsystem Performance Application Interface Operating System
More informationEIDE, ATA, SATA, USB,
Magnetic disks provide bulk of secondary storage of modern computers! Drives rotate at 60 to 200 times per second! Transfer rate is rate at which data flow between drive and computer! Positioning time
More informationOverview of Mass Storage Structure
CSC 4103 - Operating Systems Spring 2008 Lecture - XVIII Mass Storage & IO Tevfik Ko!ar Louisiana State University April 8th, 2008 1 Overview of Mass Storage Structure Magnetic disks provide bulk of secondary
More informationMain Points of the Computer Organization and System Software Module
Main Points of the Computer Organization and System Software Module You can find below the topics we have covered during the COSS module. Reading the relevant parts of the textbooks is essential for a
More informationI/O Hardwares. Some typical device, network, and data base rates
Input/Output 1 I/O Hardwares Some typical device, network, and data base rates 2 Device Controllers I/O devices have components: mechanical component electronic component The electronic component is the
More informationChapter 12: Mass-Storage Systems. Operating System Concepts 8 th Edition,
Chapter 12: Mass-Storage Systems, Silberschatz, Galvin and Gagne 2009 Chapter 12: Mass-Storage Systems Overview of Mass Storage Structure Disk Structure Disk Attachment Disk Scheduling Disk Management
More informationChapter 11 I/O Management and Disk Scheduling
Operating Systems: Internals and Design Principles, 6/E William Stallings Chapter 11 I/O Management and Disk Scheduling Patricia Roy Manatee Community College, Venice, FL 2008, Prentice Hall 1 2 Differences
More informationMass-Storage. ICS332 - Fall 2017 Operating Systems. Henri Casanova
Mass-Storage ICS332 - Fall 2017 Operating Systems Henri Casanova (henric@hawaii.edu) Magnetic Disks! Magnetic disks (a.k.a. hard drives ) are (still) the most common secondary storage devices today! They
More informationToday: I/O Systems. Architecture of I/O Systems
Today: I/O Systems How does I/O hardware influence the OS? What I/O services does the OS provide? How does the OS implement those services? How can the OS improve the performance of I/O? Lecture 20, page
More informationCOT 4600 Operating Systems Fall Dan C. Marinescu Office: HEC 439 B Office hours: Tu-Th 3:00-4:00 PM
COT 4600 Operating Systems Fall 2009 Dan C. Marinescu Office: HEC 439 B Office hours: Tu-Th 3:00-4:00 PM Lecture 23 Attention: project phase 4 due Tuesday November 24 Final exam Thursday December 10 4-6:50
More informationInput/Output. Today. Next. Principles of I/O hardware & software I/O software layers Disks. Protection & Security
Input/Output Today Principles of I/O hardware & software I/O software layers Disks Next Protection & Security Operating Systems and I/O Two key operating system goals Control I/O devices Provide a simple,
More informationCSE 4/521 Introduction to Operating Systems. Lecture 24 I/O Systems (Overview, Application I/O Interface, Kernel I/O Subsystem) Summer 2018
CSE 4/521 Introduction to Operating Systems Lecture 24 I/O Systems (Overview, Application I/O Interface, Kernel I/O Subsystem) Summer 2018 Overview Objective: Explore the structure of an operating system
More informationI/O Device Controllers. I/O Systems. I/O Ports & Memory-Mapped I/O. Direct Memory Access (DMA) Operating Systems 10/20/2010. CSC 256/456 Fall
I/O Device Controllers I/O Systems CS 256/456 Dept. of Computer Science, University of Rochester 10/20/2010 CSC 2/456 1 I/O devices have both mechanical component & electronic component The electronic
More information