Scribd
Upload
79 views

HW - Disk Storage 5 New

This document contains an OS homework assignment on disk performance concepts. It consists of 7 multiple choice and short answer questions. The questions cover topics like seek time, file allocation tables, disk allocation algorithms, UNIX file inodes, reading performance for different disk drives, and disk scheduling algorithms. The assignment is due individually via Blackboard by 1:30 PM on November 27, 2023.

Uploaded by

kingsbross72
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
79 views

HW - Disk Storage 5 New

This document contains an OS homework assignment on disk performance concepts. It consists of 7 multiple choice and short answer questions. The questions cover topics like seek time, file allocation tables, disk allocation algorithms, UNIX file inodes, reading performance for different disk drives, and disk scheduling algorithms. The assignment is due individually via Blackboard by 1:30 PM on November 27, 2023.

Uploaded by

kingsbross72
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

OS Homework Assignment

(All homework assignments are individual efforts)


(Due by 1:30 PM on Nov. 27, 2023)
(Submission via Blackboard)

1. (2 points) The aspect of disk performance that represents the time it takes to
position the head at the desired track is known as:
a. Seek time
b. Rotational delay
c. Access time
d. None of the above

2. (2 points) The data structure that maintains information on available disk space is
called the:
a. File Allocation Table (FAT)
b. Disk Allocation Table
c. Bitmap
d. None of the above

3. (2 points) Which of the following is NOT an advantage of Continuous Allocation as a


Disk Block Allocation algorithm? (assume “extents” are not used)
a) It is effective for sequential access
b) It is effective for direct access
c) Given the logical block number, the corresponding physical block number can
be easily computed
d) There is no need to know the file’s maximum size when it is first created

4. (6 points). Consider a file F whose data is spread over 1000 physical disk blocks
on the disk. Assume the size of a logical block is equal the size of a physical block.
Given a logical block number X, what is the maximum number of disk accesses that
you would need to retrieve the physical block that corresponds to X?
Assume the file control block of F and the directory entry that contains information
about F are cached in the main memory.

Give and explain your answer for each of the following cases:

i.) Continuous allocation

ii.) Linked allocation

iii.) Indexed allocation (Assume an index block may have up to 1024 entries)
5. (15 points) Consider the organization of a UNIX file as represented by the inode.
Assume that there are 12 direct block pointers and a singly, doubly, and triply indirect
pointer in each inode. Further, assume that the system block size and the disk sector
size are both 8 K. If the disk block pointer is 32 bits, with 8 bits to identify the physical
disk and 24 bits to identify the physical block, then
a. What is the maximum file size supported by this system?
b. What is the maximum file system partition supported by this system?
c. Assuming no information other than that the file inode is already in main memory,
how many disk accesses are required to access the byte in position 13,423,956?

6. (8 points) How long does it take to perform the following disk read? The
specifications of Cheetah and Barracuda are given in the following table. Assume the
block size for Cheetah is 4 KB and for Barracuda is 8KB.

(a) 4KB read w/ Cheetah


(b) 8KB read w/ Barracuda
(c) 4MB sequential read w/ Cheetah
(d) 6MB sequential read w/ Barracuda

Cheetah Barracuda
RPM 15,000 7,200
Avg Seek 4ms 11ms
Max Transfer 130MB/s 112MB/s

7. (15 points) Given a stream of I/O requests (within a cylinder range of 0-299): 46, 254,
16, 196, 205, 251, 32, 35, 48, 280, 157, calculate the number of cylinders the head
movement covers. Initially, the arm head points to 151.
(a) FIFO
(b) SPTF
(c) SCAN
(d) C-SCAN
(e) C-LOOK

You might also like