Network.py (6879:c07cf29b5a33) Network.py (6916:a421f60f0e87)
1# Copyright (c) 2009 Advanced Micro Devices, Inc.
2# All rights reserved.
3#
4# Redistribution and use in source and binary forms, with or without
5# modification, are permitted provided that the following conditions are
6# met: redistributions of source code must retain the above copyright
7# notice, this list of conditions and the following disclaimer;
8# redistributions in binary form must reproduce the above copyright

--- 50 unchanged lines hidden (view full) ---

59def makeCrossbar(nodes):
60 ext_links = [ExtLink(ext_node=n, int_node=i)
61 for (i, n) in enumerate(nodes)]
62 xbar = len(nodes) # node ID for crossbar switch
63 int_links = [IntLink(node_a=i, node_b=xbar) for i in range(len(nodes))]
64 return Topology(ext_links=ext_links, int_links=int_links,
65 num_int_nodes=len(nodes)+1)
66
1# Copyright (c) 2009 Advanced Micro Devices, Inc.
2# All rights reserved.
3#
4# Redistribution and use in source and binary forms, with or without
5# modification, are permitted provided that the following conditions are
6# met: redistributions of source code must retain the above copyright
7# notice, this list of conditions and the following disclaimer;
8# redistributions in binary form must reproduce the above copyright

--- 50 unchanged lines hidden (view full) ---

59def makeCrossbar(nodes):
60 ext_links = [ExtLink(ext_node=n, int_node=i)
61 for (i, n) in enumerate(nodes)]
62 xbar = len(nodes) # node ID for crossbar switch
63 int_links = [IntLink(node_a=i, node_b=xbar) for i in range(len(nodes))]
64 return Topology(ext_links=ext_links, int_links=int_links,
65 num_int_nodes=len(nodes)+1)
66
67def makeMesh(nodes, num_routers, num_rows):
68 #
69 # There must be an evenly divisible number of cntrls to routers
70 # Also, obviously the number or rows must be <= the number of routers
71 #
72 cntrls_per_router, remainder = divmod(len(nodes), num_routers)
73 assert(remainder == 0)
74 assert(num_rows <= num_routers)
75 num_columns = int(num_routers / num_rows)
76 assert(num_columns * num_rows == num_routers)
77
78 #
79 # Connect each node to the appropriate router
80 #
81 ext_links = []
82 for (i, n) in enumerate(nodes):
83 cntrl_level, router_id = divmod(i, num_routers)
84 assert(cntrl_level < cntrls_per_router)
85 ext_links.append(ExtLink(ext_node=n, int_node=router_id))
86
87 #
88 # Create the mesh links. First row (east-west) links then column
89 # (north-south) links
90 #
91 int_links = []
92 for row in xrange(num_rows):
93 for col in xrange(num_columns):
94 if (col + 1 < num_columns):
95 east_id = col + (row * num_columns)
96 west_id = (col + 1) + (row * num_columns)
97 int_links.append(IntLink(node_a=east_id,
98 node_b=west_id,
99 weight=1))
100 for col in xrange(num_columns):
101 for row in xrange(num_rows):
102 if (row + 1 < num_rows):
103 north_id = col + (row * num_columns)
104 south_id = col + ((row + 1) * num_columns)
105 int_links.append(IntLink(node_a=north_id,
106 node_b=south_id,
107 weight=2))
108
109 return Topology(ext_links=ext_links,
110 int_links=int_links,
111 num_int_nodes=num_routers)
112
67class RubyNetwork(SimObject):
68 type = 'RubyNetwork'
69 cxx_class = 'Network'
70 abstract = True
71 number_of_virtual_networks = Param.Int(10, "");
72 topology = Param.Topology("");
73 buffer_size = Param.Int(0,
74 "default buffer size; 0 indicates infinite buffering");
75 endpoint_bandwidth = Param.Int(10000, "");
76 adaptive_routing = Param.Bool(True, "");
77 link_latency = Param.Int(1,
78 "local memory latency ?? NetworkLinkLatency");
79 control_msg_size = Param.Int(8, "");
113class RubyNetwork(SimObject):
114 type = 'RubyNetwork'
115 cxx_class = 'Network'
116 abstract = True
117 number_of_virtual_networks = Param.Int(10, "");
118 topology = Param.Topology("");
119 buffer_size = Param.Int(0,
120 "default buffer size; 0 indicates infinite buffering");
121 endpoint_bandwidth = Param.Int(10000, "");
122 adaptive_routing = Param.Bool(True, "");
123 link_latency = Param.Int(1,
124 "local memory latency ?? NetworkLinkLatency");
125 control_msg_size = Param.Int(8, "");