RecoSim  1.0
 All Classes Files Functions Variables Enumerations
random_bcet_wcet_para.h
1 
13 #ifndef random_bcet_wcet_para_MODULE_ALGORITHMS_FILE_H
14 #define random_bcet_wcet_para_MODULE_ALGORITHMS_FILE_H
15 
16 #include "user_parameters.h"
17 
19 #include <time.h> /* time */
20 
21 /*****************************************************************************/
22 /************************** BEGIN USER SPACE ********************************/
23 
24 template<int Ni, int No>
25 void random_bcet_wcet_para(User_algorithm_interface<Ni, No> &user_algo_interface) {
26  // Sw Default behavior
27  srand ((unsigned int)sc_time_stamp().to_double());
28  user_algo_interface.get_logfile() << sc_time_stamp() << "init srand" << endl;
29 
30 
31  while(true) {
32 
33  /*******************************************************************************/
34  /**** MANDATORY PART (EXCEPT DISPLAY) ****/
35 
36 
37  /* WAIT FOR START ALGORITHM EVENT : Only for Dynamic tasks */
38  user_algo_interface.get_logfile() << sc_time_stamp() << ": " << user_algo_interface.get_name() << " Beginning of loop" << endl;
39  user_algo_interface.b_execution_requested();
40  user_algo_interface.get_logfile() << sc_time_stamp() << ": " << user_algo_interface.get_name() << " Execution requested" << endl;
41 
42  /* TRACE : The algorithm is idle in order to have an accurate trace */
43  user_algo_interface.set_algorithm_idle();
44 
45  /* WAIT FOR NEXT PERIOD to begin to start algorithm execution. For non-periodic modules, function returns right away */
46  user_algo_interface.wait_until_next_period();
47 #ifdef GENERATE_LOG_FILE
48  user_algo_interface.get_logfile() << sc_time_stamp() << ": " << user_algo_interface.get_name() << " New period started" << endl;
49 #endif
50  user_algo_interface.set_algorithm_waiting();
51 
52  /**** BEGINNING OF DATA RECEPTION SEGMENT ****/
53 
54  user_algo_interface.b_all_data_received();
55 
56  user_algo_interface.set_algorithm_running();
57 
58  /**** END OF DATA RECEPTION SEGMENT ****/
59 
60  /**** BEGINNING OF USER ALGORITHM ****/
61 
62 
63  sc_time my_WCET=user_algo_interface.get_WCET()/NB_SLICES_APPLICATION; //compute real WCET depending on application parallelism
64  sc_time my_BCET=user_algo_interface.get_BCET()/NB_SLICES_APPLICATION; // BCET
65  //sc_time my_WCET=user_algo_interface.get_WCET(); //compute real WCET depending on application parallelism
66  //sc_time my_BCET=user_algo_interface.get_BCET(); // BCET
67 
68  int *data;
69  data = user_algo_interface.get_data_in_ptr(0);
70  if ((data[0]>>16)==0)
71  current_time_state = BCET;
72  if ((data[0]>>16)==1)
73  current_time_state = WCET;
74  if ((data[0]>>16)==2)
75  current_time_state = BCET;
76  if ((data[0]>>16)>2)
77  current_time_state = RANDOM;
78 
79 
80 
81  double random = rand()%101;
82 
83  double random_result =(random/100.0)*(my_WCET.to_seconds()-my_BCET.to_seconds());
84 
85  sc_time random_execution_time = my_BCET;
86 
87 // if (user_algo_interface.is_algorithm_execution_mode(RANDOM_EXECUTION_TIME) == true)
88  if (current_time_state == RANDOM)
89  random_execution_time = my_BCET + sc_time(random_result, SC_SEC);
90 
91  if (current_time_state == BCET)
92  random_execution_time = my_BCET;
93 
94  if (current_time_state == WCET)
95  random_execution_time = my_WCET;
96 
97 
98 
99  user_algo_interface.get_logfile() << sc_time_stamp() << ": " << user_algo_interface.get_name() << " HW execution time : " << random_execution_time.to_seconds()*1000 << " ms : " << " WCET : " << user_algo_interface.get_WCET().to_seconds()*1000 << " ms : " << endl;
100 
101 
102  // Preemption points
103  for(int i = 0; i < user_algo_interface.get_nb_preemption_points(); i++) {
104  user_algo_interface.compute(random_execution_time/(user_algo_interface.get_nb_preemption_points() + 1));
105 
106  user_algo_interface.preemption_point();
107  user_algo_interface.set_algorithm_running();
108 
109  }
110 
111  // Wait for the last execution segment (after last preemption point)
112  user_algo_interface.compute(random_execution_time/(user_algo_interface.get_nb_preemption_points() + 1));
113 #ifdef GENERATE_LOG_FILE
114  user_algo_interface.get_logfile() << sc_time_stamp() << ": " << user_algo_interface.get_name() << " User algorithm ended" << endl;
115 #endif
116 
117 
118 
119 
120 
121 
122  /**** END OF USER ALGORITHM ****/
123 
124 
125  // Check that all data issued from previous algorithm execution has been processed and sent
126  user_algo_interface.b_all_data_sent();
127 
128  // When all data is sent, indicate that a new sequence starts now
129  // MUST BE DONE ONLY AFTER VERIFYING THAT ALL PREVIOUS DATA HAVE BEEN SENT
130  user_algo_interface.start_new_transaction_sequence();
131 
132  // Find a channel that is not transient and has updated data
133  int channel_id = 0;
134  while(user_algo_interface.is_channel_transient(channel_id) || !user_algo_interface.nb_data_received(channel_id)) channel_id++;
135 
136  // Copy data
137  int data_in_length = 0;
138  int data_out_length = 0;
139  for(int i = 0; i < No; i++) {
140  data_in_length = user_algo_interface.get_data_in_length(channel_id);
141  data_out_length = user_algo_interface.get_data_out_length(i);
142 
143  if(data_out_length <= data_in_length) {
144  memcpy(user_algo_interface.get_data_out_ptr(i), user_algo_interface.get_data_in_ptr(channel_id), data_out_length);
145  } else {
146  memcpy(user_algo_interface.get_data_out_ptr(i), user_algo_interface.get_data_in_ptr(channel_id), data_in_length);
147  for(int j = data_in_length; j < data_out_length; j+=4) user_algo_interface.get_data_out_ptr(i)[j/4] = 0;
148  }
149 
150  user_algo_interface.set_address_out(i, user_algo_interface.get_address_in(channel_id));
151  }
152 
153  // Release input sockets (we won't need their data anymore) for they are used by preceding modules again
154  user_algo_interface.release_all_input_sockets();
155 
156  // Notify RZ to continue processing
157  user_algo_interface.end_of_algorithm();
158 
159  // Send data to all sockets
160  user_algo_interface.nb_send_all_data();
161 
162 
163  // Wait for the event notifying a possible change in the user algorithm thread
164  user_algo_interface.wait_for_update_user_algorithm();
165 
166  user_algo_interface.get_logfile() << sc_time_stamp() << ": " << user_algo_interface.get_name() << " Update user algorithm event received" << endl;
167 
168  if(user_algo_interface.kill_user_algorithm()) {
169 #ifdef GENERATE_LOG_FILE
170  user_algo_interface.get_logfile() << user_algo_interface.get_name() << " User algorithm thread has to be killed!" << endl;
171 #endif
172  return;
173  }
174  }
175 
176 }
177 
178 /************************** END USER SPACE ********************************/
179 /***************************************************************************/
180 
181 #endif
virtual ofstream & get_logfile(void)=0
Get logfile.
virtual bool & kill_user_algorithm(void)=0
Get a reference to a boolean indicating whether the user algorithm should be killed or not (for insta...
virtual void start_new_transaction_sequence(int id)=0
Indicate that a new transaction sequence is beginning (i.e. sending new data) for a particular socket...
virtual int * get_data_in_ptr(int socket)=0
Get pointer to incoming data from socket 'socket'.
virtual void set_address_out(int socket, sc_dt::uint64 value)=0
Set address for outgoing transaction on socket 'socket'.
virtual bool nb_data_received(string name)=0
Check if the data from channel 'name' have been received yet. Non-blocking function.
virtual int get_nb_preemption_points(void)=0
Get the number of preemption points that should be inserted in the algorithm.
virtual void b_all_data_received(void)=0
Check if the data from all channels have been received yet. Blocking function: if the data is not ava...
virtual void preemption_point(void)=0
Function to call to emulate preemption.
virtual sc_time get_WCET(void) const =0
Get task worst case execution time (WCET), depending on current implementation.
virtual int get_data_out_length(int socket) const =0
Get output socket data length.
virtual void compute(sc_time duration)=0
Emulate an execution time of the algorithm.
virtual void release_all_input_sockets(void)=0
Release all input socket so that preceding modules might send some more data.
virtual void set_algorithm_waiting(void)=0
Function to call when the algorithm is waiting for data in order to have an accurate trace...
virtual int get_data_in_length(int socket) const =0
Get input socket data length.
virtual const char * get_name(void) const =0
Get task name.
virtual void b_execution_requested(void)=0
Wait until an algorithm execution has been requested/granted by the manager.
Definition: user_algorithm_interface.h:35
virtual bool is_channel_transient(string name)=0
Check if channel 'name' is transient or not.
virtual void end_of_algorithm(void)=0
Function to call at the end of algorithm.
virtual int * get_data_out_ptr(int socket)=0
Get pointer to outgoing data from socket 'socket'.
virtual void set_algorithm_running(void)=0
Function to call when the algorithm is running in order to have an accurate trace.
virtual void set_algorithm_idle(void)=0
Function to call when the algorithm is idle in order to have an accurate trace.
virtual void wait_until_next_period(void)=0
Wait until the next period is started. For non-periodic tasks, return immediately.
virtual sc_dt::uint64 get_address_in(int socket) const =0
Retrieve address from the incoming transaction on socket 'socket'.
virtual void b_all_data_sent(void)=0
Check if data has been sent on every socket. Blocking function: if data send is not finished yet...
virtual void nb_send_all_data(void)=0
Send data towards all channels. Non-blocking function.
virtual sc_time get_BCET(void) const =0
Get task best case execution time (BCET), depending on current implementation.