343e94a257
Currently the wakeup function for the PerfectSwitch contains three loops - loop on number of virtual networks loop on number of incoming links loop till all messages for this (link, network) have been routed With an 8 processor mesh network and Hammer protocol, about 11-12% of the was observed to have been spent in this function, which is the highest amongst all the functions. It was found that the innermost loop is executed about 45 times per invocation of the wakeup function, when each invocation of the wakeup function processes just about one message. The patch tries to do away with the redundant executions of the innermost loop. Counters have been added for each virtual network that record the number of messages that need to be routed for that virtual network. The inner loops are only executed when the number of messages for that particular virtual network > 0. This does away with almost 80% of the executions of the innermost loop. The function now consumes about 5-6% of the total execution time.
108 lines
3.7 KiB
C++
108 lines
3.7 KiB
C++
/*
|
|
* 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.
|
|
*/
|
|
|
|
/*
|
|
* Perfect switch, of course it is perfect and no latency or what so
|
|
* ever. Every cycle it is woke up and perform all the necessary
|
|
* routings that must be done. Note, this switch also has number of
|
|
* input ports/output ports and has a routing table as well.
|
|
*/
|
|
|
|
#ifndef __MEM_RUBY_NETWORK_SIMPLE_PERFECTSWITCH_HH__
|
|
#define __MEM_RUBY_NETWORK_SIMPLE_PERFECTSWITCH_HH__
|
|
|
|
#include <iostream>
|
|
#include <vector>
|
|
|
|
#include "mem/ruby/common/Consumer.hh"
|
|
#include "mem/ruby/common/Global.hh"
|
|
#include "mem/ruby/system/NodeID.hh"
|
|
|
|
class MessageBuffer;
|
|
class NetDest;
|
|
class SimpleNetwork;
|
|
|
|
struct LinkOrder
|
|
{
|
|
int m_link;
|
|
int m_value;
|
|
};
|
|
|
|
class PerfectSwitch : public Consumer
|
|
{
|
|
public:
|
|
PerfectSwitch(SwitchID sid, SimpleNetwork* network_ptr);
|
|
~PerfectSwitch();
|
|
|
|
void addInPort(const std::vector<MessageBuffer*>& in);
|
|
void addOutPort(const std::vector<MessageBuffer*>& out,
|
|
const NetDest& routing_table_entry);
|
|
void clearRoutingTables();
|
|
void clearBuffers();
|
|
void reconfigureOutPort(const NetDest& routing_table_entry);
|
|
int getInLinks() const { return m_in.size(); }
|
|
int getOutLinks() const { return m_out.size(); }
|
|
|
|
void wakeup();
|
|
void storeEventInfo(int info);
|
|
|
|
void printStats(std::ostream& out) const;
|
|
void clearStats();
|
|
void printConfig(std::ostream& out) const;
|
|
|
|
void print(std::ostream& out) const;
|
|
|
|
private:
|
|
// Private copy constructor and assignment operator
|
|
PerfectSwitch(const PerfectSwitch& obj);
|
|
PerfectSwitch& operator=(const PerfectSwitch& obj);
|
|
|
|
SwitchID m_switch_id;
|
|
|
|
// vector of queues from the components
|
|
std::vector<std::vector<MessageBuffer*> > m_in;
|
|
std::vector<std::vector<MessageBuffer*> > m_out;
|
|
std::vector<NetDest> m_routing_table;
|
|
std::vector<LinkOrder> m_link_order;
|
|
int m_virtual_networks;
|
|
int m_round_robin_start;
|
|
int m_wakeups_wo_switch;
|
|
SimpleNetwork* m_network_ptr;
|
|
std::vector<int> m_pending_message_count;
|
|
};
|
|
|
|
inline std::ostream&
|
|
operator<<(std::ostream& out, const PerfectSwitch& obj)
|
|
{
|
|
obj.print(out);
|
|
out << std::flush;
|
|
return out;
|
|
}
|
|
|
|
#endif // __MEM_RUBY_NETWORK_SIMPLE_PERFECTSWITCH_HH__
|