Network.py revision 7030
16876Ssteve.reinhardt@amd.com# Copyright (c) 2009 Advanced Micro Devices, Inc.
26876Ssteve.reinhardt@amd.com# All rights reserved.
36876Ssteve.reinhardt@amd.com#
46876Ssteve.reinhardt@amd.com# Redistribution and use in source and binary forms, with or without
56876Ssteve.reinhardt@amd.com# modification, are permitted provided that the following conditions are
66876Ssteve.reinhardt@amd.com# met: redistributions of source code must retain the above copyright
76876Ssteve.reinhardt@amd.com# notice, this list of conditions and the following disclaimer;
86876Ssteve.reinhardt@amd.com# redistributions in binary form must reproduce the above copyright
96876Ssteve.reinhardt@amd.com# notice, this list of conditions and the following disclaimer in the
106876Ssteve.reinhardt@amd.com# documentation and/or other materials provided with the distribution;
116876Ssteve.reinhardt@amd.com# neither the name of the copyright holders nor the names of its
126876Ssteve.reinhardt@amd.com# contributors may be used to endorse or promote products derived from
136876Ssteve.reinhardt@amd.com# this software without specific prior written permission.
146876Ssteve.reinhardt@amd.com#
156876Ssteve.reinhardt@amd.com# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
166876Ssteve.reinhardt@amd.com# "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
176876Ssteve.reinhardt@amd.com# LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
186876Ssteve.reinhardt@amd.com# A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
196876Ssteve.reinhardt@amd.com# OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
206876Ssteve.reinhardt@amd.com# SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
216876Ssteve.reinhardt@amd.com# LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
226876Ssteve.reinhardt@amd.com# DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
236876Ssteve.reinhardt@amd.com# THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
246876Ssteve.reinhardt@amd.com# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
256876Ssteve.reinhardt@amd.com# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
266876Ssteve.reinhardt@amd.com#
276876Ssteve.reinhardt@amd.com# Authors: Steve Reinhardt
286876Ssteve.reinhardt@amd.com#          Brad Beckmann
296876Ssteve.reinhardt@amd.com
306876Ssteve.reinhardt@amd.comfrom m5.params import *
316876Ssteve.reinhardt@amd.comfrom m5.SimObject import SimObject
326876Ssteve.reinhardt@amd.com
336879Ssteve.reinhardt@amd.comclass Link(SimObject):
346879Ssteve.reinhardt@amd.com    type = 'Link'
356879Ssteve.reinhardt@amd.com    latency = Param.Int(1, "")
366879Ssteve.reinhardt@amd.com    bw_multiplier = Param.Int("")
376879Ssteve.reinhardt@amd.com    weight = Param.Int(1, "")
386879Ssteve.reinhardt@amd.com
396879Ssteve.reinhardt@amd.comclass ExtLink(Link):
406879Ssteve.reinhardt@amd.com    type = 'ExtLink'
416879Ssteve.reinhardt@amd.com    ext_node = Param.RubyController("External node")
426879Ssteve.reinhardt@amd.com    int_node = Param.Int("ID of internal node")
436879Ssteve.reinhardt@amd.com    bw_multiplier = 64
446879Ssteve.reinhardt@amd.com
456879Ssteve.reinhardt@amd.comclass IntLink(Link):
466879Ssteve.reinhardt@amd.com    type = 'IntLink'
476879Ssteve.reinhardt@amd.com    node_a = Param.Int("ID of internal node on one end")
486879Ssteve.reinhardt@amd.com    node_b = Param.Int("ID of internal node on other end")
496879Ssteve.reinhardt@amd.com    bw_multiplier = 16
506879Ssteve.reinhardt@amd.com
516876Ssteve.reinhardt@amd.comclass Topology(SimObject):
526876Ssteve.reinhardt@amd.com    type = 'Topology'
536879Ssteve.reinhardt@amd.com    ext_links = VectorParam.ExtLink("Links to external nodes")
546879Ssteve.reinhardt@amd.com    int_links = VectorParam.IntLink("Links between internal nodes")
556879Ssteve.reinhardt@amd.com    num_int_nodes = Param.Int("Nunber of internal nodes")
566876Ssteve.reinhardt@amd.com    print_config = Param.Bool(False,
576876Ssteve.reinhardt@amd.com        "display topology config in the stats file")
586876Ssteve.reinhardt@amd.com
596879Ssteve.reinhardt@amd.comdef makeCrossbar(nodes):
606879Ssteve.reinhardt@amd.com    ext_links = [ExtLink(ext_node=n, int_node=i)
616879Ssteve.reinhardt@amd.com                 for (i, n) in enumerate(nodes)]
626879Ssteve.reinhardt@amd.com    xbar = len(nodes) # node ID for crossbar switch
636879Ssteve.reinhardt@amd.com    int_links = [IntLink(node_a=i, node_b=xbar) for i in range(len(nodes))]
646879Ssteve.reinhardt@amd.com    return Topology(ext_links=ext_links, int_links=int_links,
656879Ssteve.reinhardt@amd.com                    num_int_nodes=len(nodes)+1)
666879Ssteve.reinhardt@amd.com
676916SBrad.Beckmann@amd.comdef makeMesh(nodes, num_routers, num_rows):
686916SBrad.Beckmann@amd.com    #
696916SBrad.Beckmann@amd.com    # There must be an evenly divisible number of cntrls to routers
706916SBrad.Beckmann@amd.com    # Also, obviously the number or rows must be <= the number of routers
716916SBrad.Beckmann@amd.com    #
726916SBrad.Beckmann@amd.com    cntrls_per_router, remainder = divmod(len(nodes), num_routers)
736916SBrad.Beckmann@amd.com    assert(num_rows <= num_routers)
746916SBrad.Beckmann@amd.com    num_columns = int(num_routers / num_rows)
756916SBrad.Beckmann@amd.com    assert(num_columns * num_rows == num_routers)
766916SBrad.Beckmann@amd.com
776916SBrad.Beckmann@amd.com    #
786968SBrad.Beckmann@amd.com    # Add all but the remainder nodes to the list of nodes to be uniformly
796968SBrad.Beckmann@amd.com    # distributed across the network.
806968SBrad.Beckmann@amd.com    #
816968SBrad.Beckmann@amd.com    network_nodes = []
826968SBrad.Beckmann@amd.com    remainder_nodes = []
836968SBrad.Beckmann@amd.com    for node_index in xrange(len(nodes)):
846968SBrad.Beckmann@amd.com        if node_index < (len(nodes) - remainder):
856968SBrad.Beckmann@amd.com            network_nodes.append(nodes[node_index])
866968SBrad.Beckmann@amd.com        else:
876968SBrad.Beckmann@amd.com            remainder_nodes.append(nodes[node_index])
886968SBrad.Beckmann@amd.com
896968SBrad.Beckmann@amd.com    #
906916SBrad.Beckmann@amd.com    # Connect each node to the appropriate router
916916SBrad.Beckmann@amd.com    #
926916SBrad.Beckmann@amd.com    ext_links = []
936968SBrad.Beckmann@amd.com    for (i, n) in enumerate(network_nodes):
946916SBrad.Beckmann@amd.com        cntrl_level, router_id = divmod(i, num_routers)
956916SBrad.Beckmann@amd.com        assert(cntrl_level < cntrls_per_router)
966916SBrad.Beckmann@amd.com        ext_links.append(ExtLink(ext_node=n, int_node=router_id))
976916SBrad.Beckmann@amd.com
986916SBrad.Beckmann@amd.com    #
996968SBrad.Beckmann@amd.com    # Connect the remainding nodes to router 0.  These should only be DMA nodes.
1006968SBrad.Beckmann@amd.com    #
1016968SBrad.Beckmann@amd.com    for (i, node) in enumerate(remainder_nodes):
1026968SBrad.Beckmann@amd.com        assert(node.type == 'DMA_Controller')
1036968SBrad.Beckmann@amd.com        assert(i < remainder)
1046968SBrad.Beckmann@amd.com        ext_links.append(ExtLink(ext_node=node, int_node=0))
1056968SBrad.Beckmann@amd.com
1066968SBrad.Beckmann@amd.com    #
1076916SBrad.Beckmann@amd.com    # Create the mesh links.  First row (east-west) links then column
1086916SBrad.Beckmann@amd.com    # (north-south) links
1096916SBrad.Beckmann@amd.com    #
1106916SBrad.Beckmann@amd.com    int_links = []
1116916SBrad.Beckmann@amd.com    for row in xrange(num_rows):
1126916SBrad.Beckmann@amd.com        for col in xrange(num_columns):
1136916SBrad.Beckmann@amd.com            if (col + 1 < num_columns):
1146916SBrad.Beckmann@amd.com                east_id = col + (row * num_columns)
1156916SBrad.Beckmann@amd.com                west_id = (col + 1) + (row * num_columns)
1166916SBrad.Beckmann@amd.com                int_links.append(IntLink(node_a=east_id,
1176916SBrad.Beckmann@amd.com                                         node_b=west_id,
1186916SBrad.Beckmann@amd.com                                         weight=1))
1196916SBrad.Beckmann@amd.com    for col in xrange(num_columns):
1206916SBrad.Beckmann@amd.com        for row in xrange(num_rows):
1216916SBrad.Beckmann@amd.com            if (row + 1 < num_rows):
1226916SBrad.Beckmann@amd.com                north_id = col + (row * num_columns)
1236916SBrad.Beckmann@amd.com                south_id = col + ((row + 1) * num_columns)
1246916SBrad.Beckmann@amd.com                int_links.append(IntLink(node_a=north_id,
1256916SBrad.Beckmann@amd.com                                         node_b=south_id,
1266916SBrad.Beckmann@amd.com                                         weight=2))
1276916SBrad.Beckmann@amd.com
1286916SBrad.Beckmann@amd.com    return Topology(ext_links=ext_links,
1296916SBrad.Beckmann@amd.com                    int_links=int_links,
1306916SBrad.Beckmann@amd.com                    num_int_nodes=num_routers)
1316916SBrad.Beckmann@amd.com
1326876Ssteve.reinhardt@amd.comclass RubyNetwork(SimObject):
1336876Ssteve.reinhardt@amd.com    type = 'RubyNetwork'
1346876Ssteve.reinhardt@amd.com    cxx_class = 'Network'
1356876Ssteve.reinhardt@amd.com    abstract = True
1366876Ssteve.reinhardt@amd.com    number_of_virtual_networks = Param.Int(10, "");
1376876Ssteve.reinhardt@amd.com    topology = Param.Topology("");
1386876Ssteve.reinhardt@amd.com    buffer_size = Param.Int(0,
1396876Ssteve.reinhardt@amd.com        "default buffer size; 0 indicates infinite buffering");
1406876Ssteve.reinhardt@amd.com    endpoint_bandwidth = Param.Int(10000, "");
1417030SBrad.Beckmann@amd.com    adaptive_routing = Param.Bool(False, "enable adaptive routing");
1426876Ssteve.reinhardt@amd.com    link_latency = Param.Int(1,
1436876Ssteve.reinhardt@amd.com        "local memory latency ?? NetworkLinkLatency");
1446876Ssteve.reinhardt@amd.com    control_msg_size = Param.Int(8, "");
145