A high speed data acquisition collector for merging and sorting data

Robson, C.C.W.; Böhm, C.

doi:10.1109/nssmic.2008.4774528

Cited by 7 publications

(3 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…5). The PC software [2] (Fig. 5) is built on the System Adaptable Application Layers (SAAL) concept [3] including modules for control, sorting and monitoring.…”

Section: The Track Enginementioning

confidence: 99%

A low energy muon trigger for Icecube

Böhm

Kavianipour

Nygren

et al. 2008

2008 IEEE Nuclear Science Symposium Conference Record

Self Cite

View full text Add to dashboard Cite

N36-8the earth and interact near or within IceCube and produce a muon. The muon will continue in much the same direction through IceCube and produce Cherenkov light along a cone in the forward direction. Some of this light is recorded by the DOMs. From the ensemble of Hit information it is possible to reconstruct the direction of the neutrino via the muon tracks with a precision of about 1 degree. Upwardgoing neutrinos can be detected in this way even though downward-going cosmic ray muons exceed their rate by a factor of approximately 10 6 . Abstract-A "TrackEngine" (TE) concept has been developed for use with IceCube to maximize track-finding efficiency in the presence ofnoise. IceCube is a km-scale neutrino detector under construction at South Pole, now consisting of 40 strings of 60 Digital Optical modules (DOM) sensitive to Cherenkov light. Each DOM includes a large PMT that generates noise pulses at~500 Hz. The detection by a DOM ofa pulse, noise or signal, generates a "Hit". The full-scale IceCube will consist of 86 strings, and is expected to generate an average ofapproximately 13 random Hits during any 5f.Js window, the characteristic traversal time within the array ofa relativistic muon. Data is currently acquired with a simple multiplicity trigger (SMT) requiring at least 16 DOM Hits, with the additional requirement that these Hits form local coincidence pairs (8 Hit pairs). However, this trigger is inefficient, especially for low energy muons that generate a minimum oflight, but are of special interest for many experimental studies such as detecting signals from WIMP annihilation in the earth or sun. To increase efficiency for dim tracks, the TE examines all Hits, paired or not, and exploits topological features characteristic of straight line trajectories within the array to identify muons even in the presence ofsubstantial noise. A single PC and FPGA combination is expected to handle the full IceCube Hit rate of 2.5 MHz with more than a factor two margin. The received Hits are time sorted in a PC andfed to a Xi/inx ML507 FPGA board implementing the track engine algorithm. The FPGA solution was chosen, since it could be shown that the present algorithm cannot be implemented in software on one PC alone. The design reaches its high performance by an extensive pipelining of the calculations and operations, well designed and optimized network nodules in software and an extensive use ofthe fast, single-cycle delay Block RAM available in the FPGA.

show abstract

“…5). The PC software [2] (Fig. 5) is built on the System Adaptable Application Layers (SAAL) concept [3] including modules for control, sorting and monitoring.…”

Section: The Track Enginementioning

confidence: 99%

A low energy muon trigger for Icecube

Böhm

Kavianipour

Nygren

et al. 2008

2008 IEEE Nuclear Science Symposium Conference Record

Self Cite

View full text Add to dashboard Cite

show abstract

“…Sorting is a fundamental and common operation in computing. It is used in several applications such as digital signal processing and communications [1]- [4], database management systems [5], optimization, searching, data compression, data clustering, spreadsheets, etc. [6], [7].…”

Section: Introductionmentioning

confidence: 99%

Parallel Multidimensional Lookahead Sorting Algorithm

et al. 2019

View full text Add to dashboard Cite

This paper presents a new parallel structured lookahead multidimensional sorting algorithm. Our algorithm can be based on any sequential sorting algorithm. The amount of parallelism can be controlled using several parameters such as the number of threads, word size, memory/processor communication overhead, and the dimension of the algorithm. The proposed technique is ideally suited for general purpose graphic processing units and shared-memory massively parallel processor systems. It ensures that data being processed exhibits temporal and spatial locality to maximize the utilization of processor cache. The algorithm achieves a speedup even when a single processor is used. A lookahead algorithm is also proposed to achieve even higher speedup. The performance of the proposed algorithm is verified numerically and experimentally.

show abstract

“…Embedded systems that make use of FPGAs implement cryptographic algorithms like block ciphers for security applications [22] and sorting and search algorithms for signal processing [24] and data analysis applications [23]. We propose an approach to efficiently unroll designs to reduce dynamic energy consumption.…”

Section: Introductionmentioning

confidence: 99%