Memory cache hierarchy and virtual memory system, Computer Engineering

Assignment Help:

1. Detail for each of the four following MIPS instructions, which actions are being taken at each of their five steps. Do not forget to mention how and during which steps each instruction updates the program counter.

a) jalr $s0, $s1

b) sw $s1, 24($t0)

c) slt $t0, $s3, $s4

d) jal 1048576

2. Consider these two potential additions to the MIPS instruction set and explain how they would restrict pipelining.

a) cp d1(r1), d2(r2)

copy contents of word at address c address contents of r2 plus offset d2 into address contents of r1 plus displacement d2.

b) incr d2(r2)

adds one to the contents of word at address contents of r2 plus offset d2.

3. Explain how you would pipeline the four following pairs of statements.

a) add $t0, $s0, $s1

beq $s1,$s2, 300

b) add $t2, $t0, $t1

sw $t3, 36($t2)

c) add $t0, $s0, $s1

beq $t0,$s2, 300

d) lw $t0, 24($t1)

sub $s2, $t0, $t1

4. A computer system has a two-level memory cache hierarchy. The L1 cache has a zero hit penalty, a miss penalty of 5 ns and a hit rate of 95 percent. The L2 cache has a miss penalty of 100 ns and a hit rate of 90 percent.

a) How many cycles are lost for each instruction accessing the memory if the CPU clock rate is 2 GHz?

b) We can either increase the hit rate of the topmost cache to 98 percent or increase the hit rate of the second cache to 95 percent. Which improvement would have more impact?

5. A virtual memory system has a virtual address space of 4 Gigabytes and a page size of 8 Kilobytes. Each page table entry occupies 4 bytes.

a) How many bits remain unchanged during the address translation?

b) How many bits are used for the page number?

c) What is the maximum number of page table entries in a page table?


Related Discussions:- Memory cache hierarchy and virtual memory system

Boundary tag management system, what are the two memory management scehme...

what are the two memory management scehme(boundary tag system,buddy system)

Dynamic configuration of parallel virtual machine, Q. Dynamic Configuration...

Q. Dynamic Configuration of parallel virtual machine? int pvm_addhosts( char **hosts, int nhost, int *infos ) Add hosts to virtual machine. hosts is an arra

Unification algorithm - artificial intelligence, Unification Algorithm - Ar...

Unification Algorithm - Artificial intelligence: To merge two statements, we should get a substitution which forms the two sentences similar. Remember that we write V/T to sign

Give some examples of malicious data, Give some examples of malicious data....

Give some examples of malicious data. In May 2002 year, the Norton Anti-Virus software for Windows operating systems detected around 61000 malicious programs. Several of them a

What is the efficient data structure used in rdbms, In RDBMS, what is the e...

In RDBMS, what is the efficient data structure used in the internal storage representation? B+ tree. Because in B+ tree, all the data is kept only in leaf nodes, that makes sea

What is inode, What is 'inode'? All UNIX files have its description kep...

What is 'inode'? All UNIX files have its description kept in a structure called 'inode'. The inode have info about the file-size, its location, time of last access, time of las

Explain passing parameters using pointers, Q. Explain Passing Parameters Us...

Q. Explain Passing Parameters Using Pointers ? This method overcomes the drawback of using variable names directly in procedure. It uses registers to pass procedure pointers to

Desirable choice for the partitioning element in quick sort, A desirable ch...

A desirable choice for the partitioning element in quick sort is First element of the list.

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd