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 long-term, medium-term, short-term? In a batch system many processes are submitted than are able to be executed immediately. These processes are reel to a mass storage

Define where a Program generation activity aimsĀ  Program generation activity aims at Automatic generation of program


I need help implementing malloc

Problem: (a) (i) Explain what a single system image is and how it is related to the concept of a distributed operating system? (ii) What are the main differences between a

Explain the ExitThread Function used in the Windows NT ExitThread(ExitCode) The ExitThread( ) call is made to end the currently running thread. If the current thread is th

Q. Polling for an I/O completion is able to waste a large number of CPU cycles if the processor iterates a busy-waiting loop several times before the I/O completes. However if the

FCFS (First Come, First Served) Perform operations in order requested No reordering of work queue No starvation every demand is serviced Poor performance

Write a short note about schedulers. Processes migrate between the various scheduling queues throughout its life time. The operating system should select for scheduling purpose

What do you mean by first fit? First fit allocates the first hole that is big sufficient .Searching can either start at the starting of the set of holes or where the previous f