DOC PREVIEW
Pitt CS 1550 - Problems in IO

This preview shows page 1 out of 4 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 4 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 4 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

Problems in IO & File SystemPowerPoint PresentationSlide 3Slide 4Problems in IO & File SystemCS 1550 RecitationNovember 4th/6th, 2002The questions in this slide are from Andrew S. Tanenbaum's textbookpage 375, 450, 451.CHAP. 514. 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. 617. Consider the I-node shown in Fig 6-15. If it contains 10 direct addresses of 4 bytes each and all disk blocks are 1024 KB, what is the largest possible file?CHAP. 630. 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


View Full Document

Pitt CS 1550 - Problems in IO

Download Problems in IO
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Problems in IO and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Problems in IO 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?