Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Solved Assignments
Asked Questions
Answered Questions
define logical address and physical addressan address formed by the cpu is referred as logical address an address seen by the memory unit that is the
what is bankers algorithmbankers algorithm is a deadlock avoidance algorithm that is applicable to a resource-allocation system with multiple
what are a safe state and an unsafe stateanswer a state is safe if the system can allocate resources to every process in some order and still
define deadlock avoidancean alternative method for avoiding deadlocks is to need additional information about how resources are to be requested every
define deadlock prevention deadlock prevention is a set of process for ensuring that at least one of the four essential conditions like mutual
what are the methods for handling deadlocksthe deadlock problem can be dealt with in one of the three waysa use a protocol to prevent or avoid
define request edge and assignment edgeanswer a directed edge from process pi to resource type rj is denoted by pi-gtj it signifies that process
what is a resource-allocation graphdeadlocks can be explained more precisely in terms of a directed graph called 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 simultaneously in
what is the sequence in which resources may be utilizedunder normal mode of operation a process may utilize a resource in the following sequence
define deadlocka process requests resources if the resources are not available at that time the process enters a wait state waiting processes might
write about critical regions and monitorscritical region definitionmonitor definitionimplementation of the conditional-region constructsyntax of
explain what semaphores are their usage implementation given to avoid busy waiting and binary semaphoressemaphore definitionusage for mutual
state critical section problem discuss three solutions to solve the critical section problemc-s problem- n processes all competing to use some shared
explain multilevel feedback queue in detail a process can move among the various queues aging can be executed this way multilevel-feedback-queue
explain components of conflict phase of dispatch latencythe conflict phase of dispatch latency has two components1 preemption of any process running
briefly discuss on real-time schedulingit is divided into two types hard real-time systems are needed to complete a critical task within a
what are the benefits of thread pools-the benefits of thread pools are1 it is usually faster to service a request with an existing thread than
signal handlinga signal is used in unix systems to inform a process that a particular event has occurred1 a signal is produced by the occurrence of a
explain about threading issuesthe fork and exec system callsin a multithreaded program of few unix systems have chosen to have two versions of fork
what are the multithreading models there are three models-a many-to-one modelb one-to-one model c many-to-many
define the difference between preemptive and nonpreemptive scheduling state why strict nonpreemptive scheduling is unlikely to be used in a computer
what are two differences among user-level threads and kernel-level threads under what circumstances is one type better than the other1 user-level
normal 0 false false false en-in x-none x-none microsoftinternetexplorer4 provide two programming examples of
define busy waiting and spinlockwhen a process is in its significant section any other process that tries to enter its critical section must loop