Throttle.cc revision 8232
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" 337054Snate@binkert.org#include "mem/protocol/Protocol.hh" 346154Snate@binkert.org#include "mem/ruby/buffers/MessageBuffer.hh" 358229Snate@binkert.org#include "mem/ruby/network/simple/Throttle.hh" 366154Snate@binkert.org#include "mem/ruby/network/Network.hh" 377054Snate@binkert.org#include "mem/ruby/slicc_interface/NetworkMessage.hh" 386154Snate@binkert.org#include "mem/ruby/system/System.hh" 396145Snate@binkert.org 407055Snate@binkert.orgusing namespace std; 417055Snate@binkert.org 426145Snate@binkert.orgconst int HIGH_RANGE = 256; 436145Snate@binkert.orgconst int ADJUST_INTERVAL = 50000; 446145Snate@binkert.orgconst int MESSAGE_SIZE_MULTIPLIER = 1000; 456145Snate@binkert.org//const int BROADCAST_SCALING = 4; // Have a 16p system act like a 64p systems 466145Snate@binkert.orgconst int BROADCAST_SCALING = 1; 476145Snate@binkert.orgconst int PRIORITY_SWITCH_LIMIT = 128; 486145Snate@binkert.org 496145Snate@binkert.orgstatic int network_message_to_size(NetworkMessage* net_msg_ptr); 506145Snate@binkert.org 517054Snate@binkert.orgThrottle::Throttle(int sID, NodeID node, int link_latency, 527054Snate@binkert.org int link_bandwidth_multiplier) 536145Snate@binkert.org{ 547054Snate@binkert.org init(node, link_latency, link_bandwidth_multiplier); 557054Snate@binkert.org m_sID = sID; 566145Snate@binkert.org} 576145Snate@binkert.org 587054Snate@binkert.orgThrottle::Throttle(NodeID node, int link_latency, 597054Snate@binkert.org int link_bandwidth_multiplier) 606145Snate@binkert.org{ 617054Snate@binkert.org init(node, link_latency, link_bandwidth_multiplier); 627054Snate@binkert.org m_sID = 0; 636145Snate@binkert.org} 646145Snate@binkert.org 657054Snate@binkert.orgvoid 667054Snate@binkert.orgThrottle::init(NodeID node, int link_latency, int link_bandwidth_multiplier) 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; 746145Snate@binkert.org 757054Snate@binkert.org m_wakeups_wo_switch = 0; 767054Snate@binkert.org clearStats(); 776145Snate@binkert.org} 786145Snate@binkert.org 797054Snate@binkert.orgvoid 807054Snate@binkert.orgThrottle::clear() 816145Snate@binkert.org{ 827054Snate@binkert.org for (int counter = 0; counter < m_vnets; counter++) { 837054Snate@binkert.org m_in[counter]->clear(); 847054Snate@binkert.org m_out[counter]->clear(); 857054Snate@binkert.org } 866145Snate@binkert.org} 876145Snate@binkert.org 887054Snate@binkert.orgvoid 897454Snate@binkert.orgThrottle::addLinks(const std::vector<MessageBuffer*>& in_vec, 907454Snate@binkert.org const std::vector<MessageBuffer*>& out_vec) 916145Snate@binkert.org{ 927054Snate@binkert.org assert(in_vec.size() == out_vec.size()); 937054Snate@binkert.org for (int i=0; i<in_vec.size(); i++) { 947054Snate@binkert.org addVirtualNetwork(in_vec[i], out_vec[i]); 957054Snate@binkert.org } 966145Snate@binkert.org 977454Snate@binkert.org m_message_counters.resize(MessageSizeType_NUM); 987054Snate@binkert.org for (int i = 0; i < MessageSizeType_NUM; i++) { 997454Snate@binkert.org m_message_counters[i].resize(in_vec.size()); 1007054Snate@binkert.org for (int j = 0; j<m_message_counters[i].size(); j++) { 1017054Snate@binkert.org m_message_counters[i][j] = 0; 1027054Snate@binkert.org } 1036145Snate@binkert.org } 1046145Snate@binkert.org} 1056145Snate@binkert.org 1067054Snate@binkert.orgvoid 1077054Snate@binkert.orgThrottle::addVirtualNetwork(MessageBuffer* in_ptr, MessageBuffer* out_ptr) 1086145Snate@binkert.org{ 1097454Snate@binkert.org m_units_remaining.push_back(0); 1107454Snate@binkert.org m_in.push_back(in_ptr); 1117454Snate@binkert.org m_out.push_back(out_ptr); 1126145Snate@binkert.org 1137054Snate@binkert.org // Set consumer and description 1147054Snate@binkert.org m_in[m_vnets]->setConsumer(this); 1157054Snate@binkert.org string desc = "[Queue to Throttle " + NodeIDToString(m_sID) + " " + 1167054Snate@binkert.org NodeIDToString(m_node) + "]"; 1177054Snate@binkert.org m_in[m_vnets]->setDescription(desc); 1187054Snate@binkert.org m_vnets++; 1196145Snate@binkert.org} 1206145Snate@binkert.org 1217054Snate@binkert.orgvoid 1227054Snate@binkert.orgThrottle::wakeup() 1236145Snate@binkert.org{ 1247054Snate@binkert.org // Limits the number of message sent to a limited number of bytes/cycle. 1257054Snate@binkert.org assert(getLinkBandwidth() > 0); 1267054Snate@binkert.org int bw_remaining = getLinkBandwidth(); 1276145Snate@binkert.org 1287054Snate@binkert.org // Give the highest numbered link priority most of the time 1297054Snate@binkert.org m_wakeups_wo_switch++; 1307054Snate@binkert.org int highest_prio_vnet = m_vnets-1; 1317054Snate@binkert.org int lowest_prio_vnet = 0; 1327054Snate@binkert.org int counter = 1; 1337054Snate@binkert.org bool schedule_wakeup = false; 1346145Snate@binkert.org 1357054Snate@binkert.org // invert priorities to avoid starvation seen in the component network 1367054Snate@binkert.org if (m_wakeups_wo_switch > PRIORITY_SWITCH_LIMIT) { 1377054Snate@binkert.org m_wakeups_wo_switch = 0; 1387054Snate@binkert.org highest_prio_vnet = 0; 1397054Snate@binkert.org lowest_prio_vnet = m_vnets-1; 1407054Snate@binkert.org counter = -1; 1416145Snate@binkert.org } 1426145Snate@binkert.org 1437054Snate@binkert.org for (int vnet = highest_prio_vnet; 1447054Snate@binkert.org (vnet * counter) >= (counter * lowest_prio_vnet); 1457054Snate@binkert.org vnet -= counter) { 1467054Snate@binkert.org 1477054Snate@binkert.org assert(m_out[vnet] != NULL); 1487054Snate@binkert.org assert(m_in[vnet] != NULL); 1497054Snate@binkert.org assert(m_units_remaining[vnet] >= 0); 1507054Snate@binkert.org 1517054Snate@binkert.org while (bw_remaining > 0 && 1527054Snate@binkert.org (m_in[vnet]->isReady() || m_units_remaining[vnet] > 0) && 1537054Snate@binkert.org m_out[vnet]->areNSlotsAvailable(1)) { 1547054Snate@binkert.org 1557054Snate@binkert.org // See if we are done transferring the previous message on 1567054Snate@binkert.org // this virtual network 1577054Snate@binkert.org if (m_units_remaining[vnet] == 0 && m_in[vnet]->isReady()) { 1587054Snate@binkert.org // Find the size of the message we are moving 1597054Snate@binkert.org MsgPtr msg_ptr = m_in[vnet]->peekMsgPtr(); 1607054Snate@binkert.org NetworkMessage* net_msg_ptr = 1617453Snate@binkert.org safe_cast<NetworkMessage*>(msg_ptr.get()); 1627054Snate@binkert.org m_units_remaining[vnet] += 1637054Snate@binkert.org network_message_to_size(net_msg_ptr); 1647054Snate@binkert.org 1657780Snilay@cs.wisc.edu DPRINTF(RubyNetwork, "throttle: %d my bw %d bw spent " 1667780Snilay@cs.wisc.edu "enqueueing net msg %d time: %lld.\n", 1677054Snate@binkert.org m_node, getLinkBandwidth(), m_units_remaining[vnet], 1687780Snilay@cs.wisc.edu g_eventQueue_ptr->getTime()); 1697054Snate@binkert.org 1707054Snate@binkert.org // Move the message 1717054Snate@binkert.org m_out[vnet]->enqueue(m_in[vnet]->peekMsgPtr(), m_link_latency); 1727054Snate@binkert.org m_in[vnet]->pop(); 1737054Snate@binkert.org 1747054Snate@binkert.org // Count the message 1757054Snate@binkert.org m_message_counters[net_msg_ptr->getMessageSize()][vnet]++; 1767054Snate@binkert.org 1777780Snilay@cs.wisc.edu DPRINTF(RubyNetwork, "%s\n", *m_out[vnet]); 1787054Snate@binkert.org } 1797054Snate@binkert.org 1807054Snate@binkert.org // Calculate the amount of bandwidth we spent on this message 1817054Snate@binkert.org int diff = m_units_remaining[vnet] - bw_remaining; 1827054Snate@binkert.org m_units_remaining[vnet] = max(0, diff); 1837054Snate@binkert.org bw_remaining = max(0, -diff); 1847054Snate@binkert.org } 1857054Snate@binkert.org 1867054Snate@binkert.org if (bw_remaining > 0 && 1877054Snate@binkert.org (m_in[vnet]->isReady() || m_units_remaining[vnet] > 0) && 1887054Snate@binkert.org !m_out[vnet]->areNSlotsAvailable(1)) { 1897780Snilay@cs.wisc.edu DPRINTF(RubyNetwork, "vnet: %d", vnet); 1907054Snate@binkert.org // schedule me to wakeup again because I'm waiting for my 1917054Snate@binkert.org // output queue to become available 1927054Snate@binkert.org schedule_wakeup = true; 1937054Snate@binkert.org } 1946145Snate@binkert.org } 1956145Snate@binkert.org 1967054Snate@binkert.org // We should only wake up when we use the bandwidth 1977054Snate@binkert.org // This is only mostly true 1987054Snate@binkert.org // assert(bw_remaining != getLinkBandwidth()); 1996145Snate@binkert.org 2007054Snate@binkert.org // Record that we used some or all of the link bandwidth this cycle 2017054Snate@binkert.org double ratio = 1.0 - (double(bw_remaining) / double(getLinkBandwidth())); 2026145Snate@binkert.org 2037054Snate@binkert.org // If ratio = 0, we used no bandwidth, if ratio = 1, we used all 2047054Snate@binkert.org linkUtilized(ratio); 2057054Snate@binkert.org 2067054Snate@binkert.org if (bw_remaining > 0 && !schedule_wakeup) { 2077054Snate@binkert.org // We have extra bandwidth and our output buffer was 2087054Snate@binkert.org // available, so we must not have anything else to do until 2097054Snate@binkert.org // another message arrives. 2107780Snilay@cs.wisc.edu DPRINTF(RubyNetwork, "%s not scheduled again\n", *this); 2117054Snate@binkert.org } else { 2127780Snilay@cs.wisc.edu DPRINTF(RubyNetwork, "%s scheduled again\n", *this); 2137054Snate@binkert.org 2147054Snate@binkert.org // We are out of bandwidth for this cycle, so wakeup next 2157054Snate@binkert.org // cycle and continue 2167054Snate@binkert.org g_eventQueue_ptr->scheduleEvent(this, 1); 2177054Snate@binkert.org } 2186145Snate@binkert.org} 2196145Snate@binkert.org 2207054Snate@binkert.orgvoid 2217054Snate@binkert.orgThrottle::printStats(ostream& out) const 2226145Snate@binkert.org{ 2237054Snate@binkert.org out << "utilized_percent: " << getUtilization() << endl; 2246145Snate@binkert.org} 2256145Snate@binkert.org 2267054Snate@binkert.orgvoid 2277054Snate@binkert.orgThrottle::clearStats() 2286145Snate@binkert.org{ 2297054Snate@binkert.org m_ruby_start = g_eventQueue_ptr->getTime(); 2307054Snate@binkert.org m_links_utilized = 0.0; 2316145Snate@binkert.org 2327054Snate@binkert.org for (int i = 0; i < m_message_counters.size(); i++) { 2337054Snate@binkert.org for (int j = 0; j < m_message_counters[i].size(); j++) { 2347054Snate@binkert.org m_message_counters[i][j] = 0; 2357054Snate@binkert.org } 2366145Snate@binkert.org } 2376145Snate@binkert.org} 2386145Snate@binkert.org 2397054Snate@binkert.orgvoid 2407054Snate@binkert.orgThrottle::printConfig(ostream& out) const 2416145Snate@binkert.org{ 2426145Snate@binkert.org} 2436145Snate@binkert.org 2447054Snate@binkert.orgdouble 2457054Snate@binkert.orgThrottle::getUtilization() const 2466145Snate@binkert.org{ 2477054Snate@binkert.org return 100.0 * double(m_links_utilized) / 2487054Snate@binkert.org double(g_eventQueue_ptr->getTime()-m_ruby_start); 2496145Snate@binkert.org} 2506145Snate@binkert.org 2517054Snate@binkert.orgvoid 2527054Snate@binkert.orgThrottle::print(ostream& out) const 2536145Snate@binkert.org{ 2548054Sksewell@umich.edu ccprintf(out, "[%i bw: %i]", m_node, getLinkBandwidth()); 2556145Snate@binkert.org} 2566145Snate@binkert.org 2577054Snate@binkert.orgint 2587054Snate@binkert.orgnetwork_message_to_size(NetworkMessage* net_msg_ptr) 2597054Snate@binkert.org{ 2607054Snate@binkert.org assert(net_msg_ptr != NULL); 2616145Snate@binkert.org 2627054Snate@binkert.org int size = RubySystem::getNetwork()-> 2637054Snate@binkert.org MessageSizeType_to_int(net_msg_ptr->getMessageSize()); 2647054Snate@binkert.org size *= MESSAGE_SIZE_MULTIPLIER; 2656145Snate@binkert.org 2667054Snate@binkert.org // Artificially increase the size of broadcast messages 2677054Snate@binkert.org if (BROADCAST_SCALING > 1 && net_msg_ptr->getDestination().isBroadcast()) 2687054Snate@binkert.org size *= BROADCAST_SCALING; 2697054Snate@binkert.org 2707054Snate@binkert.org return size; 2716145Snate@binkert.org} 272