CS-3310 - 04 I/O and Disks - Disks

0.0(0)
studied byStudied by 0 people
0.0(0)
full-widthCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/31

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

32 Terms

1
New cards

data density of typical hard disk (video)

31B bits per cm^2

2
New cards

head above rotating disk is like (video)

747 with 100,000 passengers flying at 60 mph at 0.01 in above ground

3
New cards

how many data accesses per second on a typical hard disk? (video)

data access up to 60x per second

4
New cards

What is the basic structure of a hard disk?

One or more spinning platters coated with magnetic material, with read/write heads on each surface.

5
New cards

What is a platter?

A circular disk surface where data is stored magnetically.

6
New cards

What is a track?

A concentric ring of sectors on a platter.

7
New cards

What is a sector?

The smallest addressable block of data on a disk, typically 512 bytes.

8
New cards

What is a cylinder?

The set of tracks across all platters that align vertically.

9
New cards

What are the main components of disk access time?

Seek time, rotational delay, and transfer time.

10
New cards

What is seek time?

The time to move the disk arm to the correct track.

11
New cards

What is rotational delay?

The time for the desired sector to rotate under the read/write head.

12
New cards

What is transfer time?

The time to actually read or write the data once positioned.

13
New cards

How is total I/O time calculated?

I/O time = Seek time + Rotational delay + Transfer time.

14
New cards

Why is disk scheduling needed?

To reduce average access time and improve throughput by reordering I/O requests.

15
New cards

What does the SSTF (Shortest Seek Time First) algorithm do?

Chooses the pending request closest to the current head position.

16
New cards

What is the main disadvantage of SSTF?

It can cause starvation for distant requests.

17
New cards

How does the SCAN (Elevator) algorithm work?

It moves the disk head back and forth, servicing all requests in one direction before reversing.

18
New cards

What is C-SCAN?

A variation of SCAN that only moves in one direction, wrapping around to the beginning for fairness.

19
New cards

Why does C-SCAN provide more uniform response times than SCAN?

Because it treats all requests equally regardless of position on the disk.

20
New cards

What is SPTF (Shortest Positioning Time First)?

A scheduling method that minimizes total access time by considering both seek and rotational delay.

21
New cards

Who typically performs SPTF scheduling?

The disk controller firmware, not the OS.

22
New cards

What is RAID?

Redundant Array of Inexpensive Disks - a method of combining multiple disks for performance and reliability.

23
New cards

What are the main goals of RAID?

Improved performance, increased capacity, and better reliability.

24
New cards

Describe RAID 0.

Striping data across multiple disks for performance; no redundancy.

25
New cards

Describe RAID 1.

Mirroring data on multiple disks for reliability.

26
New cards

Describe RAID 4 and RAID 5.

Both use parity for fault tolerance; RAID 5 rotates parity among disks to balance load.

27
New cards

What is double parity RAID (RAID 6)?

A scheme that can tolerate two disk failures.

28
New cards

What is low-level disk formatting?

The process of dividing each platter into tracks and sectors with preambles, ECC, and identifiers.

29
New cards

What is high-level formatting?

Creating a file system structure like root directory, free list, and superblock.

30
New cards

What are MBR and GPT?

Partition table schemes - MBR for small disks (<2TB), GPT for larger disks.

31
New cards

How do disks handle bad sectors?

By remapping them to spare sectors stored on the drive.

32
New cards

What is the purpose of ECC in disks?

Error Correction Code helps recover data from partially damaged sectors.