2009-05-11 19:38:43 +02:00
|
|
|
/*
|
|
|
|
* Copyright (c) 1999-2008 Mark D. Hill and David A. Wood
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions are
|
|
|
|
* met: redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer;
|
|
|
|
* redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution;
|
|
|
|
* neither the name of the copyright holders nor the names of its
|
|
|
|
* contributors may be used to endorse or promote products derived from
|
|
|
|
* this software without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
|
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
|
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
|
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
|
2011-01-10 20:11:20 +01:00
|
|
|
#include <cassert>
|
2010-08-20 20:46:12 +02:00
|
|
|
#include <numeric>
|
|
|
|
|
2010-06-11 08:17:07 +02:00
|
|
|
#include "base/stl_helpers.hh"
|
2010-04-01 01:56:45 +02:00
|
|
|
#include "mem/protocol/MachineType.hh"
|
|
|
|
#include "mem/protocol/Protocol.hh"
|
|
|
|
#include "mem/protocol/TopologyType.hh"
|
|
|
|
#include "mem/ruby/buffers/MessageBuffer.hh"
|
|
|
|
#include "mem/ruby/common/NetDest.hh"
|
2011-04-29 02:18:14 +02:00
|
|
|
#include "mem/ruby/network/BasicLink.hh"
|
2009-05-11 19:38:45 +02:00
|
|
|
#include "mem/ruby/network/simple/SimpleNetwork.hh"
|
|
|
|
#include "mem/ruby/network/simple/Switch.hh"
|
2010-08-20 20:46:12 +02:00
|
|
|
#include "mem/ruby/network/simple/Throttle.hh"
|
2011-04-29 02:18:12 +02:00
|
|
|
#include "mem/ruby/network/Topology.hh"
|
2010-04-01 01:56:45 +02:00
|
|
|
#include "mem/ruby/profiler/Profiler.hh"
|
|
|
|
#include "mem/ruby/system/System.hh"
|
2009-05-11 19:38:43 +02:00
|
|
|
|
2010-04-02 20:20:32 +02:00
|
|
|
using namespace std;
|
2010-06-11 08:17:07 +02:00
|
|
|
using m5::stl_helpers::deletePointers;
|
2010-04-02 20:20:32 +02:00
|
|
|
|
2010-04-01 01:56:45 +02:00
|
|
|
#if 0
|
2009-07-07 00:49:47 +02:00
|
|
|
// ***BIG HACK*** - This is actually code that _should_ be in Network.cc
|
2009-05-11 19:38:43 +02:00
|
|
|
|
|
|
|
// Note: Moved to Princeton Network
|
|
|
|
// calls new to abstract away from the network
|
2010-04-01 01:56:45 +02:00
|
|
|
Network*
|
|
|
|
Network::createNetwork(int nodes)
|
2009-05-11 19:38:43 +02:00
|
|
|
{
|
2010-04-01 01:56:45 +02:00
|
|
|
return new SimpleNetwork(nodes);
|
2009-05-11 19:38:43 +02:00
|
|
|
}
|
2010-04-01 01:56:45 +02:00
|
|
|
#endif
|
2009-05-11 19:38:43 +02:00
|
|
|
|
2010-01-30 05:29:17 +01:00
|
|
|
SimpleNetwork::SimpleNetwork(const Params *p)
|
|
|
|
: Network(p)
|
2009-07-07 00:49:47 +02:00
|
|
|
{
|
2010-04-01 01:56:45 +02:00
|
|
|
// Note: the parent Network Object constructor is called before the
|
|
|
|
// SimpleNetwork child constructor. Therefore, the member variables
|
|
|
|
// used below should already be initialized.
|
|
|
|
|
2010-06-11 08:17:07 +02:00
|
|
|
m_endpoint_switches.resize(m_nodes);
|
2010-04-01 01:56:45 +02:00
|
|
|
|
2010-06-11 08:17:07 +02:00
|
|
|
m_in_use.resize(m_virtual_networks);
|
|
|
|
m_ordered.resize(m_virtual_networks);
|
2010-04-01 01:56:45 +02:00
|
|
|
for (int i = 0; i < m_virtual_networks; i++) {
|
|
|
|
m_in_use[i] = false;
|
|
|
|
m_ordered[i] = false;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Allocate to and from queues
|
2010-06-11 08:17:07 +02:00
|
|
|
m_toNetQueues.resize(m_nodes);
|
|
|
|
m_fromNetQueues.resize(m_nodes);
|
2010-04-01 01:56:45 +02:00
|
|
|
for (int node = 0; node < m_nodes; node++) {
|
2010-06-11 08:17:07 +02:00
|
|
|
m_toNetQueues[node].resize(m_virtual_networks);
|
|
|
|
m_fromNetQueues[node].resize(m_virtual_networks);
|
2010-04-01 01:56:45 +02:00
|
|
|
for (int j = 0; j < m_virtual_networks; j++) {
|
2010-04-02 20:20:32 +02:00
|
|
|
m_toNetQueues[node][j] =
|
|
|
|
new MessageBuffer(csprintf("toNet node %d j %d", node, j));
|
|
|
|
m_fromNetQueues[node][j] =
|
|
|
|
new MessageBuffer(csprintf("fromNet node %d j %d", node, j));
|
2010-04-01 01:56:45 +02:00
|
|
|
}
|
2009-07-07 00:49:47 +02:00
|
|
|
}
|
2010-01-30 05:29:18 +01:00
|
|
|
}
|
|
|
|
|
2010-04-01 01:56:45 +02:00
|
|
|
void
|
|
|
|
SimpleNetwork::init()
|
2010-01-30 05:29:18 +01:00
|
|
|
{
|
2010-04-01 01:56:45 +02:00
|
|
|
Network::init();
|
|
|
|
|
|
|
|
// The topology pointer should have already been initialized in
|
|
|
|
// the parent class network constructor.
|
|
|
|
assert(m_topology_ptr != NULL);
|
|
|
|
int number_of_switches = m_topology_ptr->numSwitches();
|
|
|
|
for (int i = 0; i < number_of_switches; i++) {
|
2010-06-11 08:17:07 +02:00
|
|
|
m_switch_ptr_vector.push_back(new Switch(i, this));
|
2010-04-01 01:56:45 +02:00
|
|
|
}
|
2010-01-30 05:29:18 +01:00
|
|
|
|
2010-04-01 01:56:45 +02:00
|
|
|
// false because this isn't a reconfiguration
|
|
|
|
m_topology_ptr->createLinks(this, false);
|
2009-07-07 00:49:47 +02:00
|
|
|
}
|
2009-05-11 19:38:43 +02:00
|
|
|
|
2010-04-01 01:56:45 +02:00
|
|
|
void
|
|
|
|
SimpleNetwork::reset()
|
2009-05-11 19:38:43 +02:00
|
|
|
{
|
2010-04-01 01:56:45 +02:00
|
|
|
for (int node = 0; node < m_nodes; node++) {
|
|
|
|
for (int j = 0; j < m_virtual_networks; j++) {
|
|
|
|
m_toNetQueues[node][j]->clear();
|
|
|
|
m_fromNetQueues[node][j]->clear();
|
|
|
|
}
|
2009-05-11 19:38:43 +02:00
|
|
|
}
|
|
|
|
|
2010-04-01 01:56:45 +02:00
|
|
|
for(int i = 0; i < m_switch_ptr_vector.size(); i++){
|
|
|
|
m_switch_ptr_vector[i]->clearBuffers();
|
|
|
|
}
|
2009-05-11 19:38:43 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
SimpleNetwork::~SimpleNetwork()
|
|
|
|
{
|
2010-04-01 01:56:45 +02:00
|
|
|
for (int i = 0; i < m_nodes; i++) {
|
2010-06-11 08:17:07 +02:00
|
|
|
deletePointers(m_toNetQueues[i]);
|
|
|
|
deletePointers(m_fromNetQueues[i]);
|
2010-04-01 01:56:45 +02:00
|
|
|
}
|
2010-06-11 08:17:07 +02:00
|
|
|
deletePointers(m_switch_ptr_vector);
|
|
|
|
deletePointers(m_buffers_to_free);
|
2010-04-01 01:56:45 +02:00
|
|
|
// delete m_topology_ptr;
|
2009-05-11 19:38:43 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
// From a switch to an endpoint node
|
2010-04-01 01:56:45 +02:00
|
|
|
void
|
2011-04-29 02:18:14 +02:00
|
|
|
SimpleNetwork::makeOutLink(SwitchID src, NodeID dest, BasicLink* link,
|
|
|
|
LinkDirection direction,
|
|
|
|
const NetDest& routing_table_entry,
|
|
|
|
bool isReconfiguration)
|
2009-05-11 19:38:43 +02:00
|
|
|
{
|
2010-04-01 01:56:45 +02:00
|
|
|
assert(dest < m_nodes);
|
|
|
|
assert(src < m_switch_ptr_vector.size());
|
|
|
|
assert(m_switch_ptr_vector[src] != NULL);
|
|
|
|
|
|
|
|
if (isReconfiguration) {
|
|
|
|
m_switch_ptr_vector[src]->reconfigureOutPort(routing_table_entry);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
m_switch_ptr_vector[src]->addOutPort(m_fromNetQueues[dest],
|
2011-04-29 02:18:14 +02:00
|
|
|
routing_table_entry,
|
|
|
|
link->m_latency,
|
|
|
|
link->m_bw_multiplier);
|
|
|
|
|
2009-05-11 19:38:43 +02:00
|
|
|
m_endpoint_switches[dest] = m_switch_ptr_vector[src];
|
|
|
|
}
|
|
|
|
|
|
|
|
// From an endpoint node to a switch
|
2010-04-01 01:56:45 +02:00
|
|
|
void
|
2011-04-29 02:18:14 +02:00
|
|
|
SimpleNetwork::makeInLink(NodeID src, SwitchID dest, BasicLink* link,
|
|
|
|
LinkDirection direction,
|
|
|
|
const NetDest& routing_table_entry,
|
|
|
|
bool isReconfiguration)
|
2009-05-11 19:38:43 +02:00
|
|
|
{
|
2010-04-01 01:56:45 +02:00
|
|
|
assert(src < m_nodes);
|
|
|
|
if (isReconfiguration) {
|
|
|
|
// do nothing
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2009-05-11 19:38:43 +02:00
|
|
|
m_switch_ptr_vector[dest]->addInPort(m_toNetQueues[src]);
|
|
|
|
}
|
|
|
|
|
|
|
|
// From a switch to a switch
|
2010-04-01 01:56:45 +02:00
|
|
|
void
|
2011-04-29 02:18:14 +02:00
|
|
|
SimpleNetwork::makeInternalLink(SwitchID src, SwitchID dest, BasicLink* link,
|
|
|
|
LinkDirection direction,
|
|
|
|
const NetDest& routing_table_entry,
|
|
|
|
bool isReconfiguration)
|
2009-05-11 19:38:43 +02:00
|
|
|
{
|
2010-04-01 01:56:45 +02:00
|
|
|
if (isReconfiguration) {
|
|
|
|
m_switch_ptr_vector[src]->reconfigureOutPort(routing_table_entry);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2009-05-11 19:38:43 +02:00
|
|
|
// Create a set of new MessageBuffers
|
2010-06-11 08:17:07 +02:00
|
|
|
std::vector<MessageBuffer*> queues;
|
2009-05-11 19:38:43 +02:00
|
|
|
for (int i = 0; i < m_virtual_networks; i++) {
|
2010-04-01 01:56:45 +02:00
|
|
|
// allocate a buffer
|
|
|
|
MessageBuffer* buffer_ptr = new MessageBuffer;
|
|
|
|
buffer_ptr->setOrdering(true);
|
|
|
|
if (m_buffer_size > 0) {
|
2010-06-11 08:17:07 +02:00
|
|
|
buffer_ptr->resize(m_buffer_size);
|
2010-04-01 01:56:45 +02:00
|
|
|
}
|
2010-06-11 08:17:07 +02:00
|
|
|
queues.push_back(buffer_ptr);
|
2010-04-01 01:56:45 +02:00
|
|
|
// remember to deallocate it
|
2010-06-11 08:17:07 +02:00
|
|
|
m_buffers_to_free.push_back(buffer_ptr);
|
2009-05-11 19:38:43 +02:00
|
|
|
}
|
|
|
|
// Connect it to the two switches
|
|
|
|
m_switch_ptr_vector[dest]->addInPort(queues);
|
2010-04-01 01:56:45 +02:00
|
|
|
m_switch_ptr_vector[src]->addOutPort(queues, routing_table_entry,
|
2011-04-29 02:18:14 +02:00
|
|
|
link->m_latency,
|
|
|
|
link->m_bw_multiplier);
|
2009-05-11 19:38:43 +02:00
|
|
|
}
|
|
|
|
|
2010-04-01 01:56:45 +02:00
|
|
|
void
|
|
|
|
SimpleNetwork::checkNetworkAllocation(NodeID id, bool ordered, int network_num)
|
2009-05-11 19:38:43 +02:00
|
|
|
{
|
2011-01-10 20:11:20 +01:00
|
|
|
assert(id < m_nodes);
|
|
|
|
assert(network_num < m_virtual_networks);
|
2009-05-11 19:38:43 +02:00
|
|
|
|
2010-04-01 01:56:45 +02:00
|
|
|
if (ordered) {
|
|
|
|
m_ordered[network_num] = true;
|
|
|
|
}
|
|
|
|
m_in_use[network_num] = true;
|
2009-05-11 19:38:43 +02:00
|
|
|
}
|
|
|
|
|
2010-04-01 01:56:45 +02:00
|
|
|
MessageBuffer*
|
|
|
|
SimpleNetwork::getToNetQueue(NodeID id, bool ordered, int network_num)
|
2009-05-11 19:38:43 +02:00
|
|
|
{
|
2010-04-01 01:56:45 +02:00
|
|
|
checkNetworkAllocation(id, ordered, network_num);
|
|
|
|
return m_toNetQueues[id][network_num];
|
2009-05-11 19:38:43 +02:00
|
|
|
}
|
|
|
|
|
2010-04-01 01:56:45 +02:00
|
|
|
MessageBuffer*
|
|
|
|
SimpleNetwork::getFromNetQueue(NodeID id, bool ordered, int network_num)
|
2009-05-11 19:38:43 +02:00
|
|
|
{
|
2010-04-01 01:56:45 +02:00
|
|
|
checkNetworkAllocation(id, ordered, network_num);
|
|
|
|
return m_fromNetQueues[id][network_num];
|
2009-05-11 19:38:43 +02:00
|
|
|
}
|
|
|
|
|
2010-06-11 08:17:07 +02:00
|
|
|
const std::vector<Throttle*>*
|
2010-04-01 01:56:45 +02:00
|
|
|
SimpleNetwork::getThrottles(NodeID id) const
|
2009-05-11 19:38:43 +02:00
|
|
|
{
|
2010-04-01 01:56:45 +02:00
|
|
|
assert(id >= 0);
|
|
|
|
assert(id < m_nodes);
|
|
|
|
assert(m_endpoint_switches[id] != NULL);
|
|
|
|
return m_endpoint_switches[id]->getThrottles();
|
2009-05-11 19:38:43 +02:00
|
|
|
}
|
|
|
|
|
2010-04-01 01:56:45 +02:00
|
|
|
void
|
|
|
|
SimpleNetwork::printStats(ostream& out) const
|
2009-05-11 19:38:43 +02:00
|
|
|
{
|
2010-04-01 01:56:45 +02:00
|
|
|
out << endl;
|
|
|
|
out << "Network Stats" << endl;
|
|
|
|
out << "-------------" << endl;
|
|
|
|
out << endl;
|
2010-08-20 20:46:12 +02:00
|
|
|
|
|
|
|
//
|
|
|
|
// Determine total counts before printing out each switch's stats
|
|
|
|
//
|
|
|
|
std::vector<uint64> total_msg_counts;
|
|
|
|
total_msg_counts.resize(MessageSizeType_NUM);
|
|
|
|
for (MessageSizeType type = MessageSizeType_FIRST;
|
|
|
|
type < MessageSizeType_NUM;
|
|
|
|
++type) {
|
|
|
|
total_msg_counts[type] = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (int i = 0; i < m_switch_ptr_vector.size(); i++) {
|
|
|
|
const std::vector<Throttle*>* throttles =
|
|
|
|
m_switch_ptr_vector[i]->getThrottles();
|
|
|
|
|
|
|
|
for (int p = 0; p < throttles->size(); p++) {
|
|
|
|
|
|
|
|
const std::vector<std::vector<int> >& message_counts =
|
|
|
|
((*throttles)[p])->getCounters();
|
|
|
|
|
|
|
|
for (MessageSizeType type = MessageSizeType_FIRST;
|
|
|
|
type < MessageSizeType_NUM;
|
|
|
|
++type) {
|
|
|
|
|
|
|
|
const std::vector<int> &mct = message_counts[type];
|
|
|
|
int sum = accumulate(mct.begin(), mct.end(), 0);
|
|
|
|
total_msg_counts[type] += uint64(sum);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
uint64 total_msgs = 0;
|
|
|
|
uint64 total_bytes = 0;
|
|
|
|
for (MessageSizeType type = MessageSizeType_FIRST;
|
|
|
|
type < MessageSizeType_NUM;
|
|
|
|
++type) {
|
|
|
|
|
|
|
|
if (total_msg_counts[type] > 0) {
|
|
|
|
out << "total_msg_count_" << type << ": " << total_msg_counts[type]
|
|
|
|
<< " " << total_msg_counts[type] *
|
|
|
|
uint64(RubySystem::getNetwork()->MessageSizeType_to_int(type))
|
|
|
|
<< endl;
|
|
|
|
|
|
|
|
total_msgs += total_msg_counts[type];
|
|
|
|
|
|
|
|
total_bytes += total_msg_counts[type] *
|
|
|
|
uint64(RubySystem::getNetwork()->MessageSizeType_to_int(type));
|
|
|
|
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
out << "total_msgs: " << total_msgs
|
|
|
|
<< " total_bytes: " << total_bytes << endl;
|
|
|
|
|
|
|
|
out << endl;
|
2010-04-01 01:56:45 +02:00
|
|
|
for (int i = 0; i < m_switch_ptr_vector.size(); i++) {
|
|
|
|
m_switch_ptr_vector[i]->printStats(out);
|
|
|
|
}
|
|
|
|
m_topology_ptr->printStats(out);
|
2009-05-11 19:38:43 +02:00
|
|
|
}
|
|
|
|
|
2010-04-01 01:56:45 +02:00
|
|
|
void
|
|
|
|
SimpleNetwork::clearStats()
|
2009-05-11 19:38:43 +02:00
|
|
|
{
|
2010-04-01 01:56:45 +02:00
|
|
|
for (int i = 0; i < m_switch_ptr_vector.size(); i++) {
|
|
|
|
m_switch_ptr_vector[i]->clearStats();
|
|
|
|
}
|
|
|
|
m_topology_ptr->clearStats();
|
2009-05-11 19:38:43 +02:00
|
|
|
}
|
|
|
|
|
2010-04-01 01:56:45 +02:00
|
|
|
void
|
|
|
|
SimpleNetwork::printConfig(ostream& out) const
|
2009-05-11 19:38:43 +02:00
|
|
|
{
|
2010-04-01 01:56:45 +02:00
|
|
|
out << endl;
|
|
|
|
out << "Network Configuration" << endl;
|
|
|
|
out << "---------------------" << endl;
|
|
|
|
out << "network: SIMPLE_NETWORK" << endl;
|
|
|
|
out << "topology: " << m_topology_ptr->getName() << endl;
|
|
|
|
out << endl;
|
|
|
|
|
|
|
|
for (int i = 0; i < m_virtual_networks; i++) {
|
|
|
|
out << "virtual_net_" << i << ": ";
|
|
|
|
if (m_in_use[i]) {
|
|
|
|
out << "active, ";
|
|
|
|
if (m_ordered[i]) {
|
|
|
|
out << "ordered" << endl;
|
|
|
|
} else {
|
|
|
|
out << "unordered" << endl;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
out << "inactive" << endl;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
out << endl;
|
|
|
|
|
|
|
|
for(int i = 0; i < m_switch_ptr_vector.size(); i++) {
|
|
|
|
m_switch_ptr_vector[i]->printConfig(out);
|
2009-05-11 19:38:43 +02:00
|
|
|
}
|
|
|
|
|
2010-04-01 01:56:45 +02:00
|
|
|
m_topology_ptr->printConfig(out);
|
2009-05-11 19:38:43 +02:00
|
|
|
}
|
|
|
|
|
2010-04-01 01:56:45 +02:00
|
|
|
void
|
|
|
|
SimpleNetwork::print(ostream& out) const
|
2009-05-11 19:38:43 +02:00
|
|
|
{
|
2010-04-01 01:56:45 +02:00
|
|
|
out << "[SimpleNetwork]";
|
2009-05-11 19:38:43 +02:00
|
|
|
}
|
2010-01-30 05:29:17 +01:00
|
|
|
|
|
|
|
|
|
|
|
SimpleNetwork *
|
|
|
|
SimpleNetworkParams::create()
|
|
|
|
{
|
|
|
|
return new SimpleNetwork(this);
|
|
|
|
}
|