What is the effect on the cost of merging runs if the number of buffer blocks per run is increased while overall memory available for buffering runs remains fixed?

2. a) Your colleague has invented a new scheduling algorithm using the multilevel queue approach. This list of processes showing CPU burst times is below. There are three queues used in the application. The processes all start on the first queue and receive upto 10ms of burst time. Once the process has received the 10ms on the first queue, if the process still requires burst time it is passed to the second queue where it receives upto 20ms. Once the process has received the 20ms on the second queue, if the process still requires burst time it is passed to the third queue where it receives CPU time until it is completed. The operating system will only start allocating CPU time to processes on the second queue when queue 1 is empty. The operating system will only start allocating CPU time to processes on the third queue when queue 2 is empty. Process Number P1 P2 P3 P4 Burst time (ms) 21 8 35 50 i) Does this algorithm give higher priority to any queue over the others and any processes…

There are many parameters that could be used to describe disk performance; among them are:   number of bits per track disk capacity (in bits) number of disk surfaces rotational speed rotational latency transfer rate tracks per surface sectors per track blocks per track sectors per block seek time speed of disk arm block-read time number of blocks   Some of these parameters are independent, and others are (approximately) linearly related. That is, doubling one doubles the other. Decide which of these parameters are linearly related. Then, select from the list below, the relationship that is true, to within a close approximation. Note: none of the statements may be true exactly, but one will always be much closer to the truth than the other three. Also note: you should assume all dimensions and parameters of the disk are unchanged except for the ones mentioned.        a)  If you divide tracks into half as many blocks, then you double the read time for a block.…

List the 4 conditions that can cause a deadlock for concurrent processes P1 and P2.   (short answer is ok)