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.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
2010-04-01 01:56:45 +02:00
|
|
|
* The class to implement bandwidth and latency throttle. An instance
|
|
|
|
* of consumer class that can be woke up. It is only used to control
|
|
|
|
* bandwidth at output port of a switch. And the throttle is added
|
|
|
|
* *after* the output port, means the message is put in the output
|
|
|
|
* port of the PerfectSwitch (a intermediateBuffers) first, then go
|
|
|
|
* through the Throttle.
|
2009-05-11 19:38:43 +02:00
|
|
|
*/
|
|
|
|
|
2010-04-01 01:56:45 +02:00
|
|
|
#ifndef __MEM_RUBY_NETWORK_SIMPLE_THROTTLE_HH__
|
|
|
|
#define __MEM_RUBY_NETWORK_SIMPLE_THROTTLE_HH__
|
2009-05-11 19:38:43 +02:00
|
|
|
|
2010-04-02 20:20:32 +02:00
|
|
|
#include <iostream>
|
2011-02-23 06:58:40 +01:00
|
|
|
#include <string>
|
2011-04-15 19:44:06 +02:00
|
|
|
#include <vector>
|
2010-04-02 20:20:32 +02:00
|
|
|
|
2009-05-11 19:38:45 +02:00
|
|
|
#include "mem/ruby/common/Consumer.hh"
|
2010-04-01 01:56:45 +02:00
|
|
|
#include "mem/ruby/common/Global.hh"
|
|
|
|
#include "mem/ruby/network/Network.hh"
|
2009-07-07 00:49:47 +02:00
|
|
|
#include "mem/ruby/system/System.hh"
|
2009-05-11 19:38:43 +02:00
|
|
|
|
|
|
|
class MessageBuffer;
|
|
|
|
|
2010-04-01 01:56:45 +02:00
|
|
|
class Throttle : public Consumer
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
Throttle(int sID, NodeID node, int link_latency,
|
2012-09-19 05:46:34 +02:00
|
|
|
int link_bandwidth_multiplier, int endpoint_bandwidth,
|
|
|
|
EventManager *em);
|
2011-04-29 02:18:14 +02:00
|
|
|
Throttle(NodeID node, int link_latency, int link_bandwidth_multiplier,
|
2012-09-19 05:46:34 +02:00
|
|
|
int endpoint_bandwidth, EventManager *em);
|
2010-04-01 01:56:45 +02:00
|
|
|
~Throttle() {}
|
|
|
|
|
2011-02-23 06:58:40 +01:00
|
|
|
std::string name()
|
|
|
|
{ return csprintf("Throttle-%i", m_sID); }
|
|
|
|
|
2010-06-11 08:17:07 +02:00
|
|
|
void addLinks(const std::vector<MessageBuffer*>& in_vec,
|
|
|
|
const std::vector<MessageBuffer*>& out_vec);
|
2010-04-01 01:56:45 +02:00
|
|
|
void wakeup();
|
|
|
|
|
2010-04-02 20:20:32 +02:00
|
|
|
void printStats(std::ostream& out) const;
|
2010-04-01 01:56:45 +02:00
|
|
|
void clearStats();
|
|
|
|
// The average utilization (a percent) since last clearStats()
|
|
|
|
double getUtilization() const;
|
|
|
|
int
|
|
|
|
getLinkBandwidth() const
|
|
|
|
{
|
2011-04-29 02:18:14 +02:00
|
|
|
return m_endpoint_bandwidth * m_link_bandwidth_multiplier;
|
2010-04-01 01:56:45 +02:00
|
|
|
}
|
|
|
|
int getLatency() const { return m_link_latency; }
|
|
|
|
|
2010-06-11 08:17:07 +02:00
|
|
|
const std::vector<std::vector<int> >&
|
2010-04-01 01:56:45 +02:00
|
|
|
getCounters() const
|
|
|
|
{
|
|
|
|
return m_message_counters;
|
|
|
|
}
|
|
|
|
|
|
|
|
void clear();
|
|
|
|
|
2010-04-02 20:20:32 +02:00
|
|
|
void print(std::ostream& out) const;
|
2010-04-01 01:56:45 +02:00
|
|
|
|
|
|
|
private:
|
2011-04-29 02:18:14 +02:00
|
|
|
void init(NodeID node, int link_latency, int link_bandwidth_multiplier,
|
|
|
|
int endpoint_bandwidth);
|
2010-04-01 01:56:45 +02:00
|
|
|
void addVirtualNetwork(MessageBuffer* in_ptr, MessageBuffer* out_ptr);
|
|
|
|
void linkUtilized(double ratio) { m_links_utilized += ratio; }
|
|
|
|
|
|
|
|
// Private copy constructor and assignment operator
|
|
|
|
Throttle(const Throttle& obj);
|
|
|
|
Throttle& operator=(const Throttle& obj);
|
|
|
|
|
2010-06-11 08:17:07 +02:00
|
|
|
std::vector<MessageBuffer*> m_in;
|
|
|
|
std::vector<MessageBuffer*> m_out;
|
|
|
|
std::vector<std::vector<int> > m_message_counters;
|
2010-04-01 01:56:45 +02:00
|
|
|
int m_vnets;
|
2010-06-11 08:17:07 +02:00
|
|
|
std::vector<int> m_units_remaining;
|
2010-04-01 01:56:45 +02:00
|
|
|
int m_sID;
|
|
|
|
NodeID m_node;
|
|
|
|
int m_link_bandwidth_multiplier;
|
|
|
|
int m_link_latency;
|
|
|
|
int m_wakeups_wo_switch;
|
2011-04-29 02:18:14 +02:00
|
|
|
int m_endpoint_bandwidth;
|
2010-04-01 01:56:45 +02:00
|
|
|
|
|
|
|
// For tracking utilization
|
|
|
|
Time m_ruby_start;
|
|
|
|
double m_links_utilized;
|
2009-05-11 19:38:43 +02:00
|
|
|
};
|
|
|
|
|
2010-04-02 20:20:32 +02:00
|
|
|
inline std::ostream&
|
|
|
|
operator<<(std::ostream& out, const Throttle& obj)
|
2009-05-11 19:38:43 +02:00
|
|
|
{
|
2010-04-01 01:56:45 +02:00
|
|
|
obj.print(out);
|
2010-04-02 20:20:32 +02:00
|
|
|
out << std::flush;
|
2010-04-01 01:56:45 +02:00
|
|
|
return out;
|
2009-05-11 19:38:43 +02:00
|
|
|
}
|
|
|
|
|
2010-04-01 01:56:45 +02:00
|
|
|
#endif // __MEM_RUBY_NETWORK_SIMPLE_THROTTLE_HH__
|