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
Videos
Question
Chapter 6, Problem 27E
a)
Program Plan Intro
Cache writes policies:
- The main purpose of the cache write policies is to determine whether the main memory block is being updated such that it maps with the cache block.
- There are two types of write policies and they are:
- Write-through
- Write-back
Write-through:
On every write the cache and the main memory gets updated simultaneously.
Advantage:
- Ensures the cache consistency is maintained with the main memory.
Disadvantage:
- Main memory access is required during every write.
- Every write that is made to the cache requires a new main memory access to perform the write operation and it may slow down system if all access is meant to be a write operation.
Write-back:
In write-back update is made only with the main memory blocks when the blocks of the cache are chosen to be the victim and requires to be removed.
Advantage:
- Reduced memory traffic.
- Time consumed to write information to the cache will be reduced when compared with that of the write-through policy.
Disadvantage:
- The information present in the main memory and the cache memory may not have the possibility of having a same value at the given instance of time and at cases if the process terminates before performing the write operation to the main memory there is a possibility of data being lost in the cache.
b)
Program Plan Intro
Cache writes policies:
- The main purpose of the cache write policies is to determine whether the main memory block is being updated such that it maps with the cache block.
- There are two types of write policies and they are:
- Write-through
- Write-back
Write-through:
On every write the cache and the main memory gets updated simultaneously.
Advantage:
- Ensures the cache consistency is maintained with the main memory.
Disadvantage:
- Main memory access is required during every write.
- Every write that is made to the cache requires a new main memory access to perform the write operation and it may slow down system if all access is meant to be a write operation.
Write-back:
In write-back update is made only with the main memory blocks when the blocks of the cache are chosen to be the victim and requires to be removed.
Advantage:
- Reduced memory traffic.
- Time consumed to write information to the cache will be reduced when compared with that of the write-through policy.
Disadvantage:
- The information present in the main memory and the cache memory may not have the possibility of having a same value at the given instance of time and at cases if the process terminates before performing the write operation to the main memory there is a possibility of data being lost in the cache.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
r language
r language
R language
Chapter 6 Solutions
Essentials of Computer Organization and Architecture
Ch. 6 - Prob. 1RETCCh. 6 - Prob. 2RETCCh. 6 - Prob. 3RETCCh. 6 - Prob. 4RETCCh. 6 - Prob. 5RETCCh. 6 - Prob. 6RETCCh. 6 - Prob. 7RETCCh. 6 - Prob. 8RETCCh. 6 - Prob. 9RETCCh. 6 - Prob. 10RETC
Ch. 6 - Prob. 11RETCCh. 6 - Prob. 12RETCCh. 6 - Prob. 13RETCCh. 6 - Prob. 14RETCCh. 6 - Prob. 15RETCCh. 6 - Prob. 16RETCCh. 6 - Prob. 17RETCCh. 6 - Prob. 18RETCCh. 6 - Prob. 19RETCCh. 6 - Prob. 20RETCCh. 6 - Prob. 21RETCCh. 6 - Prob. 22RETCCh. 6 - Prob. 23RETCCh. 6 - Prob. 24RETCCh. 6 - Prob. 25RETCCh. 6 - Prob. 26RETCCh. 6 - Prob. 27RETCCh. 6 - Prob. 28RETCCh. 6 - Prob. 29RETCCh. 6 - Prob. 30RETCCh. 6 - Prob. 31RETCCh. 6 - Prob. 32RETCCh. 6 - Prob. 33RETCCh. 6 - Prob. 34RETCCh. 6 - Prob. 35RETCCh. 6 - Prob. 36RETCCh. 6 - Prob. 37RETCCh. 6 - Prob. 38RETCCh. 6 - Prob. 39RETCCh. 6 - Prob. 1ECh. 6 - Prob. 2ECh. 6 - Prob. 3ECh. 6 - Prob. 4ECh. 6 - Prob. 5ECh. 6 - Prob. 6ECh. 6 - Prob. 7ECh. 6 - Prob. 8ECh. 6 - Prob. 9ECh. 6 - Prob. 10ECh. 6 - Prob. 11ECh. 6 - Prob. 12ECh. 6 - Prob. 13ECh. 6 - Prob. 14ECh. 6 - Prob. 15ECh. 6 - Prob. 16ECh. 6 - Prob. 17ECh. 6 - Prob. 18ECh. 6 - Prob. 19ECh. 6 - Prob. 20ECh. 6 - Prob. 21ECh. 6 - Prob. 22ECh. 6 - Prob. 23ECh. 6 - Prob. 24ECh. 6 - Prob. 25ECh. 6 - Prob. 26ECh. 6 - Prob. 27ECh. 6 - Prob. 28ECh. 6 - Prob. 29E
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
- Question 1 (15 Points) Inheritance: In this question, we are going to create a new subclass of the SimpleGeometricObject class, named Triangle. Create a SimpleGeometricObject.java and Copy the source code of the SimpleGeometricObject class from the following link: https://liveexample.pearsoncmg.com/html/SimpleGeometricObject.html TASK 1: Create a Triangle class that extends the SimpleGeometricObject class in Eclipse, following the below UML diagram. + base:double = 5 + height:double = 10 Triangle + Triangle() + Triangle(newBase: double, newHeight: double) + getArea(): double + setBase(): void + setHeight(): void + getBase(): double + getHeight(): doublearrow_forwardQuestion 2 (10 Points): String vs. StringBuilder Create a Question2.java file and finish the following tasks: Task 1. a) Create a 1D array of integers to store 50 integers. b) Store values from 0 to 49 in the array you just created. c) Create a new String Object using no-arg constructor. d) Using for loop to add the array elements one by one to the String (one per loop iteration) Hint: to append an element to a String, use the + operator. e) Output the String on the console. Record and display a run-time it took to append all integers to the String (record run-time of 1.d.)). Please submit a screenshot. The screenshot should match the following example: 012345678910111213141516171819202122232425262728293031323334353637383940414243444546474849 it took 196708 nanoseconds to append 50 integers to the String.| Hint: You can use the following statements to record run-time. long begin, end, time; // we will measure time it took begin = System.nanoTime(); //we measure in nanoseconds. // put…arrow_forwardAnswer this Java OOP question below: Discuss the challenges and benefits of using multiple levels of inheritance in a class hierarchy. How can deep inheritance structures impact the maintainability and readability of code?arrow_forward
- Answer the Java OOP question below: Explain the relationship between a superclass and a subclass. How do the principles of encapsulation and abstraction play a role in this relationship? In your experience, how do you decide what should be included in a superclass versus a subclass? Share an example where a well-defined superclass-subclass hierarchy improved your code.arrow_forward1.) Consider the problem of determining whether a DFA and a regular expression are equivalent. Express this problem as a language and show that it is decidable. ii) Let ALLDFA = {(A)| A is a DFA and L(A) = "}. Show that ALLDFA is decidable. iii) Let AECFG = {(G)| G is a CFG that generates &}. Show that AECFG is decidable. iv) Let ETM {(M)| M is a TM and L(M) = 0}. Show that ETM, the complement of Erm, is Turing-recognizable. Let X be the set {1, 2, 3, 4, 5} and Y be the set {6, 7, 8, 9, 10). We describe the functions f: XY and g: XY in the following tables. Answer each part and give a reason for each negative answer. n f(n) n g(n) 1 6 1 10 2 7 2 9 3 6 3 8 4 7 4 7 5 6 5 6 Aa. Is f one-to-one? b. Is fonto? c. Is fa correspondence? Ad. Is g one-to-one? e. Is g onto? f. Is g a correspondence? vi) Let B be the set of all infinite sequences over {0,1}. Show that B is uncountable using a proof by diagonalization.arrow_forwardCan you find the least amount of different numbers to pick from positive numbers (integers) that are at most 100 to confirm two numbers that add up to 101 when each number can be picked at most two times?arrow_forward
- Can you find the formula for an that satisfies the provided recursive definition? Please show all steps and justificationarrow_forwardWhat is the number of injective functions f from set {1,2,....,2n} to set {1,2,....,2n} so that f(x) >= x for all the 1<= x <= n?arrow_forwardIdeal MOSFET Current–Voltage Characteristics—NMOS Device and draw the circuitarrow_forward
- 1. Create a Person.java file. Implement the public Person and Student classes in Person.java, including all the variables and methods in the UMLS. Person -name: String -street: String -city: String +Person(String name, String, street, String, city) +getName(): String +setName(String name): void +getStreet(): String +setStreet(String street): void +getCity(): String +setCity(String City): void +toString(): String Student -Id: int +Person(String name, String, street, String, city, int Id) +getId(): int +setId(int Id): void +toString(): String 2. Create a StudentTest.java file. Implement a public StudentTest class with a main method. In the main method, create one student object and print the object using System.out.println(). Your printing result must follow the example output: name: Mike, street: Morris Ave, city: Union, Id: 1000 Hint: You need to modify the toString methods in the Student class and Person class!arrow_forward1) Apply the Paint Blue algorithm discussed in class to the following Finite Automata. a a a b b a COIS-3050H-R-W01-2025WI-COMB Formal Languages & Automata a b Show the status of the Finite Automata at the conclusion of the Paint Blue Algorithm (mark the visited states with an X and only include edges that have not been followed). 2) Use the pumping lemma to prove the following language is nonregular: L= {ab} = {abbb, aabbbbbb, aaabbbbbbbbb, ...}arrow_forward3) Find CFGs that for these regular languages over the alphabet Σ= {a, b}. Draw a Finite Automata e CFG. 1 COIS-3050H-R-W01-2025WI-COMB Formal anguages & Automata Is that contain the substring aba. (b) The language of all words that have an odd number letters and contains the string bb. (c) The language of all words that begin with the substring ba and contains an odd number of letters. 4) Convert the following FA into a PDA. a a S± b a a Ν Ꮓ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
Computer Fundamentals - Basics for Beginners; Author: Geek's Lesson;https://www.youtube.com/watch?v=eEo_aacpwCw;License: Standard YouTube License, CC-BY