Solutions for Efficient Memory Access for Cubic Lattices and Random - PowerPoint PPT Presentation

Solutions for Efficient Memory Access for Cubic Lattices and Random Number Algorithms GTC 2015 Speaker: Dr. Matteo Lulli Prof. M. Bernaschi and Prof. G. Parisi March the 19th, 2015 Matteo Lulli - arXiv: 1114.0127 - lullimat.org Solutions for Efficient Memory Access for Cubic Lattices and Random Number Algorithms 1 / 31

Outlook Cubic stencils 1 PRNGs 2 Multi-GPU and MPI 3 Results 4 Conclusions & Perspectives 5 Matteo Lulli - arXiv: 1114.0127 - lullimat.org Solutions for Efficient Memory Access for Cubic Lattices and Random Number Algorithms 2 / 31

Motivations Phase Transitions in disordered systems Matteo Lulli - arXiv: 1114.0127 - lullimat.org Solutions for Efficient Memory Access for Cubic Lattices and Random Number Algorithms 3 / 31

Motivations Phase Transitions in disordered systems Equilibrium Monte Carlo analysis works well for non-disordered systems Disordered systems are very hard to equilibrate Matteo Lulli - arXiv: 1114.0127 - lullimat.org Solutions for Efficient Memory Access for Cubic Lattices and Random Number Algorithms 3 / 31

Motivations Phase Transitions in disordered systems Equilibrium Monte Carlo analysis works well for non-disordered systems Disordered systems are very hard to equilibrate A large number of disorder realizations, samples , is required 3D Ising spin glass at most L = 40 equilibrated so far (Janus, FPGA dedicated machine) Matteo Lulli - arXiv: 1114.0127 - lullimat.org Solutions for Efficient Memory Access for Cubic Lattices and Random Number Algorithms 3 / 31

Motivations Phase Transitions in disordered systems Equilibrium Monte Carlo analysis works well for non-disordered systems Disordered systems are very hard to equilibrate A large number of disorder realizations, samples , is required 3D Ising spin glass at most L = 40 equilibrated so far (Janus, FPGA dedicated machine) Robust out-of-equilibrium methods for the study of phase transitions would be very useful Matteo Lulli - arXiv: 1114.0127 - lullimat.org Solutions for Efficient Memory Access for Cubic Lattices and Random Number Algorithms 3 / 31

Motivations Phase Transitions in disordered systems Equilibrium Monte Carlo analysis works well for non-disordered systems Disordered systems are very hard to equilibrate A large number of disorder realizations, samples , is required 3D Ising spin glass at most L = 40 equilibrated so far (Janus, FPGA dedicated machine) Robust out-of-equilibrium methods for the study of phase transitions would be very useful Why GPUs Even with out-of-equilibrium methods usual CPUs are not sufficiently powerful in order to obtain good estimates Matteo Lulli - arXiv: 1114.0127 - lullimat.org Solutions for Efficient Memory Access for Cubic Lattices and Random Number Algorithms 3 / 31

Outline for section 1 Cubic stencils 1 PRNGs 2 Multi-GPU and MPI 3 Results 4 Conclusions & Perspectives 5 Matteo Lulli - arXiv: 1114.0127 - lullimat.org Solutions for Efficient Memory Access for Cubic Lattices and Random Number Algorithms 4 / 31

Standard checkerboard pattern Nearest-neighbours based problems in spz 3D spy smx i spx smy smz Matteo Lulli - arXiv: 1114.0127 - lullimat.org Solutions for Efficient Memory Access for Cubic Lattices and Random Number Algorithms 5 / 31

Standard checkerboard pattern Nearest-neighbours based problems in spz 3D spy Cubic lattice of linear size L = 2 n : smx Checkerboard colouring i spx Each lattice site has nearest neighbours smy of the other colour smz Matteo Lulli - arXiv: 1114.0127 - lullimat.org Solutions for Efficient Memory Access for Cubic Lattices and Random Number Algorithms 5 / 31

Standard checkerboard pattern Nearest-neighbours based problems in spz 3D spy Cubic lattice of linear size L = 2 n : smx Checkerboard colouring i spx Each lattice site has nearest neighbours smy of the other colour smz Allocation choices Unified allocation: one array Matteo Lulli - arXiv: 1114.0127 - lullimat.org Solutions for Efficient Memory Access for Cubic Lattices and Random Number Algorithms 5 / 31

Standard checkerboard pattern Nearest-neighbours based problems in spz 3D spy Cubic lattice of linear size L = 2 n : smx Checkerboard colouring i spx Each lattice site has nearest neighbours smy of the other colour smz Allocation choices Unified allocation: one array Separated allocation: two arrays Matteo Lulli - arXiv: 1114.0127 - lullimat.org Solutions for Efficient Memory Access for Cubic Lattices and Random Number Algorithms 5 / 31

Standard checkerboard pattern Nearest-neighbours based problems in spz 3D spy Cubic lattice of linear size L = 2 n : smx Checkerboard colouring i spx Each lattice site has nearest neighbours smy of the other colour smz Allocation choices Unified allocation: one array Separated allocation: two arrays The parity, ( − 1) x i + y i + z i , of each lattice site has to be taken into account Matteo Lulli - arXiv: 1114.0127 - lullimat.org Solutions for Efficient Memory Access for Cubic Lattices and Random Number Algorithms 5 / 31

Sliced checkerboard pattern: definition It is always possible to remap the lattice sites Yavors’kii et al. , Heisenberg spin glass, ’snake-like’ pattern, unified Ferrero et al. , Potts 2D, separated Sliced scheme y ′ y 6 7 6 0 7 0 4 4 5 5 2 2 3 3 0 0 0 0 0 1 1 0 x ′ x 0 0 z ′ = 0 z = 0 Periodic boundary conditions are necessary Matteo Lulli - arXiv: 1114.0127 - lullimat.org Solutions for Efficient Memory Access for Cubic Lattices and Random Number Algorithms 6 / 31

Sliced checkerboard pattern: definition It is always possible to remap the lattice sites Yavors’kii et al. , Heisenberg spin glass, ’snake-like’ pattern, unified Ferrero et al. , Potts 2D, separated Sliced scheme y ′ y 6 7 6 0 7 0 4 4 5 5 2 2 3 3 0 0 0 0 0 1 1 0 0 x ′ x 0 0 z ′ = 0 z = 0 Periodic boundary conditions are necessary Matteo Lulli - arXiv: 1114.0127 - lullimat.org Solutions for Efficient Memory Access for Cubic Lattices and Random Number Algorithms 6 / 31

Sliced checkerboard pattern: definition It is always possible to remap the lattice sites Yavors’kii et al. , Heisenberg spin glass, ’snake-like’ pattern, unified Ferrero et al. , Potts 2D, separated Sliced scheme y ′ y 6 7 6 0 7 0 4 4 5 5 2 2 3 3 0 0 0 0 0 1 1 0 0 2 x ′ x 0 0 z ′ = 0 z = 0 Periodic boundary conditions are necessary Matteo Lulli - arXiv: 1114.0127 - lullimat.org Solutions for Efficient Memory Access for Cubic Lattices and Random Number Algorithms 6 / 31

Sliced checkerboard pattern: definition It is always possible to remap the lattice sites Yavors’kii et al. , Heisenberg spin glass, ’snake-like’ pattern, unified Ferrero et al. , Potts 2D, separated Sliced scheme y ′ y 6 7 6 0 7 0 4 4 5 5 2 2 3 3 0 0 0 0 0 1 1 0 0 2 5 x ′ x 0 0 z ′ = 0 z = 0 Periodic boundary conditions are necessary Matteo Lulli - arXiv: 1114.0127 - lullimat.org Solutions for Efficient Memory Access for Cubic Lattices and Random Number Algorithms 6 / 31

Sliced checkerboard pattern: definition It is always possible to remap the lattice sites Yavors’kii et al. , Heisenberg spin glass, ’snake-like’ pattern, unified Ferrero et al. , Potts 2D, separated Sliced scheme y ′ y 6 7 6 0 7 0 4 4 5 5 2 2 3 3 0 0 0 0 0 1 1 0 0 2 5 7 x ′ x 0 0 z ′ = 0 z = 0 Periodic boundary conditions are necessary Matteo Lulli - arXiv: 1114.0127 - lullimat.org Solutions for Efficient Memory Access for Cubic Lattices and Random Number Algorithms 6 / 31

Sliced checkerboard pattern: definition It is always possible to remap the lattice sites Yavors’kii et al. , Heisenberg spin glass, ’snake-like’ pattern, unified Ferrero et al. , Potts 2D, separated Sliced scheme y ′ y 14 14 15 15 12 12 13 13 10 10 11 11 10 0 8 8 0 9 9 0 0 2 5 7 x ′ x 0 0 z ′ = 0 z = 1 Periodic boundary conditions are necessary Matteo Lulli - arXiv: 1114.0127 - lullimat.org Solutions for Efficient Memory Access for Cubic Lattices and Random Number Algorithms 6 / 31

Sliced checkerboard pattern: definition It is always possible to remap the lattice sites Yavors’kii et al. , Heisenberg spin glass, ’snake-like’ pattern, unified Ferrero et al. , Potts 2D, separated Sliced scheme y ′ y 14 14 15 15 12 12 13 13 10 10 11 11 10 12 0 8 0 8 9 9 0 0 2 5 7 x ′ x 0 0 z ′ = 0 z = 1 Periodic boundary conditions are necessary Matteo Lulli - arXiv: 1114.0127 - lullimat.org Solutions for Efficient Memory Access for Cubic Lattices and Random Number Algorithms 6 / 31

Sliced checkerboard pattern: definition It is always possible to remap the lattice sites Yavors’kii et al. , Heisenberg spin glass, ’snake-like’ pattern, unified Ferrero et al. , Potts 2D, separated Sliced scheme y ′ y 14 14 15 15 12 12 13 13 10 10 11 11 10 12 15 0 8 0 8 9 9 0 0 2 5 7 x ′ x 0 0 z ′ = 0 z = 1 Periodic boundary conditions are necessary Matteo Lulli - arXiv: 1114.0127 - lullimat.org Solutions for Efficient Memory Access for Cubic Lattices and Random Number Algorithms 6 / 31

Solutions for Efficient Memory Access for Cubic Lattices and Random - PowerPoint PPT Presentation

Solutions for Efficient Memory Access for Cubic Lattices and Random Number Algorithms GTC 2015 Speaker: Dr. Matteo Lulli Prof. M. Bernaschi and Prof. G. Parisi March the 19th, 2015 Matteo Lulli - arXiv: 1114.0127 - lullimat.org Solutions for

Lattice Greens Functions of the Higher-Dimensional Face-Centered Cubic Lattices Christoph

Configurable and Efficient Memory Access Tracing via Selective Expression-based x86 Binary

sRDMA Efficient NICbased Authentication and Encryption for Remote Direct Memory Access

UMBC A B M A L T F O U M B C I M Y O R T 1 (12/8/04) I E S R C E O V U

Secure and Efficient Access to Outsourced Data Secure and Efficient Access to Outsourced Data

1 Main memory usually divided into two partitions: Resident operating system, usually

Multilevel LDPC Lattices with Efficient Encoding and Decoding and a Generalization of Construction

More Efficient Cryptographic Multilinear Maps from Ideal Lattices Ron Steinfeld Clayton School

Last class: Virtual Memory Today: Virtual Memory Uses Efficient Use of Physical

Stabilizing Cubic HfO 2 Doped Y 2 O 3 using TEM Stabilizing Cubic HfO 2 Doped Y 2 O 3 using TEM

Memory Management Memory Manager Requirements Minimize primary memory access time

Memory Access Patterns: The Missing Piece of the Multi-GPU Puzzle Tal Ben-Nun , Ely Levy, Amnon

Coordinated and Efficient Huge Page Management with Ingens Youngjin Kwon , Hangchen Yu, Simon

Some Quasi-Periodic and almost periodic solutions in coupled map lattices and flows E. Fontich,

Parallel Programming and Heterogeneous Computing Non-Uniform Memory Access Max Plauth, Sven

Simple and Efficient Two-Server ORAM Dov Gordon (George Mason U.) Jonathan Katz (U. of Maryland)

1 Programs must be brought (from disk) into memory for them to be run Main memory and

Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices Chris Peikert

In-memory In-memory Analytical Platforms Aditya Satyadev Director, BizAcuity Solutions Sachin

No/fied Access: Extending Remote Memory Access Programming

Virtual Memory - III Effective Access Time (EAT) EAT = (1 p ) x memory access + p x (page

Cache 10/27/16 The Memory Hierarchy Smaller On 1 cycle to access Chip Faster Registers CPU

LECTURE 12 Virtual Memory VIRTUAL MEMORY Just as a cache can provide fast, easy access to

MEMORY HIERARCHY RANDOM ACCESS MEMORY Key features RAM is traditionally packaged as a chip.