Throttle.cc revision 10370
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 318645Snilay@cs.wisc.edu#include "base/cast.hh" 327054Snate@binkert.org#include "base/cprintf.hh" 338232Snate@binkert.org#include "debug/RubyNetwork.hh" 348229Snate@binkert.org#include "mem/ruby/network/simple/Throttle.hh" 3510301Snilay@cs.wisc.edu#include "mem/ruby/network/MessageBuffer.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 MESSAGE_SIZE_MULTIPLIER = 1000; 436145Snate@binkert.org//const int BROADCAST_SCALING = 4; // Have a 16p system act like a 64p systems 446145Snate@binkert.orgconst int BROADCAST_SCALING = 1; 456145Snate@binkert.orgconst int PRIORITY_SWITCH_LIMIT = 128; 466145Snate@binkert.org 476145Snate@binkert.orgstatic int network_message_to_size(NetworkMessage* net_msg_ptr); 486145Snate@binkert.org 499499Snilay@cs.wisc.eduThrottle::Throttle(int sID, NodeID node, Cycles link_latency, 509230Snilay@cs.wisc.edu int link_bandwidth_multiplier, int endpoint_bandwidth, 519465Snilay@cs.wisc.edu ClockedObject *em) 529230Snilay@cs.wisc.edu : Consumer(em) 536145Snate@binkert.org{ 548259SBrad.Beckmann@amd.com init(node, link_latency, link_bandwidth_multiplier, endpoint_bandwidth); 557054Snate@binkert.org m_sID = sID; 566145Snate@binkert.org} 576145Snate@binkert.org 589499Snilay@cs.wisc.eduThrottle::Throttle(NodeID node, Cycles link_latency, 599230Snilay@cs.wisc.edu int link_bandwidth_multiplier, int endpoint_bandwidth, 609465Snilay@cs.wisc.edu ClockedObject *em) 619230Snilay@cs.wisc.edu : Consumer(em) 626145Snate@binkert.org{ 638259SBrad.Beckmann@amd.com init(node, link_latency, link_bandwidth_multiplier, endpoint_bandwidth); 647054Snate@binkert.org m_sID = 0; 656145Snate@binkert.org} 666145Snate@binkert.org 677054Snate@binkert.orgvoid 689499Snilay@cs.wisc.eduThrottle::init(NodeID node, Cycles link_latency, 699499Snilay@cs.wisc.edu int link_bandwidth_multiplier, int endpoint_bandwidth) 706145Snate@binkert.org{ 717054Snate@binkert.org m_node = node; 7210370Snilay@cs.wisc.edu m_vnets = 0; 7310370Snilay@cs.wisc.edu 747832Snate@binkert.org assert(link_bandwidth_multiplier > 0); 757054Snate@binkert.org m_link_bandwidth_multiplier = link_bandwidth_multiplier; 7610311Snilay@cs.wisc.edu 777054Snate@binkert.org m_link_latency = link_latency; 788259SBrad.Beckmann@amd.com m_endpoint_bandwidth = endpoint_bandwidth; 796145Snate@binkert.org 807054Snate@binkert.org m_wakeups_wo_switch = 0; 819863Snilay@cs.wisc.edu m_link_utilization_proxy = 0; 826145Snate@binkert.org} 836145Snate@binkert.org 847054Snate@binkert.orgvoid 8510370Snilay@cs.wisc.eduThrottle::addLinks(const vector<MessageBuffer*>& in_vec, 8610370Snilay@cs.wisc.edu const vector<MessageBuffer*>& out_vec) 876145Snate@binkert.org{ 887054Snate@binkert.org assert(in_vec.size() == out_vec.size()); 8910311Snilay@cs.wisc.edu 9010370Snilay@cs.wisc.edu for (int vnet = 0; vnet < in_vec.size(); ++vnet) { 9110370Snilay@cs.wisc.edu MessageBuffer *in_ptr = in_vec[vnet]; 9210370Snilay@cs.wisc.edu MessageBuffer *out_ptr = out_vec[vnet]; 9310311Snilay@cs.wisc.edu 9410370Snilay@cs.wisc.edu m_vnets++; 9510370Snilay@cs.wisc.edu m_units_remaining.push_back(0); 9610370Snilay@cs.wisc.edu m_in.push_back(in_ptr); 9710370Snilay@cs.wisc.edu m_out.push_back(out_ptr); 9810311Snilay@cs.wisc.edu 9910311Snilay@cs.wisc.edu // Set consumer and description 10010311Snilay@cs.wisc.edu in_ptr->setConsumer(this); 10110311Snilay@cs.wisc.edu string desc = "[Queue to Throttle " + to_string(m_sID) + " " + 10210311Snilay@cs.wisc.edu to_string(m_node) + "]"; 10310311Snilay@cs.wisc.edu in_ptr->setDescription(desc); 1047054Snate@binkert.org } 1056145Snate@binkert.org} 1066145Snate@binkert.org 1077054Snate@binkert.orgvoid 10810311Snilay@cs.wisc.eduThrottle::operateVnet(int vnet, int &bw_remaining, bool &schedule_wakeup, 10910311Snilay@cs.wisc.edu MessageBuffer *in, MessageBuffer *out) 1106145Snate@binkert.org{ 11110370Snilay@cs.wisc.edu if (out == nullptr || in == nullptr) { 11210370Snilay@cs.wisc.edu return; 11310370Snilay@cs.wisc.edu } 11410311Snilay@cs.wisc.edu assert(m_units_remaining[vnet] >= 0); 1156145Snate@binkert.org 11610311Snilay@cs.wisc.edu while (bw_remaining > 0 && (in->isReady() || m_units_remaining[vnet] > 0) && 11710311Snilay@cs.wisc.edu out->areNSlotsAvailable(1)) { 1189465Snilay@cs.wisc.edu 11910311Snilay@cs.wisc.edu // See if we are done transferring the previous message on 12010311Snilay@cs.wisc.edu // this virtual network 12110311Snilay@cs.wisc.edu if (m_units_remaining[vnet] == 0 && in->isReady()) { 12210311Snilay@cs.wisc.edu // Find the size of the message we are moving 12310311Snilay@cs.wisc.edu MsgPtr msg_ptr = in->peekMsgPtr(); 12410311Snilay@cs.wisc.edu NetworkMessage* net_msg_ptr = 12510311Snilay@cs.wisc.edu safe_cast<NetworkMessage*>(msg_ptr.get()); 12610311Snilay@cs.wisc.edu m_units_remaining[vnet] += 12710311Snilay@cs.wisc.edu network_message_to_size(net_msg_ptr); 12810311Snilay@cs.wisc.edu 12910311Snilay@cs.wisc.edu DPRINTF(RubyNetwork, "throttle: %d my bw %d bw spent " 13010311Snilay@cs.wisc.edu "enqueueing net msg %d time: %lld.\n", 13110311Snilay@cs.wisc.edu m_node, getLinkBandwidth(), m_units_remaining[vnet], 13210311Snilay@cs.wisc.edu g_system_ptr->curCycle()); 13310311Snilay@cs.wisc.edu 13410311Snilay@cs.wisc.edu // Move the message 13510311Snilay@cs.wisc.edu in->dequeue(); 13610311Snilay@cs.wisc.edu out->enqueue(msg_ptr, m_link_latency); 13710311Snilay@cs.wisc.edu 13810311Snilay@cs.wisc.edu // Count the message 13910311Snilay@cs.wisc.edu m_msg_counts[net_msg_ptr->getMessageSize()][vnet]++; 14010311Snilay@cs.wisc.edu DPRINTF(RubyNetwork, "%s\n", *out); 14110311Snilay@cs.wisc.edu } 14210311Snilay@cs.wisc.edu 14310311Snilay@cs.wisc.edu // Calculate the amount of bandwidth we spent on this message 14410311Snilay@cs.wisc.edu int diff = m_units_remaining[vnet] - bw_remaining; 14510311Snilay@cs.wisc.edu m_units_remaining[vnet] = max(0, diff); 14610311Snilay@cs.wisc.edu bw_remaining = max(0, -diff); 14710311Snilay@cs.wisc.edu } 14810311Snilay@cs.wisc.edu 14910311Snilay@cs.wisc.edu if (bw_remaining > 0 && (in->isReady() || m_units_remaining[vnet] > 0) && 15010311Snilay@cs.wisc.edu !out->areNSlotsAvailable(1)) { 15110311Snilay@cs.wisc.edu DPRINTF(RubyNetwork, "vnet: %d", vnet); 15210311Snilay@cs.wisc.edu 15310311Snilay@cs.wisc.edu // schedule me to wakeup again because I'm waiting for my 15410311Snilay@cs.wisc.edu // output queue to become available 15510311Snilay@cs.wisc.edu schedule_wakeup = true; 15610311Snilay@cs.wisc.edu } 1576145Snate@binkert.org} 1586145Snate@binkert.org 1597054Snate@binkert.orgvoid 1607054Snate@binkert.orgThrottle::wakeup() 1616145Snate@binkert.org{ 1627054Snate@binkert.org // Limits the number of message sent to a limited number of bytes/cycle. 1637054Snate@binkert.org assert(getLinkBandwidth() > 0); 1647054Snate@binkert.org int bw_remaining = getLinkBandwidth(); 1656145Snate@binkert.org 1667054Snate@binkert.org m_wakeups_wo_switch++; 1677054Snate@binkert.org bool schedule_wakeup = false; 1686145Snate@binkert.org 16910311Snilay@cs.wisc.edu // variable for deciding the direction in which to iterate 17010311Snilay@cs.wisc.edu bool iteration_direction = false; 17110311Snilay@cs.wisc.edu 17210311Snilay@cs.wisc.edu 1737054Snate@binkert.org // invert priorities to avoid starvation seen in the component network 1747054Snate@binkert.org if (m_wakeups_wo_switch > PRIORITY_SWITCH_LIMIT) { 1757054Snate@binkert.org m_wakeups_wo_switch = 0; 17610311Snilay@cs.wisc.edu iteration_direction = true; 1776145Snate@binkert.org } 1786145Snate@binkert.org 17910311Snilay@cs.wisc.edu if (iteration_direction) { 18010370Snilay@cs.wisc.edu for (int vnet = 0; vnet < m_vnets; ++vnet) { 18110311Snilay@cs.wisc.edu operateVnet(vnet, bw_remaining, schedule_wakeup, 18210370Snilay@cs.wisc.edu m_in[vnet], m_out[vnet]); 1837054Snate@binkert.org } 18410311Snilay@cs.wisc.edu } else { 18510370Snilay@cs.wisc.edu for (int vnet = m_vnets-1; vnet >= 0; --vnet) { 18610311Snilay@cs.wisc.edu operateVnet(vnet, bw_remaining, schedule_wakeup, 18710370Snilay@cs.wisc.edu m_in[vnet], m_out[vnet]); 1887054Snate@binkert.org } 1896145Snate@binkert.org } 1906145Snate@binkert.org 1917054Snate@binkert.org // We should only wake up when we use the bandwidth 1927054Snate@binkert.org // This is only mostly true 1937054Snate@binkert.org // assert(bw_remaining != getLinkBandwidth()); 1946145Snate@binkert.org 1957054Snate@binkert.org // Record that we used some or all of the link bandwidth this cycle 1967054Snate@binkert.org double ratio = 1.0 - (double(bw_remaining) / double(getLinkBandwidth())); 1976145Snate@binkert.org 1987054Snate@binkert.org // If ratio = 0, we used no bandwidth, if ratio = 1, we used all 1999863Snilay@cs.wisc.edu m_link_utilization_proxy += ratio; 2007054Snate@binkert.org 2017054Snate@binkert.org if (bw_remaining > 0 && !schedule_wakeup) { 2027054Snate@binkert.org // We have extra bandwidth and our output buffer was 2037054Snate@binkert.org // available, so we must not have anything else to do until 2047054Snate@binkert.org // another message arrives. 2057780Snilay@cs.wisc.edu DPRINTF(RubyNetwork, "%s not scheduled again\n", *this); 2067054Snate@binkert.org } else { 2077780Snilay@cs.wisc.edu DPRINTF(RubyNetwork, "%s scheduled again\n", *this); 2087054Snate@binkert.org 2097054Snate@binkert.org // We are out of bandwidth for this cycle, so wakeup next 2107054Snate@binkert.org // cycle and continue 2119499Snilay@cs.wisc.edu scheduleEvent(Cycles(1)); 2127054Snate@binkert.org } 2136145Snate@binkert.org} 2146145Snate@binkert.org 2157054Snate@binkert.orgvoid 2169863Snilay@cs.wisc.eduThrottle::regStats(string parent) 2176145Snate@binkert.org{ 2189863Snilay@cs.wisc.edu m_link_utilization 2199863Snilay@cs.wisc.edu .name(parent + csprintf(".throttle%i", m_node) + ".link_utilization"); 2209863Snilay@cs.wisc.edu 2219863Snilay@cs.wisc.edu for (MessageSizeType type = MessageSizeType_FIRST; 2229863Snilay@cs.wisc.edu type < MessageSizeType_NUM; ++type) { 2239863Snilay@cs.wisc.edu m_msg_counts[(unsigned int)type] 22410311Snilay@cs.wisc.edu .init(Network::getNumberOfVirtualNetworks()) 2259863Snilay@cs.wisc.edu .name(parent + csprintf(".throttle%i", m_node) + ".msg_count." + 2269863Snilay@cs.wisc.edu MessageSizeType_to_string(type)) 2279863Snilay@cs.wisc.edu .flags(Stats::nozero) 2289863Snilay@cs.wisc.edu ; 2299863Snilay@cs.wisc.edu m_msg_bytes[(unsigned int) type] 2309863Snilay@cs.wisc.edu .name(parent + csprintf(".throttle%i", m_node) + ".msg_bytes." + 2319863Snilay@cs.wisc.edu MessageSizeType_to_string(type)) 2329863Snilay@cs.wisc.edu .flags(Stats::nozero) 2339863Snilay@cs.wisc.edu ; 2349863Snilay@cs.wisc.edu 2359863Snilay@cs.wisc.edu m_msg_bytes[(unsigned int) type] = m_msg_counts[type] * Stats::constant( 2369863Snilay@cs.wisc.edu Network::MessageSizeType_to_int(type)); 2379863Snilay@cs.wisc.edu } 2386145Snate@binkert.org} 2396145Snate@binkert.org 2407054Snate@binkert.orgvoid 2417054Snate@binkert.orgThrottle::clearStats() 2426145Snate@binkert.org{ 2439863Snilay@cs.wisc.edu m_link_utilization_proxy = 0; 2446145Snate@binkert.org} 2456145Snate@binkert.org 2469863Snilay@cs.wisc.eduvoid 2479863Snilay@cs.wisc.eduThrottle::collateStats() 2486145Snate@binkert.org{ 2499863Snilay@cs.wisc.edu m_link_utilization = 100.0 * m_link_utilization_proxy 2509863Snilay@cs.wisc.edu / (double(g_system_ptr->curCycle() - g_ruby_start)); 2516145Snate@binkert.org} 2526145Snate@binkert.org 2537054Snate@binkert.orgvoid 2547054Snate@binkert.orgThrottle::print(ostream& out) const 2556145Snate@binkert.org{ 2568054Sksewell@umich.edu ccprintf(out, "[%i bw: %i]", m_node, getLinkBandwidth()); 2576145Snate@binkert.org} 2586145Snate@binkert.org 2597054Snate@binkert.orgint 2607054Snate@binkert.orgnetwork_message_to_size(NetworkMessage* net_msg_ptr) 2617054Snate@binkert.org{ 2627054Snate@binkert.org assert(net_msg_ptr != NULL); 2636145Snate@binkert.org 2649275Snilay@cs.wisc.edu int size = Network::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