Hi everyone , 

I have a simulation problem, I want to simulate with Ruby a memory hierarchy  
that looks like this : 

CPU1                                    CPU2
    |________            ___________|
    |               |         |                    |                         
    |               |         |                    |
   L1      Custom Cache              L1       
    |                  |                          |
  L2 ----------- Main Memory -------- L2

It is a classic memory system except that a memory cache has been added, this 
cache is shared between the CPUs  and there is a flag in the request that can 
drive the memory access to the classic data path or to the custom cache. I am 
quite familiar now with Ruby and SLICC. I don't want to modify the state 
machine for the L1 or L2 caches, I was thinking of modifying the Rubyport file 
in order to drive the memory access to the good memory. 
If someone has an idea about how to simulate such a system, please let me know 
! 

PS : my programming skills are better than my ASCII art skills  

--
Grégory Vaumourin 
Doctorant - Phd Student 
Laboratoire Adéquation Algorithme Architecture -- Algorithm and Architecture 
Codesign Laboratory
Phone: +33 (1) 69080069 
_______________________________________________
gem5-dev mailing list
[email protected]
http://m5sim.org/mailman/listinfo/gem5-dev

Reply via email to