1 / 7

Homework Assignment #4

Homework Assignment #4. J. H. Wang Dec. 13, 2013. Homework #4. Chap.11: 11.3, 11.8 Chap.12: 12.3, 12.10 (Optional programming problems for Chap. 12) Due: two weeks ( Dec. 27, 2013 ). Chap.11

ingrid-stevenson
Download Presentation

Homework Assignment #4

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Homework Assignment #4 J. H. Wang Dec. 13, 2013

  2. Homework #4 • Chap.11: 11.3, 11.8 • Chap.12: 12.3, 12.10 • (Optional programming problems for Chap. 12) • Due: two weeks (Dec. 27, 2013)

  3. Chap.11 • 11.3: What are the advantages of the variant of linked allocation that uses a FAT to chain together the blocks of a file? • 11.8: Consider a file system that uses inodes to represent files. Disk blocks are 8KB in size, and a pointer to a disk block requires 4 bytes. This file system has 12 direct disk blocks, as well as single, double, and triple indirect disk blocks. What is the maximum size of a file that can be stored in this file system?

  4. Chap.12 • 12.3: Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive is currently serving a request at cylinder 2,150, and the previous request was at cylinder 1,805. The queue of pending requests, in FIFO order, is 2,069, 1,212, 2,296, 2,800, 544, 1,618, 356, 1,523, 4,965, 3,681Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests, for each of the following disk-scheduling algorithms?(a) FCFS(b) SSTF(c) SCAN(d) LOOK(e) C-SCAN(f) C-LOOK

  5. 12.10: Compare the throughput achieved by a RAID level 5 organization with that achieved by a RAID level 1 organization for the following:(a) Read operations on single blocks.(b) Read operations on multiple contiguous blocks.

  6. Optional Programming Problems for Chap.12 • 12.16*: Write a program that implements the following disk-scheduling algorithms:(a) FCFS(b) SSTF(c) SCAN(d) C-SCAN(e) LOOK(f) C-LOOK

  7. Any Questions or Comments?

More Related