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
In this project, you will implement the Chandy and Misra's (CM) algorithm using POSIX Threads (Pthreads).   The algorithm  is a distributed algorithm to solve a generalized dining

What are the necessary conditions for deadlocks? 1. Mutual exclusion :  Only one process at a time is able to use the resource. 2. Hold and wait :  A process should be holdi

Q. Why is it important to scale up system bus and device speeds as the CPU speed increases? Answer: Consider a system which carries out 50% I/O and 50% computes. Doubling-up


EXPLAIN MULTITASKING IN DETAIL

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 is super block A partition control block have partitions details, such as the number of blocks in the partition, size of the blocks, free-blocks and free-block pointers an

operating systems and its types together with its design issues and their examples.

Explain about deadlock prevention? In order for the occurrence of deadlock, the four conditions like mutual exclusion, hold and wait, no pre-emption and  circular wait must hap

Consider a demand-paging system with the following time-measured utilizations: CPU utilization: 10%, Paging disk: 98%, Other I/O devices: 5%. What does this imply? How to improv