This is what my professor said: Items are 4 bytes, pages are 2k, so ~512 items fit on a page. Even if we start in the beginning of a page, the first access will be a miss followed by ~200 hits, then a TLB miss followed by ~500 hits, so the hit rate is ~100% 5. Page size 512 means 9 bits of offset and 7 bits of VPN. The offset is just the decimal version of 1 0111 0111 [unsigned] which is 375 The offset is 0011 100 which is 28. Is he correct?

This is what my professor said: Items are 4 bytes, pages are 2k, so ~512 items fit on a page. Even if we start in the beginning of a page, the first access will be a miss followed by ~200 hits, then a TLB miss followed by ~500 hits, so the hit rate is ~100% 5. Page size 512 means 9 bits of offset and 7 bits of VPN. The offset is just the decimal version of 1 0111 0111 [unsigned] which is 375 The offset is 0011 100 which is 28. Is he correct?

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter8: Data And Network Communication Technology

Section: Chapter Questions

Problem 41VE

See similar textbooks

Similar questions

What is the best page size if entries now become 128 bytes?
A bit (meaning binary digit) is 0 or 1. An ordered array of eight bits (such as01101001) is a byte. How many different bytes are there? If you select a byte at random, what is the probability that you select 11000010? What is the probability that you select a byte containing three 1’s and five 0’s?
A grid needs a system for numbering the tiles in order to allow random-access lookup.For instance, the rows and columns of a square grid provide a natural numbering for the tiles. Create plans for hexagonal and triangular grids. Create a rule for identifying the neighbourhood (i.e., nearby tiles) of a certain tile in the grid using the numbering scheme. For instance, the neighbourhood of tile I j in a four-connected square grid with indices of I for rows and j for columns may be described as neighbourhood(i, j) = I 1, j, I j 1.
implement byteSwap(x,n,m) Swap the m and n byte of x /* * byteSwap - swaps the nth byte and the mth byte* Examples: byteSwap(0x12345678, 1, 3) = 0x56341278* byteSwap(0xDEADBEEF, 0, 2) = 0xDEEFBEAD* You may assume that 0 <= n <= 3, 0 <= m <= 3* Legal ops: ! ~ & ^ | + << >>* Max ops: 25*/ int byteSwap(int x, int n, int m) {return 2;}
Consider the bitmap representation of the free-space map, where for eachblock in the file, two bits are maintained in the bitmap. If the block is between0 and 30 percent full the bits are 00, between 30 and 60 percent the bits are01, between 60 and 90 percent the bits are 10, and above 90 percent the bitsare 11. Such bitmaps can be kept in memory even for quite large files. Describe how to keep the bitmap up to date on record insertions and deletions.
implement greatestBitPos function Compute a mask marking the most significant 1 bit. you are only allowed to use the following eight operators: ! ~ & ^ | + << >> “Max ops” field gives the maximum number of operators you are allowed to use to implement each function /* * greatestBitPos - return a mask that marks the position of the* most significant 1 bit. If x == 0, return 0* Example: greatestBitPos(96) = 0x40* Legal ops: ! ~ & ^ | + << >>* Max ops: 70* Rating: 4 */int greatestBitPos(int x) {return 2;}
Consider the bitmap representation of the free-space map, where for eachblock in the file, two bits are maintained in the bitmap. If the block is between0 and 30 percent full the bits are 00, between 30 and 60 percent the bits are01, between 60 and 90 percent the bits are 10, and above 90 percent the bitsare 11. Such bitmaps can be kept in memory even for quite large files. Outline the benefit of the bitmap technique over free lists in searching for free space and in updating free space information.
Consider the bitmap representation of the free-space map, where for each block in the file, two bits are maintained in the bitmap. If the block is between 0 and 30 percent full the bits are 00, between 30 and 60 percent the bits are 01, between 60 and 90 percent the bits are 10, and above 90 percent the bits are 11. Such bitmaps can be kept in memory even for quite large files. Outline two benefits and one drawback to using two bits for a block, instead of one byte as described earlier in this chapter. Describe how to keep the bitmap up to date on record insertions and deletions. c .Outline the benefit of the bitmap technique over free lists in searching for free space and in updating free space information.
“Hamming,” will read in an integer “k” and a bit string “s” from the command line, calculate the “Hamming Distances,” and prints all bit strings that have Hamming distance of “k” from “s.” Note: The Hamming Distance is equal to the number of bits in which the two strings differ. A sample run would be as follows. >java Hamming 2 00111111 1001 1010 0101 0110 0000
Create a class RLE that employs fixed-length encoding and very few distinct characters to compress ASCII bytestreams, incorporating the code as a component of the encoded bitstream. Add code to compress() to create an Alphabet using all the message's different characters, prepend alpha (8-bit encoding plus its length) to the compressed bitstream, and then add code to expand() to read the alphabet before expansion.
What would be the inverse of the following code?: // Pixel at row r and col c (r >=0, c >= 0) unsigned char red, green, blue; unsigned char coded_red, coded_green, coded_blue; unsigned short us = (red << 8) + (blue); us = (us << 5 ) | (us >> 11); unsigned int threebytes = (us << 8) + green; threebytes ^= (101231 * c * c + 41231 * r * r); coded_red = (threebytes >> 16) & 255; coded_green = (threebytes >> 8) & 255; coded_blue = threebytes & 255;
Let L={ w in(0 + 1)* 1 | w has even number of 1s}, i.e. L is the set of all bit strings with even number of 1s. Which one of the regular expression below represents L? (A) (0* 10* 1)* (B) 0* (10* 10* )* (C) 0* (10* 1* )* 0* (D) 0* 1(10* 1)* 10*