Throttle.cc revision 8608
16145Snate@binkert.org/* 26145Snate@binkert.org * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood 36145Snate@binkert.org * All rights reserved. 46145Snate@binkert.org * 56145Snate@binkert.org * Redistribution and use in source and binary forms, with or without 66145Snate@binkert.org * modification, are permitted provided that the following conditions are 76145Snate@binkert.org * met: redistributions of source code must retain the above copyright 86145Snate@binkert.org * notice, this list of conditions and the following disclaimer; 96145Snate@binkert.org * redistributions in binary form must reproduce the above copyright 106145Snate@binkert.org * notice, this list of conditions and the following disclaimer in the 116145Snate@binkert.org * documentation and/or other materials provided with the distribution; 126145Snate@binkert.org * neither the name of the copyright holders nor the names of its 136145Snate@binkert.org * contributors may be used to endorse or promote products derived from 146145Snate@binkert.org * this software without specific prior written permission. 156145Snate@binkert.org * 166145Snate@binkert.org * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 176145Snate@binkert.org * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 186145Snate@binkert.org * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 196145Snate@binkert.org * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 206145Snate@binkert.org * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 216145Snate@binkert.org * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 226145Snate@binkert.org * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 236145Snate@binkert.org * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 246145Snate@binkert.org * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 256145Snate@binkert.org * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 266145Snate@binkert.org * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 276145Snate@binkert.org */ 286145Snate@binkert.org 297832Snate@binkert.org#include <cassert> 307832Snate@binkert.org 317054Snate@binkert.org#include "base/cprintf.hh" 328232Snate@binkert.org#include "debug/RubyNetwork.hh" 336154Snate@binkert.org#include "mem/ruby/buffers/MessageBuffer.hh" 348229Snate@binkert.org#include "mem/ruby/network/simple/Throttle.hh" 356154Snate@binkert.org#include "mem/ruby/network/Network.hh" 367054Snate@binkert.org#include "mem/ruby/slicc_interface/NetworkMessage.hh" 376154Snate@binkert.org#include "mem/ruby/system/System.hh" 386145Snate@binkert.org 397055Snate@binkert.orgusing namespace std; 407055Snate@binkert.org 416145Snate@binkert.orgconst int HIGH_RANGE = 256; 426145Snate@binkert.orgconst int ADJUST_INTERVAL = 50000; 436145Snate@binkert.orgconst int MESSAGE_SIZE_MULTIPLIER = 1000; 446145Snate@binkert.org//const int BROADCAST_SCALING = 4; // Have a 16p system act like a 64p systems 456145Snate@binkert.orgconst int BROADCAST_SCALING = 1; 466145Snate@binkert.orgconst int PRIORITY_SWITCH_LIMIT = 128; 476145Snate@binkert.org 486145Snate@binkert.orgstatic int network_message_to_size(NetworkMessage* net_msg_ptr); 496145Snate@binkert.org 507054Snate@binkert.orgThrottle::Throttle(int sID, NodeID node, int link_latency, 518259SBrad.Beckmann@amd.com int link_bandwidth_multiplier, int endpoint_bandwidth) 526145Snate@binkert.org{ 538259SBrad.Beckmann@amd.com init(node, link_latency, link_bandwidth_multiplier, endpoint_bandwidth); 547054Snate@binkert.org m_sID = sID; 556145Snate@binkert.org} 566145Snate@binkert.org 577054Snate@binkert.orgThrottle::Throttle(NodeID node, int link_latency, 588259SBrad.Beckmann@amd.com int link_bandwidth_multiplier, int endpoint_bandwidth) 596145Snate@binkert.org{ 608259SBrad.Beckmann@amd.com init(node, link_latency, link_bandwidth_multiplier, endpoint_bandwidth); 617054Snate@binkert.org m_sID = 0; 626145Snate@binkert.org} 636145Snate@binkert.org 647054Snate@binkert.orgvoid 658259SBrad.Beckmann@amd.comThrottle::init(NodeID node, int link_latency, int link_bandwidth_multiplier, 668259SBrad.Beckmann@amd.com int endpoint_bandwidth) 676145Snate@binkert.org{ 687054Snate@binkert.org m_node = node; 697054Snate@binkert.org m_vnets = 0; 706145Snate@binkert.org 717832Snate@binkert.org assert(link_bandwidth_multiplier > 0); 727054Snate@binkert.org m_link_bandwidth_multiplier = link_bandwidth_multiplier; 737054Snate@binkert.org m_link_latency = link_latency; 748259SBrad.Beckmann@amd.com m_endpoint_bandwidth = endpoint_bandwidth; 756145Snate@binkert.org 767054Snate@binkert.org m_wakeups_wo_switch = 0; 777054Snate@binkert.org clearStats(); 786145Snate@binkert.org} 796145Snate@binkert.org 807054Snate@binkert.orgvoid 817054Snate@binkert.orgThrottle::clear() 826145Snate@binkert.org{ 837054Snate@binkert.org for (int counter = 0; counter < m_vnets; counter++) { 847054Snate@binkert.org m_in[counter]->clear(); 857054Snate@binkert.org m_out[counter]->clear(); 867054Snate@binkert.org } 876145Snate@binkert.org} 886145Snate@binkert.org 897054Snate@binkert.orgvoid 907454Snate@binkert.orgThrottle::addLinks(const std::vector<MessageBuffer*>& in_vec, 917454Snate@binkert.org const std::vector<MessageBuffer*>& out_vec) 926145Snate@binkert.org{ 937054Snate@binkert.org assert(in_vec.size() == out_vec.size()); 947054Snate@binkert.org for (int i=0; i<in_vec.size(); i++) { 957054Snate@binkert.org addVirtualNetwork(in_vec[i], out_vec[i]); 967054Snate@binkert.org } 976145Snate@binkert.org 987454Snate@binkert.org m_message_counters.resize(MessageSizeType_NUM); 997054Snate@binkert.org for (int i = 0; i < MessageSizeType_NUM; i++) { 1007454Snate@binkert.org m_message_counters[i].resize(in_vec.size()); 1017054Snate@binkert.org for (int j = 0; j<m_message_counters[i].size(); j++) { 1027054Snate@binkert.org m_message_counters[i][j] = 0; 1037054Snate@binkert.org } 1046145Snate@binkert.org } 1056145Snate@binkert.org} 1066145Snate@binkert.org 1077054Snate@binkert.orgvoid 1087054Snate@binkert.orgThrottle::addVirtualNetwork(MessageBuffer* in_ptr, MessageBuffer* out_ptr) 1096145Snate@binkert.org{ 1107454Snate@binkert.org m_units_remaining.push_back(0); 1117454Snate@binkert.org m_in.push_back(in_ptr); 1127454Snate@binkert.org m_out.push_back(out_ptr); 1136145Snate@binkert.org 1147054Snate@binkert.org // Set consumer and description 1157054Snate@binkert.org m_in[m_vnets]->setConsumer(this); 1168608Snilay@cs.wisc.edu string desc = "[Queue to Throttle " + to_string(m_sID) + " " + 1178608Snilay@cs.wisc.edu to_string(m_node) + "]"; 1187054Snate@binkert.org m_in[m_vnets]->setDescription(desc); 1197054Snate@binkert.org m_vnets++; 1206145Snate@binkert.org} 1216145Snate@binkert.org 1227054Snate@binkert.orgvoid 1237054Snate@binkert.orgThrottle::wakeup() 1246145Snate@binkert.org{ 1257054Snate@binkert.org // Limits the number of message sent to a limited number of bytes/cycle. 1267054Snate@binkert.org assert(getLinkBandwidth() > 0); 1277054Snate@binkert.org int bw_remaining = getLinkBandwidth(); 1286145Snate@binkert.org 1297054Snate@binkert.org // Give the highest numbered link priority most of the time 1307054Snate@binkert.org m_wakeups_wo_switch++; 1317054Snate@binkert.org int highest_prio_vnet = m_vnets-1; 1327054Snate@binkert.org int lowest_prio_vnet = 0; 1337054Snate@binkert.org int counter = 1; 1347054Snate@binkert.org bool schedule_wakeup = false; 1356145Snate@binkert.org 1367054Snate@binkert.org // invert priorities to avoid starvation seen in the component network 1377054Snate@binkert.org if (m_wakeups_wo_switch > PRIORITY_SWITCH_LIMIT) { 1387054Snate@binkert.org m_wakeups_wo_switch = 0; 1397054Snate@binkert.org highest_prio_vnet = 0; 1407054Snate@binkert.org lowest_prio_vnet = m_vnets-1; 1417054Snate@binkert.org counter = -1; 1426145Snate@binkert.org } 1436145Snate@binkert.org 1447054Snate@binkert.org for (int vnet = highest_prio_vnet; 1457054Snate@binkert.org (vnet * counter) >= (counter * lowest_prio_vnet); 1467054Snate@binkert.org vnet -= counter) { 1477054Snate@binkert.org 1487054Snate@binkert.org assert(m_out[vnet] != NULL); 1497054Snate@binkert.org assert(m_in[vnet] != NULL); 1507054Snate@binkert.org assert(m_units_remaining[vnet] >= 0); 1517054Snate@binkert.org 1527054Snate@binkert.org while (bw_remaining > 0 && 1537054Snate@binkert.org (m_in[vnet]->isReady() || m_units_remaining[vnet] > 0) && 1547054Snate@binkert.org m_out[vnet]->areNSlotsAvailable(1)) { 1557054Snate@binkert.org 1567054Snate@binkert.org // See if we are done transferring the previous message on 1577054Snate@binkert.org // this virtual network 1587054Snate@binkert.org if (m_units_remaining[vnet] == 0 && m_in[vnet]->isReady()) { 1597054Snate@binkert.org // Find the size of the message we are moving 1607054Snate@binkert.org MsgPtr msg_ptr = m_in[vnet]->peekMsgPtr(); 1617054Snate@binkert.org NetworkMessage* net_msg_ptr = 1627453Snate@binkert.org safe_cast<NetworkMessage*>(msg_ptr.get()); 1637054Snate@binkert.org m_units_remaining[vnet] += 1647054Snate@binkert.org network_message_to_size(net_msg_ptr); 1657054Snate@binkert.org 1667780Snilay@cs.wisc.edu DPRINTF(RubyNetwork, "throttle: %d my bw %d bw spent " 1677780Snilay@cs.wisc.edu "enqueueing net msg %d time: %lld.\n", 1687054Snate@binkert.org m_node, getLinkBandwidth(), m_units_remaining[vnet], 1697780Snilay@cs.wisc.edu g_eventQueue_ptr->getTime()); 1707054Snate@binkert.org 1717054Snate@binkert.org // Move the message 1727054Snate@binkert.org m_out[vnet]->enqueue(m_in[vnet]->peekMsgPtr(), m_link_latency); 1737054Snate@binkert.org m_in[vnet]->pop(); 1747054Snate@binkert.org 1757054Snate@binkert.org // Count the message 1767054Snate@binkert.org m_message_counters[net_msg_ptr->getMessageSize()][vnet]++; 1777054Snate@binkert.org 1787780Snilay@cs.wisc.edu DPRINTF(RubyNetwork, "%s\n", *m_out[vnet]); 1797054Snate@binkert.org } 1807054Snate@binkert.org 1817054Snate@binkert.org // Calculate the amount of bandwidth we spent on this message 1827054Snate@binkert.org int diff = m_units_remaining[vnet] - bw_remaining; 1837054Snate@binkert.org m_units_remaining[vnet] = max(0, diff); 1847054Snate@binkert.org bw_remaining = max(0, -diff); 1857054Snate@binkert.org } 1867054Snate@binkert.org 1877054Snate@binkert.org if (bw_remaining > 0 && 1887054Snate@binkert.org (m_in[vnet]->isReady() || m_units_remaining[vnet] > 0) && 1897054Snate@binkert.org !m_out[vnet]->areNSlotsAvailable(1)) { 1907780Snilay@cs.wisc.edu DPRINTF(RubyNetwork, "vnet: %d", vnet); 1917054Snate@binkert.org // schedule me to wakeup again because I'm waiting for my 1927054Snate@binkert.org // output queue to become available 1937054Snate@binkert.org schedule_wakeup = true; 1947054Snate@binkert.org } 1956145Snate@binkert.org } 1966145Snate@binkert.org 1977054Snate@binkert.org // We should only wake up when we use the bandwidth 1987054Snate@binkert.org // This is only mostly true 1997054Snate@binkert.org // assert(bw_remaining != getLinkBandwidth()); 2006145Snate@binkert.org 2017054Snate@binkert.org // Record that we used some or all of the link bandwidth this cycle 2027054Snate@binkert.org double ratio = 1.0 - (double(bw_remaining) / double(getLinkBandwidth())); 2036145Snate@binkert.org 2047054Snate@binkert.org // If ratio = 0, we used no bandwidth, if ratio = 1, we used all 2057054Snate@binkert.org linkUtilized(ratio); 2067054Snate@binkert.org 2077054Snate@binkert.org if (bw_remaining > 0 && !schedule_wakeup) { 2087054Snate@binkert.org // We have extra bandwidth and our output buffer was 2097054Snate@binkert.org // available, so we must not have anything else to do until 2107054Snate@binkert.org // another message arrives. 2117780Snilay@cs.wisc.edu DPRINTF(RubyNetwork, "%s not scheduled again\n", *this); 2127054Snate@binkert.org } else { 2137780Snilay@cs.wisc.edu DPRINTF(RubyNetwork, "%s scheduled again\n", *this); 2147054Snate@binkert.org 2157054Snate@binkert.org // We are out of bandwidth for this cycle, so wakeup next 2167054Snate@binkert.org // cycle and continue 2177054Snate@binkert.org g_eventQueue_ptr->scheduleEvent(this, 1); 2187054Snate@binkert.org } 2196145Snate@binkert.org} 2206145Snate@binkert.org 2217054Snate@binkert.orgvoid 2227054Snate@binkert.orgThrottle::printStats(ostream& out) const 2236145Snate@binkert.org{ 2247054Snate@binkert.org out << "utilized_percent: " << getUtilization() << endl; 2256145Snate@binkert.org} 2266145Snate@binkert.org 2277054Snate@binkert.orgvoid 2287054Snate@binkert.orgThrottle::clearStats() 2296145Snate@binkert.org{ 2307054Snate@binkert.org m_ruby_start = g_eventQueue_ptr->getTime(); 2317054Snate@binkert.org m_links_utilized = 0.0; 2326145Snate@binkert.org 2337054Snate@binkert.org for (int i = 0; i < m_message_counters.size(); i++) { 2347054Snate@binkert.org for (int j = 0; j < m_message_counters[i].size(); j++) { 2357054Snate@binkert.org m_message_counters[i][j] = 0; 2367054Snate@binkert.org } 2376145Snate@binkert.org } 2386145Snate@binkert.org} 2396145Snate@binkert.org 2407054Snate@binkert.orgvoid 2417054Snate@binkert.orgThrottle::printConfig(ostream& out) const 2426145Snate@binkert.org{ 2436145Snate@binkert.org} 2446145Snate@binkert.org 2457054Snate@binkert.orgdouble 2467054Snate@binkert.orgThrottle::getUtilization() const 2476145Snate@binkert.org{ 2487054Snate@binkert.org return 100.0 * double(m_links_utilized) / 2497054Snate@binkert.org double(g_eventQueue_ptr->getTime()-m_ruby_start); 2506145Snate@binkert.org} 2516145Snate@binkert.org 2527054Snate@binkert.orgvoid 2537054Snate@binkert.orgThrottle::print(ostream& out) const 2546145Snate@binkert.org{ 2558054Sksewell@umich.edu ccprintf(out, "[%i bw: %i]", m_node, getLinkBandwidth()); 2566145Snate@binkert.org} 2576145Snate@binkert.org 2587054Snate@binkert.orgint 2597054Snate@binkert.orgnetwork_message_to_size(NetworkMessage* net_msg_ptr) 2607054Snate@binkert.org{ 2617054Snate@binkert.org assert(net_msg_ptr != NULL); 2626145Snate@binkert.org 2637054Snate@binkert.org int size = RubySystem::getNetwork()-> 2647054Snate@binkert.org MessageSizeType_to_int(net_msg_ptr->getMessageSize()); 2657054Snate@binkert.org size *= MESSAGE_SIZE_MULTIPLIER; 2666145Snate@binkert.org 2677054Snate@binkert.org // Artificially increase the size of broadcast messages 2687054Snate@binkert.org if (BROADCAST_SCALING > 1 && net_msg_ptr->getDestination().isBroadcast()) 2697054Snate@binkert.org size *= BROADCAST_SCALING; 2707054Snate@binkert.org 2717054Snate@binkert.org return size; 2726145Snate@binkert.org} 273