recategorized by
4,624 views
0 votes
0 votes

Which of the following statements is not true about disk-arm scheduling algorithms ? 

  1. SSTF (shortest seek time first) algorithm increases performance of FCFS.
  2. The number of requests for disk service are not influenced by file allocation method.
  3. Caching the directories and index blocks in main memory can also help in reducing disk arm movements.
  4. SCAN and C-SCAN algorithms are less likely to have a starvation problem. 
recategorized by

2 Answers

2 votes
2 votes

Ans is B

A)is true 

B)is NOT CORRECT  as the  number of requests for disk service can be greatly influenced by file allocation method.e.g a program reading contiguous allocated file will generate several requests that are closed together on the disk hence minimal head movement . on the other hand linked file or indexed file may include scattered block which need more head movement

C)is TRUE Caching the directories and index blocks in main memory can also help in reducing disk arm movements especially for read operation.

d)is TRUE as SCAN & C-SCAN are less likely to be suffer from starvation as they move in both direction irrespective of type of request. SSTF may suffer from starvation

edited by
0 votes
0 votes

In the disk-arm scheduling algorithms The number of requests for disk service are highly influenced by file allocation method.
The time required to read or write a disk block determined by 3 factors.
Seek time: The time to move the arm to the proper cylinder.
Rotational delay: the time for the proper sector to rotate under the head.
Actual data transfer time
Among these, the Seek time dominates.

Answer:

Related questions

1 votes
1 votes
1 answer
1
1 votes
1 votes
2 answers
2
makhdoom ghaya asked Jul 11, 2016
3,376 views
The output generated by the LINUX command :$ seq 1 2 10will be 1 2 101 2 3 4 5 6 7 8 9 101 3 5 7 91 5 10
0 votes
0 votes
2 answers
3
makhdoom ghaya asked Jul 10, 2016
4,244 views
__________ maintains the list of free disk blocks in the Unix file system.I-nodeBoot blockSuper blockFile allocation table
0 votes
0 votes
3 answers
4
makhdoom ghaya asked Jul 9, 2016
7,537 views
Consider a program that consists of $8$ pages (from $0$ to $7$) and we have $4$ page frames in the physical memory for the pages. The page reference string is :$1\; 2\; 3...