Q1. Different algorithms are used for scheduling the disk head so that seek time may be reduced. Calculate total number of heads movement for the following algorithms for the given disk queue with requests for I/O to blocks on cylinders in that order. Queue = 98, 183, 37, 122, 14, 124, 65, 67 If the disk head is initially at cylinder 53 and direction is Right. FCFS – First-Come, First-Served - FCFS

Q1. Different algorithms are used for scheduling the disk head so that seek time may be reduced. Calculate total number of heads movement for the following algorithms for the given disk queue with requests for I/O to blocks on cylinders in that order. Queue = 98, 183, 37, 122, 14, 124, 65, 67 If the disk head is initially at cylinder 53 and direction is Right. FCFS – First-Come, First-Served - FCFS

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter8: Advanced Data Handling Concepts

Section: Chapter Questions

Problem 20RQ

See similar textbooks

Similar questions

Some applications require two types of accesses to the critical section-read access and write access. For these applications, it is reasonable for multiple read accesses to happen concurrently. However, a write access cannot happen concurrently with either a read access or a write access. Example: For a sequence [R1, R2, W1, R3] of requests, R1 and R2 should be able to access the critical section concurrently while W1 and R3 wait in the queue. Once R1 and R2 leave the critical section, W1 can enter the critical section while R3 waits in the queue. (a) Modify Lamport's algorithm for such applications. (b) Modify Ricart and Agrawala's algorithm for such applications.
Consider a variant of the RR scheduling algorithm where the entries in the ready queue are pointers to the PCBs. a. What would be the effect of putting two pointers to the same process in the ready queue? b. What would be the major advantages and disadvantages of this scheme? c. How would you modify the basic RR algorithm to achieve the same effect without the duplicate pointers?
b) Consider a disk queue with requests for IVO to blocks on cylinders 108, 193, 51, 132, 24, 134, 75, 77. The head is initially at cylinder number 63. The cylinders are numbered from 0 to 199. Find out the total head movements using the following algorithms a) First Come-First Serve (FCFS) b) Shortest Seek Time First (SSTF) c) Elevator (SCAN) d) Circular LOOK (C-LOOK)
A common implementation of sequential files on disk has each block point to its successor, which may be any block on the disk. This method requires a constant amount of time to write a block (as the file is originally written), to read the first block in the file, and to read the ith block, once you have read the 1 - 1” block. Reading the lth block therefore requires time proportional to 1. Show how by adding just one additional pointer per node, you can keep all the other properties, but allow the lth block to be read in time proportional to log I. [Hint: heaps have implicit pointers from node I to what other nodes?] Explain what the algorithm for reading the th block has in common with an algorithm for raising a number to the ith power in time proportional to log 1.
An operating system follows a variable memory partitioning model. The system keeps track of empty blocks in a linked list in the order of their address, where each node stores the size of next empty block in the memory. Say that current state of the memory is hold by the linked list shown below, which tells that there are currently four empty blocks in the memory, and the size of first block is 12 byte etc.
In order to maintain linked lists in memory, static arrays or dynamically divided memory sections may be used. In what ways does one strategy offer advantages over the others?
Can you provide a step-by-step procedure on how to solve this image below for better understanding of multilevel queue scheduling? thank you!
In asymmetric multiprocessing, the process is taken from the ready queue. Select one: O True O False Drevie IS
PLEASE USE PTHREADS Write a program in C using PTHREADSthat will simulate the operations of the following Batch scheduling algorithms: PLease use Pthreads First-Come, First-Served Shortest Job First Your Program will implement threads for each algorithm plus the main thread. A linked list will be used to represent the list of jobs available to run. Each node will represent a Job with the following information: int PID Process ID int time; The time needed on CPU to finish executing Main thread: Your main code will request the user to input a list of jobs, and to fill the information in each job node until a sentinel value is reached, each data item will be stored in a separate node. Starts the FCFS thread, followed by SJF thread. Wait for both threads to finish before exiting. FCFS thread: The thread will simulate the First-Come, First-Served algorithm. Displays the data in a list in the order they were inserted. SJF thread: The thread will simulate the Shortest…
Which of the following statements are true about implementing a queue using dynamically linked nodes? The size of the queue cannot be obtained with O(1) time complexity if the variable that keeps track of the number of items is not maintained. If only a head pointer is used, the dequeue operation will have a time complexity of O(n). If only a head pointer is used, the enqueue operation will have a time complexity of O(n).
To store linked lists in memory, employ static arrays or dynamically divided memory portions. How does each strategy differ?
AN EXAMPLE OF THE Dynamic Partitioning Memory Allocation Algorithm using First Fit is PRESENTED in the following table. Example for First-Fit TASK 1 2 3 4 5 BEST FIT SIZE STATE 50 EXECUTION 30 EXECUTION 120 WAIT 80 WATI 25 EXECUTION WORST FIT BLOCK SAWNP 1 2 3 4 5 P.D. EXPLAIN STEP AND CALCULATION TO DO THIS SIZE STATE 120 BUSY 80 BUSY 40 BUSY 50 FREE 30 FREE TASK 1 2 5 SIZE T. Then under the previous format and the same data is to perform the following two algorithms 50 30 25 WASTE 70 50 15 50 30 215 fragmentation FRAGMENTATION CALCULATIONS 元 50 15 70 135