Questions from Operating Systems

Q: For the frequency-based replacement algorithm (see Figure 11.

For the frequency-based replacement algorithm (see Figure 11.9), define Fnew, Fmiddle and Fold as the fraction of the cache that comprises the new, middle, and old sections, respectively. Clearly, Fne...

Q: Calculate how much disk space (in sectors, tracks, and

Calculate how much disk space (in sectors, tracks, and surfaces) will be required to store 300,000 120-byte logical records if the disk is fixed sector with 512 bytes/sector, with 96 sectors/track, 11...

Q: Consider the disk system described in Problem 11.7, and

Consider the disk system described in Problem 11.7, and assume the disk rotates at 360 rpm. A processor reads one sector from the disk using interrupt-driven I/O, with one interrupt per byte. If it ta...

Q: Repeat the preceding problem using DMA, and assume one interrupt per

Repeat the preceding problem using DMA, and assume one interrupt per sector. Data from problem 11.8: There are 512 bytes/sector. Since each byte generates an interrupt, there are 512 interrupts. Tota...

Q: Define: B=block size R=record size

Define: B=block size R=record size P=size of block pointer F=blocking factor; expected number of records within a block Give a formula for F for the three blocking methods depicted in Figure 12.8 Fig...

Q: Some operating systems have a tree–structured file system but limit

Some operating systems have a tree–structured file system but limit the depth of the tree to some small number of levels. What effect does this limit have on users? How does this simplify file system...

Q: One scheme to avoid the problem of preallocation versus waste or lack

One scheme to avoid the problem of preallocation versus waste or lack of contiguity is to allocate portions of increasing size as the file grows. For example, begin with a portion size of one block, a...

Q: What is an instruction trace?

What is an instruction trace?

Q: What file organization would you choose to maximize efficiency in terms of

What file organization would you choose to maximize efficiency in terms of speed of access, use of storage space, and ease of updating (adding/deleting/modifying) when the data are: a. updated infrequ...

Q: For the B-tree in Figure 12.4c, show

For the B-tree in Figure 12.4c, show the result of inserting the key 97. Figure 12.4: