Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
what are overlaysto enable a process to be larger than the amount of memory allocated to it overlays are used the idea of overlays is to keep in
define dynamic linking dynamic linking is same to dynamic loading rather that loading being postponed unless execution time linking is postponed
define dynamic loadingto get better memory-space utilization dynamic loading is used with dynamic loading a routine is not loaded unless it is called
what is the main function of the memory-management unit the runtime mapping from virtual to physical addresses is done by a hardware device known as
what is logical address space and physical address spacethe set of all logical addresses generated by a program is known as a logical address space
what are the methods for handling deadlocks the deadlock problem can be dealt with in one of the three ways a use a protocol to prevent or
what is a resource-allocation graphdeadlocks can be described more precisely in terms of a directed graph known as a system resource allocation graph
what are conditions under which a deadlock situation may arisea deadlock situation can arise if the following four conditions hold concurrently in a
what is the sequence in which resources may be utilized under normal mode of operation a process might be utilize a resource in the following
define deadlocka process requests resources if the resources are not available at that time the method enters a wait state waiting processes might
define busy waiting and spinlock when a process is in its critical section any other process that tries to enter its critical section must loop
what is semaphores a semaphore s is a synchronization tool which is an integer value that apart from initialization is accessed only by two
define entry section and exit section the critical section problem is to design a protocol that the processes can use to cooperate every process must
what is critical section problem consider a system having of n processes each process has segment of code known as a critical section in which the
define race condition when several process access and manipulate similar data concurrently then the outcome of the implementation depends on
what is turnaround timeturnaround time is the interval from the time of submission to the time of completion of a process it is the sum of the
define throughput throughput in cpu scheduling is the number of processes that are completed per unit time for long processes this rate might be
what is preemptive and nonpreemptive schedulingunder nonpreemptive scheduling once the cpu has been allocated to a process the process keeps the cpu
define cpu schedulingcpu scheduling is the method of switching the cpu among various processes cpu scheduling is the basis of multiprogrammed
what are the different ways in which a thread can be cancelled cancellation of a target thread may occur in two different scenariosasynchronous
define thread cancellation amp target thread the thread cancellation is the task of terminating a thread before it has done a thread that is to
what is the use of fork and exec system calls fork is a system call by which a new process is formed exec is also a system call which is used
what are the kernel threadskernel threads are supported directly by the operating system thread creation scheduling and management are done by the
what are user threads user threads are supported above the kernel and are executed by a thread library at the user level thread creation amp
what is a threada thread otherwise called a lightweight process lwp is a basic unit of cpu utilization it comprises of a thread id a program counter