816 views
0 0 votes
Suppose a file F of size 16KB is shared by 100 processes, each process read the entire F 10 timessequentially, disk uses linked allocation policy to store both Inode and data of the file with block size512byte in FAT and Block Pointer takes 4bytes. The number of disk block access related to access thefile F in executing all the 100 processes is :

Ans. 34

2 Answers

0 0 votes
As disk uses linked allocation for storing blocks, no extra blocks for FAT are needed. It needs to access Inode table from the disk and there are ceil [16KB/(512-4)] = 33 spanned block need to access to load the whole file F sequentially .

So total = 33+1 (Access the Inode) = 34.

Once the file loaded to memory by any one processs, we do not need to access hard disk block as the file F is shared by other 99 processes.
Position:
Show:

Related questions

2 2 votes
1 1 answer
102
102 views
Sandy_05 asked Jun 23
102 views
Which of the following actions by a running process will always result in a context switch of the running process, even in a non-preemptive kernel design?(a) Servicing a ...
0 0 votes
1 1 answer
328
328 views
Mudit Jain asked Dec 16, 2024
328 views
I have a question.If there is a hypothetical cs solution.In it 3 processes are waiting .whoever will get cpu will enter into the cs.Can that be called starvation?
0 0 votes
1 1 answer
405
405 views
Shivateja MST asked Jul 13, 2023
405 views
Like other allocation techniques, does Overlaying technique uses MMU? And how address translation takes place and security is maintained in Overlaying ?
2 2 votes
2 answers 2 answers
1.6k
1.6k views
Sunnidhya Roy asked Dec 30, 2022
1,607 views
Can Safe state in DeadLock Avoidance Mechanism always guarantee No DeadLock??