1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
|
// $Id: trafficmanager.hpp 5365 2012-11-25 02:09:59Z qtedq $
/*
Copyright (c) 2007-2012, Trustees of The Leland Stanford Junior University
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
Redistributions in binary form must reproduce the above copyright notice, this
list of conditions and the following disclaimer in the documentation and/or
other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef _TRAFFICMANAGER_HPP_
#define _TRAFFICMANAGER_HPP_
#include <list>
#include <map>
#include <set>
#include <cassert>
#include "module.hpp"
#include "config_utils.hpp"
#include "network.hpp"
#include "flit.hpp"
#include "buffer_state.hpp"
#include "stats.hpp"
#include "traffic.hpp"
#include "routefunc.hpp"
#include "outputset.hpp"
#include "injection.hpp"
//register the requests to a node
class PacketReplyInfo;
class TrafficManager : public Module {
private:
vector<vector<int> > _packet_size;
vector<vector<int> > _packet_size_rate;
vector<int> _packet_size_max_val;
protected:
int _nodes;
int _routers;
int _vcs;
vector<Network *> _net;
vector<vector<Router *> > _router;
// ============ Traffic ============
int _classes;
vector<double> _load;
vector<int> _use_read_write;
vector<double> _write_fraction;
vector<int> _read_request_size;
vector<int> _read_reply_size;
vector<int> _write_request_size;
vector<int> _write_reply_size;
vector<string> _traffic;
vector<int> _class_priority;
vector<vector<int> > _last_class;
vector<TrafficPattern *> _traffic_pattern;
vector<InjectionProcess *> _injection_process;
// ============ Message priorities ============
enum ePriority { class_based, age_based, network_age_based, local_age_based, queue_length_based, hop_count_based, sequence_based, none };
ePriority _pri_type;
// ============ Injection VC states ============
vector<vector<BufferState *> > _buf_states;
#ifdef TRACK_FLOWS
vector<vector<vector<int> > > _outstanding_credits;
vector<vector<vector<queue<int> > > > _outstanding_classes;
#endif
vector<vector<vector<int> > > _last_vc;
// ============ Routing ============
tRoutingFunction _rf;
bool _lookahead_routing;
bool _noq;
// ============ Injection queues ============
vector<vector<int> > _qtime;
vector<vector<bool> > _qdrained;
vector<vector<list<Flit *> > > _partial_packets;
vector<map<unsigned long long, Flit *> > _total_in_flight_flits;
vector<map<unsigned long long, Flit *> > _measured_in_flight_flits;
vector<map<unsigned long long, Flit *> > _retired_packets;
bool _empty_network;
bool _hold_switch_for_packet;
// ============ physical sub-networks ==========
int _subnets;
vector<int> _subnet;
// ============ deadlock ==========
int _deadlock_timer;
int _deadlock_warn_timeout;
// ============ request & replies ==========================
vector<int> _packet_seq_no;
vector<list<PacketReplyInfo*> > _repliesPending;
vector<int> _requestsOutstanding;
// ============ Statistics ============
vector<Stats *> _plat_stats;
vector<double> _overall_min_plat;
vector<double> _overall_avg_plat;
vector<double> _overall_max_plat;
vector<Stats *> _nlat_stats;
vector<double> _overall_min_nlat;
vector<double> _overall_avg_nlat;
vector<double> _overall_max_nlat;
vector<Stats *> _flat_stats;
vector<double> _overall_min_flat;
vector<double> _overall_avg_flat;
vector<double> _overall_max_flat;
vector<Stats *> _frag_stats;
vector<double> _overall_min_frag;
vector<double> _overall_avg_frag;
vector<double> _overall_max_frag;
vector<vector<Stats *> > _pair_plat;
vector<vector<Stats *> > _pair_nlat;
vector<vector<Stats *> > _pair_flat;
vector<Stats *> _hop_stats;
vector<double> _overall_hop_stats;
vector<vector<int> > _sent_packets;
vector<double> _overall_min_sent_packets;
vector<double> _overall_avg_sent_packets;
vector<double> _overall_max_sent_packets;
vector<vector<int> > _accepted_packets;
vector<double> _overall_min_accepted_packets;
vector<double> _overall_avg_accepted_packets;
vector<double> _overall_max_accepted_packets;
vector<vector<int> > _sent_flits;
vector<double> _overall_min_sent;
vector<double> _overall_avg_sent;
vector<double> _overall_max_sent;
vector<vector<int> > _accepted_flits;
vector<double> _overall_min_accepted;
vector<double> _overall_avg_accepted;
vector<double> _overall_max_accepted;
#ifdef TRACK_STALLS
vector<vector<int> > _buffer_busy_stalls;
vector<vector<int> > _buffer_conflict_stalls;
vector<vector<int> > _buffer_full_stalls;
vector<vector<int> > _buffer_reserved_stalls;
vector<vector<int> > _crossbar_conflict_stalls;
vector<double> _overall_buffer_busy_stalls;
vector<double> _overall_buffer_conflict_stalls;
vector<double> _overall_buffer_full_stalls;
vector<double> _overall_buffer_reserved_stalls;
vector<double> _overall_crossbar_conflict_stalls;
#endif
vector<int> _slowest_packet;
vector<int> _slowest_flit;
map<string, Stats *> _stats;
// ============ Simulation parameters ============
enum eSimState { warming_up, running, draining, done };
eSimState _sim_state;
bool _measure_latency;
int _reset_time;
int _drain_time;
int _total_sims;
int _sample_period;
int _max_samples;
int _warmup_periods;
int _include_queuing;
vector<int> _measure_stats;
bool _pair_stats;
vector<double> _latency_thres;
vector<double> _stopping_threshold;
vector<double> _acc_stopping_threshold;
vector<double> _warmup_threshold;
vector<double> _acc_warmup_threshold;
unsigned long long _cur_id;
unsigned long long _cur_pid;
int _time;
set<unsigned long long> _flits_to_watch;
set<unsigned long long> _packets_to_watch;
bool _print_csv_results;
//flits to watch
ostream * _stats_out;
#ifdef TRACK_FLOWS
vector<vector<int> > _injected_flits;
vector<vector<int> > _ejected_flits;
ostream * _injected_flits_out;
ostream * _received_flits_out;
ostream * _stored_flits_out;
ostream * _sent_flits_out;
ostream * _outstanding_credits_out;
ostream * _ejected_flits_out;
ostream * _active_packets_out;
#endif
#ifdef TRACK_CREDITS
ostream * _used_credits_out;
ostream * _free_credits_out;
ostream * _max_credits_out;
#endif
// ============ Internal methods ============
protected:
virtual void _RetireFlit( Flit *f, int dest );
void _Inject();
virtual void _Step( );
bool _PacketsOutstanding( ) const;
virtual int _IssuePacket( int source, int cl );
virtual void _GeneratePacket( int source, int size, int cl, int time );
virtual void _ClearStats( );
void _ComputeStats( const vector<int> & stats, int *sum, int *min = NULL, int *max = NULL, int *min_pos = NULL, int *max_pos = NULL ) const;
virtual bool _SingleSim( );
void _DisplayRemaining( ostream & os = cout ) const;
void _LoadWatchList(const string & filename);
virtual void _UpdateOverallStats();
virtual string _OverallStatsCSV(int c = 0) const;
int _GetNextPacketSize(int cl) const;
double _GetAveragePacketSize(int cl) const;
public:
static TrafficManager * New(Configuration const & config,
vector<Network *> const & net);
TrafficManager( const Configuration &config, const vector<Network *> & net );
virtual ~TrafficManager( );
bool Run( );
virtual void WriteStats( ostream & os = cout ) const ;
virtual void UpdateStats( ) ;
virtual void DisplayStats( ostream & os = cout ) const ;
virtual void DisplayOverallStats( ostream & os = cout ) const ;
virtual void DisplayOverallStatsCSV( ostream & os = cout ) const ;
inline int getTime() { return _time;}
Stats * getStats(const string & name) { return _stats[name]; }
};
template<class T>
ostream & operator<<(ostream & os, const vector<T> & v) {
for(size_t i = 0; i < v.size() - 1; ++i) {
os << v[i] << ",";
}
os << v[v.size()-1];
return os;
}
#endif
|