INFSO-RI-508833 Enabling Grids for E-sciencE www.eu-egee.org SALUTE – Grid application for problems in quantum transport E. Atanassov, T. Gurov, A. Karaivanova,

Slides:



Advertisements
Similar presentations
Bayesian Belief Propagation
Advertisements

Dialogue Policy Optimisation
Ionization of the Hydrogen Molecular Ion by Ultrashort Intense Elliptically Polarized Laser Radiation Ryan DuToit Xiaoxu Guan (Mentor) Klaus Bartschat.
Approaches to Data Acquisition The LCA depends upon data acquisition Qualitative vs. Quantitative –While some quantitative analysis is appropriate, inappropriate.
1 Quantum Monte Carlo Methods Jian-Sheng Wang Dept of Computational Science, National University of Singapore.
FIN 685: Risk Management Topic 5: Simulation Larry Schrenk, Instructor.
Chapter 20 Basic Numerical Procedures
1 Lecture 12 Monte Carlo methods in parallel computing Parallel Computing Fall 2008.
Generating Continuous Random Variables some. Quasi-random numbers So far, we learned about pseudo-random sequences and a common method for generating.
Large-Scale Density Functional Calculations James E. Raynolds, College of Nanoscale Science and Engineering Lenore R. Mullin, College of Computing and.
Physics of fusion power
Analysis of Monte Carlo Integration Fall 2012 By Yaohang Li, Ph.D.
Exercise problems for students taking the Programming Parallel Computers course. Janusz Kowalik Piotr Arlukowicz Tadeusz Puzniakowski Informatics Institute.
Monte Carlo Simulation of Interacting Electron Models by a New Determinant Approach Mucheng Zhang (Under the direction of Robert W. Robinson and Heinz-Bernd.
Kalman filtering techniques for parameter estimation Jared Barber Department of Mathematics, University of Pittsburgh Work with Ivan Yotov and Mark Tronzo.
Particle Transport Methods in Parallel Environments
A SCALABLE LIBRARY FOR PSEUDORANDOM NUMBER GENERATION ALGORITHM 806: SPRNG.
Workload Management WP Status and next steps Massimo Sgaravatto INFN Padova.
Tzveta Apostolova Institute for Nuclear Research and Nuclear Energy,
EGEE-II INFSO-RI Enabling Grids for E-sciencE EGEE and gLite are registered trademarks Computational Chemistry and Material Science.
Probabilistic Mechanism Analysis. Outline Uncertainty in mechanisms Why consider uncertainty Basics of uncertainty Probabilistic mechanism analysis Examples.
INFSO-RI Enabling Grids for E-sciencE InterExpo Center, , Sofia Participation of Bulgaria in the European Grid Infrastructure.
Grid Workload Management & Condor Massimo Sgaravatto INFN Padova.
Enabling Grids for E-sciencE ENEA and the EGEE project gLite and interoperability Andrea Santoro, Carlo Sciò Enea Frascati, 22 November.
INFSO-RI Enabling Grids for E-sciencE An MRI Simulation Web Portal on EGEE Grid Architecture F. Bellet, I. Nistoreanu,
INFSO-RI Enabling Grids for E-sciencE Project Gridification: the UNOSAT experience Patricia Méndez Lorenzo CERN (IT-PSS/ED) CERN,
Module 1: Statistical Issues in Micro simulation Paul Sousa.
Stochastic Monte Carlo methods for non-linear statistical inverse problems Benjamin R. Herman Department of Electrical Engineering City College of New.
Statistical Sampling-Based Parametric Analysis of Power Grids Dr. Peng Li Presented by Xueqian Zhao EE5970 Seminar.
Grid Workload Management Massimo Sgaravatto INFN Padova.
Monte Carlo Methods Versatile methods for analyzing the behavior of some activity, plan or process that involves uncertainty.
Tarek A. El-Moselhy and Luca Daniel
EGEE-II INFSO-RI Enabling Grids for E-sciencE EGEE and gLite are registered trademarks EGEE – paving the way for a sustainable infrastructure.
Basic Numerical Procedures Chapter 19 1 Options, Futures, and Other Derivatives, 7th Edition, Copyright © John C. Hull 2008.
Enabling Grids for E-sciencE EGEE-III INFSO-RI Using DIANE for astrophysics applications Ladislav Hluchy, Viet Tran Institute of Informatics Slovak.
Author: B. C. Bromley Presented by: Shuaiyuan Zhou Quasi-random Number Generators for Parallel Monte Carlo Algorithms.
Ames Research CenterDivision 1 Information Power Grid (IPG) Overview Anthony Lisotta Computer Sciences Corporation NASA Ames May 2,
Time-dependent Schrodinger Equation Numerical solution of the time-independent equation is straightforward constant energy solutions do not require us.
Computational Aspects of Multi-scale Modeling Ahmed Sameh, Ananth Grama Computing Research Institute Purdue University.
Sep 08, 2009 SPEEDUP – Optimization and Porting of Path Integral MC Code to New Computing Architectures V. Slavnić, A. Balaž, D. Stojiljković, A. Belić,
Lesson 4: Computer method overview
NCN nanoHUB.org Wagner The basics of quantum Monte Carlo Lucas K. Wagner Computational Nanosciences Group University of California, Berkeley In collaboration.
INFSO-RI Enabling Grids for E-sciencE Workflows in Fusion applications José Luis Vázquez-Poletti Universidad.
Parallelization of likelihood functions for data analysis Alfio Lazzaro CERN openlab Forum on Concurrent Programming Models and Frameworks.
ESFRI & e-Infrastructure Collaborations, EGEE’09 Krzysztof Wrona September 21 st, 2009 European XFEL.
SEE-GRID-2 The SEE-GRID-2 initiative is co-funded by the European Commission under the FP6 Research Infrastructures contract no Ultra-fast Semiconductor.
INFSO-RI User Forum 1-3 March 2006 Enabling Grids for E-sciencE Worldwide ozone distribution by using Grid infrastructure ESA: L.
EGEE-III INFSO-RI Enabling Grids for E-sciencE EGEE and gLite are registered trademarks Abel Carrión Ignacio Blanquer Vicente Hernández.
INFSO-RI Enabling Grids for E-sciencE Application of GRID resource for modeling of charge transfer in DNA Nadezhda S. Fialko, Victor.
Application of the MCMC Method for the Calibration of DSMC Parameters James S. Strand and David B. Goldstein The University of Texas at Austin Sponsored.
Markov Chain Monte Carlo for LDA C. Andrieu, N. D. Freitas, and A. Doucet, An Introduction to MCMC for Machine Learning, R. M. Neal, Probabilistic.
Variance Reduction Fall 2012
A. Ambrosetti, F. Pederiva and E. Lipparini
Scheduling MPI Workflow Applications on Computing Grids Juemin Zhang, Waleed Meleis, and David Kaeli Electrical and Computer Engineering Department, Northeastern.
Università di Perugia Enabling Grids for E-sciencE Status of and requirements for Computational Chemistry NA4 – SA1 Meeting – 6 th April.
Monte Carlo Linear Algebra Techniques and Their Parallelization Ashok Srinivasan Computer Science Florida State University
INFSO-RI Enabling Grids for E-sciencE Using of GANGA interface for Athena applications A. Zalite / PNPI.
INFSO-RI Enabling Grids for E-sciencE Introduction to Grid Computing, EGEE and Bulgarian Grid Initiatives, Sofia, South.
INFSO-RI Enabling Grids for E-sciencE Clermond-Ferrant (FR), February 11 th -14 th, 2008 Vangelis Daskalakis 1, Manos Giatromanolakis.
EGEE-III INFSO-RI Enabling Grids for E-sciencE Nov. 18, EGEE and gLite are registered trademarks High-End Computing - Clusters.
Enabling Grids for E-sciencE LRMN ThIS on the Grid Sorina CAMARASU.
INFSO-RI Enabling Grids for E-sciencE Kurchatov Institute Genetic Stellarator Optimisation in Grid Vladimir Voznesensky
INFSO-RI Enabling Grids for E-sciencE EGEE is a project funded by the European Union under contract IST Report from.
Monte Carlo Methods and Grid Computing
Bulgarian Grid Applications
CNRS applications in medical imaging
CompChem VO: User experience using MPI
Introduction Motivation Objective
Stratified Sampling for Data Mining on the Deep Web
Lecture 4 - Monte Carlo improvements via variance reduction techniques: antithetic sampling Antithetic variates: for any one path obtained by a gaussian.
Presentation transcript:

INFSO-RI Enabling Grids for E-sciencE SALUTE – Grid application for problems in quantum transport E. Atanassov, T. Gurov, A. Karaivanova, M. Nedjalkov Institute for Parallel Processing Bulgarian Academy of Sciences

Enabling Grids for E-sciencE INFSO-RI EGEE User Forum, CERN, Geneva, 1-3 March Outline Introduction (What is SALUTE) Problem description Monte Carlo methods Grid implementation and results Conclusion and future work

Enabling Grids for E-sciencE INFSO-RI EGEE User Forum, CERN, Geneva, 1-3 March SALUTE SALUTE (Stochastic ALgorithms for Ultra-fast Transport in sEmiconductors) is a Grid application developed for solving computationally intensive problems in quantum transport. It consists of a bunch of Monte Carlo algorithms for solving quantum kinetic equations which describe the considered model. The quantum kinetic model: a femtosecond relaxation process of optically excited carriers in one-band semiconductors or quantum wires. The electron-phonon interaction is switched on after a laser pulse creates an initial electron distribution. Two cases are considered – with and without applied electric field. Using SALUTE innovative results for different materials can be obtained. Here we present the first version of SALUTE (the results are for GaAs).

Enabling Grids for E-sciencE INFSO-RI EGEE User Forum, CERN, Geneva, 1-3 March

Enabling Grids for E-sciencE INFSO-RI EGEE User Forum, CERN, Geneva, 1-3 March The integral Equation

Enabling Grids for E-sciencE INFSO-RI EGEE User Forum, CERN, Geneva, 1-3 March The Monte Carlo approach N independent RANDOM WALKS :

Enabling Grids for E-sciencE INFSO-RI EGEE User Forum, CERN, Geneva, 1-3 March Monte Carlo Methods Monte Carlo Methods (MCM) provide numerical solutions to a variety of problems: –Multidimensional integrals and integral equations; –Boundary value problems in complicated domains; –Stochastic differential equations; –Eigenvalue problems, etc. through statistical sampling. They form the computational foundation for many fields including transport theory, quantum physics, computational chemistry, financial mathematics, etc. Time consuming but inherently parallel

Enabling Grids for E-sciencE INFSO-RI EGEE User Forum, CERN, Geneva, 1-3 March Monte Carlo Methods (cont.) J is a quantity to be estimated via a MCM (in our application: different functionals of the solution of an integral equation) θ is a random variable with E[θ]=J θ N is the estimator with N samples σ(θ)N -1/2 is the statistical error Reducing the error:  Variance reduction (antithetic variates, control variates, stratification, importance sampling)  Using more powerful random numbers (quasirandom numbers instead of pseudorandom)

Enabling Grids for E-sciencE INFSO-RI EGEE User Forum, CERN, Geneva, 1-3 March Parallel Monte Carlo Parallelism is an alternative way to accelerate the convergence of a Monte Carlo computation If n processors execute n independent copies of a MC computation, the accumulated result will have a variance n time smaller than that of a single copy A computational grid has attractively tremendous large amount of computational power  Effectively exploring the power of distributed MC application requires that the underlying random number streams in each subtask are independent in a statistical sense  Running quasi-MC in parallel is more challenging because division into subtasks is a non-trivial problem

Enabling Grids for E-sciencE INFSO-RI EGEE User Forum, CERN, Geneva, 1-3 March Numerical tests (parameters) Scalable Parallel Random Number Generator library: independent and non-overlapping r.n. sequences (SPRNG) ; GaAs material parametes; T=0 K, with and without electric field. The initial condition – product of two Gaussian distributions of the energy and space (inhomogeneous case); one Gaussian distribution of the energy (homogeneous case) Results: –Wigner function, energy distribution, electron density (inhomogeneous case); –Energy distribution and intra-collisional field effect (homogeneous case).

Enabling Grids for E-sciencE INFSO-RI EGEE User Forum, CERN, Geneva, 1-3 March Example execution times

Enabling Grids for E-sciencE INFSO-RI EGEE User Forum, CERN, Geneva, 1-3 March Grid implementation –MPI and single-processor versions developed –MPI version run at MPI enabled sites with:  Pbs jobmanager (with shared home directories)  lcgpbs batch system (without shared home directories). –Single processor version run in two modes:  input fixed at job submission time  input downloaded via https protocol from node running secure web service.

Enabling Grids for E-sciencE INFSO-RI EGEE User Forum, CERN, Geneva, 1-3 March SEE sites Sites running SALUTE BG01-IPP GR-01-AUTH GR-02-UoM GR-04-FORTH-ICS HG-01-GRNET HG-04-FORTH RO-01-ICI Jobs successfully executed: > 1000

Enabling Grids for E-sciencE INFSO-RI EGEE User Forum, CERN, Geneva, 1-3 March Collision broadening and memory effects The electron energy distribution |k|.f(0,|k|,t) version |k|^2 for a long evolution time. The relaxation leads to a time-dependent broadening of the replicas.

Enabling Grids for E-sciencE INFSO-RI EGEE User Forum, CERN, Geneva, 1-3 March Quantum scattering- accelerating field Solutions |k|.f(0,0,k_z,t) versus |kxk|, at positive direction of the z-axis. The electric field is 0, 6 kV/cm, and 12 kV/cm. The replicas are shifted to the right by the increasing electric field. Field direction ---->>

Enabling Grids for E-sciencE INFSO-RI EGEE User Forum, CERN, Geneva, 1-3 March Wigner Function 800 x 260 points t=175 fs

Enabling Grids for E-sciencE INFSO-RI EGEE User Forum, CERN, Geneva, 1-3 March Energy relaxation process: collisional broadening Accumulation From 10 fs up 250 fs

Enabling Grids for E-sciencE INFSO-RI EGEE User Forum, CERN, Geneva, 1-3 March Comparison of MPI vs single processor version Positive sides: MPI provides results faster (within the day) Single CPU version allows sites without MPI support to be utilized Single CPU version allows a lot of jobs to be submitted and executed Negative sides: MPI support on production service has some inefficiencies and problems A mysql database backend has to be used in the single CPU version for recording information about succesful/unsuccesful jobs, job inputs and outputs.

Enabling Grids for E-sciencE INFSO-RI EGEE User Forum, CERN, Geneva, 1-3 March Conclusion and Future Work The first version of SALUTE integrates MC algorithms for evaluating ultrafast relaxation processes in one band semiconductors and quantum wire. Successful tests of the application were performed at several South East European ROC EGEE sites using the Resource Broker at BG01-IPP. The test results of the MPI version show excellent parallel efficiency. SALUTE solves computationally intensive problems. By using the Grid environment provided by the EGEE project, we were able to obtain accurate results within a reasonable timeframe. We are working on improving the algorithms and the job submission procedures in order to obtain results for larger evolution times. SALUTE can provide results for other types of semiconductors like Si or for composite materials.