Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
consider the following ways of handling deadlock1 bankers algorithm2 detect deadlock and kill thread releasing all
a three processes share four resource units that can be reserved and released only one at a time each process needs a
1 in a fixed-partitioning scheme what are the advantages of using unequal-size partitions2 what is the difference
to implement the various placement algorithms discussed for dynamic partitioning section 72 a list of the free blocks
another placement algorithm for dynamic partitioning is referred to as worst-fit in this case the largest free block of
consider a buddy system in which a particular block under the current allocation has an address of 011011110000a if the
the fibonacci sequence is defined as followsa could this sequence be used to establish a buddy systemb what would be
during the course of execution of a program the processor will increment the contents of the instruction register
consider a simple paging system with the following parameters 232 bytes of physical memory page size of 210 bytes 216
a virtual address a in a paging system is equivalent to a pair p w in which p is a page number and w is a byte number
1 what is the difference between simple paging and virtual memory paging2 explain thrashing3 why is the principle of
1 what is the purpose of a translation lookaside buffer2 briefly define the alternative page fetch policies3 what is
1 what is an embedded system2 what are some typical requirements or constraints on embedded systems3 what is an
least laxity first llf is a real-time scheduling algorithm for periodic tasks slack time or laxity is the amount of
maximum urgency first muf is a real-time scheduling algorithm for periodic tasks each task is assigned an urgency that
five batch jobs a through e arrive at a computer center at essentially the same time they have an estimated running
1 list and briefly define five different categories of synchronization granularity2 list and briefly define four
1 what is the difference between periodic and aperiodic real-time tasks2 list and briefly define five general areas of
in priority-based process scheduling the scheduler only gives control to a particular process if no other process of
an interactive system using round-robin scheduling and swapping tries to give guaranteed response to trivial requests
most round-robin schedulers use a fixed size quantum give an argument in favor of a small quantum now give an argument
consider the disk system described in problem 119 and assume that the disk rotates at 360 rpm a processor reads one
calculate how much disk space in sectors tracks and surfaces will be required to store 300000 120-byte logical records
consider a disk with n tracks numbered from 0 to n - 1 and assume that requested sectors are distributed randomly and
generalize the result of problem 111 to the case in which a program refers to n devicesproblem 111consider a program