-
Notifications
You must be signed in to change notification settings - Fork 4
Expand file tree
/
Copy pathcaHandler.h
More file actions
77 lines (64 loc) · 2.17 KB
/
Copy pathcaHandler.h
File metadata and controls
77 lines (64 loc) · 2.17 KB
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
/*
FOGSim, simulator for interconnection networks.
http://fuentesp.github.io/fogsim/
Copyright (C) 2017 University of Cantabria
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License
as published by the Free Software Foundation; either version 2
of the License, or (at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
#ifndef CA_HANDLER_H
#define CA_HANDLER_H
#include "global.h"
#include <queue>
class flitModule;
class caHandler {
public:
caHandler(switchModule * sw);
virtual ~caHandler();
void update();
void flitSent(flitModule * flit, int input, int length);
int getContention(int output) const;
bool isThereContention(int output);
bool isThereGlobalContention(flitModule * flit);
void increaseContention(int port);
void decreaseContention(int port);
void updateContention(int output);
void readIncomingCAFlits();
private:
/* Counts number of PHITS that would
* be minimally routed through each port
*/
int * m_contention_counter;
/* Stores accumulated contention value
* (in PHITS) upon past cycles
*/
float * m_accumulated_contention;
/* Series of partial counters */
int ** m_partial_counter;
/* Counts number of PHITS that would be
* minimally routed through each port,
* but that can be misrouted
*/
int * m_potential_contention_counter;
/* For each output port, there is a
* queue that stores when a message
* that would have been minimally
* routed through that port, has
* completely left the buffer
* (g_packet_size cycles after
* starting to send)
*/
queue<float> * m_sending_end_cycle_queue;
queue<float> * m_sending_end_cycle_globalport_queue;
switchModule * m_sw;
void update_sending_end_cycle_queues();
};
#endif /* CA_HANDLER_H */