MODULE 4 (STORAGE MANAGEMENT)

0.0(0)
studied byStudied by 0 people
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/15

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.

16 Terms

1
New cards

disk scheduling

  • It is usually done by the OS to schedule I/O requests arriving for the disk.

  • Goal: to minimize seek time (time taken to reach up to desired track).

2
New cards

FCFS/FIFO

is the easiest disk scheduling algorithm among all the scheduling algorithms.

3
New cards

FCFS/FIFO

each input/output request is served in the order in which the requests arrive.

4
New cards

FCFS/FIFO

In this algorithm, starvation does not occur because ____ address each request.

5
New cards

SSTF (Shortest Seek Time First)

In this type of disk scheduling, the job which has less seek time will be executed first.

6
New cards

SCAN

In this algorithm, we move the disk arm into a specific direction (direction can be moved towards large value or the smallest value).

7
New cards

SCAN

Each request is addressed that comes in its path, and when it comes into the end of the disk, then the disk arm will move reverse, and all the requests are addressed that are arriving in its path.

8
New cards

SCAN

is also called an elevator algorithm because its working like an elevator.

9
New cards

C-SCAN

stands for Circular-SCAN

10
New cards

C-SCAN

is an enhanced version of SCAN disk scheduling.

11
New cards

C-SCAN

the disk head starts to move at one end of the disk and moves towards the other end and service the requests that come in its path and reach another end. After doing this, the direction of the head is reversed. The head reaches the first end without satisfying any request and then it goes back and services the requests which are remaining.

12
New cards

Look

is an enhanced version of SCAN disk scheduling. 

13
New cards

Look

is the same as SCAN disk scheduling, but in this scheduling, instead of going till the last track, we go till the last request and then change the direction.

14
New cards

C-look

means circular-look.

15
New cards

C-look

It takes the advantages of both the disk scheduling C-SCAN, and Look disk scheduling.

16
New cards

C-look

the disk arm moves and service each request till the head reaches its highest request, and after that, the disk arm jumps to the lowest cylinder without servicing any request, and the disk arm moves further and service those requests which are remaining.