Problems in IO & File System CS 1550 Recitation November 4 th /6 th, 2002 The questions in this slide are from Andrew S. Tanenbaum's textbook page 375,

Slides:

Advertisements

Similar presentations

I/O Management and Disk Scheduling

Advertisements

ICS 624 Spring 2011 Multi-Dimensional Clustering Asst. Prof. Lipyeow Lim Information & Computer Science Department University of Hawaii at Manoa 1/24/20111Lipyeow.

1 Advanced Database Technology February 12, 2004 DATA STORAGE (Lecture based on [GUW ], [Sanders03, ], and [MaheshwariZeh03, ])

13.2 Disks Mechanics of Disks Presented by Chao-Hsin Shih Feb 21, 2011.

File System Implementation: beyond the user’s view A possible file system layout on a disk.

File Systems Implementation

Disk Drivers May 10, 2000 Instructor: Gary Kimura.

1 Storage Hierarchy Cache Main Memory Virtual Memory File System Tertiary Storage Programs DBMS Capacity & Cost Secondary Storage.

CPSC-608 Database Systems Fall 2009 Instructor: Jianer Chen Office: HRBB 309B Phone: Notes #5.

CS 342 – Operating Systems Spring 2003 © Ibrahim Korpeoglu Bilkent University1 Input/Output – 5 Disks CS 342 – Operating Systems Ibrahim Korpeoglu Bilkent.

1 Disk Scheduling Chapter 14 Based on the slides supporting the text.

CPSC 231 Secondary storage (D.H.)1 Learning Objectives Understanding disk organization. Sectors, clusters and extents. Fragmentation. Disk access time.

Introduction to Database Systems 1 The Storage Hierarchy and Magnetic Disks Storage Technology: Topic 1.

Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Chapter 12: Mass-Storage Systems.

Disk and I/O Management

CS4432: Database Systems II Data Storage (Better Block Organization) 1.

CS 346 – Chapter 10 Mass storage –Advantages? –Disk features –Disk scheduling –Disk formatting –Managing swap space –RAID.

1 Recitation 8 Disk & File System. 2 Disk Scheduling Disks are at least four orders of magnitude slower than main memory –The performance of disk I/O.

1 6 Further System Fundamentals (HL) 6.2 Magnetic Disk Storage.

Disk Access. DISK STRUCTURE Sector: Smallest unit of data transfer from/to disk; 512B 2/4/8 adjacent sectors transferred together: Blocks Read/write heads.

Topic: Disks – file system devices. Rotational Media Sector Track Cylinder Head Platter Arm Access time = seek time + rotational delay + transfer time.

Problems in Memory Management CS 1550 Recitation October 9 th, 2002 The questions in this slide are from Andrew S. Tanenbaum's textbook page 264.

Chapter 12: Mass-Storage Systems Silberschatz, Galvin and Gagne ©2005 Operating System Concepts – 7 th Edition, Jan 1, 2005 Chapter 12: Mass-Storage.

External Storage Primary Storage : Main Memory (RAM). Secondary Storage: Peripheral Devices –Disk Drives –Tape Drives Secondary storage is CHEAP. Secondary.

Storage and Indexes Introduction to Databases Computer Science 557 Instructor: Joe Bockhorst University of Wisconsin - Milwaukee.

Chapter 8 External Storage. Primary vs. Secondary Storage Primary storage: Main memory (RAM) Secondary Storage: Peripheral devices  Disk drives  Tape.

Lecture 3 Page 1 CS 111 Online Disk Drives An especially important and complex form of I/O device Still the primary method of providing stable storage.

DMBS Internals I. What Should a DBMS Do? Store large amounts of data Process queries efficiently Allow multiple users to access the database concurrently.

Lecture 40: Review Session #2 Reminders –Final exam, Thursday 3:10pm Sloan 150 –Course evaluation (Blue Course Evaluation) Access through.

Storing Data Dina Said 1 1.

Database Systems Disk Management Concepts. WHY DO DISKS NEED MANAGING? logical information  physical representation bigger databases, larger records,

Disk Basics CS Introduction to Operating Systems.

Operating Systems (CS 340 D) Princess Nora University Faculty of Computer & Information Systems Computer science Department.

1.  Disk Structure Disk Structure  Disk Scheduling Disk Scheduling  FCFS FCFS  SSTF SSTF  SCAN SCAN  C-SCAN C-SCAN  C-LOOK C-LOOK  Selecting a.

Operating Systems (CS 340 D) Princess Nora University Faculty of Computer & Information Systems Computer science Department.

1 CS.217 Operating System By Ajarn..Sutapart Sappajak,METC,MSIT Chapter 13 Mass-Storage Systems Slide 1 Chapter 13 Mass-Storage Systems.

Section 13.2 – Secondary storage management (Former Student’s Note)

DMBS Internals I. What Should a DBMS Do? Store large amounts of data Process queries efficiently Allow multiple users to access the database concurrently.

Disk storage systems Question#1 (True/False) A track is divided into multiple units called sectors.

Disk Average Seek Time. Multi-platter Disk platter Disk read/write arm read/write head.

Disk Scheduling The operating system is responsible for using hardware efficiently — for the disk drives, this means having a fast access time and disk.

Section 13.2 – Secondary storage management. Index 13.2 Disks Mechanics of Disks The Disk Controller Disk Access Characteristics.

Magnetic Disk Rotational latency Example Find the average rotational latency if the disk rotates at 20,000 rpm.

CPSC 231 Secondary storage (D.H.)1 Learning Objectives Understanding disk organization. Sectors, clusters and extents. Fragmentation. Disk access time.

Programmer’s View of Files Logical view of files: –An a array of bytes. –A file pointer marks the current position. Three fundamental operations: –Read.

COSC 6340: Disks 1 Disks and Files DBMS stores information on (“hard”) disks. This has major implications for DBMS design! » READ: transfer data from disk.

1 Reminders Project 3 due tomorrow in lecture turnin + report Today’s office hours in 006 changed to 5:30-6:30 Project 4 out soon, due last day of classes.

Part IV I/O System Chapter 12: Mass Storage Structure.

CPS216: Advanced Database Systems Notes 03: Data Access from Disks Shivnath Babu.

1 Lecture 16: Data Storage Wednesday, November 6, 2006.

1 Components of the Virtual Memory System  Arrows indicate what happens on a lw virtual address data physical address TLB page table memory cache disk.

Problems in IO CS 1550 Recitation December 2 nd /4 th, 2002 The questions in this slide are from Andrew S. Tanenbaum's textbook page 376, 377.

CS422 Principles of Database Systems Disk Access Chengyu Sun California State University, Los Angeles.

File organization Secondary Storage Devices Lec#7 Presenter: Dr Emad Nabil.

Storing Data Dina Said.

File Organization Record Storage and Primary File Organization

Section 13.2 – Secondary storage management (Former Student’s Note)

Course INF211 File Organization Revision 1.

Lecture 16: Data Storage Wednesday, November 6, 2006.

Computer Science 210 Computer Organization

Disk Scheduling Algorithms

Disks and Files DBMS stores information on (“hard”) disks.

Chapter 14 Based on the slides supporting the text

Operating Systems (CS 340 D)

Parameters of Disks The most important disk parameter is the time required to locate an arbitrary disk block, given its block address, and then to transfer.

CSE451 File System Introduction and Disk Drivers Autumn 2002

Chapter 11: Mass-Storage Systems

CPS216: Advanced Database Systems Notes 04: Data Access from Disks

Presentation transcript:

Problems in IO & File System CS 1550 Recitation November 4 th /6 th, 2002 The questions in this slide are from Andrew S. Tanenbaum's textbook page 375, 450, 451.

CHAP How much cylinder skew is needed for a 7200-rpm disk with a track –to-track seek time of 1 msec? The disk has 200 sectors of 512 bytes each on each track.

CHAP Consider the I-node shown in Fig If it contains 10 direct addresses of 4 bytes each and all disk blocks are 1024 KB, what is the largest possible file?

CHAP A floppy disk has 40 cylinders. A seek takes 6 msec per cylinder moved. If no attempt is made to put the blocks of a file close to each other, two blocks that are logically consecutive (I.e., follow one another in the file) will be about 13 cylinders apart, on the average. If, however, the operating system makes an attempt to cluster related blocks, the mean interblock distance can be reduced to 2 cylinders (for example). How long does it take to read a 100-block file in both cases, if the rotational latency is 100 msec and the transfer time 25 msec per block?