Scribd
Upload
84 views2 pages

Homework #6 - : Questions: Answers

This document contains an analysis of disk scheduling algorithms and questions about file management and RAID implementations. It provides: 1. A table to analyze disk track requests using FIFO, SSTF, SCAN, and C-LOOK scheduling and calculate the average seek for each. 2. Questions about the transfer rate of a 9-track magnetic tape drive, how devices are represented in UNIX, what an inode is, and what happens when a file is deleted from a FAT12 disk. 3. Questions to match RAID implementations like RAID 0, 1, 2, 3, 4, 5, 6, and 10 to their characteristics such as using parity disks, fault tolerance, performance, and

Uploaded by

bunty da
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
84 views2 pages

Homework #6 - : Questions: Answers

This document contains an analysis of disk scheduling algorithms and questions about file management and RAID implementations. It provides: 1. A table to analyze disk track requests using FIFO, SSTF, SCAN, and C-LOOK scheduling and calculate the average seek for each. 2. Questions about the transfer rate of a 9-track magnetic tape drive, how devices are represented in UNIX, what an inode is, and what happens when a file is deleted from a FAT12 disk. 3. Questions to match RAID implementations like RAID 0, 1, 2, 3, 4, 5, 6, and 10 to their characteristics such as using parity disks, fault tolerance, performance, and

Uploaded by

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

Grading: 3 = correct

Homework #6 _______________________________ _____


(45 pts) (Name) (Section)
2 = almost
Disk Scheduling (Chapter 11)
File Management (Chapter 12)
Questions: Answers:
1-4. (12 points) Perform an analysis for the 1. FIFO 2. SSTF
following sequence of disk track requests: 27, 129, Next track # of tracks Next track # of tracks
accessed traversed accessed traversed
110, 186, 147, 41, 10, 64, 120. Assume that the 27 110
disk head is initially positioned over track 100 and
129 120
is moving in the direction of decreasing track
110 129
number. Fill in the table to the right with your
186 147
results. (See Table 11.2, pg. 512)
147 186
41 64
10 41
64 27
120 10
Average seek: Average seek:
3. SCAN 4. C-LOOK
Next track # of tracks Next track # of tracks
accessed traversed accessed traversed
64 10
41 27
27 41
10 64
110 110
120 120
129 129
147 147
186 186
Average seek: Average seek:

5. What is the transfer rate of a nine-track magnetic


tape unit (9 bits per read) whose tape speed is 120
inches per second and whose tape density is 1,600
linear bits per inch?

6. How are devices represented in UNIX?

7. What is 'inode'?

BYU, CS 345, F2019 Homework #6 Page 1/2


8. What happens to a FAT12 disk when a file is
deleted?

9. Using variables BPB_NumFATs,


BPB_FATSz16, BPB_TotSec16, and
BPB_RootEntCnt, give a formula for the number of
clusters of a FAT12 disk.

(2 points each) Answer questions 10 thru 18 with a. RAID 0 c. RAID 2 e. RAID 4 g. RAID 6
the most applicable RAID implementation. b. RAID 1 d. RAID 3 f. RAID 5 h. RAID 10
10. Shared parity disks - each entire block is written
onto a data disk. Parity for same rank blocks is
generated on Writes, recorded on the parity disk
and checked on Reads.
11. Not a "True" RAID because it is NOT fault-
tolerant. Should never be used in mission critical
environments.
12. Protects against multiple bad block failures
while non-degraded and against a single bad block
failure while operating in a degraded mode -
Perfect solution for mission critical applications.
13. Simplest RAID storage subsystem design,
highest disk overhead of all RAID types.
14. Very expensive / High overhead - All drives
must move in parallel to proper track lowering
sustained performance - Very limited scalability at
a very high inherent cost.
15. Very high ratio of ECC disks to data disks with
smaller word sizes – inefficient, but "On the fly"
data error correction. No commercial
implementations exist / not commercially viable
16. Distributed parity blocks - Used for File and
Application servers, Database servers, Web, E-
mail, and News servers, Intranet servers - Most
versatile RAID level.
17. Parallel transfer with parity - the data block is
subdivided ("striped") and written on the data disks.
Stripe parity is generated on Writes, recorded on
the parity disk and checked on Reads.
18. Implemented as a striped array whose segments
are RAID 1 arrays - has the same overhead for
fault-tolerance as mirroring alone - Under certain
circumstances, can sustain multiple simultaneous
drive failures.

BYU, CS 345, F2019 Homework #6 Page 2/2

You might also like