BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CERN//INDICO//EN
BEGIN:VEVENT
SUMMARY:Fast Parallel Ring Recognition Algorithm  in the RICH Detector of 
 the CBM Experiment at FAIR
DTSTART;VALUE=DATE-TIME:20100226T132500Z
DTEND;VALUE=DATE-TIME:20100226T135000Z
DTSTAMP;VALUE=DATE-TIME:20130524T204044Z
UID:indico-contribution-39@cern.ch
DESCRIPTION:Speakers: LEBEDEV\, Semen (GSI\, Darmstadt / JINR\, Dubna)\nTh
 e Compressed Baryonic Matter (CBM) experiment at the future FAIR facility 
 at Darmstadt will measure dileptons emitted from the hot and dense phase i
 n heavy-ion collisions. In case of an electron measurement\, a high purity
  of identified electrons is required in order to suppress the background. 
 Electron identification in CBM will be performed by a Ring Imaging Cherenk
 ov (RICH) detector and Transition Radiation Detectors (TRD).\nVery fast da
 ta reconstruction is extremely important for CBM because of the huge amoun
 t of data which has to be handled. In this contribution\, the parallel rin
 g recognition algorithm is presented. Modern CPUs have two features\, whic
 h enable parallel programming. First\, the SSE technology allows using the
  SIMD execution model. Second\, multi core CPUs enable to use multithreadi
 ng. Both features have been implemented in the ring reconstruction of the 
 RICH detector. A speed up factor of 20 has been achieved (from 750 ms/even
 t to 38 ms/event) for an Intel Core 2 Duo processor at 2.13 GHz.\n\nhttp:/
 /indico.cern.ch/contributionDisplay.py?contribId=39&sessionId=8&confId=593
 97
LOCATION:Jaipur\, India
URL:http://indico.cern.ch/contributionDisplay.py?contribId=39&sessionId=8&
 confId=59397
END:VEVENT
END:VCALENDAR