SimpleNetwork.cc revision 6294:b42cea5e1625
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; 10 * redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution; 13 * neither the name of the copyright holders nor the names of its 14 * contributors may be used to endorse or promote products derived from 15 * this software without specific prior written permission. 16 * 17 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 18 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 19 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 20 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 21 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 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 string & name) 63 : Network(name) 64{ 65 m_virtual_networks = 0; 66 m_topology_ptr = NULL; 67} 68 69void SimpleNetwork::init(const vector<string> & argv) 70{ 71 72 Network::init(argv); 73 74 m_endpoint_switches.setSize(m_nodes); 75 76 m_in_use.setSize(m_virtual_networks); 77 m_ordered.setSize(m_virtual_networks); 78 for (int i = 0; i < m_virtual_networks; i++) { 79 m_in_use[i] = false; 80 m_ordered[i] = false; 81 } 82 83 // Allocate to and from queues 84 m_toNetQueues.setSize(m_nodes); 85 m_fromNetQueues.setSize(m_nodes); 86 for (int node = 0; node < m_nodes; node++) { 87 m_toNetQueues[node].setSize(m_virtual_networks); 88 m_fromNetQueues[node].setSize(m_virtual_networks); 89 for (int j = 0; j < m_virtual_networks; j++) { 90 m_toNetQueues[node][j] = new MessageBuffer; 91 m_fromNetQueues[node][j] = new MessageBuffer; 92 } 93 } 94 95 // Setup the network switches 96 // m_topology_ptr = new Topology(this, m_nodes); 97 m_topology_ptr->makeTopology(); 98 int number_of_switches = m_topology_ptr->numSwitches(); 99 for (int i=0; i<number_of_switches; i++) { 100 m_switch_ptr_vector.insertAtBottom(new Switch(i, this)); 101 } 102 m_topology_ptr->createLinks(false); // false because this isn't a reconfiguration 103} 104/* 105SimpleNetwork::SimpleNetwork(int nodes) 106{ 107 m_nodes = MachineType_base_number(MachineType_NUM); 108 109 m_virtual_networks = RubyConfig::getNumberOfVirtualNetworks(); 110 m_endpoint_switches.setSize(m_nodes); 111 112 m_in_use.setSize(m_virtual_networks); 113 m_ordered.setSize(m_virtual_networks); 114 for (int i = 0; i < m_virtual_networks; i++) { 115 m_in_use[i] = false; 116 m_ordered[i] = false; 117 } 118 119 // Allocate to and from queues 120 m_toNetQueues.setSize(m_nodes); 121 m_fromNetQueues.setSize(m_nodes); 122 for (int node = 0; node < m_nodes; node++) { 123 m_toNetQueues[node].setSize(m_virtual_networks); 124 m_fromNetQueues[node].setSize(m_virtual_networks); 125 for (int j = 0; j < m_virtual_networks; j++) { 126 m_toNetQueues[node][j] = new MessageBuffer; 127 m_fromNetQueues[node][j] = new MessageBuffer; 128 } 129 } 130 131 // Setup the network switches 132 m_topology_ptr = new Topology(this, m_nodes); 133 int number_of_switches = m_topology_ptr->numSwitches(); 134 for (int i=0; i<number_of_switches; i++) { 135 m_switch_ptr_vector.insertAtBottom(new Switch(i, this)); 136 } 137 m_topology_ptr->createLinks(false); // false because this isn't a reconfiguration 138} 139*/ 140void SimpleNetwork::reset() 141{ 142 for (int node = 0; node < m_nodes; node++) { 143 for (int j = 0; j < m_virtual_networks; j++) { 144 m_toNetQueues[node][j]->clear(); 145 m_fromNetQueues[node][j]->clear(); 146 } 147 } 148 149 for(int i=0; i<m_switch_ptr_vector.size(); i++){ 150 m_switch_ptr_vector[i]->clearBuffers(); 151 } 152} 153 154SimpleNetwork::~SimpleNetwork() 155{ 156 for (int i = 0; i < m_nodes; i++) { 157 m_toNetQueues[i].deletePointers(); 158 m_fromNetQueues[i].deletePointers(); 159 } 160 m_switch_ptr_vector.deletePointers(); 161 m_buffers_to_free.deletePointers(); 162 delete m_topology_ptr; 163} 164 165// From a switch to an endpoint node 166void SimpleNetwork::makeOutLink(SwitchID src, NodeID dest, const NetDest& routing_table_entry, int link_latency, int link_weight, int bw_multiplier, bool isReconfiguration) 167{ 168 assert(dest < m_nodes); 169 assert(src < m_switch_ptr_vector.size()); 170 assert(m_switch_ptr_vector[src] != NULL); 171 if(!isReconfiguration){ 172 m_switch_ptr_vector[src]->addOutPort(m_fromNetQueues[dest], routing_table_entry, link_latency, bw_multiplier); 173 m_endpoint_switches[dest] = m_switch_ptr_vector[src]; 174 } else { 175 m_switch_ptr_vector[src]->reconfigureOutPort(routing_table_entry); 176 } 177} 178 179// From an endpoint node to a switch 180void SimpleNetwork::makeInLink(NodeID src, SwitchID dest, const NetDest& routing_table_entry, int link_latency, int bw_multiplier, bool isReconfiguration) 181{ 182 assert(src < m_nodes); 183 if(!isReconfiguration){ 184 m_switch_ptr_vector[dest]->addInPort(m_toNetQueues[src]); 185 } else { 186 // do nothing 187 } 188} 189 190// From a switch to a switch 191void SimpleNetwork::makeInternalLink(SwitchID src, SwitchID dest, const NetDest& routing_table_entry, int link_latency, int link_weight, int bw_multiplier, bool isReconfiguration) 192{ 193 if(!isReconfiguration){ 194 // Create a set of new MessageBuffers 195 Vector<MessageBuffer*> queues; 196 for (int i = 0; i < m_virtual_networks; i++) { 197 // allocate a buffer 198 MessageBuffer* buffer_ptr = new MessageBuffer; 199 buffer_ptr->setOrdering(true); 200 if (m_buffer_size > 0) { 201 buffer_ptr->setSize(m_buffer_size); 202 } 203 queues.insertAtBottom(buffer_ptr); 204 // remember to deallocate it 205 m_buffers_to_free.insertAtBottom(buffer_ptr); 206 } 207 208 // Connect it to the two switches 209 m_switch_ptr_vector[dest]->addInPort(queues); 210 m_switch_ptr_vector[src]->addOutPort(queues, routing_table_entry, link_latency, bw_multiplier); 211 } else { 212 m_switch_ptr_vector[src]->reconfigureOutPort(routing_table_entry); 213 } 214} 215 216void SimpleNetwork::checkNetworkAllocation(NodeID id, bool ordered, int network_num) 217{ 218 ASSERT(id < m_nodes); 219 ASSERT(network_num < m_virtual_networks); 220 221 if (ordered) { 222 m_ordered[network_num] = true; 223 } 224 m_in_use[network_num] = true; 225} 226 227MessageBuffer* SimpleNetwork::getToNetQueue(NodeID id, bool ordered, int network_num) 228{ 229 checkNetworkAllocation(id, ordered, network_num); 230 return m_toNetQueues[id][network_num]; 231} 232 233MessageBuffer* SimpleNetwork::getFromNetQueue(NodeID id, bool ordered, int network_num) 234{ 235 checkNetworkAllocation(id, ordered, network_num); 236 return m_fromNetQueues[id][network_num]; 237} 238 239const Vector<Throttle*>* SimpleNetwork::getThrottles(NodeID id) const 240{ 241 assert(id >= 0); 242 assert(id < m_nodes); 243 assert(m_endpoint_switches[id] != NULL); 244 return m_endpoint_switches[id]->getThrottles(); 245} 246 247void SimpleNetwork::printStats(ostream& out) const 248{ 249 out << endl; 250 out << "Network Stats" << endl; 251 out << "-------------" << endl; 252 out << endl; 253 for(int i=0; i<m_switch_ptr_vector.size(); i++) { 254 m_switch_ptr_vector[i]->printStats(out); 255 } 256} 257 258void SimpleNetwork::clearStats() 259{ 260 for(int i=0; i<m_switch_ptr_vector.size(); i++) { 261 m_switch_ptr_vector[i]->clearStats(); 262 } 263} 264 265void SimpleNetwork::printConfig(ostream& out) const 266{ 267 out << endl; 268 out << "Network Configuration" << endl; 269 out << "---------------------" << endl; 270 out << "network: SIMPLE_NETWORK" << endl; 271 out << "topology: " << m_topology_ptr->getName() << endl; 272 out << endl; 273 274 for (int i = 0; i < m_virtual_networks; i++) { 275 out << "virtual_net_" << i << ": "; 276 if (m_in_use[i]) { 277 out << "active, "; 278 if (m_ordered[i]) { 279 out << "ordered" << endl; 280 } else { 281 out << "unordered" << endl; 282 } 283 } else { 284 out << "inactive" << endl; 285 } 286 } 287 out << endl; 288 for(int i=0; i<m_switch_ptr_vector.size(); i++) { 289 m_switch_ptr_vector[i]->printConfig(out); 290 } 291 292 m_topology_ptr->printConfig(out); 293} 294 295void SimpleNetwork::print(ostream& out) const 296{ 297 out << "[SimpleNetwork]"; 298} 299