# Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 35 (Page No. 258)

1 vote
49 views

How long does it take to load a $64-KB$ program from a disk whose average seek time is $5\: msec,$ whose rotation time is $5 msec,$ and whose tracks hold $1\: MB$

1. for a $2-KB$ page size?
2. for a $4-KB$ page size?

The pages are spread randomly around the disk and the number of cylinders is so large that the chance of two pages being on the same cylinder is negligible.

0

## Related questions

0 votes
0 answers
1
31 views
One of the first timesharing machines, the $DEC\: PDP-1,$ had a (core) memory of $4K\: 18-bit$ ... drum. The drum could start writing (or reading) at any word, rather than only at word $0.$ Why do you suppose this drum was chosen?
0 votes
0 answers
2
34 views
A student in a compiler design course proposes to the professor a project of writing a compiler that will produce a list of page references that can be used to implement the optimal page replacement algorithm. Is this possible? Why or why not? Is there anything that could be done to improve paging efficiency at run time?
1 vote
1 answer
3
90 views
Consider the following two-dimensional array: int X[64][64]; Suppose that a system has four page frames and each frame is $128$ words (an integer occupies one word). Programs that manipulate the $X$ array fit into exactly one page and always occupy page $0.$ The data are swapped in and out of the other three frames ... B for (int i = 0; i < 64; i++) for (int j = 0; j < 64; j++) X[i][j] = 0;
0 votes
0 answers
4
73 views
Suppose that two processes $A$ and $B$ share a page that is not in memory. If process $A$ faults on the shared page, the page table entry for process $A$ must be updated once the page is read into memory. Under what conditions should the page table update ... of process $A's$ page fault will bring the shared page into memory? Explain. What is the potential cost of delaying the page table update?