Throttle.cc revision 7054
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 297054Snate@binkert.org#include "base/cprintf.hh" 307054Snate@binkert.org#include "mem/protocol/Protocol.hh" 316154Snate@binkert.org#include "mem/ruby/buffers/MessageBuffer.hh" 326154Snate@binkert.org#include "mem/ruby/network/Network.hh" 337054Snate@binkert.org#include "mem/ruby/network/simple/Throttle.hh" 347054Snate@binkert.org#include "mem/ruby/slicc_interface/NetworkMessage.hh" 356154Snate@binkert.org#include "mem/ruby/system/System.hh" 366145Snate@binkert.org 376145Snate@binkert.orgconst int HIGH_RANGE = 256; 386145Snate@binkert.orgconst int ADJUST_INTERVAL = 50000; 396145Snate@binkert.orgconst int MESSAGE_SIZE_MULTIPLIER = 1000; 406145Snate@binkert.org//const int BROADCAST_SCALING = 4; // Have a 16p system act like a 64p systems 416145Snate@binkert.orgconst int BROADCAST_SCALING = 1; 426145Snate@binkert.orgconst int PRIORITY_SWITCH_LIMIT = 128; 436145Snate@binkert.org 446145Snate@binkert.orgstatic int network_message_to_size(NetworkMessage* net_msg_ptr); 456145Snate@binkert.org 467054Snate@binkert.orgextern std::ostream *debug_cout_ptr; 476145Snate@binkert.org 487054Snate@binkert.orgThrottle::Throttle(int sID, NodeID node, int link_latency, 497054Snate@binkert.org int link_bandwidth_multiplier) 506145Snate@binkert.org{ 517054Snate@binkert.org init(node, link_latency, link_bandwidth_multiplier); 527054Snate@binkert.org m_sID = sID; 536145Snate@binkert.org} 546145Snate@binkert.org 557054Snate@binkert.orgThrottle::Throttle(NodeID node, int link_latency, 567054Snate@binkert.org int link_bandwidth_multiplier) 576145Snate@binkert.org{ 587054Snate@binkert.org init(node, link_latency, link_bandwidth_multiplier); 597054Snate@binkert.org m_sID = 0; 606145Snate@binkert.org} 616145Snate@binkert.org 627054Snate@binkert.orgvoid 637054Snate@binkert.orgThrottle::init(NodeID node, int link_latency, int link_bandwidth_multiplier) 646145Snate@binkert.org{ 657054Snate@binkert.org m_node = node; 667054Snate@binkert.org m_vnets = 0; 676145Snate@binkert.org 687054Snate@binkert.org ASSERT(link_bandwidth_multiplier > 0); 697054Snate@binkert.org m_link_bandwidth_multiplier = link_bandwidth_multiplier; 707054Snate@binkert.org m_link_latency = link_latency; 716145Snate@binkert.org 727054Snate@binkert.org m_wakeups_wo_switch = 0; 737054Snate@binkert.org clearStats(); 746145Snate@binkert.org} 756145Snate@binkert.org 767054Snate@binkert.orgvoid 777054Snate@binkert.orgThrottle::clear() 786145Snate@binkert.org{ 797054Snate@binkert.org for (int counter = 0; counter < m_vnets; counter++) { 807054Snate@binkert.org m_in[counter]->clear(); 817054Snate@binkert.org m_out[counter]->clear(); 827054Snate@binkert.org } 836145Snate@binkert.org} 846145Snate@binkert.org 857054Snate@binkert.orgvoid 867054Snate@binkert.orgThrottle::addLinks(const Vector<MessageBuffer*>& in_vec, 877054Snate@binkert.org const Vector<MessageBuffer*>& out_vec) 886145Snate@binkert.org{ 897054Snate@binkert.org assert(in_vec.size() == out_vec.size()); 907054Snate@binkert.org for (int i=0; i<in_vec.size(); i++) { 917054Snate@binkert.org addVirtualNetwork(in_vec[i], out_vec[i]); 927054Snate@binkert.org } 936145Snate@binkert.org 947054Snate@binkert.org m_message_counters.setSize(MessageSizeType_NUM); 957054Snate@binkert.org for (int i = 0; i < MessageSizeType_NUM; i++) { 967054Snate@binkert.org m_message_counters[i].setSize(in_vec.size()); 977054Snate@binkert.org for (int j = 0; j<m_message_counters[i].size(); j++) { 987054Snate@binkert.org m_message_counters[i][j] = 0; 997054Snate@binkert.org } 1006145Snate@binkert.org } 1016145Snate@binkert.org} 1026145Snate@binkert.org 1037054Snate@binkert.orgvoid 1047054Snate@binkert.orgThrottle::addVirtualNetwork(MessageBuffer* in_ptr, MessageBuffer* out_ptr) 1056145Snate@binkert.org{ 1067054Snate@binkert.org m_units_remaining.insertAtBottom(0); 1077054Snate@binkert.org m_in.insertAtBottom(in_ptr); 1087054Snate@binkert.org m_out.insertAtBottom(out_ptr); 1096145Snate@binkert.org 1107054Snate@binkert.org // Set consumer and description 1117054Snate@binkert.org m_in[m_vnets]->setConsumer(this); 1127054Snate@binkert.org string desc = "[Queue to Throttle " + NodeIDToString(m_sID) + " " + 1137054Snate@binkert.org NodeIDToString(m_node) + "]"; 1147054Snate@binkert.org m_in[m_vnets]->setDescription(desc); 1157054Snate@binkert.org m_vnets++; 1166145Snate@binkert.org} 1176145Snate@binkert.org 1187054Snate@binkert.orgvoid 1197054Snate@binkert.orgThrottle::wakeup() 1206145Snate@binkert.org{ 1217054Snate@binkert.org // Limits the number of message sent to a limited number of bytes/cycle. 1227054Snate@binkert.org assert(getLinkBandwidth() > 0); 1237054Snate@binkert.org int bw_remaining = getLinkBandwidth(); 1246145Snate@binkert.org 1257054Snate@binkert.org // Give the highest numbered link priority most of the time 1267054Snate@binkert.org m_wakeups_wo_switch++; 1277054Snate@binkert.org int highest_prio_vnet = m_vnets-1; 1287054Snate@binkert.org int lowest_prio_vnet = 0; 1297054Snate@binkert.org int counter = 1; 1307054Snate@binkert.org bool schedule_wakeup = false; 1316145Snate@binkert.org 1327054Snate@binkert.org // invert priorities to avoid starvation seen in the component network 1337054Snate@binkert.org if (m_wakeups_wo_switch > PRIORITY_SWITCH_LIMIT) { 1347054Snate@binkert.org m_wakeups_wo_switch = 0; 1357054Snate@binkert.org highest_prio_vnet = 0; 1367054Snate@binkert.org lowest_prio_vnet = m_vnets-1; 1377054Snate@binkert.org counter = -1; 1386145Snate@binkert.org } 1396145Snate@binkert.org 1407054Snate@binkert.org for (int vnet = highest_prio_vnet; 1417054Snate@binkert.org (vnet * counter) >= (counter * lowest_prio_vnet); 1427054Snate@binkert.org vnet -= counter) { 1437054Snate@binkert.org 1447054Snate@binkert.org assert(m_out[vnet] != NULL); 1457054Snate@binkert.org assert(m_in[vnet] != NULL); 1467054Snate@binkert.org assert(m_units_remaining[vnet] >= 0); 1477054Snate@binkert.org 1487054Snate@binkert.org while (bw_remaining > 0 && 1497054Snate@binkert.org (m_in[vnet]->isReady() || m_units_remaining[vnet] > 0) && 1507054Snate@binkert.org m_out[vnet]->areNSlotsAvailable(1)) { 1517054Snate@binkert.org 1527054Snate@binkert.org // See if we are done transferring the previous message on 1537054Snate@binkert.org // this virtual network 1547054Snate@binkert.org if (m_units_remaining[vnet] == 0 && m_in[vnet]->isReady()) { 1557054Snate@binkert.org // Find the size of the message we are moving 1567054Snate@binkert.org MsgPtr msg_ptr = m_in[vnet]->peekMsgPtr(); 1577054Snate@binkert.org NetworkMessage* net_msg_ptr = 1587054Snate@binkert.org safe_cast<NetworkMessage*>(msg_ptr.ref()); 1597054Snate@binkert.org m_units_remaining[vnet] += 1607054Snate@binkert.org network_message_to_size(net_msg_ptr); 1617054Snate@binkert.org 1627054Snate@binkert.org DEBUG_NEWLINE(NETWORK_COMP,HighPrio); 1637054Snate@binkert.org DEBUG_MSG(NETWORK_COMP, HighPrio, 1647054Snate@binkert.org csprintf("throttle: %d my bw %d bw spent enqueueing " 1657054Snate@binkert.org "net msg %d time: %d.", 1667054Snate@binkert.org m_node, getLinkBandwidth(), m_units_remaining[vnet], 1677054Snate@binkert.org g_eventQueue_ptr->getTime())); 1687054Snate@binkert.org 1697054Snate@binkert.org // Move the message 1707054Snate@binkert.org m_out[vnet]->enqueue(m_in[vnet]->peekMsgPtr(), m_link_latency); 1717054Snate@binkert.org m_in[vnet]->pop(); 1727054Snate@binkert.org 1737054Snate@binkert.org // Count the message 1747054Snate@binkert.org m_message_counters[net_msg_ptr->getMessageSize()][vnet]++; 1757054Snate@binkert.org 1767054Snate@binkert.org DEBUG_MSG(NETWORK_COMP,LowPrio,*m_out[vnet]); 1777054Snate@binkert.org DEBUG_NEWLINE(NETWORK_COMP,HighPrio); 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)) { 1897054Snate@binkert.org DEBUG_MSG(NETWORK_COMP,LowPrio,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. 2107054Snate@binkert.org DEBUG_MSG(NETWORK_COMP, LowPrio, *this); 2117054Snate@binkert.org DEBUG_MSG(NETWORK_COMP, LowPrio, "not scheduled again"); 2127054Snate@binkert.org } else { 2137054Snate@binkert.org DEBUG_MSG(NETWORK_COMP, LowPrio, *this); 2147054Snate@binkert.org DEBUG_MSG(NETWORK_COMP, LowPrio, "scheduled again"); 2157054Snate@binkert.org 2167054Snate@binkert.org // We are out of bandwidth for this cycle, so wakeup next 2177054Snate@binkert.org // cycle and continue 2187054Snate@binkert.org g_eventQueue_ptr->scheduleEvent(this, 1); 2197054Snate@binkert.org } 2206145Snate@binkert.org} 2216145Snate@binkert.org 2227054Snate@binkert.orgvoid 2237054Snate@binkert.orgThrottle::printStats(ostream& out) const 2246145Snate@binkert.org{ 2257054Snate@binkert.org out << "utilized_percent: " << getUtilization() << endl; 2266145Snate@binkert.org} 2276145Snate@binkert.org 2287054Snate@binkert.orgvoid 2297054Snate@binkert.orgThrottle::clearStats() 2306145Snate@binkert.org{ 2317054Snate@binkert.org m_ruby_start = g_eventQueue_ptr->getTime(); 2327054Snate@binkert.org m_links_utilized = 0.0; 2336145Snate@binkert.org 2347054Snate@binkert.org for (int i = 0; i < m_message_counters.size(); i++) { 2357054Snate@binkert.org for (int j = 0; j < m_message_counters[i].size(); j++) { 2367054Snate@binkert.org m_message_counters[i][j] = 0; 2377054Snate@binkert.org } 2386145Snate@binkert.org } 2396145Snate@binkert.org} 2406145Snate@binkert.org 2417054Snate@binkert.orgvoid 2427054Snate@binkert.orgThrottle::printConfig(ostream& out) const 2436145Snate@binkert.org{ 2446145Snate@binkert.org} 2456145Snate@binkert.org 2467054Snate@binkert.orgdouble 2477054Snate@binkert.orgThrottle::getUtilization() const 2486145Snate@binkert.org{ 2497054Snate@binkert.org return 100.0 * double(m_links_utilized) / 2507054Snate@binkert.org double(g_eventQueue_ptr->getTime()-m_ruby_start); 2516145Snate@binkert.org} 2526145Snate@binkert.org 2537054Snate@binkert.orgvoid 2547054Snate@binkert.orgThrottle::print(ostream& out) const 2556145Snate@binkert.org{ 2567054Snate@binkert.org out << "[Throttle: " << m_sID << " " << m_node 2577054Snate@binkert.org << " bw: " << getLinkBandwidth() << "]"; 2586145Snate@binkert.org} 2596145Snate@binkert.org 2607054Snate@binkert.orgint 2617054Snate@binkert.orgnetwork_message_to_size(NetworkMessage* net_msg_ptr) 2627054Snate@binkert.org{ 2637054Snate@binkert.org assert(net_msg_ptr != NULL); 2646145Snate@binkert.org 2657054Snate@binkert.org int size = RubySystem::getNetwork()-> 2667054Snate@binkert.org MessageSizeType_to_int(net_msg_ptr->getMessageSize()); 2677054Snate@binkert.org size *= MESSAGE_SIZE_MULTIPLIER; 2686145Snate@binkert.org 2697054Snate@binkert.org // Artificially increase the size of broadcast messages 2707054Snate@binkert.org if (BROADCAST_SCALING > 1 && net_msg_ptr->getDestination().isBroadcast()) 2717054Snate@binkert.org size *= BROADCAST_SCALING; 2727054Snate@binkert.org 2737054Snate@binkert.org return size; 2746145Snate@binkert.org} 275