Explain about memory-management scheme, Operating System

Q. In the IBM/370 memory protection is offered through the use of keys. A key is a 4-bit quantity every 2K block of memory has a key (the storage key) associated with it. The CPU as well has a key (the protection key) associated with it. A store operation is permitted only if both keys are equal or if either is zero. Which of the subsequent memory-management schemes could be used successfully with this hardware?

a. Bare machine

b. Single-user system

c. A Multiprogramming with a fixed number of processes

d. A Multiprogramming with a variable number of processes

e. Paging

f. Segmentation

Answer:

a. Protection not necessary set system key to 0.

b. Set system key to 0 when in supervisor mode.

c. Region sizes should be fixed in increments of 2k bytes allocate key with memory blocks.

d. Same as above.

e. Frame sizes should be in increments of 2k bytes, allocate key with pages.

f. Segment sizes should be in increments of 2k bytes, allocate key with segments.

Posted Date: 7/27/2013 5:15:41 AM | Location : United States







Related Discussions:- Explain about memory-management scheme, Assignment Help, Ask Question on Explain about memory-management scheme, Get Answer, Expert's Help, Explain about memory-management scheme Discussions

Write discussion on Explain about memory-management scheme
Your posts are moderated
Related Questions
Q. Presume that a distributed system is susceptible to server failure. What mechanisms would be needed to guarantee the exactly once semantics for execution of RPCs? Ans

Q. Dynamically loadable kernel modules give elasticity when drivers are added to a system however do they have disadvantages too? Under what situations would a kernel be compiled

Cold Backup: It is copying the three groups of files when the object is shut down. This is a straight file copy, generally from the storage disk directly to tape. You must end th

Many-to-Many Model The many-to-many model- many user-level threads to many kernel-level threads avoids several of the limitations of the one-to-one model, although extending mu

FIXED PARTITIONING In a fixed partitioning, the operating system inhabiting some fixed portion of main memory is available for use of multiple processes -Using fixed partit

Define Disadvantages of Top Down parsing of Backtracking The disadvantages of top down parsing of backtracking: (i)  Semantic actions cannot be carried out while making a pr

Define deadlock. A process requests resources; if the resources are not available at that time, the process enters a wait state. Waiting processes might be never again change s

Problem: (a) Based on your experience in setting up Windows 2003 Server operating system, briefly describe the twelve different steps in which the installation is conducted du

Explain the Thread Contextual Data  Threads in Net Ware carry additional context as well. Per-thread, stacks, errno, Net Ware Errno, t_errno and others are available to the ap

how to solve queing theory step by step