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
|
#include "booksim.hpp"
#include <vector>
#include <sstream>
#include "kncube.hpp"
#include "random_utils.hpp"
#include "misc_utils.hpp"
KNCube::KNCube( const Configuration &config, bool mesh ) :
Network( config )
{
_mesh = mesh;
_ComputeSize( config );
_Alloc( );
_BuildNet( config );
}
void KNCube::_ComputeSize( const Configuration &config )
{
_k = config.GetInt( "k" );
_n = config.GetInt( "n" );
gK = _k; gN = _n;
_size = powi( _k, _n );
_channels = 2*_n*_size;
_sources = _size;
_dests = _size;
}
void KNCube::_BuildNet( const Configuration &config )
{
int left_node;
int right_node;
int right_input;
int left_input;
int right_output;
int left_output;
ostringstream router_name;
for ( int node = 0; node < _size; ++node ) {
router_name << "router";
for ( int dim_offset = _size / _k; dim_offset >= 1; dim_offset /= _k ) {
router_name << "_" << ( node / dim_offset ) % _k;
}
_routers[node] = Router::NewRouter( config, this, router_name.str( ),
node, 2*_n + 1, 2*_n + 1 );
router_name.seekp( 0, ios::beg );
for ( int dim = 0; dim < _n; ++dim ) {
left_node = _LeftNode( node, dim );
right_node = _RightNode( node, dim );
//
// Current (N)ode
// (L)eft node
// (R)ight node
//
// L--->N<---R
// L<---N--->R
//
right_input = _LeftChannel( right_node, dim );
left_input = _RightChannel( left_node, dim );
_routers[node]->AddInputChannel( &_chan[right_input], &_chan_cred[right_input] );
_routers[node]->AddInputChannel( &_chan[left_input], &_chan_cred[left_input] );
right_output = _RightChannel( node, dim );
left_output = _LeftChannel( node, dim );
_routers[node]->AddOutputChannel( &_chan[right_output], &_chan_cred[right_output] );
_routers[node]->AddOutputChannel( &_chan[left_output], &_chan_cred[left_output] );
}
_routers[node]->AddInputChannel( &_inject[node], &_inject_cred[node] );
_routers[node]->AddOutputChannel( &_eject[node], &_eject_cred[node] );
}
}
int KNCube::_LeftChannel( int node, int dim )
{
// The base channel for a node is 2*_n*node
int base = 2*_n*node;
// The offset for a left channel is 2*dim + 1
int off = 2*dim + 1;
return( base + off );
}
int KNCube::_RightChannel( int node, int dim )
{
// The base channel for a node is 2*_n*node
int base = 2*_n*node;
// The offset for a right channel is 2*dim
int off = 2*dim;
return( base + off );
}
int KNCube::_LeftNode( int node, int dim )
{
int k_to_dim = powi( _k, dim );
int loc_in_dim = ( node / k_to_dim ) % _k;
int left_node;
// if at the left edge of the dimension, wraparound
if ( loc_in_dim == 0 ) {
left_node = node + (_k-1)*k_to_dim;
} else {
left_node = node - k_to_dim;
}
return left_node;
}
int KNCube::_RightNode( int node, int dim )
{
int k_to_dim = powi( _k, dim );
int loc_in_dim = ( node / k_to_dim ) % _k;
int right_node;
// if at the right edge of the dimension, wraparound
if ( loc_in_dim == ( _k-1 ) ) {
right_node = node - (_k-1)*k_to_dim;
} else {
right_node = node + k_to_dim;
}
return right_node;
}
int KNCube::GetN( ) const
{
return _n;
}
int KNCube::GetK( ) const
{
return _k;
}
void KNCube::InsertRandomFaults( const Configuration &config )
{
int num_fails;
unsigned long prev_seed;
int node, chan;
int i, j, t, n, c;
bool *fail_nodes;
bool available;
bool edge;
num_fails = config.GetInt( "link_failures" );
if ( num_fails ) {
prev_seed = RandomIntLong( );
RandomSeed( config.GetInt( "fail_seed" ) );
fail_nodes = new bool [_size];
for ( i = 0; i < _size; ++i ) {
node = i;
// edge test
edge = false;
for ( n = 0; n < _n; ++n ) {
if ( ( ( node % _k ) == 0 ) ||
( ( node % _k ) == _k - 1 ) ) {
edge = true;
}
node /= _k;
}
if ( edge ) {
fail_nodes[i] = true;
} else {
fail_nodes[i] = false;
}
}
for ( i = 0; i < num_fails; ++i ) {
j = RandomInt( _size - 1 );
available = false;
for ( t = 0; ( t < _size ) && (!available); ++t ) {
node = ( j + t ) % _size;
if ( !fail_nodes[node] ) {
// check neighbors
c = RandomInt( 2*_n - 1 );
for ( n = 0; ( n < 2*_n ) && (!available); ++n ) {
chan = ( n + c ) % 2*_n;
if ( chan % 1 ) {
available = fail_nodes[_LeftNode( node, chan/2 )];
} else {
available = fail_nodes[_RightNode( node, chan/2 )];
}
}
}
if ( !available ) {
cout << "skipping " << node << endl;
}
}
if ( t == _size ) {
Error( "Could not find another possible fault channel" );
}
OutChannelFault( node, chan );
fail_nodes[node] = true;
for ( n = 0; ( n < _n ) && available ; ++n ) {
fail_nodes[_LeftNode( node, n )] = true;
fail_nodes[_RightNode( node, n )] = true;
}
cout << "failure at node " << node << ", channel "
<< chan << endl;
}
delete [] fail_nodes;
RandomSeed( prev_seed );
}
}
double KNCube::Capacity( ) const
{
if ( _mesh ) {
return(double)_k / 4.0;
} else {
return(double)_k / 8.0;
}
}
|
