Operating System



Item Name

Assume that we wish to compress a digital video file

Assume that we wish to compress a digital video file using MPEG-1 technology. The target bit rate is 1.5 Mbps. If the video is displayed at a resolution of 352 x 240 at 30 frames per second using 24 bits to represent each color, what is the necessary compression ratio to achieve the desired bit rate?

Assume that you are monitoring the rate at which the

Assume that you are monitoring the rate at which the pointer in the clock algorithm (which indicates the candidate page for replacement) moves. What can you say about the system if you notice the following behavior? a. Pointer is moving fast. b. Pointer is moving slow.

Assume that you have a mixed configuration comprising disks

Assume that you have a mixed configuration comprising disks orga­ nized as RAID levell and RAID levelS disks. Assume that the system has flexibility in deciding which disk organization to use for storing a particular file. Which files should be stored in the RAID level 1 disks and which in the RAID levelS disks in order to optimize performance?

Assume there is a 1,024-KB segment where memory is allocated

Assume there is a 1,024-KB segment where memory is allocated using the buddy system. Using Figure as a guide, draw a tree illustrating how the following memory requests are allocated: Request 240 bytes Request 120 bytes Request 60 bytes Request 130 bytes Next modify the tree for the following releases of memory. Perform coalescing whenever possible: Release 240 bytes Release 60 bytes Release 120...

Assuming a 1-KB page size, what are the page numbers

Assuming a 1-KB page size, what are the page numbers and offsets for the following address references (provided as decimal numbers): a. 2375 b. 19366 c. 30000 d. 256 e. 16385

At one time, UNIX systems used disk-layout optimizations based o

At one time, UNIX systems used disk-layout optimizations based on the rotation position of disk data, but modern implementations, including Linux, simply optimize for sequential data access. Why do they do so? Of what hardware characteristics does sequential access take advantage? Why is rotational optimization no longer so useful?

Can a multithreaded solution using multiple user-level threads a

Can a multithreaded solution using multiple user-level threads achieve better performance on a multiprocessor system than on a single processor system? Explain.

Compare and contrast the techniques of caching disk blocks local

Compare and contrast the techniques of caching disk blocks locally, on a client system, and remotely, on a server.

Compare paging with segmentation with respect to the amount of

Compare paging with segmentation with respect to the amount of memory required by the address translation structures in order to convert virtual addresses to physical addresses.

Compare the circular-wait scheme with the various deadlock-avoid

Compare the circular-wait scheme with the various deadlock-avoidance schemes (like the banker's algorithm) with respect to the following issues: a. Runtime overheads b. System throughput