recategorized by
473 views
2 votes
2 votes
Compute the run time of a program which has 55.500.000 memory accesses, a TLB hit rate of 75%, and a page fault rate of 0,005. We consider the TLB access time negligible. The page fault rate is the percent of memory accesses that require a disk access. The program has an average DRAM access time of 50ns (this number includes the proportional relevance of the read and write DRAM accesses). The average disk access time is 9ms, and this number includes also the time the OS spends writing dirty pages to the disk when the memory becomes full. The average page table access time is 130ns, and this number includes the fact that finding the physical address on a TLB miss means that all levels of the page tables must be accessed (and a page table can be in memory or on disk). On a TLB miss, the OS accesses the memory to get the page table entry and updates the TLB. Which is the run time of the application??
recategorized by

Please log in or register to answer this question.

Related questions

377
views
0 answers
0 votes
admin asked Oct 26, 2019
377 views
Write a program that can be used to compare the effectiveness of adding a tag field to $TLB$ entries when control is toggled between two programs. The tag ... nontrivial) input example.Plot the number of $TLB$ updates per $1000$ references.
293
views
0 answers
0 votes
admin asked Oct 26, 2019
293 views
How can the associative memory device needed for a $TLB$ be implemented in hardware, and what are the implications of such a design for expandability?
881
views
1 answers
1 votes
admin asked Oct 26, 2019
881 views
A computer whose processes have $1024$ ... What hit rate is needed to reduce the mean overhead to $2\: nsec?$
664
views
1 answers
1 votes
admin asked Oct 26, 2019
664 views
Consider the following C program: int X[N]; int step = M; /* M is some predefined constant */ for (int i = 0; i < N; i += step) X[i] = X[i ... loop?Would your answer in part $(a)$ be different if the loop were repeated many times? Explain.