| Re: Is SADC data always time ordered ? [message #421 is a reply to message #417] |
Thu, 06 May 2004 16:30  |
Igor Konorov
Messages: 7
Registered: April 2004
Location: TU Muenchen
|
occasional visitor |
From: *e18.physik.tu-muenchen.de
|
|
I agree that with the algorithm which you propose to order the hits the multiplexer should have a buffers which can store the data for a maximum time interval between hits or "heart beats".
But the algorithm is enhanced by taking in to account maximum propagation time of the hits from SADC to multiplexer and then the heart bit is not needed for sorting.
The longest propagation time occurs when the hit rate is high and all buffers are full . It can be calculated for this case:
Prop.Time = BufferSize / Link Bandwidth.
For SADC the maximum propagation time is about 500us.
For low hit rate the propagation time is few useconds.
The data flow , buffer size and sorting algorithm are subject of simulation and optimization .
Igor Konorov
Technical University of Munich
Physic Department E18
mail: igor.konorov@ph.tum.de
tel: +49-89-28912574
Fax: +49-89-28912570
|
|
|
|
GSI Forum
Search
Help
Members
Login
Home
