27 March 2003RD Schaffer & C. Arnault CHEP031 Use of a Generic Identification Scheme Connecting Events and Detector Description in Atlas  Authors: C.

Slides:



Advertisements
Similar presentations
ATLAS ATLAS Week: 25/Feb to 1/Mar 2002 Data Manager Design Status Report DM.pdf.
Advertisements

Jan. 2009Jinyuan Wu & Tiehui Liu, Visualization of FTK & Tiny Triplet Finder Jinyuan Wu and Tiehui Liu Fermilab January 2010.
Image Indexing and Retrieval using Moment Invariants Imran Ahmad School of Computer Science University of Windsor – Canada.
25 th March 2003 V.Fine, H.Ma CHEP 2003, San Diego 1 Root Based Persistency in Athena (ATLAS) by Valeri Fine and Hong Ma.
2010/3/81 Lecture 8 on Physical Database DBMS has a view of the database as a collection of stored records, and that view is supported by the file manager.
11 3 / 12 CHAPTER Databases MIS105 Lec14 Irfan Ahmed Ilyas.
Online Measurement of LHC Beam Parameters with the ATLAS High Level Trigger David W. Miller on behalf of the ATLAS Collaboration 27 May th Real-Time.
Fundamentals of Python: From First Programs Through Data Structures
Identifiers for Everyone J. Bogart Core Software Workshop April
DHTML. What is DHTML?  DHTML is the combination of several built-in browser features in fourth generation browsers that enable a web page to be more.
Data Quality Monitoring of the CMS Tracker
Framework for track reconstruction and it’s implementation for the CMS tracker A.Khanov,T.Todorov,P.Vanlaer.
The Pixel Detector ByteStream Converter M.Cobal (1), L. Santi (2) (1) University of Udine and INFN Trieste, Italy (2) University of Trieste and INFN Trieste,
Algorithm / Data-flow Interface
Conditions DB in LHCb LCG Conditions DB Workshop 8-9 December 2003 P. Mato / CERN.
Alignment Strategy for ATLAS: Detector Description and Database Issues
NetConf Data Model draft-adwankar-netconf-datamodel-01.txt Sandeep Adwankar.
LHC: ATLAS Experiment meeting “Conditions” data challenge Elizabeth Gallas - Oxford - August 29, 2009 XLDB3.
Event Data Model in ATLAS Edward Moyse (CERN) On behalf of the ATLAS collaboration CHEP 2004, Interlaken.
N ATIONAL E NERGY R ESEARCH S CIENTIFIC C OMPUTING C ENTER Charles Leggett The Athena Control Framework in Production, New Developments and Lessons Learned.
David N. Brown Lawrence Berkeley National Lab Representing the BaBar Collaboration The BaBar Mini  BaBar  BaBar’s Data Formats  Design of the Mini 
Software Solutions for Variable ATLAS Detector Description J. Boudreau, V. Tsulaia University of Pittsburgh R. Hawkings, A. Valassi CERN A. Schaffer LAL,
The Region of Interest Strategy for the ATLAS Second Level Trigger
Event Data History David Adams BNL Atlas Software Week December 2001.
MOORE MOORE (Muon Object Oriented REconstruction) Track reconstruction in the Muon Spectrometer MuonIdentification MuonIdentification Reconstruction and.
CHEP 2003 March 22-28, 2003 POOL Data Storage, Cache and Conversion Mechanism Motivation Data access Generic model Experience & Conclusions D.Düllmann,
XML in Atlas: from generic to parametric detector description Stan Bentvelsen NIKHEF Amsterdam XML workshop, CERN, May 22.
“Primary Numbers” Database for ATLAS Detector Description Parameters March 24, 2003 S. Eckmann, D. Malon, A. Vaniachine (ANL) P. Nevski, T. Wenaus (BNL)
Copyright 2006 Prentice-Hall, Inc. Essentials of Systems Analysis and Design Third Edition Joseph S. Valacich Joey F. George Jeffrey A. Hoffer Chapter.
24/06/03 ATLAS WeekAlexandre Solodkov1 Status of TileCal software.
Some Thoughts about Hits, Geometry etc Rob Kutschke, Hans Wenzel Fermilab March 13, 2007.
The Persistency Patterns of Time Evolving Conditions for ATLAS and LCG António Amorim CFNUL- FCUL - Universidade de Lisboa A. António, Dinis.
CHEP /21/03 Detector Description Framework in LHCb Sébastien Ponce CERN.
Chapter 10 Designing the Files and Databases. SAD/CHAPTER 102 Learning Objectives Discuss the conversion from a logical data model to a physical database.
N ATIONAL E NERGY R ESEARCH S CIENTIFIC C OMPUTING C ENTER Charles Leggett Interval of Validity Service IOVSvc ATLAS Software Week May Architecture.
AMB HW LOW LEVEL SIMULATION VS HW OUTPUT G. Volpi, INFN Pisa.
Navigation Timing Studies of the ATLAS High-Level Trigger Andrew Lowe Royal Holloway, University of London.
The GeoModel Toolkit for Detector Description Joe Boudreau Vakho Tsulaia University of Pittsburgh CHEP’04 Interlaken.
P-Tree Implementation Anne Denton. So far: Logical Definition C.f. Dr. Perrizo’s slides Logical definition Defines node information Representation of.
David Adams ATLAS DIAL: Distributed Interactive Analysis of Large datasets David Adams BNL August 5, 2002 BNL OMEGA talk.
CHEP /21/03 Detector Description Framework in LHCb Sébastien Ponce CERN.
Detector Description in LHCb Detector Description Workshop 13 June 2002 S. Ponce, P. Mato / CERN.
Chapter 10 Designing Databases. Objectives:  Define key database design terms.  Explain the role of database design in the IS development process. 
4/9/2007RPC converter1/18 RPC bytestream converter: Brainstorming a summary of discussions involving M.Bianco, G.Cataldi, G.Chiodini, E.Gorini, A.Guida,
Chapter 13.3: Databases Invitation to Computer Science, Java Version, Second Edition.
S t a t u s a n d u pd a t e s Gabriella Cataldi (INFN Lecce) & the group Moore … in the H8 test-beam … in the HLT(Pesa environment) … work in progress.
Software Tools for Layout Optimization (Fermilab) Software Tools for Layout Optimization Harry Cheung (Fermilab) For the Tracker Upgrade Simulations Working.
D. Duellmann - IT/DB LCG - POOL Project1 The LCG Dictionary and POOL Dirk Duellmann.
30/09/081 Muon Spectrometer Detector Description Outline: - Present situation - Dead Matter - Validation - GeoModel.. Laurent Chevalier, Andrea Dell’Acqua,
G.Govi CERN/IT-DB 1GridPP7 June30 - July 2, 2003 Data Storage with the POOL persistency framework Motivation Strategy Storage model Storage operation Summary.
A Level-2 trigger algorithm for the identification of muons in the ATLAS Muon Spectrometer Alessandro Di Mattia on behalf of the Atlas TDAQ group Computing.
9/29/ CMS Detector Description: New Developments Ad Aerts Eindhoven University of Technology, Eindhoven, The Netherlands Martin Liendl CERN, Geneva,
LHC CMS Detector Upgrade Project RCT/CTP7 Readout Isobel Ojalvo, U. Wisconsin Level-1 Trigger Meeting June 4, June 2015, Isobel Ojalvo Trigger Meeting:
Detector Description (Overview) C.Cheshkov. 25/9/2006Detector Description (C.Cheshkov)OutlineTerminology Overview on: Detector geometry implementation.
SiD Tracking in the LOI and Future Plans Richard Partridge SLAC ALCPG 2009.
ATLAS The ConditionDB is accessed by the offline reconstruction framework (ATHENA). COOLCOnditions Objects for LHC The interface is provided by COOL (COnditions.
VI/ CERN Dec 4 CMS Software Architecture vs Hybrid Store Vincenzo Innocente CMS Week CERN, Dec
4 Dec., 2001 Software Week Data flow in the LArG Reconstruction software chain Updated status for various reconstruction algorithm LAr Converters and miscellaneous.
Iterative local  2 alignment algorithm for the ATLAS Pixel detector Tobias Göttfert IMPRS young scientists workshop 17 th July 2006.
Introduction Specification for the possible Identifiers
2018/6/15 The Fast Tracker Real Time Processor and Its Impact on the Muon Isolation, Tau & b-Jet Online Selections at ATLAS Francesco Crescioli1 1University.
A C++ generic model for the GLAST Geometric Description
HEP detector description supporting the full experiment life cycle
Silicon Tracking with GENFIT
LHCb Detector Description Framework Radovan Chytracek CERN Switzerland
Detector Description in LHCb
MOORE (Muon Object Oriented REconstruction) MuonIdentification
Use of variable size array to model the Atlas raw data
Trees in java.util A set is an object that stores unique elements
LHCb Detector Description Framework Radovan Chytracek CERN Switzerland
Presentation transcript:

27 March 2003RD Schaffer & C. Arnault CHEP031 Use of a Generic Identification Scheme Connecting Events and Detector Description in Atlas  Authors: C. Arnault, RD Schaffer (LAL Orsay)  The problem: Data coming from a HEP detector requires access to “detector description” to be used E.g. geometry, calibration, alignment This can be done in many ways, but ultimately this relies on a key- lookup to match the readout data with its detector description data  The chosen solution: An identification scheme which follows an hierarchical structure of the detector Support: id dictionary, various identifiers, and id “helpers” - factories/manipulators

27 March 2003RD Schaffer & C. Arnault CHEP032 A historical overview  Basic identifier classes available Incorporation in first C++ event model Based on expanded form of Identifier  Migration to next generation event model today Deployment of an Identifier dictionary Movement to compact and hash identifiers Use of an two-level container based on hashes

27 March 2003RD Schaffer & C. Arnault CHEP033 The Identifier Specification  We have defined a tree-like identifier for all detectors: E.g. Silicon Strip Tracker (SCT): InnerDetector disk 0layer 0layer 1layer 2disk 1disk 2disk 1disk 0disk 2NegEndCapBarrelPosEndCapSCTPixelTRT wafer phi 0wafer phi N … strip 0strip N … wafer eta 0wafer eta N … ID levels radial phi eta Detector element level Readout channel level Detector system subsystem

27 March 2003RD Schaffer & C. Arnault CHEP034 The Identifier Specification (2)  Specification may identify different parts, depending upon the depth Subdetector, barrel/endcap, detector elements, readout channels  As will be seen, this has led to a three-level model used in different parts of the software SubdetectorDetector element Readout channel 1..n

27 March 2003RD Schaffer & C. Arnault CHEP035 Infrastructure: Basic Model ID Helper ID Dictionary DOM Parser client XML specification id wafer_id(values) pack id read parse and build Get id for a particular wafer Initialize dictionary

27 March 2003RD Schaffer & C. Arnault CHEP036 Infrastructure: Identifier classes  Various identifier classes only contain numbers - no strings Expanded - internal representation is vector Compact - 32 bit, created by id dictionary Hash - 32 bit, transformation of id to number 0 - N elements Allows constant-time table look-up

27 March 2003RD Schaffer & C. Arnault CHEP037 Infrastructure: Range classes  Specification “capture” Range class contains the allowed values at each level for a region of identifiers  Each level: min/max or enumeration (plus wild-carded min/max)  2 / -2, 2 / 1 / -6 : 6 / 0 : 55 / 0 : 767 MultiRange class full specification for a part of detector (vector ) Both provide iterators over ids match(id) - id validity check

27 March 2003RD Schaffer & C. Arnault CHEP038 Infrastructure: Identifier dictionary  Features: Defines logical hierarchy, providing a name for each level Specifies the non-overlapping regions of valid identifier values E.g. each barrel layer is a different region because N  changes  Primary specification is in XML files => DOM parser builds IdDictDictionary in memory  Dictionary operations: Can perform various queries on dictionary Extract MultiRange object for a subset of the specification Pack/unpack identifiers (expanded compact 32 bit)

27 March 2003RD Schaffer & C. Arnault CHEP039 Infrastructure: Helper classes  The client interface to the ID dictionary Each detector system has an ID helper class There is a common implementation base class Create/decode compact ids Defines which ids can be created E.g. detector element or readout channel Converts compact id hash id Provides iterators over all identifiers Can provide (limited) access to neighbour identifiers Dictionary contains previous/next, min/max, wrap around

27 March 2003RD Schaffer & C. Arnault CHEP0310 Infrastructure: Helper classes (2)  Part of interface of PixelID helpers Identifier wafer_id ( int barrel_ec, int layer_disk, int phi_module, int eta_module ) const; Identifier pixel_id ( const Identifier& id, int phi_index, int eta_index) const; int barrel_ec (const Identifier& id) const; int layer_disk (const Identifier& id) const; int phi_module (const Identifier& id) const; int eta_module (const Identifier& id) const; int phi_index (const Identifier& id) const; int eta_index (const Identifier& id) const; ; PixelID

27 March 2003RD Schaffer & C. Arnault CHEP0311 More on compact and hash ids  Dictionary packs level values in an optimized binary representation Want to fit all readout channels into 32-bit id Maintaining simple decoding of each of the different levels  I.e. simple “mask and shift” operations Pixel readout channel id requires some special treatment (36 bits) Use generic packing algorithm takes into account non- overlapping sub-regions Packed id stores indices - level values kept in dictionary  Compact id can be used as a key in a binary look-up

27 March 2003RD Schaffer & C. Arnault CHEP0312 More on compact and hash ids (2)  The term “hash id” is not quite exact The dictionary “knows” the extent of values for any subset of compact identifiers This can be used to convert a subset into a sequence of 0 to N-1 Binary look-up becomes constant-time look-up Look-up table size is known and minimized  The hash id allows “pointer-like” navigation while “decoupling” different parts of the model

27 March 2003RD Schaffer & C. Arnault CHEP0313 Impact of identifiers on the data model  Introduced a two-level container used for event data: Currently being used in High Level Trigger studies for data access for reconstruction within region-of-interest (ROI) ROI from LVL1 trigger =>  => hash ids => collections to decode from online byte-stream  Integrated in the triggering of the Athena conversion services Used in offline reconstruction for data access within roads ContainerCollection T: Digit 1..n detElem Hash id Readout channel id

27 March 2003RD Schaffer & C. Arnault CHEP0314 Impact of identifiers on the data model (2)  Connection to detElem transformation matrices Alg DetDescrMgr Descriptor DetDescrElement (position) * 1..* IdHelper 1 DetNode PhyVol children parent position Detector Element hierarchy GeoModel node hierarchy 1..* DetDescr interface Alg root 1 1..* 1 Detector Store Hash id

27 March 2003RD Schaffer & C. Arnault CHEP0315 Summary  We have set up an hierarchical identification system reflecting the structure of the detectors  Used to identify detector elements and readout channels  The identification specification is captured in memory in an “identifier dictionary” Fed by an XML description  Various forms of identifiers are being used: Compact 32-bit identifiers Hash ids provide constant-time look-ups

27 March 2003RD Schaffer & C. Arnault CHEP0316 Summary (2)  Use cases for identifiers include: The connection of event data to detector description Access to event data within regions-of-interest  A new iteration of the definition of our event model is being completed and incorporate for a first time compact and hash ids  The usefulness of the identifiers will be understood better in the coming weeks as studies are performed for the High Level Trigger Technical Design Report