Essentials of Computer Organization and Architecture
5th Edition
ISBN: 9781284123036
Author: Linda Null
Publisher: Jones & Bartlett Learning
expand_more
expand_more
format_list_bulleted
Concept explainers
Expert Solution & Answer
Chapter 11, Problem 21E
Explanation of Solution
Performance:
- The speed of the CPU is a key factor that often decides the performance of the system.
- Disk access speed is considered to be another factor that is used to determine the performance.
- The read write operation that is performed on the disk (milliseconds) is considered to take significantly longer access time in comparison with that of the operation that is performed in a CPU (nanoseconds).
- To improve the performance of the disk access they are different ways present.
- The
algorithm that determines the order in which the data access made in the disk will be beneficial is calculated.
Given:
It is know that there are 100 tracks that are ranged from 0 to 99.
At the beginning the disk arm is considered to be at the position 50 and it will getting move through and towards the lower numbered tracks.
It will require 500 nanoseconds to pass over the track.
The desired track is accessed in 2milliseconds.
The service request order is as follows 35,53,90,67,79,37,76, and 47.
Disk traversed using FCFS (First come First Serve):
The service request is being handled in the way they are being received:
Service request | Access made | Number of access |
35 | 50-35 | 15 |
53 | 35-53 | 18 |
90 | 53-90 | 37 |
67 | 90-67 | 23 |
79 | 67-79 | 12 |
37 | 79-37 | 42 |
76 | 37-76 | 39 |
47 | 76-47 | 29 |
Total number of disk access | 215 | |
Total time taken | 8*2 milliseconds+(218-8)*500 nanoseconds |
Therefore, total number of disk access required is “215”.
Disk traversed using SSTF (Shortest Seek Time First):
- The service request that are from the nearest of the sector to that of the current position of the disk arm are being handled on priority.
- The list is processed to be generated in the way from the current position of the disk arm and the instances of the next nearest access are being obtained at every instance.
Service request | Access made | Number of access |
47 | 50-47 | 3 |
53 | 47-53 | 6 |
67 | 53-67 | 14 |
76 | 67-76 | 9 |
79 | 76-79 | 3 |
90 | 79-90 | 11 |
37 | 90-37 | 53 |
35 | 37-35 | 2 |
Total number of disk access | 101 | |
Total time taken | 8*2 milliseconds+(101-8)*500 nanoseconds |
Therefore, total number of disk access required is “101”...
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionChapter 11 Solutions
Essentials of Computer Organization and Architecture
Ch. 11 - Prob. 1RETCCh. 11 - Prob. 2RETCCh. 11 - Prob. 3RETCCh. 11 - Prob. 4RETCCh. 11 - Prob. 5RETCCh. 11 - Prob. 6RETCCh. 11 - Prob. 7RETCCh. 11 - Prob. 8RETCCh. 11 - Prob. 9RETCCh. 11 - Prob. 10RETC
Ch. 11 - Prob. 11RETCCh. 11 - Prob. 12RETCCh. 11 - Prob. 13RETCCh. 11 - Prob. 14RETCCh. 11 - Prob. 15RETCCh. 11 - Prob. 16RETCCh. 11 - Prob. 17RETCCh. 11 - Prob. 18RETCCh. 11 - Prob. 19RETCCh. 11 - Prob. 20RETCCh. 11 - Prob. 1ECh. 11 - Prob. 2ECh. 11 - Prob. 3ECh. 11 - Prob. 4ECh. 11 - Prob. 5ECh. 11 - Prob. 6ECh. 11 - Prob. 7ECh. 11 - Prob. 8ECh. 11 - Prob. 10ECh. 11 - Prob. 11ECh. 11 - Prob. 12ECh. 11 - Prob. 13ECh. 11 - Prob. 14ECh. 11 - Prob. 15ECh. 11 - Prob. 16ECh. 11 - Prob. 17ECh. 11 - Prob. 18ECh. 11 - Prob. 19ECh. 11 - Prob. 20ECh. 11 - Prob. 21ECh. 11 - Prob. 22ECh. 11 - Prob. 23ECh. 11 - Prob. 24ECh. 11 - Prob. 25ECh. 11 - Prob. 26E
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.Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education