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;
9 * redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution;
12 * neither the name of the copyright holders nor the names of its
13 * contributors may be used to endorse or promote products derived from
14 * this software without specific prior written permission.
15 *
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 */
28
29#include "mem/protocol/MessageSizeType.hh"
30#include "mem/protocol/Protocol.hh"
31#include "mem/ruby/buffers/MessageBuffer.hh"
32#include "mem/ruby/network/Network.hh"
33#include "mem/ruby/network/simple/PerfectSwitch.hh"
34#include "mem/ruby/network/simple/Switch.hh"
35#include "mem/ruby/network/simple/Throttle.hh"
36
| 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;
9 * redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution;
12 * neither the name of the copyright holders nor the names of its
13 * contributors may be used to endorse or promote products derived from
14 * this software without specific prior written permission.
15 *
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 */
28
29#include "mem/protocol/MessageSizeType.hh"
30#include "mem/protocol/Protocol.hh"
31#include "mem/ruby/buffers/MessageBuffer.hh"
32#include "mem/ruby/network/Network.hh"
33#include "mem/ruby/network/simple/PerfectSwitch.hh"
34#include "mem/ruby/network/simple/Switch.hh"
35#include "mem/ruby/network/simple/Throttle.hh"
36
|
| 37using namespace std;
38
|
37Switch::Switch(SwitchID sid, SimpleNetwork* network_ptr)
38{
39 m_perfect_switch_ptr = new PerfectSwitch(sid, network_ptr);
40 m_switch_id = sid;
41 m_throttles.setSize(0);
42}
43
44Switch::~Switch()
45{
46 delete m_perfect_switch_ptr;
47
48 // Delete throttles (one per output port)
49 m_throttles.deletePointers();
50
51 // Delete MessageBuffers
52 m_buffers_to_free.deletePointers();
53}
54
55void
56Switch::addInPort(const Vector<MessageBuffer*>& in)
57{
58 m_perfect_switch_ptr->addInPort(in);
59}
60
61void
62Switch::addOutPort(const Vector<MessageBuffer*>& out,
63 const NetDest& routing_table_entry, int link_latency, int bw_multiplier)
64{
65 Throttle* throttle_ptr = NULL;
66
67 // Create a throttle
68 throttle_ptr = new Throttle(m_switch_id, m_throttles.size(), link_latency,
69 bw_multiplier);
70 m_throttles.insertAtBottom(throttle_ptr);
71
72 // Create one buffer per vnet (these are intermediaryQueues)
73 Vector<MessageBuffer*> intermediateBuffers;
74 for (int i = 0; i < out.size(); i++) {
75 MessageBuffer* buffer_ptr = new MessageBuffer;
76 // Make these queues ordered
77 buffer_ptr->setOrdering(true);
78 Network* net_ptr = RubySystem::getNetwork();
79 if (net_ptr->getBufferSize() > 0) {
80 buffer_ptr->setSize(net_ptr->getBufferSize());
81 }
82 intermediateBuffers.insertAtBottom(buffer_ptr);
83 m_buffers_to_free.insertAtBottom(buffer_ptr);
84 }
85
86 // Hook the queues to the PerfectSwitch
87 m_perfect_switch_ptr->addOutPort(intermediateBuffers, routing_table_entry);
88
89 // Hook the queues to the Throttle
90 throttle_ptr->addLinks(intermediateBuffers, out);
91}
92
93void
94Switch::clearRoutingTables()
95{
96 m_perfect_switch_ptr->clearRoutingTables();
97}
98
99void
100Switch::clearBuffers()
101{
102 m_perfect_switch_ptr->clearBuffers();
103 for (int i = 0; i < m_throttles.size(); i++) {
104 if (m_throttles[i] != NULL) {
105 m_throttles[i]->clear();
106 }
107 }
108}
109
110void
111Switch::reconfigureOutPort(const NetDest& routing_table_entry)
112{
113 m_perfect_switch_ptr->reconfigureOutPort(routing_table_entry);
114}
115
116const Throttle*
117Switch::getThrottle(LinkID link_number) const
118{
119 assert(m_throttles[link_number] != NULL);
120 return m_throttles[link_number];
121}
122
123const Vector<Throttle*>*
124Switch::getThrottles() const
125{
126 return &m_throttles;
127}
128
129void
130Switch::printStats(std::ostream& out) const
131{
| 39Switch::Switch(SwitchID sid, SimpleNetwork* network_ptr)
40{
41 m_perfect_switch_ptr = new PerfectSwitch(sid, network_ptr);
42 m_switch_id = sid;
43 m_throttles.setSize(0);
44}
45
46Switch::~Switch()
47{
48 delete m_perfect_switch_ptr;
49
50 // Delete throttles (one per output port)
51 m_throttles.deletePointers();
52
53 // Delete MessageBuffers
54 m_buffers_to_free.deletePointers();
55}
56
57void
58Switch::addInPort(const Vector<MessageBuffer*>& in)
59{
60 m_perfect_switch_ptr->addInPort(in);
61}
62
63void
64Switch::addOutPort(const Vector<MessageBuffer*>& out,
65 const NetDest& routing_table_entry, int link_latency, int bw_multiplier)
66{
67 Throttle* throttle_ptr = NULL;
68
69 // Create a throttle
70 throttle_ptr = new Throttle(m_switch_id, m_throttles.size(), link_latency,
71 bw_multiplier);
72 m_throttles.insertAtBottom(throttle_ptr);
73
74 // Create one buffer per vnet (these are intermediaryQueues)
75 Vector<MessageBuffer*> intermediateBuffers;
76 for (int i = 0; i < out.size(); i++) {
77 MessageBuffer* buffer_ptr = new MessageBuffer;
78 // Make these queues ordered
79 buffer_ptr->setOrdering(true);
80 Network* net_ptr = RubySystem::getNetwork();
81 if (net_ptr->getBufferSize() > 0) {
82 buffer_ptr->setSize(net_ptr->getBufferSize());
83 }
84 intermediateBuffers.insertAtBottom(buffer_ptr);
85 m_buffers_to_free.insertAtBottom(buffer_ptr);
86 }
87
88 // Hook the queues to the PerfectSwitch
89 m_perfect_switch_ptr->addOutPort(intermediateBuffers, routing_table_entry);
90
91 // Hook the queues to the Throttle
92 throttle_ptr->addLinks(intermediateBuffers, out);
93}
94
95void
96Switch::clearRoutingTables()
97{
98 m_perfect_switch_ptr->clearRoutingTables();
99}
100
101void
102Switch::clearBuffers()
103{
104 m_perfect_switch_ptr->clearBuffers();
105 for (int i = 0; i < m_throttles.size(); i++) {
106 if (m_throttles[i] != NULL) {
107 m_throttles[i]->clear();
108 }
109 }
110}
111
112void
113Switch::reconfigureOutPort(const NetDest& routing_table_entry)
114{
115 m_perfect_switch_ptr->reconfigureOutPort(routing_table_entry);
116}
117
118const Throttle*
119Switch::getThrottle(LinkID link_number) const
120{
121 assert(m_throttles[link_number] != NULL);
122 return m_throttles[link_number];
123}
124
125const Vector<Throttle*>*
126Switch::getThrottles() const
127{
128 return &m_throttles;
129}
130
131void
132Switch::printStats(std::ostream& out) const
133{
|
132 using namespace std;
133
| |
134 ccprintf(out, "switch_%d_inlinks: %d\n", m_switch_id,
135 m_perfect_switch_ptr->getInLinks());
136 ccprintf(out, "switch_%d_outlinks: %d\n", m_switch_id,
137 m_perfect_switch_ptr->getOutLinks());
138
139 // Average link utilizations
140 double average_utilization = 0.0;
141 int throttle_count = 0;
142
143 for (int i = 0; i < m_throttles.size(); i++) {
144 Throttle* throttle_ptr = m_throttles[i];
145 if (throttle_ptr) {
146 average_utilization += throttle_ptr->getUtilization();
147 throttle_count++;
148 }
149 }
150 average_utilization =
151 throttle_count == 0 ? 0 : average_utilization / throttle_count;
152
153 // Individual link utilizations
154 out << "links_utilized_percent_switch_" << m_switch_id << ": "
155 << average_utilization << endl;
156
157 for (int link = 0; link < m_throttles.size(); link++) {
158 Throttle* throttle_ptr = m_throttles[link];
159 if (throttle_ptr != NULL) {
160 out << " links_utilized_percent_switch_" << m_switch_id
161 << "_link_" << link << ": "
162 << throttle_ptr->getUtilization() << " bw: "
163 << throttle_ptr->getLinkBandwidth()
164 << " base_latency: " << throttle_ptr->getLatency() << endl;
165 }
166 }
167 out << endl;
168
169 // Traffic breakdown
170 for (int link = 0; link < m_throttles.size(); link++) {
171 Throttle* throttle_ptr = m_throttles[link];
172 if (!throttle_ptr)
173 continue;
174
175 const Vector<Vector<int> >& message_counts =
176 throttle_ptr->getCounters();
177 for (int int_type = 0; int_type < MessageSizeType_NUM; int_type++) {
178 MessageSizeType type = MessageSizeType(int_type);
179 int sum = message_counts[type].sum();
180 if (sum == 0)
181 continue;
182
183 out << " outgoing_messages_switch_" << m_switch_id
184 << "_link_" << link << "_" << type << ": " << sum << " "
185 << sum * RubySystem::getNetwork()->MessageSizeType_to_int(type)
186 << " " << message_counts[type] << " base_latency: "
187 << throttle_ptr->getLatency() << endl;
188 }
189 }
190 out << endl;
191}
192
193void
194Switch::clearStats()
195{
196 m_perfect_switch_ptr->clearStats();
197 for (int i = 0; i < m_throttles.size(); i++) {
198 if (m_throttles[i] != NULL)
199 m_throttles[i]->clearStats();
200 }
201}
202
203void
204Switch::printConfig(std::ostream& out) const
205{
206 m_perfect_switch_ptr->printConfig(out);
207 for (int i = 0; i < m_throttles.size(); i++) {
208 if (m_throttles[i] != NULL)
209 m_throttles[i]->printConfig(out);
210 }
211}
212
213void
214Switch::print(std::ostream& out) const
215{
216 // FIXME printing
217 out << "[Switch]";
218}
219
| 134 ccprintf(out, "switch_%d_inlinks: %d\n", m_switch_id,
135 m_perfect_switch_ptr->getInLinks());
136 ccprintf(out, "switch_%d_outlinks: %d\n", m_switch_id,
137 m_perfect_switch_ptr->getOutLinks());
138
139 // Average link utilizations
140 double average_utilization = 0.0;
141 int throttle_count = 0;
142
143 for (int i = 0; i < m_throttles.size(); i++) {
144 Throttle* throttle_ptr = m_throttles[i];
145 if (throttle_ptr) {
146 average_utilization += throttle_ptr->getUtilization();
147 throttle_count++;
148 }
149 }
150 average_utilization =
151 throttle_count == 0 ? 0 : average_utilization / throttle_count;
152
153 // Individual link utilizations
154 out << "links_utilized_percent_switch_" << m_switch_id << ": "
155 << average_utilization << endl;
156
157 for (int link = 0; link < m_throttles.size(); link++) {
158 Throttle* throttle_ptr = m_throttles[link];
159 if (throttle_ptr != NULL) {
160 out << " links_utilized_percent_switch_" << m_switch_id
161 << "_link_" << link << ": "
162 << throttle_ptr->getUtilization() << " bw: "
163 << throttle_ptr->getLinkBandwidth()
164 << " base_latency: " << throttle_ptr->getLatency() << endl;
165 }
166 }
167 out << endl;
168
169 // Traffic breakdown
170 for (int link = 0; link < m_throttles.size(); link++) {
171 Throttle* throttle_ptr = m_throttles[link];
172 if (!throttle_ptr)
173 continue;
174
175 const Vector<Vector<int> >& message_counts =
176 throttle_ptr->getCounters();
177 for (int int_type = 0; int_type < MessageSizeType_NUM; int_type++) {
178 MessageSizeType type = MessageSizeType(int_type);
179 int sum = message_counts[type].sum();
180 if (sum == 0)
181 continue;
182
183 out << " outgoing_messages_switch_" << m_switch_id
184 << "_link_" << link << "_" << type << ": " << sum << " "
185 << sum * RubySystem::getNetwork()->MessageSizeType_to_int(type)
186 << " " << message_counts[type] << " base_latency: "
187 << throttle_ptr->getLatency() << endl;
188 }
189 }
190 out << endl;
191}
192
193void
194Switch::clearStats()
195{
196 m_perfect_switch_ptr->clearStats();
197 for (int i = 0; i < m_throttles.size(); i++) {
198 if (m_throttles[i] != NULL)
199 m_throttles[i]->clearStats();
200 }
201}
202
203void
204Switch::printConfig(std::ostream& out) const
205{
206 m_perfect_switch_ptr->printConfig(out);
207 for (int i = 0; i < m_throttles.size(); i++) {
208 if (m_throttles[i] != NULL)
209 m_throttles[i]->printConfig(out);
210 }
211}
212
213void
214Switch::print(std::ostream& out) const
215{
216 // FIXME printing
217 out << "[Switch]";
218}
219
|