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 22E
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 48,14,85,35,84,61,30, and 22.
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 |
| 48 | 50-48 | 2 |
| 14 | 48-14 | 34 |
| 85 | 14-85 | 71 |
| 35 | 85-35 | 50 |
| 84 | 35-84 | 49 |
| 61 | 84-61 | 23 |
| 30 | 61-30 | 31 |
| 22 | 30-22 | 8 |
| Total number of disk access | 268 | |
| Total time taken | 8*2 milliseconds+(268-8)*500 nanoseconds | |
Therefore, total number of disk access required is “268”.
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 |
| 48 | 50-48 | 2 |
| 61 | 48-61 | 13 |
| 84 | 61-84 | 23 |
| 85 | 84-85 | 1 |
| 35 | 85-35 | 50 |
| 30 | 35-30 | 5 |
| 22 | 30-22 | 8 |
| 14 | 22-14 | 8 |
| Total number of disk access | 110 | |
| Total time taken | 8*2 milliseconds+(110-8)*500 nanoseconds | |
Therefore, total number of disk access required is “110”...
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
I need help to solve a simple problem using Grover’s algorithm, where the solution is not necessarily known beforehand. The problem is a 2×2 binary sudoku with two rules:
• No column may contain the same value twice.
• No row may contain the same value twice.
Each square in the sudoku is assigned to a variable as follows:
We want to design a quantum circuit that outputs a valid solution to this sudoku. While using Grover’s algorithm for this task is not necessarily practical, the goal is to demonstrate how classical decision problems can be converted into oracles for Grover’s algorithm.
Turning the Problem into a Circuit
To solve this, an oracle needs to be created that helps identify valid solutions. The first step is to construct a classical function within a quantum circuit that checks whether a given state satisfies the sudoku rules.
Since we need to check both columns and rows, there are four conditions to verify:
v0 ≠ v1 # Check top row
v2 ≠ v3 # Check bottom row…
I need help to solve a simple problem using Grover’s algorithm, where the solution is not necessarily known beforehand. The problem is a 2×2 binary sudoku with two rules:
• No column may contain the same value twice.
• No row may contain the same value twice.
Each square in the sudoku is assigned to a variable as follows:
We want to design a quantum circuit that outputs a valid solution to this sudoku. While using Grover’s algorithm for this task is not necessarily practical, the goal is to demonstrate how classical decision problems can be converted into oracles for Grover’s algorithm.
Turning the Problem into a Circuit
To solve this, an oracle needs to be created that helps identify valid solutions. The first step is to construct a classical function within a quantum circuit that checks whether a given state satisfies the sudoku rules.
Since we need to check both columns and rows, there are four conditions to verify:
v0 ≠ v1 # Check top row
v2 ≠ v3 # Check bottom row…
I need help to solve a simple problem using Grover’s algorithm, where the solution is not necessarily known beforehand. The problem is a 2×2 binary sudoku with two rules:
• No column may contain the same value twice.
• No row may contain the same value twice.
Each square in the sudoku is assigned to a variable as follows:
We want to design a quantum circuit that outputs a valid solution to this sudoku. While using Grover’s algorithm for this task is not necessarily practical, the goal is to demonstrate how classical decision problems can be converted into oracles for Grover’s algorithm.
Turning the Problem into a Circuit
To solve this, an oracle needs to be created that helps identify valid solutions. The first step is to construct a classical function within a quantum circuit that checks whether a given state satisfies the sudoku rules.
Since we need to check both columns and rows, there are four conditions to verify:
v0 ≠ v1 # Check top row
v2 ≠ v3 # Check bottom row…
Chapter 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.Similar questions
- Don't use ai to answer I will report you answerarrow_forwardYou can use Eclipse later for program verification after submission. 1. Create an abstract Animal class. Then, create a Cat class. Please implement all the methods and inheritance relations in the UML correctly: Animal name: String # Animal (name: String) + getName(): String + setName(name: String): void + toString(): String + makeSound(): void Cat breed : String age: int + Cat(name: String, breed: String, age: int) + getBreed(): String + getAge (): int + toString(): String + makeSound(): void 2. Create a public CatTest class with a main method. In the main method, create one Cat object and print the object using System.out.println(). Then, test makeSound() method. Your printing result must follow the example output: name: Coco, breed: Domestic short-haired, age: 3 Meow Meowarrow_forwardautomata theory can please wright the exact language it know for example say it knows strings start 0 and end with 1 this is as example also as regular expressionarrow_forward
- I would like help to resolve the following case, thank youarrow_forwardI need help with the following casearrow_forwardQ2) by using SHI-Tomasi detector method under the constraints shown in fig. 1 below find the corner that is usful to use in video-steganography? 10.8 ...... V...... 0.7 286 720 ke Fig.1 Threshold graph. The plain test is :Hello Ahmed the key is: 3a 2x5 5b 7c 1J 55 44 2X3 [ ] 2x3arrow_forward
- What significant justification is there for the -> operator in C and C++?arrow_forwardMultidimensional arrays can be stored in row major order, as in C++, or in column major order, as in Fortran. Develop the access functions for both of these arrangements for three-dimensional arrays.arrow_forwardWhat are the arguments for and against Java’s implicit heap storage recovery, when compared with the explicit heap storage recovery required in C++? Consider real-time systems.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable 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