Hi Folks,

I am currently working on modeling a system in which the L3 Cache is 
dynamically set. As a simple example of this, say there were two sets of 
addresses. If I get a LD/ST request to the first set, it takes twice as long as 
it would for retrieval in the second set. In any case, I have been able to 
model this phenomenon in gem5's SLICC structure under the guise of a new 
protocol and was able to see it working as intended using the protocol 
debugger. However, when I set up a python configuration file to get things 
going, I know that the RubyCache python object that my generated controller 
connects to also has a latency parameter. My question is, to accurately model 
this phenomenon, is the modification of the SLICC sufficient to model the new 
delays, or do modifications have to be made to RubyCache as well? I took a look 
at the RubyCache python object, and was left more puzzled when I didn't see any 
special methods directly in this class (I understand it pulls some of these 
from SimObject), which made me think this may a better place to ask in the 
meantime.

Thanks



_______________________________________________
gem5-users mailing list -- gem5-users@gem5.org
To unsubscribe send an email to gem5-users-le...@gem5.org

Reply via email to