1. This site uses cookies. By continuing to use this site, you are agreeing to our use of cookies. Learn More.

Cache Simulator

Discussion in 'Java' started by brucey, Jun 12, 2009.

  1. brucey

    brucey New Member

    Joined:
    Jun 12, 2009
    Messages:
    3
    Likes Received:
    0
    Trophy Points:
    0
    Hello all,

    I am just getting into Java and have been given a test from my fellow colleagues.

    They have asked me:

    "Given test data in a sequence of random numbers in the range 00000 - 99999.

    Each of these numbers is an address reference. So, every A is a p-digit number, p = 5.

    Cache Size = 100 Bytes (N = 2)
    Block Size = 10 Bytes (M = 1)

    Build a Java program for a Direct Mapped and Fully Associative Cache.

    Show the contents of the Cache after all the given references have been made (in both cases) in the order they were supplied.

    Calculate hit and miss rates (in both cases).

    For displaying the cache contents, represent the memory content at address A simply as M(A).

    Where necessary, you should employ the Least Recently Used scheme for block replacement."

    (Test data is 119 random numbers all of 5 digits).
     
  2. brucey

    brucey New Member

    Joined:
    Jun 12, 2009
    Messages:
    3
    Likes Received:
    0
    Trophy Points:
    0
    Woops...forgot to ask...someone please help!! :)
     
  3. brucey

    brucey New Member

    Joined:
    Jun 12, 2009
    Messages:
    3
    Likes Received:
    0
    Trophy Points:
    0
    Can anybody help? I will be grateful!
     

Share This Page