Register

Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 40 (Page No. 259)

198 views
0 votes
0 votes
One of the first timesharing machines, the $DEC\: PDP-1,$ had a (core) memory of $4K\: 18-bit$ words. It held one process at a time in its memory. When the scheduler decided to run another process, the process in memory was written to a paging drum, with $4K\: 18-bit$ words around the circumference of the 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?
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

397
views
0 answers
1 votes
admin asked Oct 26, 2019
397 views
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 35 (Page No. 258)
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 ... cylinders is so large that the chance of two pages being on the same cylinder is negligible.
User Avatar
339
views
0 answers
0 votes
admin asked Oct 26, 2019
339 views
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 26 (Page No. 256)
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 ... Is there anything that could be done to improve paging efficiency at run time?
User Avatar
823
views
0 answers
1 votes
admin asked Oct 26, 2019
823 views
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 47 (Page No. 259 - 260)
We consider a program which has the two segments shown below consisting of instructions in segment $0,$ and read/write data in segment $1.$ Segment $0$ has read/execute ... offset $28$Jump to location in segment $1,$ page $3,$ offset $32$
User Avatar
313
views
0 answers
0 votes
admin asked Oct 26, 2019
313 views
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 46 (Page No. 259)
When segmentation and paging are both being used, as in $MULTICS,$ first the segment descriptor must be looked up, then the page descriptor. Does the $TLB$ also work this way, with two levels of lookup?
User Avatar
Link Copied!