T4-Input/Output
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Ext4 File System and Crash Consistency
1 Ext4 file system and crash consistency Changwoo Min 2 Summary of last lectures • Tools: building, exploring, and debugging Linux kernel • Core kernel infrastructure • Process management & scheduling • Interrupt & interrupt handler • Kernel synchronization • Memory management • Virtual file system • Page cache and page fault 3 Today: ext4 file system and crash consistency • File system in Linux kernel • Design considerations of a file system • History of file system • On-disk structure of Ext4 • File operations • Crash consistency 4 File system in Linux kernel User space application (ex: cp) User-space Syscalls: open, read, write, etc. Kernel-space VFS: Virtual File System Filesystems ext4 FAT32 JFFS2 Block layer Hardware Embedded Hard disk USB drive flash 5 What is a file system fundamentally? int main(int argc, char *argv[]) { int fd; char buffer[4096]; struct stat_buf; DIR *dir; struct dirent *entry; /* 1. Path name -> inode mapping */ fd = open("/home/lkp/hello.c" , O_RDONLY); /* 2. File offset -> disk block address mapping */ pread(fd, buffer, sizeof(buffer), 0); /* 3. File meta data operation */ fstat(fd, &stat_buf); printf("file size = %d\n", stat_buf.st_size); /* 4. Directory operation */ dir = opendir("/home"); entry = readdir(dir); printf("dir = %s\n", entry->d_name); return 0; } 6 Why do we care EXT4 file system? • Most widely-deployed file system • Default file system of major Linux distributions • File system used in Google data center • Default file system of Android kernel • Follows the traditional file system design 7 History of file system design 8 UFS (Unix File System) • The original UNIX file system • Design by Dennis Ritche and Ken Thompson (1974) • The first Linux file system (ext) and Minix FS has a similar layout 9 UFS (Unix File System) • Performance problem of UFS (and the first Linux file system) • Especially, long seek time between an inode and data block 10 FFS (Fast File System) • The file system of BSD UNIX • Designed by Marshall Kirk McKusick, et al. -
Operating System User's Mannal ~Zilog 03-0072-01 Revision a September 1978
t_ .' Operating System User's Mannal ~Zilog 03-0072-01 Revision A September 1978 Copyright © 1978 by Zilog, Inc. All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, electronic, mechanical, photocopying, recording, or otherwise, without the prior written permission of Zilog. Zilog assumes no responsibility for the use of any circuitry other than circuitry embodied in a Zilog product. No other circuit patent licenses are implied. zaO-RIO Operating System User's Manual September 1978 TABLE OF CONTENTS CHAPTER 1 - INTRODUCTION AND OVERVIEW • 1 1.1 INTRODUCTION •• 1 1.2 SYSTEM OVERVIEW 3 1.2.1 Hardware Configuration • • • • • • 3 1.2.2 File Systems • • • • • • • . • • 3 1.2.3 System Initialization •••.••• 6 1.2.4 Commands • • .• .•..••• 7 1.2.5 I/O • • • . • • • • • . • • • • • . 7 CHAPTER 2 - RIO EXECUTIVE 9 2.1 SYSTEM INITIALIZATION 9 2.2 FILE NAME CONVENTIONS · 10 2.3 MEMORY MANAGEMENT . • • . 12 2.3.1 MEMMGR • . 13 2.4 COMMAND STRING INTERPRETATION · 13 2.5 ERROR HANDLING • • . 15 2.6 PROGRAM EXECUTION OF COMMANDS · 15 CHAPTER 3 - 1/0 STRUCTURE • · 16 3.1 OVERVIEW . • · 16 3.2 I/O REQUESTS - SYSTEM CALLS · 17 3.3 THE 'ASSIGN' I/O REQUEST ••• • 19 - i - 3.4 STANDARD RIO I/O DEVICES • • • 21 3.4.1 ZDOS . • • • . 21 3.4.2 DFS . 21 3.4.3 NULL . • • • . 21 3.4.4 CON . • • • . • • • • • 22 3.4.5 PCON • 27 3.4.6 FLOPPY • • • • • • • • • • 27 3.4.7 DISK • • • • • • 27 CHAPTER 4 - PROGRAM INTERFACE • • 28 4.1 PROGRAM LOCATION • • • • • 28 4.2 PARAMETER STRING ADDRESS · 29 4.3 PROGRAM STACK SPACE • • • 29 4.4 PROGRAM TERMINATION - ERROR HANDLING ••. -
How UNIX Organizes and Accesses Files on Disk Why File Systems
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 data logically for random access by the OS. • A virtual file system provides the interface between the data representation by the kernel to the user process and the data presentation to the kernel in memory. The file and directory system cache. • Because of the performance disparity between disk and CPU/memory, file system performance is the paramount issue for any OS Main memory vs. Secondary storage • Small (MB/GB) Large (GB/TB) • Expensive Cheap -2 -3 • Fast (10-6/10-7 sec) Slow (10 /10 sec) • Volatile Persistent Cannot be directly accessed • Directly accessible by CPU by CPU – Interface: (virtual) memory – Data should be first address brought into the main memory Secondary storage (disk) • A number of disks directly attached to the computer • Network attached disks accessible through a fast network - Storage Area Network (SAN) • Simple disks (IDE, SATA) have a described disk geometry. Sector size is the minimum read/write unit of data (usually 512Bytes) – Access: (#surface, #track, #sector) • Smart disks (SCSI, SAN, NAS) hide the internal disk layout using a controller type function – Access: (#sector) • Moving arm assembly (Seek) is expensive – Sequential access is x100 times faster than the random access Internal disk structure • Disk structure User Process Accessing Data • Given the file name. Get to the file’s FCB using the file system catalog (Open, Close, Set_Attribute) • The catalog maps a file name to the FCB – Checks permissions • file_handle=open(file_name): – search the catalog and bring FCB into the memory – UNIX: in-memory FCB: in-core i-node • Use the FCB to get to the desired offset within the file data: (CREATE, DELETE, SEEK, TRUNCATE) • close(file_handle): release FCB from memory Catalog Organization (Directories) • In UNIX, special files (not special device files) called directories contain information about other files. -
IODF Explorer
The Input/Output Definition File (IODF) is a critical Control Point in the management of the IBM z/Series Platform. IODF Explorer Release 4.0 USER GUIDE Contact us for additional information: NewEra Software Technical Support 800-421-5035 [email protected] www.newera.com Rev: 2009-04-24 IODF Explorer 4.0 ¾ Copyright, Trademark and Legal Notices Copyrights This Getting Started Guide and the related Software Product(s) are protected under a Copyright dated 2009 by NewEra Software, Inc. All rights are reserved. License Agreement This Getting Started Guide describes the installation and operation of Image FOCUS, its environment and applications. It is made available only under the terms of a license agreement between the licensee and NewEra Software Inc. No part of this Guide or the related Software Product(s) may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopying and recording, for any purpose, without the express written permission of NewEra Software, Inc. Trademarks and Copyrights of Others The following products and/or registered trademarks of International Business Machines Corporation are referenced in this document: MVS, VM, RACF, z/OS, SYSPLEX, JES, VTAM, TSO, ISPF, ICKDSF, DFSMSdss, DF/DSS, and others. 2 NewEra Software, Inc. ‐ Image Control Environment (ICE) Applications IODF Explorer 4.0 ¾ Technical Support Information NewEra Software is dedicated to providing the highest level of technical Around-the-clock- support support to meet our customers’ growing needs. In order to meet these needs, NewEra provides around‐the‐clock technical support, 7 days a week, 24 hours a day. -
Hardware Configuration Definition User's Guide
z/OS Version 2 Release 3 Hardware Configuration Definition User's Guide IBM SC34-2669-30 Note Before using this information and the product it supports, read the information in “Notices” on page 443. This edition applies to Version 2 Release 3 of z/OS (5650-ZOS) and to all subsequent releases and modifications until otherwise indicated in new editions. Last updated: 2019-02-16 © Copyright International Business Machines Corporation 1994, 2018. US Government Users Restricted Rights – Use, duplication or disclosure restricted by GSA ADP Schedule Contract with IBM Corp. Contents List of Figures..................................................................................................... xiii List of Tables.....................................................................................................xxiii About this document.......................................................................................... xxv Who this document is for..........................................................................................................................xxv Related information.................................................................................................................................. xxv How to use this document.......................................................................................................................xxvi How this document is organized............................................................................................................. xxvi How to read syntax diagrams................................................................................................................ -
File Systems
File Systems Profs. Bracy and Van Renesse based on slides by Prof. Sirer Storing Information • Applications could store information in the process address space • Why is this a bad idea? – Size is limited to size of virtual address space – The data is lost when the application terminates • Even when computer doesn’t crash! – Multiple process might want to access the same data File Systems • 3 criteria for long-term information storage: 1. Able to store very large amount of information 2. Information must survive the processes using it 3. Provide concurrent access to multiple processes • Solution: – Store information on disks in units called files – Files are persistent, only owner can delete it – Files are managed by the OS File Systems: How the OS manages files! File Naming • Motivation: Files abstract information stored on disk – You do not need to remember block, sector, … – We have human readable names • How does it work? – Process creates a file, and gives it a name • Other processes can access the file by that name – Naming conventions are OS dependent • Usually names as long as 255 characters is allowed • Windows names not case sensitive, UNIX family is File Extensions • Name divided into 2 parts: Name+Extension • On UNIX, extensions are not enforced by OS – Some applications might insist upon them • Think: .c, .h, .o, .s, etc. for C compiler • Windows attaches meaning to extensions – Tries to associate applications to file extensions File Access • Sequential access – read all bytes/records from the beginning – particularly convenient for magnetic tape • Random access – bytes/records read in any order – essential for database systems File Attributes • File-specific info maintained by the OS – File size, modification date, creation time, etc. -
File System Layout
File Systems Main Points • File layout • Directory layout • Reliability/durability Named Data in a File System index !le name directory !le number structure storage o"set o"set block Last Time: File System Design Constraints • For small files: – Small blocks for storage efficiency – Files used together should be stored together • For large files: – ConCguous allocaon for sequenCal access – Efficient lookup for random access • May not know at file creaon – Whether file will become small or large File System Design Opons FAT FFS NTFS Index Linked list Tree Tree structure (fixed, asym) (dynamic) granularity block block extent free space FAT array Bitmap Bitmap allocaon (fixed (file) locaon) Locality defragmentaon Block groups Extents + reserve Best fit space defrag MicrosoS File Allocaon Table (FAT) • Linked list index structure – Simple, easy to implement – SCll widely used (e.g., thumb drives) • File table: – Linear map of all blocks on disk – Each file a linked list of blocks FAT MFT Data Blocks 0 1 2 3 !le 9 block 3 4 5 6 7 8 9 !le 9 block 0 10 !le 9 block 1 11 !le 9 block 2 12 !le 12 block 0 13 14 15 16 !le 12 block 1 17 18 !le 9 block 4 19 20 FAT • Pros: – Easy to find free block – Easy to append to a file – Easy to delete a file • Cons: – Small file access is slow – Random access is very slow – Fragmentaon • File blocks for a given file may be scaered • Files in the same directory may be scaered • Problem becomes worse as disk fills Berkeley UNIX FFS (Fast File System) • inode table – Analogous to FAT table • inode – Metadata • File owner, access permissions, -
Lecture 03: Layering, Naming, and Filesystem Design
Lecture 03: Layering, Naming, and Filesystem Design Principles of Computer Systems Spring 2019 Stanford University Computer Science Department Lecturer: Chris Gregg PDF of this presentation 1 Lecture 03: Layering, Naming, and Filesystem Design Just like RAM, hard drives provide us with a contiguous stretch of memory where we can store information. Information in RAM is byte-addressable: even if you’re only trying to store a boolean (1 bit), you need to read an entire byte (8 bits) to retrieve that boolean from memory, and if you want to flip the boolean, you need to write the entire byte back to memory. A similar concept exists in the world of hard drives. Hard drives are divided into sectors (we'll assume 512 bytes), and are sector-addressable: you must read or write entire sectors, even if you’re only interested in a portion of each. Sectors are often 512 bytes in size, but not always. The size is determined by the physical drive and might be 1024 or 2048 bytes, or even some larger power of two if the drive is optimized to store a small number of large files (e.g. high definition videos for youtube.com) Conceptually, a hard drive might be viewed like this: Thanks to Ryan Eberhardt for the illustrations and the text used in these slides, and to Ryan and Jerry Cain for the content. 2 Lecture 03: Layering, Naming, and Filesystem Design The drive itself exports an API—a hardware API—that allows us to read a sector into main memory, or update an entire sector with a new payload. -
Operating Systems – Assignment 4 File Systems
OPERATING SYSTEMS – ASSIGNMENT 4 FILE SYSTEMS The xv6 file system provides Unix-like files, directories, and pathnames, and stores its data on an IDE disk for persistence. The file-system addresses several challenges: • The file system needs on-disk data structures to represent the tree of named directories and files, to record the identities of the blocks that hold each file’s content, and to record which areas of the disk are free. • Accessing a disk is orders of magnitude slower than accessing memory, so the file system must maintain an in-memory cache of popular blocks. • Different processes may operate on the file system at the same time, and must coordinate to maintain invariants. • The file system must support crash recovery. That is, if a crash (e.g., power failure) occurs, the file system must still work correctly after a restart. The risk is that a crash might interrupt a sequence of updates and leave inconsistent on-disk data structures (e.g., a block that is both used in a file and marked free). To do so, xv6 divides the disk into several sections, as shown in the Figure below. The file system does not use block 0 (it holds the boot sector). Block 1 is called the superblock, it contains metadata about the file system (the file system size in blocks, the number of data blocks, the number of inodes, and the number of blocks in the log). Blocks starting at 2 hold inodes. After those come bitmap blocks tracking which data blocks are in use. Most of the remaining blocks are data blocks. -
Avaya Call Management System Software Installation, Maintenance, and Troubleshooting for Linux®
Avaya Call Management System Software Installation, Maintenance, and Troubleshooting for Linux® Release 18.0.2 February 2018 © 2018 Avaya Inc. All Rights Reserved. CHANNEL PARTNER; AVAYA RESERVES THE RIGHT TO TAKE LEGAL ACTION AGAINST YOU AND ANYONE ELSE USING OR SELLING THE Notice SOFTWARE WITHOUT A LICENSE. BY INSTALLING, DOWNLOADING OR While reasonable efforts have been made to ensure that the information in this USING THE SOFTWARE, OR AUTHORIZING OTHERS TO DO SO, YOU, ON document is complete and accurate at the time of printing, Avaya assumes no BEHALF OF YOURSELF AND THE ENTITY FOR WHOM YOU ARE liability for any errors. Avaya reserves the right to make changes and INSTALLING, DOWNLOADING OR USING THE SOFTWARE corrections to the information in this document without the obligation to notify (HEREINAFTER REFERRED TO INTERCHANGEABLY AS "YOU" AND "END any person or organization of such changes. USER"), AGREE TO THESE TERMS AND CONDITIONS AND CREATE A BINDING CONTRACT BETWEEN YOU AND AVAYA INC. OR THE Documentation disclaimer APPLICABLE AVAYA AFFILIATE ("AVAYA"). "Documentation" means information published in varying mediums which may Avaya grants You a license within the scope of the license types described include product information, operating instructions and performance below, with the exception of Heritage Nortel Software, for which the scope of specifications that are generally made available to users of products. the license is detailed below. Where the order documentation does not Documentation does not include marketing materials. Avaya shall not be expressly identify a license type, the applicable license will be a Designated responsible for any modifications, additions, or deletions to the original System License. -