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
|
// $Id: batchtrafficmanager.cpp 5188 2012-08-30 00:31:31Z dub $
/*
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.
*/
#include <limits>
#include <sstream>
#include <fstream>
#include "packet_reply_info.hpp"
#include "random_utils.hpp"
#include "batchtrafficmanager.hpp"
BatchTrafficManager::BatchTrafficManager( const Configuration &config,
const vector<Network *> & net )
: TrafficManager(config, net), _last_id(-1), _last_pid(-1),
_overall_min_batch_time(0), _overall_avg_batch_time(0),
_overall_max_batch_time(0)
{
_max_outstanding = config.GetInt ("max_outstanding_requests");
_batch_size = config.GetInt( "batch_size" );
_batch_count = config.GetInt( "batch_count" );
_batch_time = new Stats( this, "batch_time", 1.0, 1000 );
_stats["batch_time"] = _batch_time;
string sent_packets_out_file = config.GetStr( "sent_packets_out" );
if(sent_packets_out_file == "") {
_sent_packets_out = NULL;
} else {
_sent_packets_out = new ofstream(sent_packets_out_file.c_str());
}
}
BatchTrafficManager::~BatchTrafficManager( )
{
delete _batch_time;
if(_sent_packets_out) delete _sent_packets_out;
}
void BatchTrafficManager::_RetireFlit( Flit *f, int dest )
{
_last_id = f->id;
_last_pid = f->pid;
TrafficManager::_RetireFlit(f, dest);
}
int BatchTrafficManager::_IssuePacket( int source, int cl )
{
int result = 0;
if(_use_read_write[cl]) { //read write packets
//check queue for waiting replies.
//check to make sure it is on time yet
if(!_repliesPending[source].empty()) {
if(_repliesPending[source].front()->time <= _time) {
result = -1;
}
} else {
if((_packet_seq_no[source] < _batch_size) &&
((_max_outstanding <= 0) ||
(_requestsOutstanding[source] < _max_outstanding))) {
//coin toss to determine request type.
result = (RandomFloat() < 0.5) ? 2 : 1;
_requestsOutstanding[source]++;
}
}
} else { //normal
if((_packet_seq_no[source] < _batch_size) &&
((_max_outstanding <= 0) ||
(_requestsOutstanding[source] < _max_outstanding))) {
result = _GetNextPacketSize(cl);
_requestsOutstanding[source]++;
}
}
if(result != 0) {
_packet_seq_no[source]++;
}
return result;
}
void BatchTrafficManager::_ClearStats( )
{
TrafficManager::_ClearStats();
_batch_time->Clear( );
}
bool BatchTrafficManager::_SingleSim( )
{
int batch_index = 0;
while(batch_index < _batch_count) {
_packet_seq_no.assign(_nodes, 0);
_last_id = -1;
_last_pid = -1;
_sim_state = running;
int start_time = _time;
bool batch_complete;
cout << "Sending batch " << batch_index + 1 << " (" << _batch_size << " packets)..." << endl;
do {
_Step();
batch_complete = true;
for(int i = 0; i < _nodes; ++i) {
if(_packet_seq_no[i] < _batch_size) {
batch_complete = false;
break;
}
}
if(_sent_packets_out) {
*_sent_packets_out << _packet_seq_no << endl;
}
} while(!batch_complete);
cout << "Batch injected. Time used is " << _time - start_time << " cycles." << endl;
int sent_time = _time;
cout << "Waiting for batch to complete..." << endl;
int empty_steps = 0;
bool packets_left = false;
for(int c = 0; c < _classes; ++c) {
packets_left |= !_total_in_flight_flits[c].empty();
}
while( packets_left ) {
_Step( );
++empty_steps;
if ( empty_steps % 1000 == 0 ) {
_DisplayRemaining( );
cout << ".";
}
packets_left = false;
for(int c = 0; c < _classes; ++c) {
packets_left |= !_total_in_flight_flits[c].empty();
}
}
cout << endl;
cout << "Batch received. Time used is " << _time - sent_time << " cycles." << endl
<< "Last packet was " << _last_pid << ", last flit was " << _last_id << "." << endl;
_batch_time->AddSample(_time - start_time);
cout << _sim_state << endl;
UpdateStats();
DisplayStats();
++batch_index;
}
_sim_state = draining;
_drain_time = _time;
return 1;
}
void BatchTrafficManager::_UpdateOverallStats() {
TrafficManager::_UpdateOverallStats();
_overall_min_batch_time += _batch_time->Min();
_overall_avg_batch_time += _batch_time->Average();
_overall_max_batch_time += _batch_time->Max();
}
string BatchTrafficManager::_OverallStatsCSV(int c) const
{
ostringstream os;
os << TrafficManager::_OverallStatsCSV(c) << ','
<< _overall_min_batch_time / (double)_total_sims << ','
<< _overall_avg_batch_time / (double)_total_sims << ','
<< _overall_max_batch_time / (double)_total_sims;
return os.str();
}
void BatchTrafficManager::WriteStats(ostream & os) const
{
TrafficManager::WriteStats(os);
os << "batch_time = " << _batch_time->Average() << ";" << endl;
}
void BatchTrafficManager::DisplayStats(ostream & os) const {
TrafficManager::DisplayStats();
os << "Minimum batch duration = " << _batch_time->Min() << endl;
os << "Average batch duration = " << _batch_time->Average() << endl;
os << "Maximum batch duration = " << _batch_time->Max() << endl;
}
void BatchTrafficManager::DisplayOverallStats(ostream & os) const {
TrafficManager::DisplayOverallStats(os);
os << "Overall min batch duration = " << _overall_min_batch_time / (double)_total_sims
<< " (" << _total_sims << " samples)" << endl
<< "Overall min batch duration = " << _overall_avg_batch_time / (double)_total_sims
<< " (" << _total_sims << " samples)" << endl
<< "Overall min batch duration = " << _overall_max_batch_time / (double)_total_sims
<< " (" << _total_sims << " samples)" << endl;
}
|
