Consider a disk queue with requests for I/O to blocks on cylinders.98 183 37 122 14 124 65 67. "Considering SSTF (shortest seek time first) scheduling", the total number of head movements is, if the disk head is initially at 53 is?

Consider a disk queue with requests for I/O to blocks on cylinders.98 183 37 122 14 124 65 67. "Considering SSTF (shortest seek time first) scheduling", the total number of head movements is, if the disk head is initially at 53 is?

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter20: Queuing Theory

Section20.10: Exponential Queues In Series And Open Queuing Networks

Problem 12P

See similar textbooks

Related questions

Q: Make the difference between a cache that is directly mapped and one that is totally associative.

A: The answer is given in the below step

Q: Find out the average waiting time, average response time and average turnaround time of the…

A: A)

Q: Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive is currently serving…

A: Solution: The queue of pending requests, in FIFO order, is: 2,069 1,212 2,296 2,800 544 1,618 356…

Q: Consider an ordered disk requests queue with involving

A: Total distance to satisfy pending request in C-SCAN = 367

Q: Find out the total Head Movement of the Disk Head for the following request queue: 98, 183, 37, 122,…

Q: Consider a memory of size 8KB (8192 bytes) that allows dynamic, variable sized partitioning among…

A: ans :: As given in the question, P1 is allocated 500 bytes of memoryBase address BA = 2000Updated…

Q: Suppose that a disk drive has 40 cylinders, numbered 0 to 40. The drive is currently serving a…

A: Operating systems use a disk scheduling algorithm to schedule I/O requests that arrive at the disk.…

Q: . A paging system with a cache size of 3 pages, but with 8 pages in the disk (A,B,..H) has the…

Q: Consider a 4-way set associative cache made up of 64-bit words. The number of words per line is 8…

A: To calculate the size of the cache, use the following formula –

Q: b) Consider a disk queue with requests for I/O to blocks on cylinders 108, 193, 51, 132, 24, 134,…

Q: Suppose the head of a moving-head disk with 200 tracks numbered 0 to 199 is currently serving a…

A: Disk Scheduling Algorithms are used to decrease any request's total seek time and schedule I/O…

Q: Consider a computer with 128 MB of main memory, 64 KB of cache, and 4 bytes per memory block. Find…

A: Block size = 4B So block offset bits = log 4 = 2 bits. Total number of cache block = 64/4 = 16…

Q: suppose that a disk drive has 200 tracks, numbered 0 to 199. The drive is currently serving a…

Q: Suppose that a disk drive has 200 cylinders num- bered 0 to 199. The drive is currently serving a…

A: The Answer is

Q: Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive is currently serving…

A: Solution: The queue of pending requests, in FIFO order, is: 2,069 1,212 2,296 2,800 544 1,618 356…

Q: Consider a disk queue with requests for 1/O to blocks on cylinders 82,170,43,140,24,16,190 The head…

A: Let's understand step by step : 1. FCFS FCFS means First Come First Serve. The request which…

Q: Assume there are three small caches, each consisting of four one word blocks. One cache is fully…

A: Assume there are three small caches, each consisting of four one word blocks. One cache isfully…

Q: Draw a line between a cache that is fully associative and one that is directly mapped out.

A: In a complete associative cache mapping, each block of main memory may be stored anywhere in the…

Q: head is at cylinder 130. The request queue is given as follows: 150, 40, 350, 100, 280 For each of…

A: Here in this question we have given a disk with 400 cylinder and we have also given some request to…

Q: Consider a 200 cylinder hard disk with one arm. Suppose the following cylinder requests arrive in…

A: Consider a 200 cylinder hard disk with one arm. Suppose the following cylinder requests, made by…

Q: . Suppose that a disk drive has 200 cylinders, numbered 0 to 199 and the disk head is initially at…

A: We are going to find out the distance in terms of cylinder using following disk scheduling…

Q: Consider an ordered disk queue with requests involving tracks 97,145,22,14,124,65 and 67. if the…

A: The answer is given in the below step

Q: Suppose that a disk drive has 300 cylinders, numbered 0 to 299, the outermost cylinder is number 0.…

A: Algorithm: We will stores the indexes of the tracks that have been requested in ascending order and…

Q: Suppose that a disk drive has 300 cylinders, numbered 0 to 299, the outermost cylinder is number 0.…

A: C-LOOK is an enhanced version of both SCAN as well as LOOK disk scheduling algorithms. In this…

Q: Assume a 32-bit virtual address and 4 MBs of memory (i.e., DRAM). If the page size is 1 KB, then…

A: Assume a 32-bit virtual address and 4 MBs of memory (i.e., DRAM). If the page size is 1 KB, then…

Q: We know that the paging scheme suffers from internal fragmentation. S1: If the CPU attempts to…

A: answer: S2 is correct means S2 is true

Q: Suppose that a disk drive has 300 cylinders, numbered 0 to 299, the outermost cylinder is number 0.…

A: Algorithm: We will stores the indexes of the tracks that have been requested in ascending order and…

Q: 5. Suppose that a disk drive has 40 cylinders, numbered 0 to 40. The drive is currently serving a…

Q: Consider a paging memory allocation whose page size is 5KB and one word is equal to 8 Bytes. Answer…

A: Total number of words in one page = 5KB/8B = 640 words. Logical address = 33124 Page number =…

Q: Think about the distinction that exists between a cache that is completely associative and one that…

A: The above question is solved in step 2 :-

Q: (a) Discuss, with the help of a diagram, why a hierarchical structure is used for system…

A: Disk scheduling :It is used to access data from the disk. Computer architecture: It is the ways by…

Q: Consider a disk queue with requests for I/O to blocks on cylinders 47, 38, 121, 191, 87, 11, 92, 10.…

A: Introduction:Given, request for I/O to blocks on cylinders 47, 38, 121, 191, 87, 11, 92 and…

Q: Consider an ordered disk queue with requests involving tracks 97,145,22,14,124,65 and 67. if the…

A: C-SCAN is a varient of scan designed to provide a more uniform wait time.

Q: Calculate the number of disk tracks traversed using the FCFS algorithms for the series of disk track…

A: Given: Calculate the number of disk tracks traversed using the FCFS algorithms for the series of…

Q: Calculate the number of disk tracks traversed using the FCFS, SSTF, SCAN, and LOOK algorithms for…

A: Performance: The speed of the CPU is a key factor that often decides the performance of the system.…

Q: Fill in blank Suppose that linear page table is used where the memory addresses are 12-bit binary…

A: Here, we are given a linear page table with memory address and page size. Virtual address is divided…

Q: We are given a list of 64-bit memory address references, given as word addresses. Ox03, Oxb4, Ox2b,…

A: Actually, cache is a fast access memory.

Q: Consider a disk queue with requests for I/O to blocks on Cylinders: 98 183 37 122 14 124 65 67…

A: Minimise the overhead by picking closest to current head position.

Q: Suppose the head of a moving head disk with 200 tracks numbered 0-199 is currently serving a request…

A: 1. FCFS (First Come First Served)

Q: Suppose we have a byte-addressable computer with a cache that holds 16 blocks of 4 bytes each.…

A: The given system is a byte addressable computer. Number of blocks = 16 Block Size = 4 Bytes Length…

Q: Suppose there are four processes (P1 - P4) with respective arrival times of 0, 10, 30, and 40, and…

A: Required: Suppose there are four processes (P1 - P4) with respective arrival times of 0, 10, 30, and…

Q: Find the total head movements for a request queue given below, using FCFS scheduling for a disk of…

A: The given I/O blocks for FCFS Scheduling 75, 25, 30, 68, 40, 89, 10 where head is initially at…

Q: For the provided log processing function, which fields in a log entry will be accessed? How many…

A: For the provided log processing function, which fields in a log entry will be accessed? How many…

Q: Suppose the head of a moving-head disk with 200 tracks numbered 0 to 199 is currently serving a…

A: The answer given as below:

Q: We are given a list of 64-bit memory address references, given as word addresses. Ox03, Oxb4, Ox2b,…

A: According to the information given:- We have to identify the binary word address on the basic of…

Q: SSTF scheduling algorithm, a) What is the order that the requests are serviced, assuming the disk…

A: EXPLANATION SSTF stands for Shortest Seek Time First. As the name suggests the tracks that are…

Q: Question: CLO: ; Bloom Taxonomy Level: Suppose that the current position of Read/Write head is at…

A: 140,82,170,24,16,43,190,37,95,111 start head at 60 FCFS,SSTF,SCAN,C-SCAN,LOOK,C-LOOK

Q: Assume there are three small caches, each consisting of four one-word blocks. One cache is fully…

A: Solution Fully Associated 4- caches block number or miss = 3

Q: Consider a disk queue holding requests to the following cylinders in the listed order: 116, 22, 3,…

A: Answer to the above question is in step2.

Concept explainers

Properties of different architectures

Software architectures are the blueprint of a software system. They consist of all components involved in a system, relations between various components, the environment of operation, and the principle used in designing the software. In other words, software architecture shows the organization of different software structures and helps understand their behavior.

Question

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Consider a disk queue with requests for I/O to blocks on Cylinders: 98 183 37 122 14 124 65 67 Consider SSTF (shortest seek time first) scheduling, the total number of head movements is, if the disk is initially 53. Select one: a.245 b.240 c.236 d.224
Consider an ordered disk queue with requests involving tracks 97,145,22,14,124,65 and 67. if the read write head is initially at track 53, what is the total distance that the disk are moves to satisfy all the pending request for C-SCAN?
Suppose the head of a moving-head disk with 200 tracks numbered 0 to 199 is currently serving a request at track 99 and has just finished a request at track 125. The queue of outstanding requests in FIFO order is: 5, 95, 75, 100,30 and 155. What is the total number of head movements (in cylinders) for the following disk-scheduling algorithms? a.FCFS Scheduling b.SCAN Scheduling c.SSTF Scheduling
Consider a disk queue with requests for I/O to blocks on cylinders 47, 38, 121, 191, 87, 11, 92, 10. The C-LOOK scheduling algorithm is used. The head is initially at cylinder number 63, moving towards larger cylinder numbers on its servicing pass. The cylinders are numbered from 0 to 199. The total head movement (in number of cylinders) incurred while servicing these requests is
Suppose the head of a moving head disk with 200 tracks numbered 0-199 is currently servinga request at track 143. It has just finished a request at track 125. If the queue of requests iskept in the FIFO order,86,147,85,177,94,150,102,175,130What is the total head movement to satisfy these requests for the following disk schedulingalgorithms? First Come First Served Shortest Seek Time First SCAN
Suppose the head of a moving-head disk with 200 tracks numbered 0 to 199 is currently serving a request at track 99 and has just finished a request at track 125. The queue of outstanding requests in FIFO order is: 5, 95, 75, 100,30 and 155. What is the total number of head movements (in cylinders) for the following disk-scheduling algorithms? FCFS Scheduling SCAN Scheduling SSTF Scheduling
Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive is currently serving a request at cylinder 2,150, and the previous request was at cylinder 1,805. The queue of pending requests, in FIFO order, is:2,069 1,2122,2962,8005441,6183561,5234,9653681a. FCFSb. SSTFc. SCANd. LOOKe. C-SCANf. C-LOOK
Suppose that a disk drive has 100 cylinders, numbered from 0 to 99. The queue which is maintained is 10, 20, 50, 70, 80 in order. The disk arm is initially at cylinder 40. Starting from the current head position, what is the total distance (head movement) for SSTF algorithms? LOOK
Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive is currently serving a request at cylinder 2,150, and the previous request was at cylinder 1,805. The queue of pending requests, in FIFO order, is: 2,069 1,212 2,296 2,800 544 1,618 356 1,523 4,956 3,681 Calculate the total seek time for each of the schedules TOTAL DISTANCE TOTAL SEEK TIME FCFS SSTF SCAN LOOK C-SCAN C-LOOK
Find the total head movements for a request queue given below, using FCFS scheduling for a disk of 100 cylinders (0-99). It is assumed that read write head is initially present at cylinder number 50. Request queue for disk cylinders: 75, 25, 30, 68, 40, 89, 10
Consider a file system that uses contiguous allocation method. For a disk consists of 100 data blocks, each block is 4KB. What is the maximum and minimum number of files of size 15KB can it save? Find the number of files the disk able to support using (1) link allocation and (2) index allocation, assuming the address is 32 bit.
Find out the total Head Movement of the Disk Head for the following request queue: 98, 183, 37, 122, 14, 124, 65, 67 Using the algorithms: a) FCFS b) SSTF c) SCAN d) C-SCAN e) C-LOOK The question did not state any initial head cylinder number.