6fc0094337
In the current caches the hit latency is paid twice on a miss. This patch lets a configurable response latency be set of the cache for the backward path.
98 lines
3.2 KiB
Python
98 lines
3.2 KiB
Python
# Copyright (c) 2006-2007 The Regents of The University of Michigan
|
|
# All rights reserved.
|
|
#
|
|
# Redistribution and use in source and binary forms, with or without
|
|
# modification, are permitted provided that the following conditions are
|
|
# met: redistributions of source code must retain the above copyright
|
|
# notice, this list of conditions and the following disclaimer;
|
|
# redistributions in binary form must reproduce the above copyright
|
|
# notice, this list of conditions and the following disclaimer in the
|
|
# documentation and/or other materials provided with the distribution;
|
|
# neither the name of the copyright holders nor the names of its
|
|
# contributors may be used to endorse or promote products derived from
|
|
# this software without specific prior written permission.
|
|
#
|
|
# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
# "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
# LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
# A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
# OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
# SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
# LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
# DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
# THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
#
|
|
# Authors: Ron Dreslinski
|
|
|
|
import m5
|
|
from m5.objects import *
|
|
|
|
# --------------------
|
|
# Base L1 Cache
|
|
# ====================
|
|
|
|
class L1(BaseCache):
|
|
hit_latency = '1ns'
|
|
response_latency = '1ns'
|
|
block_size = 64
|
|
mshrs = 12
|
|
tgts_per_mshr = 8
|
|
is_top_level = True
|
|
|
|
# ----------------------
|
|
# Base L2 Cache
|
|
# ----------------------
|
|
|
|
class L2(BaseCache):
|
|
block_size = 64
|
|
hit_latency = '10ns'
|
|
response_latency = '10ns'
|
|
mshrs = 92
|
|
tgts_per_mshr = 16
|
|
write_buffers = 8
|
|
|
|
#MAX CORES IS 8 with the fals sharing method
|
|
nb_cores = 8
|
|
cpus = [ MemTest() for i in xrange(nb_cores) ]
|
|
|
|
# system simulated
|
|
system = System(cpu = cpus, funcmem = SimpleMemory(in_addr_map = False),
|
|
funcbus = NoncoherentBus(),
|
|
physmem = SimpleMemory(),
|
|
membus = CoherentBus(clock="500GHz", width=16))
|
|
|
|
# l2cache & bus
|
|
system.toL2Bus = CoherentBus(clock="500GHz", width=16)
|
|
system.l2c = L2(size='64kB', assoc=8)
|
|
system.l2c.cpu_side = system.toL2Bus.master
|
|
|
|
# connect l2c to membus
|
|
system.l2c.mem_side = system.membus.slave
|
|
|
|
# add L1 caches
|
|
for cpu in cpus:
|
|
cpu.l1c = L1(size = '32kB', assoc = 4)
|
|
cpu.l1c.cpu_side = cpu.test
|
|
cpu.l1c.mem_side = system.toL2Bus.slave
|
|
system.funcbus.slave = cpu.functional
|
|
|
|
system.system_port = system.membus.slave
|
|
|
|
# connect reference memory to funcbus
|
|
system.funcmem.port = system.funcbus.master
|
|
|
|
# connect memory to membus
|
|
system.physmem.port = system.membus.master
|
|
|
|
|
|
# -----------------------
|
|
# run simulation
|
|
# -----------------------
|
|
|
|
root = Root( full_system = False, system = system )
|
|
root.system.mem_mode = 'timing'
|
|
#root.trace.flags="Cache CachePort MemoryAccess"
|
|
#root.trace.cycle=1
|
|
|