Аннотация:

For real time applications such as trigger, online monitoring, data stream selectors rudimentary tracking/vertexing is necessary in order to reach the decision required. In order to achieve this, flash (very fast) algorithms are needed. A few such applications are reviewed and the plan for SPD fast-tracking, needed for unbiased event-selection, is made. The main idea is to split pattern recognition combinatorics into segment formation and track assembly (from segments). The segment formation allows straight-track fits, which have flash-algorithm solutions. Also track-assembly can be performed with a flash-circle fit and a subsequent flash-lin fit to verify helicity. The approach seems very promising.