Operating System



Item Name

Compare the memory organization schemes of contiguous memory all

Compare the memory organization schemes of contiguous memory allocation, pure segmentation, and pure paging with respect to the following issues: a. External fragmentation b. Internal fragmentation c. Ability to share code across processes

Compare the performance of C-SCAN and SCAN scheduling, assuming

Compare the performance of C-SCAN and SCAN scheduling, assuming a uniform distribution of requests. Consider the average response time (the time between the arrival of a request and the completion of that request's service), the variation in response time, and the effective 550 Chapter 12 bandwidth. How does performance depend on the relative sizes of seek time and rotational latency?

Compare the performance of write operations achieved by a

Compare the performance of write operations achieved by a RAID level 5 organization with that achieved by a RAID level1 organization.

Compare the segmented paging scheme with the hashed page table

Compare the segmented paging scheme with the hashed page table scheme for handling large address spaces. Under what circumstances is one scheme preferable to the other?

Compare the throughput achieved by a RAID levels organization

Compare the throughput achieved by a RAID levels organization with that achieved by a RAID level organization for the following: a. Read operations on single blocks b. Read operations on multiple contiguous blocks

Consider a computer system in which "computer games" can be

Consider a computer system in which "computer games" can be played by students only between 10 P.M. and 6 A.M., by faculty members between 5 P.M. and 8 A.M. and by the computer center staff at all times. Suggest a scheme for implementing this policy efficiently.

Consider a computer system that runs 5,000 jobs per month

Consider a computer system that runs 5,000 jobs per month and has no deadlock-prevention or deadlock-avoidance scheme. Deadlocks occur about twice per month, and the operator must terminate and rerun about 10 jobs per deadlock. Each job is worth about $2 (in CPU time), and the jobs terminated tend to be about half-done when they are aborted. A systems programmer has estimated that a...

Consider a computer system with a 32-bit logical address and

Consider a computer system with a 32-bit logical address and 4-KB page size. The system supports up to 512 MB of physical memory. How many entries are there in each of the following? a. A conventional single-level page table b. An inverted page table

Consider a computing cluster consisting of two nodes running a

Consider a computing cluster consisting of two nodes running a database. Describe two ways in which the cluster software can manage access to the data on the disk. Discuss the benefits and disadvantages of each.

Consider a computing environment where a unique number is associ

Consider a computing environment where a unique number is associated with each process and each object in the system. Suppose that we allow a process with number n to access an object with number m only if n > m. What type of protection structure do we have?