Name
Abstract | ||
|---|---|---|
At the upcoming Large Hadron Collider (LHC) at CERN one expects to measure 20,000 particles in a single Pb-Pb event resulting in a data rate of ∼75MByte/event. The event rate is limited by the bandwidth of the storage system. Higher rates are possible by selecting interesting events and subevents (Level-3 trigger) or compressing the data efficiently withmo deling techniques. Both require a fast parallel pattern recognition. One possible solution to process the detector data at such rates is a farm of clustered SMP nodes, based on off-the-shelf PCs, and connected by a high bandwidth, low latency network. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1007/3-540-44681-8_54 | Euro-Par |
Keywords | Field | DocType |
level-3 trigger,possible solution,smp node,single pb-pb event,interesting event,data rate,event rate,detector data,higher rate,heavy ion experiment,high bandwidth,low latency,pattern recognition,large hadron collider,storage system | Large Hadron Collider,Lossy compression,Simulation,Computer data storage,Computer science,Image processing,Real-time computing,Bandwidth (signal processing),Time projection chamber,Latency (engineering),Detector,Distributed computing | Conference |
ISBN | Citations | PageRank |
3-540-42495-4 | 0 | 0.34 |
References | Authors | |
1 | 11 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| u frankenfeld | 1 | 0 | 0.68 |
| H. Helstrup | 2 | 0 | 0.68 |
| J. Lien | 3 | 0 | 0.68 |
| Volker Lindenstruth | 4 | 97 | 11.71 |
| Dieter Röhrich | 5 | 2 | 1.67 |
| M. W. Schulz | 6 | 2 | 2.00 |
| B. Skaali | 7 | 4 | 1.18 |
| Timm M. Steinbeck | 8 | 15 | 3.91 |
| k ullaland | 9 | 0 | 1.35 |
| Anders Strand Vestbø | 10 | 2 | 1.34 |
| Arne Wiebalck | 11 | 14 | 4.22 |