GATE CSE
First time here? Checkout the FAQ!
x
+4 votes
88 views

Consider the following piece of code which multiplies two matrices:

int a[1024][1024], b[1024][1024], c[1024][1024];
multiply()
{
   unsigned i, j, k;
   for(i = 0; i < 1024; i++)
       for(j = 0; j < 1024; j++)
           for(k = 0; k < 1024; k++)
               c[i][j] += a[i,k] * b[k,j];
}

Assume that the binary for executing this function fits in one page, and the stack also fits in one page. Assume further that an integer requires 4 bytes for storage. Compute the number of TLB misses if the page size is 4096 and the TLB has 8 entries with a replacement policy consisting of LRU.

asked in Operating System by Loyal (4.7k points)   | 88 views
@sushmita..whats the answer??
since page size is 4096 bytes and integer reuires 4 bytes ,so we can have store 1024 elements in one page.

for each table entry,one miss will be counted..

further i am not able to understand..

Please log in or register to answer this question.

Top Users Jan 2017
  1. Debashish Deka

    8978 Points

  2. sudsho

    5326 Points

  3. Habibkhan

    4798 Points

  4. Bikram

    4676 Points

  5. Vijay Thakur

    4496 Points

  6. saurabh rai

    4222 Points

  7. Arjun

    4216 Points

  8. Sushant Gokhale

    3834 Points

  9. santhoshdevulapally

    3808 Points

  10. Kapil

    3736 Points

Monthly Topper: Rs. 500 gift card

19,229 questions
24,123 answers
53,256 comments
20,322 users