1/* 2 * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions are 7 * met: redistributions of source code must retain the above copyright 8 * notice, this list of conditions and the following disclaimer; --- 90 unchanged lines hidden (view full) --- 99 m_routing_table.push_back(routing_table_entry); 100} 101 102PerfectSwitch::~PerfectSwitch() 103{ 104} 105 106void |
107PerfectSwitch::operateVnet(int vnet) |
108{ 109 MsgPtr msg_ptr; |
110 NetworkMessage* net_msg_ptr = NULL; 111 |
112 // This is for round-robin scheduling 113 int incoming = m_round_robin_start; 114 m_round_robin_start++; 115 if (m_round_robin_start >= m_in.size()) { 116 m_round_robin_start = 0; |
117 } 118 |
119 if(m_pending_message_count[vnet] > 0) { 120 // for all input ports, use round robin scheduling 121 for (int counter = 0; counter < m_in.size(); counter++) { 122 // Round robin scheduling 123 incoming++; 124 if (incoming >= m_in.size()) { 125 incoming = 0; 126 } |
127 |
128 // temporary vectors to store the routing results 129 vector<LinkID> output_links; 130 vector<NetDest> output_link_destinations; |
131 |
132 // Is there a message waiting? 133 auto it = m_in[incoming].find(vnet); 134 if (it == m_in[incoming].end()) 135 continue; 136 MessageBuffer *buffer = (*it).second; |
137 |
138 while (buffer->isReady()) { 139 DPRINTF(RubyNetwork, "incoming: %d\n", incoming); |
140 |
141 // Peek at message 142 msg_ptr = buffer->peekMsgPtr(); 143 net_msg_ptr = safe_cast<NetworkMessage*>(msg_ptr.get()); 144 DPRINTF(RubyNetwork, "Message: %s\n", (*net_msg_ptr)); |
145 |
146 output_links.clear(); 147 output_link_destinations.clear(); 148 NetDest msg_dsts = net_msg_ptr->getInternalDestination(); |
149 |
150 // Unfortunately, the token-protocol sends some 151 // zero-destination messages, so this assert isn't valid 152 // assert(msg_dsts.count() > 0); |
153 |
154 assert(m_link_order.size() == m_routing_table.size()); 155 assert(m_link_order.size() == m_out.size()); |
156 |
157 if (m_network_ptr->getAdaptiveRouting()) { 158 if (m_network_ptr->isVNetOrdered(vnet)) { 159 // Don't adaptively route 160 for (int out = 0; out < m_out.size(); out++) { 161 m_link_order[out].m_link = out; 162 m_link_order[out].m_value = 0; 163 } 164 } else { 165 // Find how clogged each link is 166 for (int out = 0; out < m_out.size(); out++) { 167 int out_queue_length = 0; 168 for (int v = 0; v < m_virtual_networks; v++) { 169 out_queue_length += m_out[out][v]->getSize(); |
170 } |
171 int value = 172 (out_queue_length << 8) | (random() & 0xff); 173 m_link_order[out].m_link = out; 174 m_link_order[out].m_value = value; |
175 } |
176 177 // Look at the most empty link first 178 sort(m_link_order.begin(), m_link_order.end()); |
179 } |
180 } |
181 |
182 for (int i = 0; i < m_routing_table.size(); i++) { 183 // pick the next link to look at 184 int link = m_link_order[i].m_link; 185 NetDest dst = m_routing_table[link]; 186 DPRINTF(RubyNetwork, "dst: %s\n", dst); |
187 |
188 if (!msg_dsts.intersectionIsNotEmpty(dst)) 189 continue; |
190 |
191 // Remember what link we're using 192 output_links.push_back(link); |
193 |
194 // Need to remember which destinations need this message in 195 // another vector. This Set is the intersection of the 196 // routing_table entry and the current destination set. The 197 // intersection must not be empty, since we are inside "if" 198 output_link_destinations.push_back(msg_dsts.AND(dst)); |
199 |
200 // Next, we update the msg_destination not to include 201 // those nodes that were already handled by this link 202 msg_dsts.removeNetDest(dst); 203 } |
204 |
205 assert(msg_dsts.count() == 0); |
206 |
207 // Check for resources - for all outgoing queues 208 bool enough = true; 209 for (int i = 0; i < output_links.size(); i++) { 210 int outgoing = output_links[i]; |
211 |
212 if (!m_out[outgoing][vnet]->areNSlotsAvailable(1)) 213 enough = false; |
214 |
215 DPRINTF(RubyNetwork, "Checking if node is blocked ..." 216 "outgoing: %d, vnet: %d, enough: %d\n", 217 outgoing, vnet, enough); 218 } |
219 |
220 // There were not enough resources 221 if (!enough) { 222 scheduleEvent(Cycles(1)); 223 DPRINTF(RubyNetwork, "Can't deliver message since a node " 224 "is blocked\n"); 225 DPRINTF(RubyNetwork, "Message: %s\n", (*net_msg_ptr)); 226 break; // go to next incoming port 227 } |
228 |
229 MsgPtr unmodified_msg_ptr; |
230 |
231 if (output_links.size() > 1) { 232 // If we are sending this message down more than one link 233 // (size>1), we need to make a copy of the message so each 234 // branch can have a different internal destination we need 235 // to create an unmodified MsgPtr because the MessageBuffer 236 // enqueue func will modify the message |
237 |
238 // This magic line creates a private copy of the message 239 unmodified_msg_ptr = msg_ptr->clone(); 240 } |
241 |
242 // Dequeue msg 243 buffer->dequeue(); 244 m_pending_message_count[vnet]--; |
245 |
246 // Enqueue it - for all outgoing queues 247 for (int i=0; i<output_links.size(); i++) { 248 int outgoing = output_links[i]; |
249 |
250 if (i > 0) { 251 // create a private copy of the unmodified message 252 msg_ptr = unmodified_msg_ptr->clone(); |
253 } |
254 255 // Change the internal destination set of the message so it 256 // knows which destinations this link is responsible for. 257 net_msg_ptr = safe_cast<NetworkMessage*>(msg_ptr.get()); 258 net_msg_ptr->getInternalDestination() = 259 output_link_destinations[i]; 260 261 // Enqeue msg 262 DPRINTF(RubyNetwork, "Enqueuing net msg from " 263 "inport[%d][%d] to outport [%d][%d].\n", 264 incoming, vnet, outgoing, vnet); 265 266 m_out[outgoing][vnet]->enqueue(msg_ptr); |
267 } 268 } 269 } 270 } 271} 272 273void |
274PerfectSwitch::wakeup() 275{ 276 // Give the highest numbered link priority most of the time 277 m_wakeups_wo_switch++; 278 int highest_prio_vnet = m_virtual_networks-1; 279 int lowest_prio_vnet = 0; 280 int decrementer = 1; 281 282 // invert priorities to avoid starvation seen in the component network 283 if (m_wakeups_wo_switch > PRIORITY_SWITCH_LIMIT) { 284 m_wakeups_wo_switch = 0; 285 highest_prio_vnet = 0; 286 lowest_prio_vnet = m_virtual_networks-1; 287 decrementer = -1; 288 } 289 290 // For all components incoming queues 291 for (int vnet = highest_prio_vnet; 292 (vnet * decrementer) >= (decrementer * lowest_prio_vnet); 293 vnet -= decrementer) { 294 operateVnet(vnet); 295 } 296} 297 298void |
299PerfectSwitch::storeEventInfo(int info) 300{ 301 m_pending_message_count[info]++; 302} 303 304void 305PerfectSwitch::clearStats() 306{ --- 12 unchanged lines hidden --- |