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 co-operative process? A process is co-operating if it can influence or be affected by the other processes implementing in the system. Any process that share data with o

1. A digitized voice channel is made by digitizing a 7 KHz bandwidth analog signal. The signal is to be sampled twice the highest frequency (two samples per hertz) . Assume each sa


Consider a scenario of post mailbox, there are two processes named sender S and receiver R. Both processes can communicate with each other by name along with message. You need to I

Locality of reference entails that the page reference being made by a processĀ  Locality of reference entails that the page reference being made by a process is similarly to be

explain about design issues of network operating system

LRU page replacement In slightest recently used page replacement algorithm we will replace that page that hasn't been used for the longest period of time. This is similar as an

Explian Integrating a Request/Response Mechanism Traditional application developers will need to develop a mechanism for communication between requesting (client) and respondin

Q. Data transfer between two processes? Communication: Data transfer between two processes is essential for some time. Both processes are on the one computer or on different

Define lazy swapper. Rather than swapping the entire process into main memory, a lazy swapper is used. A lazy swapper never swaps a page into memory unless that page will be ne