... | ... | @@ -78,9 +78,9 @@ This script |
|
|
else:
|
|
|
# see which functions is first
|
|
|
first_routine = functions_called_once_per_step[0]
|
|
|
```
|
|
|
```
|
|
|
5. For all cpu finds the shortes timestep, then look on average which one has been the fastest
|
|
|
``` python
|
|
|
``` python
|
|
|
for proc in nemo_proc:
|
|
|
index = proc - nemo_proc[0]
|
|
|
ts_time[index] = time[(cpu_ids == proc) & (function_ids == first_routine)]
|
... | ... | @@ -94,7 +94,6 @@ This script |
|
|
# Evaluate the most common index for best ts
|
|
|
counts = np.bincount(ts_min_index)
|
|
|
best_ts_index = np.argmax(counts)
|
|
|
|
|
|
```
|
|
|
6. Once the index of the best time-step has been found find time begin/end times to pass to Extrae cutter
|
|
|
```python
|
... | ... | |