You are viewing an old version of this page. View the current version.

Compare with Current View Page History

« Previous Version 5 Next »

This page provides an overview of the status and inner workings of the TES Readout development and eventual implementation.

 

Description of TES

 

 

PseudoCode

 

 

Benchmarks

This table lists the latest benchmarks.

Currently, it evaluates the average time (over 1e6 iterations) to complete the number of products indicated as well as the sum of the resulting vector. The length of the vector varies according to the number of samples.

The code currently uses a simple decision tree which directly indicates how many filters to use. In the future this tree will determine the case to use depending on which windows have a hit.

These benchmarks were obtained os psanagpu116, using O3 and vectored optimization.

Compile flags
g++ -std=c++11 -O3 -DNDEBUG -march=native -IEigen main.cpp

 

All values are in μs.

Number of products

Number of samples

12345
1000.0610.0740.091  
2000.1130.1450.176  
3000.1500.1900.241  
4000.2000.2660.329  
5000.2390.3210.402  
6000.2790.3780.476  
7000.3180.4350.549  

 

 

Tasks

  • No labels