Mokka, main guidelines and future

Similar documents
BoxPlot++ Zeina Azmeh, Fady Hamoui, Marianne Huchard. To cite this version: HAL Id: lirmm

Setup of epiphytic assistance systems with SEPIA

Multimedia CTI Services for Telecommunication Systems

Relabeling nodes according to the structure of the graph

How to simulate a volume-controlled flooding with mathematical morphology operators?

SIM-Mee - Mobilizing your social network

Linux: Understanding Process-Level Power Consumption

Tacked Link List - An Improved Linked List for Advance Resource Reservation

Fault-Tolerant Storage Servers for the Databases of Redundant Web Servers in a Computing Grid

Mapping classifications and linking related classes through SciGator, a DDC-based browsing library interface

Service Reconfiguration in the DANAH Assistive System

Blind Browsing on Hand-Held Devices: Touching the Web... to Understand it Better

X-Kaapi C programming interface

Modularity for Java and How OSGi Can Help

A Voronoi-Based Hybrid Meshing Method

A 64-Kbytes ITTAGE indirect branch predictor

Linked data from your pocket: The Android RDFContentProvider

The Connectivity Order of Links

Comparator: A Tool for Quantifying Behavioural Compatibility

QuickRanking: Fast Algorithm For Sorting And Ranking Data

Comparison of spatial indexes

Open Digital Forms. Hiep Le, Thomas Rebele, Fabian Suchanek. HAL Id: hal

Study on Feebly Open Set with Respect to an Ideal Topological Spaces

FIT IoT-LAB: The Largest IoT Open Experimental Testbed

BugMaps-Granger: A Tool for Causality Analysis between Source Code Metrics and Bugs

DANCer: Dynamic Attributed Network with Community Structure Generator

Reverse-engineering of UML 2.0 Sequence Diagrams from Execution Traces

HySCaS: Hybrid Stereoscopic Calibration Software

YAM++ : A multi-strategy based approach for Ontology matching task

The optimal routing of augmented cubes.

Teaching Encapsulation and Modularity in Object-Oriented Languages with Access Graphs

IntroClassJava: A Benchmark of 297 Small and Buggy Java Programs

Catalogue of architectural patterns characterized by constraint components, Version 1.0

Taking Benefit from the User Density in Large Cities for Delivering SMS

Every 3-connected, essentially 11-connected line graph is hamiltonian

Branch-and-price algorithms for the Bi-Objective Vehicle Routing Problem with Time Windows

Assisted Policy Management for SPARQL Endpoints Access Control

Very Tight Coupling between LTE and WiFi: a Practical Analysis

KeyGlasses : Semi-transparent keys to optimize text input on virtual keyboard

Natural Language Based User Interface for On-Demand Service Composition

From medical imaging to numerical simulations

A N-dimensional Stochastic Control Algorithm for Electricity Asset Management on PC cluster and Blue Gene Supercomputer

Real-Time and Resilient Intrusion Detection: A Flow-Based Approach

Change Detection System for the Maintenance of Automated Testing

Application of RMAN Backup Technology in the Agricultural Products Wholesale Market System

YANG-Based Configuration Modeling - The SecSIP IPS Case Study

A Resource Discovery Algorithm in Mobile Grid Computing based on IP-paging Scheme

Simulations of VANET Scenarios with OPNET and SUMO

The New Territory of Lightweight Security in a Cloud Computing Environment

Representation of Finite Games as Network Congestion Games

Moveability and Collision Analysis for Fully-Parallel Manipulators

Real-Time Collision Detection for Dynamic Virtual Environments

An FCA Framework for Knowledge Discovery in SPARQL Query Answers

NP versus PSPACE. Frank Vega. To cite this version: HAL Id: hal

Malware models for network and service management

Physics-level job configuration

Preliminary analysis of the drive system of the CTA LST Telescope and its integration in the whole PLC architecture

Quality of Service Enhancement by Using an Integer Bloom Filter Based Data Deduplication Mechanism in the Cloud Storage Environment

LaHC at CLEF 2015 SBS Lab

A Methodology for Improving Software Design Lifecycle in Embedded Control Systems

Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression

THE COVERING OF ANCHORED RECTANGLES UP TO FIVE POINTS

Efficient implementation of interval matrix multiplication

A million pixels, a million polygons: which is heavier?

Syrtis: New Perspectives for Semantic Web Adoption

Fuzzy sensor for the perception of colour

Leveraging ambient applications interactions with their environment to improve services selection relevancy

The Athena data dictionary and description language

An Experimental Assessment of the 2D Visibility Complex

XBenchMatch: a Benchmark for XML Schema Matching Tools

XML Document Classification using SVM

MUTE: A Peer-to-Peer Web-based Real-time Collaborative Editor

Robust IP and UDP-lite header recovery for packetized multimedia transmission

Traffic Grooming in Bidirectional WDM Ring Networks

Comparison of radiosity and ray-tracing methods for coupled rooms

Deformetrica: a software for statistical analysis of anatomical shapes

Light field video dataset captured by a R8 Raytrix camera (with disparity maps)

UsiXML Extension for Awareness Support

Using a Medical Thesaurus to Predict Query Difficulty

Kernel perfect and critical kernel imperfect digraphs structure

Structuring the First Steps of Requirements Elicitation

Scan chain encryption in Test Standards

The Proportional Colouring Problem: Optimizing Buffers in Radio Mesh Networks

ASAP.V2 and ASAP.V3: Sequential optimization of an Algorithm Selector and a Scheduler

Scalewelis: a Scalable Query-based Faceted Search System on Top of SPARQL Endpoints

QAKiS: an Open Domain QA System based on Relational Patterns

lambda-min Decoding Algorithm of Regular and Irregular LDPC Codes

Regularization parameter estimation for non-negative hyperspectral image deconvolution:supplementary material

SDLS: a Matlab package for solving conic least-squares problems

Formal modelling of ontologies within Event-B

Hardware Acceleration for Measurements in 100 Gb/s Networks

CTF3 BPM acquisition system

Self-optimisation using runtime code generation for Wireless Sensor Networks Internet-of-Things

Continuous Control of Lagrangian Data

Open Source Software Developer and Project Networks

Emerging and scripted roles in computer-supported collaborative learning

Combined video and laser camera for inspection of old mine shafts

The Sissy Electro-thermal Simulation System - Based on Modern Software Technologies

Privacy-preserving carpooling

Real-time FEM based control of soft surgical robots

Transcription:

Mokka, main guidelines and future P. Mora De Freitas To cite this version: P. Mora De Freitas. Mokka, main guidelines and future. H. Videau; J-C. Brient. International Conference on Linear Collider, Apr 2004, Paris, France. Ecole Polytechnique, pp.441-444. <in2p3-00078900> HAL Id: in2p3-00078900 http://hal.in2p3.fr/in2p3-00078900 Submitted on 8 Jun 2006 HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

Mokka, main guidelines and future Paulo Mora de Freitas Laboratoire Leprince-Ringuet - Ecole polytechnique/in2p3 Since 1999 we have developed Mokka [1], a Geant4 [2] full event simulation allowing a complete reconstruction and energy flow analysis to evaluate the detector designs for the Future Linear Collider (FLC). For the first time the next Mokka release includes code developed elsewhere and committed directly into the Mokka CVS repository in coordination with us. It s so time to recall some Mokka main guidelines which should (or not) be held for this new Mokka era. 1 Mokka main guidelines Three major guidelines have guided us while developing Mokka: 1.1 Let s compare detector designs in a common framework! The time being software simulation is the only way to compare performances of different detector designs currently in consideration for the FLC. To insure that different performances come only from the detector designs all detector models should be simulated in the same simulation framework. It means to simulate the same physics with the same simulation tool, to accept the same generator data files as input. Moreover, keeping the all in a common framework insures that the simulation output data is written in a common data format, so the users are able to apply almost the same reconstruction and analyze programs for all detector designs. In Mokka this requirement is successfully implemented thanks to an external geometry database. Geometry drivers, pieces of C++ code, act as pluggins to connect detector parts to the simulation framework. It insures that the Mokka Kernel doesn t depend anyway on the simulated geometry, so all detector proposals can share the same Geant4 machinery, the same input and output file formats and so on. 1.2 Keep it simple, stand alone as possible and available for all! New approaches for what should be the best detector for the F.L.C. have to be considered. Several groups around the world are interested to contribute with the F.L.C. project and they need a common simulation tool working as a reference test bed for their new ideas. Doors should be kept wide open for all these groups. The common simulation framework has to be stand alone as 441

possible, available for all, just relying on free available software and standard building tools. To keep a native ASCII output format insures that it can be read anywhere. Open wide access to the simulation code has to be provided. Following this guideline Mokka depends only on Geant4 and MySQL [3] free available softwares. Mokka is LCIO [6] compliant but it keeps always an ASCII native file format. Since 2003 the Mokka sources and documentation are available from the Mokka web site [4], everyone is able to download and build it just issuing the standard gmake command. 1.3 Keep trace! To make the best choices is not enough if we cannot reproduce the simulations used to decide it. The time being the simulation for the F.L.C. detectors acts as experiments where impacting results have to be reproducibles anywhere else. For a software it means to keep trace of its development process via a tag police and full release notes. Geometry descriptions of released detector models have to be frozen, improvements should let to new models instead geometry modifications in an old one. The Mokka code is kept in a cvs repository and all released tags can be checked out. Just one reference geometry database [5] is available over broad thanks to the MySQL client-server model. Local database copies can be useful while developing new detector models, but if significant results are achieved the new model has to be released in the reference database. Thanks to this centralized approach output data can refer to the model name, run log files can keep all the necessary information to reproduce a simulation run (detector model, Geant4 and Mokka release tag ids, line command parameters, etc). 2 What we learned for these five years Along these five years several real use cases in detector studies for the F.L.C. let us to re-engineer Mokka a few number of times. We resume here the reasons for these revisions as it can be useful for future developments. 2.1 Geometry have to be shared Simulation, reconstruction and analysis are independent applications which have to share a common detector geometry at run time to insure their coherence. For this reason the geometry layer of Mokka became a general propose Common Geometry Access interface (CGA) to make available the simulated detector geometry for reconstruction, analysis and visualization jobs. CGA 442

provides application interfaces (API) for F77, C, C++ and Java for programmers developing reconstruction and analysis code. CGA implements a few reconstruction utilities and it should be extended in the future, to provide access for information in the geometry database concerning specifically reconstruction and analysis tasks. 2.2 Data format have to be shared Indeed the native ASCII file format insures that everyone in the world can read the Mokka output, of course it s not the best format to save disk space and to organize data. Moreover, the ASCII file format evolves with the software development so reconstruction and analysis applications depend on the Mokka release to run correctly. A better solution is to adopt a persistence model providing an abstract interface to access data. For Mokka it s done thanks to LCIO, which provides APIs for F77, C, C++ and Java. 2.3 New users ask for new functionalities and use cases! The initial Mokka specification approach was to keep a clear separation between generation, simulation, reconstruction and analysis jobs. Recently new users requested to be able to plug analysis as user actions inside the simulation job. In the same way Mokka were specified to be controlled by command line parameters and new users asked to control simulation jobs via steering files. Both new user facilities are now implemented thanks to Frank Gaede (DESY) and it illustrates that new users ask for new functionalities in use cases, so the simulation framework architecture for the F.L.C has to be kept as open as possible. 2.4 We have to work together! The big improvement thanks to the LCIO file format and the recent contributions from Frank Gaede (DESY) and Jeremy McCormick (NICADD) illustrates the power of joining efforts to develop a common simulation framework for the F.L.C. Moreover, only detector specialists are able to describe correctly and to verify the simulation results for the detector part they are concerned. So we have to improve working together by an informal developers committee and its organization around the CVS repository management, code standards, Geant4 - FLC users interface, to bring adequate level of detector descriptions to this common simulation tool. 443

3 Conclusion Improve framework but Keep things simple. Let s compare detector designs in a common framework, to do this We need adequate level of detector descriptions. So... Let s work together!!! References 1. For a full description of Mokka and its status rapport see the previous LCWS04 talk Geant4 simulation for the FLC detector models with Mokka by Gabriel Musat. For an historical view, see also the one for the LCW2000 at http://www-lc.fnal.gov/proceedings/ proceedings.html#simulation/freitas.ps. 2. Geant4 Home Page, http://wwwinfo.cern.ch/asd/geant4/geant4.html. 3. A free of charge and almost standard SGBD server available for Lynux and Windows systems, see http://www.mysql.com/. 4. http://polywww.in2p3.fr/geant4/tesla/www/ MOKKA/MOKKA.html. 5. http://polywww.in2p3.fr/geant4/tesla/www/mokka/ software/database/phpmyadmin/index.php3 6. LCIO, a persistency framework for future linear collider detector simulations, http://www-it.desy.de/physics/projects/simsoft/lcio/ 444