Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
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
what is a semaphorea 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 sectionthe critical section problem is to design a protocol that the processes can use to cooperate every process must
what is critical section problemconsider a system consists of n processes every process has segment of code called a critical section in which the
define race conditionwhen various process access and manipulate similar data concurrently then the outcome of the execution depends on certain order
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 throughputthroughput in cpu scheduling is the number of processes that are completed per unit time for long processes this rate might be one
what are the various scheduling criteria for cpu schedulingthe various scheduling criteria are cpu
what is dispatch latencythe time taken by the dispatcher to stop one process and begin another running is known as dispatch