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

What is sector sparing? Low-level formatting also sets aside extra sectors not visible to the operating system. The controller can be told to change each bad sector logically w

Define multithreading The proficiency of an operating system to execute different parts of a program called threads simultaneously is called as multithreading. A thread is a fl

Q) a. Given that the first three necessary conditions for a deadlock are in place, comment on the feasibility of the following strategy. All processes are given  unique priorities.

Define a linker program  A linker program links the program along with other programs required for its execution.


Now, let us discuss two related algorithms for deciding which pages to evict. The clock algorithm is one of the most popular choices. It works by keeping frames in a circular struc

NEXT FIT ALGORITHM Here scanning starts from the first fit position and then it finds the next position which is large sufficient to hold the process. Thus the name next fit.

explain how response time are reduced by allowing time sharing on top of multiprogramming

Determine how Action implementing instruction’s meaning are a actually carried out   Action implementing meaning of instruction are a actually carried out Instruction executio