Suppose that a disk drive has 200 cylinders, numbered 0 to 199. The drive is currently serving a request at cylinder 53. The queue of request is kept in theFIFO order: 98, 183, 37, 122, 14, 124, 65, and 67What is the total number of head movements needed to satisfy these requests for the following SSTF disk-scheduling algorithm?O a. 640O b. 720OC. 540O d. 236

Shortest seek time first Disk Scheduling algorithm:

Answered: Suppose that a disk drive has 200…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

Consider a file system on a disk that has both logical and physical block sizes of 512 bytes. Assume that the information about each file is al ready in memory. For each of the three allocation strategies (contiguous, linked, and indexed), answer these questions: a. How is the logical-to-physical address mapping accomplished in this system? (For the indexed allocation, assume that a file is always less than 512 blocks long.) b. If we are currently at logical block 10 (the last block accessed was block 10) and want to access logical block 4, how many physical blocks must be read from the disk
Assuming 4K clustering for a 500-byte file, what is the size (in bytes) of the File Slack? O 12 bytes O 1536 bytes O 3584 bytes O 4096 bytes
Calculate the number of disk tracks traversed using the FCFS algorithms for the series of disk track service requests given as 54,36,21,74,46,35,26,67. At the time the first request arrives in the disk request queue, the read/write head is at track 50, moving toward the outer (lower-numbered)tracks. Draw the graph of the movement. Assume that the disk has 100 tracks from 0 to 99.
Suppose a disk has N cylinders, numbered from 0 to P. At some time, the disk arm is at cylinder X, and there is a queue of disk access requests for cylinders R1, R2, R3, R4. Explain which Disk scheduling algorithm should be the best to be used between the following a) FIFO b) CSCAN c) SSTF d) FSCAN e) CLOOK N: B • • Choose any acceptable numeric numbers for N, P, X, R1, R2, R3 and R4 • • Plagiarism Will be penalized heavily
Requests are not usually uniformly distributed. For example, a cylinder containing the file system FAT or inodes can be expected to be accessed more frequently than a cylinder that only contains files. Suppose you know that 50 percent of the requests are for a small, fixed number of cylinders. a. Would any of the scheduling algorithms discussed in this chapter be particularly good for this case? Explain your answer. b. Propose a disk-scheduling algorithm that gives even better performance by taking advantage of this "hot spot" on the disk. c. File systems typically find data blocks via an indirection table, such as a FAT in DOS or inodes in UNIX. Describe one or more ways to take advantage of this indirection to improve the disk performance.

Recommended textbooks for you

Computer Networking: A Top-Down Approach (7th Edi…

Computer Engineering

ISBN:

9780133594140

Author:

James Kurose, Keith Ross

Publisher:

PEARSON

Computer Organization and Design MIPS Edition, Fi…

Computer Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

Network+ Guide to Networks (MindTap Course List)

Computer Engineering

ISBN:

9781337569330

Author:

Jill West, Tamara Dean, Jean Andrews

Publisher:

Cengage Learning

Computer Networking: A Top-Down Approach (7th Edi…

Computer Engineering

ISBN:

9780133594140

Author:

James Kurose, Keith Ross

Publisher:

PEARSON

Computer Organization and Design MIPS Edition, Fi…

Computer Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

Network+ Guide to Networks (MindTap Course List)

Computer Engineering

ISBN:

9781337569330

Author:

Jill West, Tamara Dean, Jean Andrews

Publisher:

Cengage Learning

Concepts of Database Management

Computer Engineering

ISBN:

9781337093422

Author:

Joy L. Starks, Philip J. Pratt, Mary Z. Last

Publisher:

Cengage Learning

Prelude to Programming

Computer Engineering

ISBN:

9780133750423

Author:

VENIT, Stewart

Publisher:

Pearson Education

Sc Business Data Communications and Networking, T…

Computer Engineering

ISBN:

9781119368830

Author:

FITZGERALD

Publisher:

WILEY

SEE MORE TEXTBOOKS