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.
What are two differences among user-level threads and kernel-level threads? Under what circumstances is one type better than the other? (1) User-level threads are unknown by th
Define busy waiting and spinlock. When a process is in its significant section, any other process that tries to enter its critical section must loop continuously in the entry c
Explain the various methods for handling deadlocks. A set of processes is deadlocked if every process in the set is waiting for an event that only a process in the
Define CPU scheduling. CPU scheduling is the method of switching the CPU among several processes. CPU scheduling is the basis of multiprogrammed operating systems. By switching
Tree structured directories: This is the main common directory structure. The tree has a root directory as well as every file in the system has a unique path name. A directory
What are the common strategies to select a free hole from a set of available holes? The most common methods are a. First fit b. Best fit c. Worst fit
Question: a) Each process is represented in the operating system by a process control block (PCB). The PCB contains many pieces of information associated with a specific proce
Q. Describe why SSTF scheduling tends to favour middle cylinders over the innermost and outermost cylinders. Answer: The middle of the disk is the location having the smalles
Medium term scheduling This is component of the swapping function. Usually the swapping in decision is based on the need to manage the degree of multiprogramming. At a system t
what is the meaning
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