SimpleNetwork.cc revision 6285:ce086eca1ede
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 cerr << "Creating new MessageBuffer for " << node << " " << j << endl; 91 m_toNetQueues[node][j] = new MessageBuffer; 92 m_fromNetQueues[node][j] = new MessageBuffer; 93 } 94 } 95 96 // Setup the network switches 97 // m_topology_ptr = new Topology(this, m_nodes); 98 m_topology_ptr->makeTopology(); 99 int number_of_switches = m_topology_ptr->numSwitches(); 100 for (int i=0; i<number_of_switches; i++) { 101 m_switch_ptr_vector.insertAtBottom(new Switch(i, this)); 102 } 103 m_topology_ptr->createLinks(false); // false because this isn't a reconfiguration 104} 105/* 106SimpleNetwork::SimpleNetwork(int nodes) 107{ 108 m_nodes = MachineType_base_number(MachineType_NUM); 109 110 m_virtual_networks = RubyConfig::getNumberOfVirtualNetworks(); 111 m_endpoint_switches.setSize(m_nodes); 112 113 m_in_use.setSize(m_virtual_networks); 114 m_ordered.setSize(m_virtual_networks); 115 for (int i = 0; i < m_virtual_networks; i++) { 116 m_in_use[i] = false; 117 m_ordered[i] = false; 118 } 119 120 // Allocate to and from queues 121 m_toNetQueues.setSize(m_nodes); 122 m_fromNetQueues.setSize(m_nodes); 123 for (int node = 0; node < m_nodes; node++) { 124 m_toNetQueues[node].setSize(m_virtual_networks); 125 m_fromNetQueues[node].setSize(m_virtual_networks); 126 for (int j = 0; j < m_virtual_networks; j++) { 127 m_toNetQueues[node][j] = new MessageBuffer; 128 m_fromNetQueues[node][j] = new MessageBuffer; 129 } 130 } 131 132 // Setup the network switches 133 m_topology_ptr = new Topology(this, m_nodes); 134 int number_of_switches = m_topology_ptr->numSwitches(); 135 for (int i=0; i<number_of_switches; i++) { 136 m_switch_ptr_vector.insertAtBottom(new Switch(i, this)); 137 } 138 m_topology_ptr->createLinks(false); // false because this isn't a reconfiguration 139} 140*/ 141void SimpleNetwork::reset() 142{ 143 for (int node = 0; node < m_nodes; node++) { 144 for (int j = 0; j < m_virtual_networks; j++) { 145 m_toNetQueues[node][j]->clear(); 146 m_fromNetQueues[node][j]->clear(); 147 } 148 } 149 150 for(int i=0; i<m_switch_ptr_vector.size(); i++){ 151 m_switch_ptr_vector[i]->clearBuffers(); 152 } 153} 154 155SimpleNetwork::~SimpleNetwork() 156{ 157 for (int i = 0; i < m_nodes; i++) { 158 m_toNetQueues[i].deletePointers(); 159 m_fromNetQueues[i].deletePointers(); 160 } 161 m_switch_ptr_vector.deletePointers(); 162 m_buffers_to_free.deletePointers(); 163 delete m_topology_ptr; 164} 165 166// From a switch to an endpoint node 167void SimpleNetwork::makeOutLink(SwitchID src, NodeID dest, const NetDest& routing_table_entry, int link_latency, int link_weight, int bw_multiplier, bool isReconfiguration) 168{ 169 assert(dest < m_nodes); 170 assert(src < m_switch_ptr_vector.size()); 171 assert(m_switch_ptr_vector[src] != NULL); 172 if(!isReconfiguration){ 173 m_switch_ptr_vector[src]->addOutPort(m_fromNetQueues[dest], routing_table_entry, link_latency, bw_multiplier); 174 m_endpoint_switches[dest] = m_switch_ptr_vector[src]; 175 } else { 176 m_switch_ptr_vector[src]->reconfigureOutPort(routing_table_entry); 177 } 178} 179 180// From an endpoint node to a switch 181void SimpleNetwork::makeInLink(NodeID src, SwitchID dest, const NetDest& routing_table_entry, int link_latency, int bw_multiplier, bool isReconfiguration) 182{ 183 assert(src < m_nodes); 184 if(!isReconfiguration){ 185 m_switch_ptr_vector[dest]->addInPort(m_toNetQueues[src]); 186 } else { 187 // do nothing 188 } 189} 190 191// From a switch to a switch 192void SimpleNetwork::makeInternalLink(SwitchID src, SwitchID dest, const NetDest& routing_table_entry, int link_latency, int link_weight, int bw_multiplier, bool isReconfiguration) 193{ 194 if(!isReconfiguration){ 195 // Create a set of new MessageBuffers 196 Vector<MessageBuffer*> queues; 197 for (int i = 0; i < m_virtual_networks; i++) { 198 // allocate a buffer 199 MessageBuffer* buffer_ptr = new MessageBuffer; 200 buffer_ptr->setOrdering(true); 201 if (m_buffer_size > 0) { 202 buffer_ptr->setSize(m_buffer_size); 203 } 204 queues.insertAtBottom(buffer_ptr); 205 // remember to deallocate it 206 m_buffers_to_free.insertAtBottom(buffer_ptr); 207 } 208 209 // Connect it to the two switches 210 m_switch_ptr_vector[dest]->addInPort(queues); 211 m_switch_ptr_vector[src]->addOutPort(queues, routing_table_entry, link_latency, bw_multiplier); 212 } else { 213 m_switch_ptr_vector[src]->reconfigureOutPort(routing_table_entry); 214 } 215} 216 217void SimpleNetwork::checkNetworkAllocation(NodeID id, bool ordered, int network_num) 218{ 219 ASSERT(id < m_nodes); 220 ASSERT(network_num < m_virtual_networks); 221 222 if (ordered) { 223 m_ordered[network_num] = true; 224 } 225 m_in_use[network_num] = true; 226} 227 228MessageBuffer* SimpleNetwork::getToNetQueue(NodeID id, bool ordered, int network_num) 229{ 230 checkNetworkAllocation(id, ordered, network_num); 231 return m_toNetQueues[id][network_num]; 232} 233 234MessageBuffer* SimpleNetwork::getFromNetQueue(NodeID id, bool ordered, int network_num) 235{ 236 checkNetworkAllocation(id, ordered, network_num); 237 return m_fromNetQueues[id][network_num]; 238} 239 240const Vector<Throttle*>* SimpleNetwork::getThrottles(NodeID id) const 241{ 242 assert(id >= 0); 243 assert(id < m_nodes); 244 assert(m_endpoint_switches[id] != NULL); 245 return m_endpoint_switches[id]->getThrottles(); 246} 247 248void SimpleNetwork::printStats(ostream& out) const 249{ 250 out << endl; 251 out << "Network Stats" << endl; 252 out << "-------------" << endl; 253 out << endl; 254 for(int i=0; i<m_switch_ptr_vector.size(); i++) { 255 m_switch_ptr_vector[i]->printStats(out); 256 } 257} 258 259void SimpleNetwork::clearStats() 260{ 261 for(int i=0; i<m_switch_ptr_vector.size(); i++) { 262 m_switch_ptr_vector[i]->clearStats(); 263 } 264} 265 266void SimpleNetwork::printConfig(ostream& out) const 267{ 268 out << endl; 269 out << "Network Configuration" << endl; 270 out << "---------------------" << endl; 271 out << "network: SIMPLE_NETWORK" << endl; 272 out << "topology: " << m_topology_ptr->getName() << endl; 273 out << endl; 274 275 for (int i = 0; i < m_virtual_networks; i++) { 276 out << "virtual_net_" << i << ": "; 277 if (m_in_use[i]) { 278 out << "active, "; 279 if (m_ordered[i]) { 280 out << "ordered" << endl; 281 } else { 282 out << "unordered" << endl; 283 } 284 } else { 285 out << "inactive" << endl; 286 } 287 } 288 out << endl; 289 for(int i=0; i<m_switch_ptr_vector.size(); i++) { 290 m_switch_ptr_vector[i]->printConfig(out); 291 } 292 293 m_topology_ptr->printConfig(out); 294} 295 296void SimpleNetwork::print(ostream& out) const 297{ 298 out << "[SimpleNetwork]"; 299} 300