Fake trigger background simulation

Slides:



Advertisements
Similar presentations
Paging: Design Issues. Readings r Silbershatz et al: ,
Advertisements

Yaron Doweck Yael Einziger Supervisor: Mike Sumszyk Spring 2011 Semester Project.
23/04/2008VLVnT08, Toulon, FR, April 2008, M. Stavrianakou, NESTOR-NOA 1 First thoughts for KM3Net on-shore data storage and distribution Facilities VLV.
1 Distributed File System, and Disk Quotas (Week 7, Thursday 2/21/2007) © Abdou Illia, Spring 2007.
JEM input processor stand-alone tests Andrey Belkin Uni Mainz 7th November 2003.
GLAST LAT ProjectOnline Peer Review – July 21, Integration and Test L. Miller 1 GLAST Large Area Telescope: I&T Integration Readiness Review.
18.337: Image Median Filter Rafael Palacios Aeronautics and Astronautics department. Visiting professor (IIT-Institute for Research in Technology, University.
Large scale data flow in local and GRID environment V.Kolosov, I.Korolko, S.Makarychev ITEP Moscow.
Research on cloud computing application in the peer-to-peer based video-on-demand systems Speaker : 吳靖緯 MA0G rd International Workshop.
JPEG C OMPRESSION A LGORITHM I N CUDA Group Members: Pranit Patel Manisha Tatikonda Jeff Wong Jarek Marczewski Date: April 14, 2009.
Artdaq Introduction artdaq is a toolkit for creating the event building and filtering portions of a DAQ. A set of ready-to-use components along with hooks.
Ranking Queries on Uncertain Data: A Probabilistic Threshold Approach Wenjie Zhang, Xuemin Lin The University of New South Wales & NICTA Ming Hua,
1 Wenguang WangRichard B. Bunt Department of Computer Science University of Saskatchewan November 14, 2000 Simulating DB2 Buffer Pool Management.
CMAQ Runtime Performance as Affected by Number of Processors and NFS Writes Patricia A. Bresnahan, a * Ahmed Ibrahim b, Jesse Bash a and David Miller a.
Conclusions and Future Considerations: Parallel processing of raster functions were 3-22 times faster than ArcGIS depending on file size. Also, processing.
David N. Brown Lawrence Berkeley National Lab Representing the BaBar Collaboration The BaBar Mini  BaBar  BaBar’s Data Formats  Design of the Mini 
Practice and Evaluation. Practice Develop a java class called: SumCalculator.java which computes a sum of all integer from 1 to 100 and displays the result.
Computer Architecture Lecture 3 Cache Memory. Characteristics Location Capacity Unit of transfer Access method Performance Physical type Physical characteristics.
Status report from T2K-SK group Task list of this group discussion about NEUT Kaneyuki, Walter, Konaka We have just started the discussion.
Introduction Advantages/ disadvantages Code examples Speed Summary Running on the AOD Analysis Platforms 1/11/2007 Andrew Mehta.
HPDC 2013 Taming Massive Distributed Datasets: Data Sampling Using Bitmap Indices Yu Su*, Gagan Agrawal*, Jonathan Woodring # Kary Myers #, Joanne Wendelberger.
QCAdesigner – CUDA HPPS project
Analysis trains – Status & experience from operation Mihaela Gheata.
MROrder: Flexible Job Ordering Optimization for Online MapReduce Workloads School of Computer Engineering Nanyang Technological University 30 th Aug 2013.
Modeling Billion-Node Torus Networks Using Massively Parallel Discrete-Event Simulation Ning Liu, Christopher Carothers 1.
GEM: A Framework for Developing Shared- Memory Parallel GEnomic Applications on Memory Constrained Architectures Mucahid Kutlu Gagan Agrawal Department.
CBM ECAL simulation status Prokudin Mikhail ITEP.
LogTree: A Framework for Generating System Events from Raw Textual Logs Liang Tang and Tao Li School of Computing and Information Sciences Florida International.
Computing R&D and Milestones LHCb Plenary June 18th, 1998 These slides are on WWW at:
Implementing Precise Interrupts in Pipelined Processors James E. Smith Andrew R.Pleszkun Presented By: Shrikant G.
The JANA Reconstruction Framework David Lawrence - JLab May 25, /25/101JANA - Lawrence - CLAS12 Software Workshop.
PROOF tests at BNL Sergey Panitkin, Robert Petkus, Ofer Rind BNL May 28, 2008 Ann Arbor, MI.
ATLAS Distributed Computing perspectives for Run-2 Simone Campana CERN-IT/SDC on behalf of ADC.
Susanna Guatelli Geant4 in a Distributed Computing Environment S. Guatelli 1, P. Mendez Lorenzo 2, J. Moscicki 2, M.G. Pia 1 1. INFN Genova, Italy, 2.
Markus Frank (CERN) & Albert Puig (UB).  An opportunity (Motivation)  Adopted approach  Implementation specifics  Status  Conclusions 2.
Enabling Grids for E-sciencE LRMN ThIS on the Grid Sorina CAMARASU.
Review and Perspective of Muon Studies Marco Destefanis Università degli Studi di Torino PANDA Collaboration Meeting GSI (Germany) September 5-9, 2011.
ANL T3g infrastructure S.Chekanov (HEP Division, ANL) ANL ASC Jamboree September 2009.
Skimming in Zztop Ricardo – SLT meeting.
TA-EUSO: First simulation study and status
A to Zh Tutorial Progress
DCS Status and Amanda News
Analysis of Sparse Convolutional Neural Networks
WP18, High-speed data recording Krzysztof Wrona, European XFEL
Hydrodynamic Galactic Simulations
Digital readout architecture for Velopix
DPG Activities DPG Session, ALICE Monthly Mini Week
Work report Xianghu Zhao Nov 11, 2014.
SAM at CCIN2P3 configuration issues
A451 Theory – 7 Programming 7A, B - Algorithms.
Releases and developments
Progress with MUON reconstruction
Introduction to HDFS: Hadoop Distributed File System
Issues with Simulating High Luminosities in ATLAS
Experience with Corsika
Fake trigger background simulations
ESAF Euso Simulation and Analysis Framework
Blahoslav Pastirčák, IEP SAS Košice Pavol Bobík, IEP SAS Košice
Implementation of Efficient Check-pointing and Restart on CPU - GPU
Selectivity Estimation of Big Spatial Data
US ATLAS Physics & Computing
Control and monitoring of trigger algorithms using Gaucho
Chapter 2: Operating-System Structures
Outline Chapter 2 (cont) OS Design OS structure
Simulation and Physics
LHC BLM Software audit June 2008.
Chapter 2: Operating-System Structures
MapReduce: Simplified Data Processing on Large Clusters
Preliminary design of the behavior level model of the chip
Presentation transcript:

Fake trigger background simulation Blahoslav Pastirčák, Pavol Bobík, Franceso Fenu, Kenji Shinozaki JEM-EUSO Simulation meeting, Košice, 2 November 2011

Outline Motivation SW and configuration Rates Ambiguities in background generation Stored information

Motivation Very high statistics of bckg needed to be sure when filtering events → 10^5 events It corresponds to 10^14 GTU's Not possible to be simulated by ESAF which is 10^3 slower then presented code and cannot be runned by parallel computing (memory share) Fast and standalone code written in C++ developed by Francseco Fenu

The code Trigger algorithm implemented (the same as in ESAF) One PDM simulated PTT alg. → 2nd level → 1Hz/PDM LTT alg. → 3rd level → 1 mHZ/PDM Bckg source → Poisson ditribution of avg 500 photons/(m^2 s sr) Code fast but since to produce huge statistics has to be run in parallel (on Kosice cluster)

JEM-EUSO Kosice cluster Actually used and available for also for collaboration 7*32 cores @ 2.3 Ghz; 25 TB Fedora Core 14 1.2.5-2.fc14 kernel 2.6.35.13-91.fc14.x86_64 Gcc 4.5.1-4 Disk space shared by nfs ROOT v30.00, ESAF trunk, GEANT4 9.4

Configuration M36 BG = 2.1 ph/pix/GTU PTT_integr = 43 LTT integration = 145

Background rate for M36 configuration

Stored information Two files written when thresholds reached: PTT_SECOND_OUT → (x,y,pers, ecid,counts) 12x12x5 =720 lines/pdm LTT_SECOND_OUT → (x,y,time,counts) 36x36x31 = 40196 lines/pdm Information for which PPT, LTT dumped (reached threshold) Analysis of only pixels contributed to LTT going on

Older result The information of accumulated LTT triggers stored to ascii file in the 4 column format: row in EC (0-35) : column in EC (0-35) : time (0-30) : counts/pixel 1 LTT trigger = 36x36x31 lines Average size of the LTT output : 250 MB/ 1.e9 Gtu's We reprocessed it to store like root ntuples: 10 MB/1.e9 GTU's

Random number generation Doubts on misintrepretation of algorithms and/or artifiial accuracy limited → random generation Investigating rndm=rndm1+10^6*rndm2 unsuccesfull → increased LTT rate 4 different types of rnd generation acording to predefined Poisson distributions investigated from ROOT framework investigated and used

Present statistics New 10^12 GTU's simulated during cca 6 weeks on PC cluster (power consumption and not clarified configuration limited higher st.) 12 000 LTT triggers → 1mHz/PDM 750000 PTT triggers → 0.1 Hz/PDM

Possible problem in the code The trigger code exctrated from ESAF for determining appropriate threshold values seems to be affected → generate_background and PPT_pre_analysis status executed in the same loop, but has to be accomplished separately As FF code uses the same algorithm it appeared also there I have modified the code, but it results in enormous time consuming and no trigger rates

Summary, questions, todo Checked trigger rates obtained from the code compatible with expectation Visualisation at present level don't show structures Obtain LTT history also from PTT contributing to LTT and analyse Check the validity of possible change in the code Fix the fully perfect thresholds to start massive simulation