Explain the concept of reentrancy, Operating System

Concept of Reentrancy

 

It is a useful, memory-saving method for multiprogrammed timesharing machines. A Reentrant method is one in which multiple clients can share a single copy of a program during the similar period. Reentrancy has 2 key functions: The program code cannot change itself, and the local data for each client process must be stored in different disk. Thus, the permanent phase is the code, and the temporary phase is the pointer back to the calling function and local variables needed by that code. Each operation instance is known as activation. It runs the code in the permanent phase, but has its permanent copy of local parameters or variables. The temporary phase associated with each activity is the activation record. usually, the activation record is store on the stack.

 

 

1267_concept of Reentrancy.png

Posted Date: 8/20/2012 3:20:39 AM | Location : United States







Related Discussions:- Explain the concept of reentrancy, Assignment Help, Ask Question on Explain the concept of reentrancy, Get Answer, Expert's Help, Explain the concept of reentrancy Discussions

Write discussion on Explain the concept of reentrancy
Your posts are moderated
Related Questions
Define the properties of Interactive operating system Interactive:- This system is composed of many short transactions where the results of the next transaction may be unpred

Second-Chance algorithm When a page has been selected, we inspect its reference bit. If the value is 0, we proceed to replace this page. If the reference bit is set to 1, thoug

Explain the Types of System Calls The major types of system calls are like this: a. Process Control: These types of system calls are employed to control the processes.

Explain Deadlock Prevention-Resource allocation graph allocation Resource allocation graph algorithm :  Using this algorithm we are able to actually know if there exists in th

Q. Consider a system in which a program is able to be separated into two parts: code and data. The CPU recognizes whether it wants an instruction (instruction fetch) or data (data


Q.  You have devised a fresh page-replacement algorithm that you think may be optimal. In a few contorted test cases Belady's anomaly occurs. Is the fresh algorithm optimal? Descr

Linked list allocation: At this time the blocks are stored using linked lists. The block size require not be the same. Thus internal fragmentation is avoided. Consider

Define Overflow Chaining Another method will divide the pre-allocated table into two sections: the primary area to determine which keys are mapped and an area for collisions, g

Q. If each the access rights to an object are deleted the object can no longer be accessed. At this stage the object should also be deleted and the space it occupies should be ret