Computer Systems: A Programmer's Perspective (3rd Edition)
3rd Edition
ISBN: 9780134092997
Author: Bryant
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 6, Problem 6.41HW
You are writing a new 3D game that you hope will earn you fame and fortune. You are currently working on a function to blank the screen buffer before drawing the next frame. The screen you are working with is a 640 x 480 array of pixels. The machine you are working on has a 64 KB direct-mapped cache with 4-byte lines The C structures you are using are as follows:
Assume the following:
- size of(char) = 1 and size of(int) = 4.
Homework Problem
- buffer begins at memory address 0.
- The cache is initially empty.
- The only memory accesses are to the entries of the array buffer. Variables l, j, cptr, and iptr are stored in registers.
What percentage of writes in the following code will miss in the cache?
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
For the following loop, assume the array arr2[][] has never been referenced before in the code. Also assume that a cache line is 32 Bytes, and an int is 4 Bytes.
1. How many memory references are there?2. How many cache misses are there?
Create a program in C++ which simulates a direct cache. The memory array that contains the data to becached is byte addressable and can contain 256 single byte entries or lines. The cache has only 8 entriesor lines. The Data field in each line of the cache is 8 bits. Since the data stored in each line of the cache isonly 8 bits, there is no need for a line field. Only a tag field is needed which is log2(256) = 8 bits.The memory array can be filled with any values of your choice. The program should work by taking userinput of a memory address (index). This input represents the memory data that should be cached.Check the cache to see if the item is already cached. If it is not, your program should counta cache miss, and then replace the item currently in the cache with the data from the inputted address.Allow the user to input addresses (in a loop), until they so choose to end the program.
The program should output the number of cache misses upon ending.
instruction is in the first picture
please give me only implementation of int L1lookup(u_int32_t address) and int L2lookup(u_int32_t address)
cacheSim.h
#include<stdlib.h>#include<stdio.h>#define DRAM_SIZE 1048576typedef struct cb_struct {unsigned char data[16]; // One cache block is 16 bytes.u_int32_t tag;u_int32_t timeStamp; /// This is used to determine what to evict. You can update the timestamp using cycles.}cacheBlock;typedef struct access {int readWrite; // 0 for read, 1 for writeu_int32_t address;u_int32_t data; // If this is a read access, value here is 0}cacheAccess;// This is our dummy DRAM. You can initialize this in anyway you want to test.unsigned char * DRAM;cacheBlock L1_cache[2][2]; // Our 2-way, 64 byte cachecacheBlock L2_cache[4][4]; // Our 4-way, 256 byte cache// Trace points to a series of cache accesses.FILE *trace;long cycles;void init_DRAM();// This function print the content of the cache in the following format for an N-way cache with M Sets// Set 0…
Chapter 6 Solutions
Computer Systems: A Programmer's Perspective (3rd Edition)
Ch. 6.1 - Prob. 6.1PPCh. 6.1 - Prob. 6.2PPCh. 6.1 - Prob. 6.3PPCh. 6.1 - Prob. 6.4PPCh. 6.1 - Prob. 6.5PPCh. 6.1 - Prob. 6.6PPCh. 6.2 - Prob. 6.7PPCh. 6.2 - Prob. 6.8PPCh. 6.4 - Prob. 6.9PPCh. 6.4 - Prob. 6.10PP
Ch. 6.4 - Prob. 6.11PPCh. 6.4 - Prob. 6.12PPCh. 6.4 - Prob. 6.13PPCh. 6.4 - Prob. 6.14PPCh. 6.4 - Prob. 6.15PPCh. 6.4 - Prob. 6.16PPCh. 6.5 - Prob. 6.17PPCh. 6.5 - Prob. 6.18PPCh. 6.5 - Prob. 6.19PPCh. 6.5 - Prob. 6.20PPCh. 6.6 - Prob. 6.21PPCh. 6 - Prob. 6.22HWCh. 6 - Prob. 6.23HWCh. 6 - Suppose that a 2 MB file consisting of 512-byte...Ch. 6 - The following table gives the parameters for a...Ch. 6 - The following table gives the parameters for a...Ch. 6 - Prob. 6.27HWCh. 6 - This problem concerns the cache in Practice...Ch. 6 - Suppose we have a system with the following...Ch. 6 - Suppose we have a system with following...Ch. 6 - Suppose that a program using the cache in Problem...Ch. 6 - Repeat Problem 6.31 for memory address0x16E8 A....Ch. 6 - Prob. 6.33HWCh. 6 - Prob. 6.34HWCh. 6 - Prob. 6.35HWCh. 6 - Prob. 6.36HWCh. 6 - Prob. 6.37HWCh. 6 - Prob. 6.38HWCh. 6 - Prob. 6.39HWCh. 6 - Given the assumptions in Problem 6.38, determine...Ch. 6 - You are writing a new 3D game that you hope will...Ch. 6 - Prob. 6.42HWCh. 6 - Prob. 6.43HWCh. 6 - Prob. 6.45HWCh. 6 - Prob. 6.46HW
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
Triangle Display Write a program that uses nested loops to display the triangle pattern shown below.
Starting Out with C++: Early Objects
T F: It is not possible to write Boolean expressions that contain math, relational, and logical operators.
Starting Out With Visual Basic (8th Edition)
In Exercises 1 through 52, determine the output produced by the lines of code. DimdtAsDate=1/2/2020MessageBox.S...
Introduction to Programming Using Visual Basic (10th Edition)
What is a flag and how does it work?
Starting Out With Visual Basic (7th Edition)
(Radiocarbon dating) Carbon taken from a purported relic of the time of Christ contained 4.6104 atoms of 14C pe...
Differential Equations: Computing and Modeling (5th Edition), Edwards, Penney & Calvis
Why does the following version of refundBalance not give the same results as the original? publicintrefundBalan...
Objects First with Java: A Practical Introduction Using BlueJ (6th Edition)
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
- Create a program in C++ which simulates a direct cache. The memory array that contains the data to be cached is byte addressable and can contain 256 single byte entries or lines. The cache has only 8 entries or lines. The Data field in each line of the cache is 8 bits. Since the data stored in each line of the cache is only 8 bits, there is no need for a line field. Only a tag field is needed which is log2(256) = 8 bits. The memory array can be filled with any values of your choice. The program should work by taking user input of a memory address (index). This input represents the memory data that should be cached. Your program will check the cache to see if the item is already cached. If it is not, your program should count a cache miss, and then replace the item currently in the cache with the data from the inputted address. Allow the user to input addresses (in a loop), until they so choose to end the program. The program should output the number of cache misses upon ending.arrow_forwardAssume that arrX array is already defined and allocated in memory, its base address 0xabcd3000 and already stored in $a2 and its number of elements in $a3. Answer each of the next questions as required. arrX: .word 0x99,0x20,0x73,0x40,0x50,0x69, ... Please write question numbers and answer parts in this question in order. Q4) Write NO more than 3 MIPS instructions to decrement the fourth element of arrX: ______________________________ Q5) Write no more than 6 instructions to calculate $v0= first element - last element in arrX.arrow_forwardFor the following loop assume the array arr2[][] has never been referenced before in the code. Also assume that a cache line is 32 Bytes, and an int is 4 Bytes. 1. How many memory references are there?arrow_forward
- Write and simulate a MIPS assembly-language routine that: 1. Prints your group number, for example “Group 1”, 2. Computes the dot product of two vectors, A_vec and B_vec, as described in Lab 4 of the Lab Manual, 3. Stores the result at memory word DOTPROD, and 4. Prints the result preceded by the phrase: “The result of the dot product is: “. Your data segment should look like the following: .data group: .asciiz “\nGroup x” msg: .asciiz "\nThe result of the dot product is: " A_vec: .word x, 4, 20, 13, 3, 10, 5 B_vec: .word 4, 2, 1, 2, 5, 2, 4 n: .word 7 DOTPROD: .word 0 Replace each “x” with your group number.arrow_forwardInput file sample.txt contains a hex dump of some data in the following format:<address> <byte1> <byte2> ... <byte16>Example Input File:00000000 54 68 69 73 20 69 73 20 61 6e 20 65 78 61 6d00000010 70 6c 65 20 6f 66 20 68 65 78 20 64 75 6d 70...Construct a pipeline using Ubuntu bash to discard the first column (address) and to reformat bytesinto a single column:arrow_forwardIn MIPS assembly, how do I iteratively read a file that contains only 2 numbers on each line, and calculate the distance between the two numbers on each line. Ex: file contains 1 5 4 7 function returns $v0=2 $a2 contains the array address [4, 3, default, default, default] also the file won't be greater than 300 mb and is never emptyarrow_forward
- This function will be able to determine the fields in a log entry it needs to look at in order to do its job properly. The following line of code computes the average number of cache misses for each item in the cache when 64-byte cache blocks are used without any prefetching being performed by the program.arrow_forwardYour task is to write an assembly-language program that finds the most frequently occurring valuein a data array that starts at memory address $0 and contains $1 words. The most frequent value must be stored in register $2. If multiple distinct values have the maximum number of occurrences in the data array, returning any one of these values $2 will do. Hints: Recall that the study material for Round 5 contains example armlet programs that sort an array. You may want to sort the array first and then find the most frequent value in the sorted data. Indeed, once the data is sorted, it is easy to find out how many times each value occurs by making one scan through the data. You probably want to keep track of a value that occurs the maximum number of times in the array scanned so far, and update this value whenever a more frequent value occurs.arrow_forwardIn layman's terms, here's how dynamic memory allocation works.arrow_forward
- Please calculate the total clock cycles for each functionseperately then calculate how much faster would the functions be if a better data cache reduced the average memory operations time to 4 cycles? Code: # Calculating Fibonacci numbers# fib(0) = 0# fib(1) = 1# fib(n) = fib(n-1)+fib(n-2).text.globl mainprint_str:li $v0, 4 # print string at ($a0)syscall #jr $ra # return; print_eol:la $a0, eol # print "\n"li $v0, 4 #syscall #jr $ra # return; print_int:li $v0, 1 # print integer ($a0)syscall #jr $ra # return; # fib(n) - recursive function to compute nth Fibonacci number#fib: sub $sp,$sp,12 # save registers on stacksw $a0, 0($sp) # save $a0 = nsw $s0, 4($sp) # save $s0sw $ra, 8($sp) # save $ra to allow recursive calls bgt $a0,1, gen # if n>1 then goto generic casemove $v0,$a0 # output = input if n=0 or n=1j rreg # goto restore registers gen: sub $a0,$a0,1 # param = n-1jal fib # compute fib(n-1)move $s0,$v0 # save fib(n-1) sub $a0,$a0,1 # set param to n-2jal fib # and make recursive…arrow_forwardwrite your own MIPS program that allocates space for two integer arrays (P and Q) of size 9 each. You can use pointers or indices for traversing arrays. The program should do the following:a. Read in the value of N (a digit between 1 and 9, the actual working size of your array).b. Read in from the keyboard the first N values of the array P. Note that we want both arrays P and Q to haveidentical elements (see the example below for additional explanation).c. Output to the console the N values of both arrays P and Q (use any format and additional text you like).Textbook i use is "Computer Organization and Design 4th Edition by John L hennesyExample: let’s say that the digit read from the keyboard was 3. This means that N=3; them our program will initialise two arrays with elements P[0], P[1], P[2] and Q[0], Q[1], Q[2]. Elements of the arrays are to be read from the keyboard, let’s assume that they were: 25, 11 and 2. The arrays are to be initialised as following:Q[0]=25 Q[1]=11 Q[2]=…arrow_forwardBelow is a list of 32-bit memory address references, given as memory addresses. 12, 720, 172, 8, 764, 352, 760, 56, 724, 176, 744You would like to access a cache with the given memory addresses. The size of cache is 23 = 8-blocks. Your task is to: (1) find out the binary address, (2) fill out the tag and index for each memory address and (3) indicate whether the access is hit or miss in the following table: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
Instruction Format (With reference to address); Author: ChiragBhalodia;https://www.youtube.com/watch?v=lNdy8HREvgo;License: Standard YouTube License, CC-BY