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
Write in brief on UNIX file structure. UNIX considers every file to be a sequence of 8-bit bytes no interpretation of these bits is made by the operating system. This system pr

Question 1 Explain the structure of operating system in detail Question 2 Explain the following scheduling algorithm                                     1) First come Firs

Explain the Thread Contextual Data  Threads in Net Ware carry additional context as well. Per-thread, stacks, errno, Net Ware Errno, t_errno and others are available to the ap

with the aid of diagrams describe the following os structures monolithic , layered, client server

Q. Some untimely computers protected the operating system by placing it in a memory partition that couldn't be modified by either the user job or the operating system itself. Expl

The physical memory acts as a cache backed by the disk. When the physical memory is full, and we want to read in another page from disk, we have to evict a page from physical memor

Consider the subsequent resource-allocation policy. Requests as well as releases for resources are allowed at any time. If a request for resources can't be satisfied because the re

Write a note on the usage of semaphores. Semaphore is a synchronization tool and it is a variable having integer values. It is accessed only by two standard atomic operations w

Define rotational latency and disk bandwidth. Rotational latency is the additional time waiting for the disk to rotate the wanted sector to the disk head. The disk bandwidth is

In a  p system each part (RAM, ROM, I/O) has a unique set of numbers. The allocation of these numbers is usually stated in the form of a memory map. This is a plot of data bus agai