Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Process Description
A process in UNIX is a somewhat complex set of data structures that provides the operating system with all of the information necessary to dispatch and manage processes. The elements of the process image are categorized into two parts. They are as system context and user level context.
The user level context encloses the fundamental elements of the user's program and can be generated directly from a compiled object file. The user's program is divided into text and data areas. The text area is read-only as well as it is intended to hold the program's instructions. While the process is implementing the processor uses the user stack area for procedure calls and returns and parameter passing. The shared memory area is a data area specifically shared with other processes. There is merely one physical copy of a shared memory area other than, by the utilize of virtual memory it appears to every sharing process memory region is in its address space. When a process isn't running then the processor status information is stored in the register context area.
The system level context encloses the remaining information that the operating system needs to manage the process.
It consists of a static part which is fixed in size and stays with a process throughout its lifetime and a dynamic part which vary through the life of the process. The one element of the static part is the process table entry. This is in fact part of the process table maintained by the operating system with one entry per process. The process table entry table process a control information i.e. accessible to the kernel at all times therefore in a virtual memory system all process table entries are maintained in main memory.
Define request edge and assignment edge. Answer: A directed edge from process Pi to resource type R j is denoted by Pi->j; it signifies that process Pi requested an instance
What is the Translation Lookaside Buffer (TLB) In a cached system, the base addresses of the last few referenced pages is maintained in registers known as the TLB that aids in
discuss unsafe state in operating system
Q. Likewise some systems support many types of structures for a file's data while others simply support a stream of bytes. What are the merits in addition to demerits? Answer:
How are file sharing and protection implemented? To execute file sharing and protection the system have to maintain more file and directory attributes than are needed on a sing
draw a state diagram showing the transissions of a process from creation to termination
What is a semaphore? A semaphore 'S' is a synchronization tool which is an integer value that, apart from initialization, is accessed only by two standard atomic operations; w
How do we keep track of where the free pieces of memory are? One idea is to maintain a set of linked-lists of free space; each linked-list will store free chunks of some given size
advantages and disadvantages of kernal level thread
what is secondary storage management
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd