1
2/*
3 * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood
4 * All rights reserved.
5 *
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions are
8 * met: redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer;
--- 12 unchanged lines hidden (view full) ---
22 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
23 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
24 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
25 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
26 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
27 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28 */
29
30/*
31 * SimpleNetwork.cc
32 *
33 * Description: See SimpleNetwork.hh
34 *
35 * $Id$
36 *
37 */
38
39#include "mem/ruby/network/simple/SimpleNetwork.hh"
40#include "mem/ruby/profiler/Profiler.hh"
41#include "mem/ruby/system/System.hh"
42#include "mem/ruby/network/simple/Switch.hh"
43#include "mem/ruby/common/NetDest.hh"
44#include "mem/ruby/network/simple/Topology.hh"
45#include "mem/protocol/TopologyType.hh"
46#include "mem/protocol/MachineType.hh"
47#include "mem/ruby/buffers/MessageBuffer.hh"
48#include "mem/protocol/Protocol.hh"
49#include "mem/gems_common/Map.hh"
50
51// ***BIG HACK*** - This is actually code that _should_ be in Network.cc
52
53// Note: Moved to Princeton Network
54// calls new to abstract away from the network
55/*
56Network* Network::createNetwork(int nodes)
57{
58 return new SimpleNetwork(nodes);
59}
60*/
61
62SimpleNetwork::SimpleNetwork(const Params *p)
63 : Network(p)
64{
65 //
66 // Note: the parent Network Object constructor is called before the
67 // SimpleNetwork child constructor. Therefore, the member variables
68 // used below should already be initialized.
69 //
70
71 m_endpoint_switches.setSize(m_nodes);
72
73 m_in_use.setSize(m_virtual_networks);
74 m_ordered.setSize(m_virtual_networks);
75 for (int i = 0; i < m_virtual_networks; i++) {
76 m_in_use[i] = false;
77 m_ordered[i] = false;
78 }
79
80 // Allocate to and from queues
81 m_toNetQueues.setSize(m_nodes);
82 m_fromNetQueues.setSize(m_nodes);
83 for (int node = 0; node < m_nodes; node++) {
84 m_toNetQueues[node].setSize(m_virtual_networks);
85 m_fromNetQueues[node].setSize(m_virtual_networks);
86 for (int j = 0; j < m_virtual_networks; j++) {
87 m_toNetQueues[node][j] = new MessageBuffer(
88 "toNet node "+int_to_string(node)+" j "+int_to_string(j));
89 m_fromNetQueues[node][j] = new MessageBuffer(
90 "fromNet node "+int_to_string(node)+" j "+int_to_string(j));
91 }
92 }
93}
94
95void SimpleNetwork::init()
96{
97
98 Network::init();
99
100 //
101 // The topology pointer should have already been initialized in the parent
102 // class network constructor.
103 //
104 assert(m_topology_ptr != NULL);
105 int number_of_switches = m_topology_ptr->numSwitches();
106 for (int i=0; i<number_of_switches; i++) {
107 m_switch_ptr_vector.insertAtBottom(new Switch(i, this));
108 }
109 m_topology_ptr->createLinks(this, false); // false because this isn't a reconfiguration
110}
111
112void SimpleNetwork::reset()
113{
114 for (int node = 0; node < m_nodes; node++) {
115 for (int j = 0; j < m_virtual_networks; j++) {
116 m_toNetQueues[node][j]->clear();
117 m_fromNetQueues[node][j]->clear();
118 }
119 }
120
121 for(int i=0; i<m_switch_ptr_vector.size(); i++){
122 m_switch_ptr_vector[i]->clearBuffers();
123 }
124}
125
126SimpleNetwork::~SimpleNetwork()
127{
128 for (int i = 0; i < m_nodes; i++) {
129 m_toNetQueues[i].deletePointers();
130 m_fromNetQueues[i].deletePointers();
131 }
132 m_switch_ptr_vector.deletePointers();
133 m_buffers_to_free.deletePointers();
134 // delete m_topology_ptr;
135}
136
137// From a switch to an endpoint node
138void SimpleNetwork::makeOutLink(SwitchID src, NodeID dest, const NetDest& routing_table_entry, int link_latency, int link_weight, int bw_multiplier, bool isReconfiguration)
139{
140 assert(dest < m_nodes);
141 assert(src < m_switch_ptr_vector.size());
142 assert(m_switch_ptr_vector[src] != NULL);
143 if(!isReconfiguration){
144 m_switch_ptr_vector[src]->addOutPort(m_fromNetQueues[dest], routing_table_entry, link_latency, bw_multiplier);
145 m_endpoint_switches[dest] = m_switch_ptr_vector[src];
146 } else {
147 m_switch_ptr_vector[src]->reconfigureOutPort(routing_table_entry);
148 }
149}
150
151// From an endpoint node to a switch
152void SimpleNetwork::makeInLink(NodeID src, SwitchID dest, const NetDest& routing_table_entry, int link_latency, int bw_multiplier, bool isReconfiguration)
153{
154 assert(src < m_nodes);
155 if(!isReconfiguration){
156 m_switch_ptr_vector[dest]->addInPort(m_toNetQueues[src]);
157 } else {
158 // do nothing
159 }
160}
161
162// From a switch to a switch
163void SimpleNetwork::makeInternalLink(SwitchID src, SwitchID dest, const NetDest& routing_table_entry, int link_latency, int link_weight, int bw_multiplier, bool isReconfiguration)
164{
165 if(!isReconfiguration){
166 // Create a set of new MessageBuffers
167 Vector<MessageBuffer*> queues;
168 for (int i = 0; i < m_virtual_networks; i++) {
169 // allocate a buffer
170 MessageBuffer* buffer_ptr = new MessageBuffer;
171 buffer_ptr->setOrdering(true);
172 if (m_buffer_size > 0) {
173 buffer_ptr->setSize(m_buffer_size);
174 }
175 queues.insertAtBottom(buffer_ptr);
176 // remember to deallocate it
177 m_buffers_to_free.insertAtBottom(buffer_ptr);
178 }
179
180 // Connect it to the two switches
181 m_switch_ptr_vector[dest]->addInPort(queues);
182 m_switch_ptr_vector[src]->addOutPort(queues, routing_table_entry, link_latency, bw_multiplier);
183 } else {
184 m_switch_ptr_vector[src]->reconfigureOutPort(routing_table_entry);
185 }
186}
187
188void SimpleNetwork::checkNetworkAllocation(NodeID id, bool ordered, int network_num)
189{
190 ASSERT(id < m_nodes);
191 ASSERT(network_num < m_virtual_networks);
192
193 if (ordered) {
194 m_ordered[network_num] = true;
195 }
196 m_in_use[network_num] = true;
197}
198
199MessageBuffer* SimpleNetwork::getToNetQueue(NodeID id, bool ordered, int network_num)
200{
201 checkNetworkAllocation(id, ordered, network_num);
202 return m_toNetQueues[id][network_num];
203}
204
205MessageBuffer* SimpleNetwork::getFromNetQueue(NodeID id, bool ordered, int network_num)
206{
207 checkNetworkAllocation(id, ordered, network_num);
208 return m_fromNetQueues[id][network_num];
209}
210
211const Vector<Throttle*>* SimpleNetwork::getThrottles(NodeID id) const
212{
213 assert(id >= 0);
214 assert(id < m_nodes);
215 assert(m_endpoint_switches[id] != NULL);
216 return m_endpoint_switches[id]->getThrottles();
217}
218
219void SimpleNetwork::printStats(ostream& out) const
220{
221 out << endl;
222 out << "Network Stats" << endl;
223 out << "-------------" << endl;
224 out << endl;
225 for(int i=0; i<m_switch_ptr_vector.size(); i++) {
226 m_switch_ptr_vector[i]->printStats(out);
227 }
228 m_topology_ptr->printStats(out);
229}
230
231void SimpleNetwork::clearStats()
232{
233 for(int i=0; i<m_switch_ptr_vector.size(); i++) {
234 m_switch_ptr_vector[i]->clearStats();
235 }
236 m_topology_ptr->clearStats();
237}
238
239void SimpleNetwork::printConfig(ostream& out) const
240{
241 out << endl;
242 out << "Network Configuration" << endl;
243 out << "---------------------" << endl;
244 out << "network: SIMPLE_NETWORK" << endl;
245 out << "topology: " << m_topology_ptr->getName() << endl;
246 out << endl;
247
248 for (int i = 0; i < m_virtual_networks; i++) {
249 out << "virtual_net_" << i << ": ";
250 if (m_in_use[i]) {
251 out << "active, ";
252 if (m_ordered[i]) {
253 out << "ordered" << endl;
254 } else {
255 out << "unordered" << endl;
256 }
257 } else {
258 out << "inactive" << endl;
259 }
260 }
261 out << endl;
262 for(int i=0; i<m_switch_ptr_vector.size(); i++) {
263 m_switch_ptr_vector[i]->printConfig(out);
264 }
265
266 m_topology_ptr->printConfig(out);
267}
268
269void SimpleNetwork::print(ostream& out) const
270{
271 out << "[SimpleNetwork]";
272}
273
274
275SimpleNetwork *
276SimpleNetworkParams::create()
277{
278 return new SimpleNetwork(this);
279}
2/*
3 * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood
4 * All rights reserved.
5 *
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions are
8 * met: redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer;
--- 12 unchanged lines hidden (view full) ---
22 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
23 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
24 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
25 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
26 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
27 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28 */
29
30/*
31 * SimpleNetwork.cc
32 *
33 * Description: See SimpleNetwork.hh
34 *
35 * $Id$
36 *
37 */
38
39#include "mem/ruby/network/simple/SimpleNetwork.hh"
40#include "mem/ruby/profiler/Profiler.hh"
41#include "mem/ruby/system/System.hh"
42#include "mem/ruby/network/simple/Switch.hh"
43#include "mem/ruby/common/NetDest.hh"
44#include "mem/ruby/network/simple/Topology.hh"
45#include "mem/protocol/TopologyType.hh"
46#include "mem/protocol/MachineType.hh"
47#include "mem/ruby/buffers/MessageBuffer.hh"
48#include "mem/protocol/Protocol.hh"
49#include "mem/gems_common/Map.hh"
50
51// ***BIG HACK*** - This is actually code that _should_ be in Network.cc
52
53// Note: Moved to Princeton Network
54// calls new to abstract away from the network
55/*
56Network* Network::createNetwork(int nodes)
57{
58 return new SimpleNetwork(nodes);
59}
60*/
61
62SimpleNetwork::SimpleNetwork(const Params *p)
63 : Network(p)
64{
65 //
66 // Note: the parent Network Object constructor is called before the
67 // SimpleNetwork child constructor. Therefore, the member variables
68 // used below should already be initialized.
69 //
70
71 m_endpoint_switches.setSize(m_nodes);
72
73 m_in_use.setSize(m_virtual_networks);
74 m_ordered.setSize(m_virtual_networks);
75 for (int i = 0; i < m_virtual_networks; i++) {
76 m_in_use[i] = false;
77 m_ordered[i] = false;
78 }
79
80 // Allocate to and from queues
81 m_toNetQueues.setSize(m_nodes);
82 m_fromNetQueues.setSize(m_nodes);
83 for (int node = 0; node < m_nodes; node++) {
84 m_toNetQueues[node].setSize(m_virtual_networks);
85 m_fromNetQueues[node].setSize(m_virtual_networks);
86 for (int j = 0; j < m_virtual_networks; j++) {
87 m_toNetQueues[node][j] = new MessageBuffer(
88 "toNet node "+int_to_string(node)+" j "+int_to_string(j));
89 m_fromNetQueues[node][j] = new MessageBuffer(
90 "fromNet node "+int_to_string(node)+" j "+int_to_string(j));
91 }
92 }
93}
94
95void SimpleNetwork::init()
96{
97
98 Network::init();
99
100 //
101 // The topology pointer should have already been initialized in the parent
102 // class network constructor.
103 //
104 assert(m_topology_ptr != NULL);
105 int number_of_switches = m_topology_ptr->numSwitches();
106 for (int i=0; i<number_of_switches; i++) {
107 m_switch_ptr_vector.insertAtBottom(new Switch(i, this));
108 }
109 m_topology_ptr->createLinks(this, false); // false because this isn't a reconfiguration
110}
111
112void SimpleNetwork::reset()
113{
114 for (int node = 0; node < m_nodes; node++) {
115 for (int j = 0; j < m_virtual_networks; j++) {
116 m_toNetQueues[node][j]->clear();
117 m_fromNetQueues[node][j]->clear();
118 }
119 }
120
121 for(int i=0; i<m_switch_ptr_vector.size(); i++){
122 m_switch_ptr_vector[i]->clearBuffers();
123 }
124}
125
126SimpleNetwork::~SimpleNetwork()
127{
128 for (int i = 0; i < m_nodes; i++) {
129 m_toNetQueues[i].deletePointers();
130 m_fromNetQueues[i].deletePointers();
131 }
132 m_switch_ptr_vector.deletePointers();
133 m_buffers_to_free.deletePointers();
134 // delete m_topology_ptr;
135}
136
137// From a switch to an endpoint node
138void SimpleNetwork::makeOutLink(SwitchID src, NodeID dest, const NetDest& routing_table_entry, int link_latency, int link_weight, int bw_multiplier, bool isReconfiguration)
139{
140 assert(dest < m_nodes);
141 assert(src < m_switch_ptr_vector.size());
142 assert(m_switch_ptr_vector[src] != NULL);
143 if(!isReconfiguration){
144 m_switch_ptr_vector[src]->addOutPort(m_fromNetQueues[dest], routing_table_entry, link_latency, bw_multiplier);
145 m_endpoint_switches[dest] = m_switch_ptr_vector[src];
146 } else {
147 m_switch_ptr_vector[src]->reconfigureOutPort(routing_table_entry);
148 }
149}
150
151// From an endpoint node to a switch
152void SimpleNetwork::makeInLink(NodeID src, SwitchID dest, const NetDest& routing_table_entry, int link_latency, int bw_multiplier, bool isReconfiguration)
153{
154 assert(src < m_nodes);
155 if(!isReconfiguration){
156 m_switch_ptr_vector[dest]->addInPort(m_toNetQueues[src]);
157 } else {
158 // do nothing
159 }
160}
161
162// From a switch to a switch
163void SimpleNetwork::makeInternalLink(SwitchID src, SwitchID dest, const NetDest& routing_table_entry, int link_latency, int link_weight, int bw_multiplier, bool isReconfiguration)
164{
165 if(!isReconfiguration){
166 // Create a set of new MessageBuffers
167 Vector<MessageBuffer*> queues;
168 for (int i = 0; i < m_virtual_networks; i++) {
169 // allocate a buffer
170 MessageBuffer* buffer_ptr = new MessageBuffer;
171 buffer_ptr->setOrdering(true);
172 if (m_buffer_size > 0) {
173 buffer_ptr->setSize(m_buffer_size);
174 }
175 queues.insertAtBottom(buffer_ptr);
176 // remember to deallocate it
177 m_buffers_to_free.insertAtBottom(buffer_ptr);
178 }
179
180 // Connect it to the two switches
181 m_switch_ptr_vector[dest]->addInPort(queues);
182 m_switch_ptr_vector[src]->addOutPort(queues, routing_table_entry, link_latency, bw_multiplier);
183 } else {
184 m_switch_ptr_vector[src]->reconfigureOutPort(routing_table_entry);
185 }
186}
187
188void SimpleNetwork::checkNetworkAllocation(NodeID id, bool ordered, int network_num)
189{
190 ASSERT(id < m_nodes);
191 ASSERT(network_num < m_virtual_networks);
192
193 if (ordered) {
194 m_ordered[network_num] = true;
195 }
196 m_in_use[network_num] = true;
197}
198
199MessageBuffer* SimpleNetwork::getToNetQueue(NodeID id, bool ordered, int network_num)
200{
201 checkNetworkAllocation(id, ordered, network_num);
202 return m_toNetQueues[id][network_num];
203}
204
205MessageBuffer* SimpleNetwork::getFromNetQueue(NodeID id, bool ordered, int network_num)
206{
207 checkNetworkAllocation(id, ordered, network_num);
208 return m_fromNetQueues[id][network_num];
209}
210
211const Vector<Throttle*>* SimpleNetwork::getThrottles(NodeID id) const
212{
213 assert(id >= 0);
214 assert(id < m_nodes);
215 assert(m_endpoint_switches[id] != NULL);
216 return m_endpoint_switches[id]->getThrottles();
217}
218
219void SimpleNetwork::printStats(ostream& out) const
220{
221 out << endl;
222 out << "Network Stats" << endl;
223 out << "-------------" << endl;
224 out << endl;
225 for(int i=0; i<m_switch_ptr_vector.size(); i++) {
226 m_switch_ptr_vector[i]->printStats(out);
227 }
228 m_topology_ptr->printStats(out);
229}
230
231void SimpleNetwork::clearStats()
232{
233 for(int i=0; i<m_switch_ptr_vector.size(); i++) {
234 m_switch_ptr_vector[i]->clearStats();
235 }
236 m_topology_ptr->clearStats();
237}
238
239void SimpleNetwork::printConfig(ostream& out) const
240{
241 out << endl;
242 out << "Network Configuration" << endl;
243 out << "---------------------" << endl;
244 out << "network: SIMPLE_NETWORK" << endl;
245 out << "topology: " << m_topology_ptr->getName() << endl;
246 out << endl;
247
248 for (int i = 0; i < m_virtual_networks; i++) {
249 out << "virtual_net_" << i << ": ";
250 if (m_in_use[i]) {
251 out << "active, ";
252 if (m_ordered[i]) {
253 out << "ordered" << endl;
254 } else {
255 out << "unordered" << endl;
256 }
257 } else {
258 out << "inactive" << endl;
259 }
260 }
261 out << endl;
262 for(int i=0; i<m_switch_ptr_vector.size(); i++) {
263 m_switch_ptr_vector[i]->printConfig(out);
264 }
265
266 m_topology_ptr->printConfig(out);
267}
268
269void SimpleNetwork::print(ostream& out) const
270{
271 out << "[SimpleNetwork]";
272}
273
274
275SimpleNetwork *
276SimpleNetworkParams::create()
277{
278 return new SimpleNetwork(this);
279}