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
|
// $Id: loa.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 "booksim.hpp"
#include <iostream>
#include "loa.hpp"
#include "random_utils.hpp"
LOA::LOA( Module *parent, const string& name,
int inputs, int outputs ) :
DenseAllocator( parent, name, inputs, outputs )
{
_req.resize(inputs);
_counts.resize(outputs);
_rptr.resize(inputs);
_gptr.resize(outputs);
}
void LOA::Allocate( )
{
int input;
int output;
int input_offset;
int output_offset;
int lonely;
int lonely_cnt;
// Count phase --- the number of requests
// per output is counted
for ( int j = 0; j < _outputs; ++j ) {
_counts[j] = 0;
for ( int i = 0; i < _inputs; ++i ) {
_counts[j] += ( _request[i][j].label != -1 ) ? 1 : 0;
}
}
// Request phase
for ( input = 0; input < _inputs; ++input ) {
// Find the lonely output
output_offset = _rptr[input];
lonely = -1;
lonely_cnt = _inputs + 1;
for ( int o = 0; o < _outputs; ++o ) {
output = ( o + output_offset ) % _outputs;
if ( ( _request[input][output].label != -1 ) &&
( _counts[output] < lonely_cnt ) ) {
lonely = output;
lonely_cnt = _counts[output];
}
}
// Request the lonely output (-1 for no request)
_req[input] = lonely;
}
// Grant phase
for ( output = 0; output < _outputs; ++output ) {
input_offset = _gptr[output];
for ( int i = 0; i < _inputs; ++i ) {
input = ( i + input_offset ) % _inputs;
if ( _req[input] == output ) {
// Grant!
_inmatch[input] = output;
_outmatch[output] = input;
_rptr[input] = ( _rptr[input] + 1 ) % _outputs;
_gptr[output] = ( _gptr[output] + 1 ) % _inputs;
break;
}
}
}
}
|
