Pt2Pt.py (11666:10d59d546ea2) Pt2Pt.py (13731:67cd980cb20f)
1# Copyright (c) 2011 Advanced Micro Devices, Inc.
2# 2011 Massachusetts Institute of Technology
3# All rights reserved.
4#
5# Redistribution and use in source and binary forms, with or without
6# modification, are permitted provided that the following conditions are
7# met: redistributions of source code must retain the above copyright
8# notice, this list of conditions and the following disclaimer;
9# redistributions in binary form must reproduce the above copyright
10# notice, this list of conditions and the following disclaimer in the
11# documentation and/or other materials provided with the distribution;
12# neither the name of the copyright holders nor the names of its
13# contributors may be used to endorse or promote products derived from
14# this software without specific prior written permission.
15#
16# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17# "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18# LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19# A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20# OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21# SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22# LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23# DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24# THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27#
28# Authors: Brad Beckmann
29# Tushar Krishna
30
31from m5.params import *
32from m5.objects import *
33
34from BaseTopology import SimpleTopology
35
36class Pt2Pt(SimpleTopology):
37 description='Pt2Pt'
38
39 def __init__(self, controllers):
40 self.nodes = controllers
41
42 def makeTopology(self, options, network, IntLink, ExtLink, Router):
43 nodes = self.nodes
44
45 # default values for link latency and router latency.
46 # Can be over-ridden on a per link/router basis
47 link_latency = options.link_latency # used by simple and garnet
48 router_latency = options.router_latency # only used by garnet
49
50 # Create an individual router for each controller,
51 # and connect all to all.
52 # Since this is a high-radix router, router_latency should
53 # accordingly be set to a higher value than the default
54 # (which is 1 for mesh routers)
55 routers = [Router(router_id=i, latency = router_latency) \
56 for i in range(len(nodes))]
57 network.routers = routers
58
59 ext_links = [ExtLink(link_id=i, ext_node=n, int_node=routers[i],
60 latency = link_latency)
61 for (i, n) in enumerate(nodes)]
62 network.ext_links = ext_links
63
64 link_count = len(nodes)
65 int_links = []
1# Copyright (c) 2011 Advanced Micro Devices, Inc.
2# 2011 Massachusetts Institute of Technology
3# All rights reserved.
4#
5# Redistribution and use in source and binary forms, with or without
6# modification, are permitted provided that the following conditions are
7# met: redistributions of source code must retain the above copyright
8# notice, this list of conditions and the following disclaimer;
9# redistributions in binary form must reproduce the above copyright
10# notice, this list of conditions and the following disclaimer in the
11# documentation and/or other materials provided with the distribution;
12# neither the name of the copyright holders nor the names of its
13# contributors may be used to endorse or promote products derived from
14# this software without specific prior written permission.
15#
16# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17# "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18# LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19# A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20# OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21# SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22# LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23# DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24# THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27#
28# Authors: Brad Beckmann
29# Tushar Krishna
30
31from m5.params import *
32from m5.objects import *
33
34from BaseTopology import SimpleTopology
35
36class Pt2Pt(SimpleTopology):
37 description='Pt2Pt'
38
39 def __init__(self, controllers):
40 self.nodes = controllers
41
42 def makeTopology(self, options, network, IntLink, ExtLink, Router):
43 nodes = self.nodes
44
45 # default values for link latency and router latency.
46 # Can be over-ridden on a per link/router basis
47 link_latency = options.link_latency # used by simple and garnet
48 router_latency = options.router_latency # only used by garnet
49
50 # Create an individual router for each controller,
51 # and connect all to all.
52 # Since this is a high-radix router, router_latency should
53 # accordingly be set to a higher value than the default
54 # (which is 1 for mesh routers)
55 routers = [Router(router_id=i, latency = router_latency) \
56 for i in range(len(nodes))]
57 network.routers = routers
58
59 ext_links = [ExtLink(link_id=i, ext_node=n, int_node=routers[i],
60 latency = link_latency)
61 for (i, n) in enumerate(nodes)]
62 network.ext_links = ext_links
63
64 link_count = len(nodes)
65 int_links = []
66 for i in xrange(len(nodes)):
67 for j in xrange(len(nodes)):
66 for i in range(len(nodes)):
67 for j in range(len(nodes)):
68 if (i != j):
69 link_count += 1
70 int_links.append(IntLink(link_id=link_count,
71 src_node=routers[i],
72 dst_node=routers[j],
73 latency = link_latency))
74
75 network.int_links = int_links
68 if (i != j):
69 link_count += 1
70 int_links.append(IntLink(link_id=link_count,
71 src_node=routers[i],
72 dst_node=routers[j],
73 latency = link_latency))
74
75 network.int_links = int_links