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


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 Demand paging? Virtual memory is commonly executed by demand paging. In demand paging, the pager brings only those essential pages into memory instead of swapping in a

what are reasons for cooperating processes

Explain the TlsAlloc (VOID) This function is used to allocate a TLS index.Any subsequent TLS function calls will require  the handle returned  from TlsAlloc to be passed. The i

Virtual addresses are made up of two parts: the ?rst part is the page number, and the second part is an offset inside that page. Suppose our pages are 4kb (4096 = 212 bytes) long,

Explain the Request/Response Interface   Many issues are involved in providing a procedural interface for client functions to interact with server components. First off, since

State critical section problem? Discuss three solutions to solve the critical section problem. C-S Problem:- n processes all competing to use some shared data Every

Demand paging With demand paging, a page is called into memory only when a location on that page is actually indexed during run time. With pre-paging, pages other than the one

W hat is hashed page table & method of hashed page table with details