asynchronously parallelised percolation on distributed
play

Asynchronously Parallelised Percolation on Distributed Machines - PowerPoint PPT Presentation

Dec 11, 2023 •327 likes •674 views

Asynchronously Parallelised Percolation on Distributed Machines Gunnar Pruessner 1 Nicholas R. Moloney 2 1 Mathematics Institute, University of Warwick, UK, g.pruessner@warwick.ac.uk 2 Lornd Etvs University Budapest, Hungary Warwick CSC @

  1. Asynchronously Parallelised Percolation on Distributed Machines Gunnar Pruessner 1 Nicholas R. Moloney 2 1 Mathematics Institute, University of Warwick, UK, g.pruessner@warwick.ac.uk 2 Loránd Eötvös University Budapest, Hungary Warwick CSC @ Lunchtime Seminar, May 2007 g.pruessner@warwick.ac.uk (WMI) Parallelised Percolation Warwick, 05/2007 1 / 24

  2. Outline Introduction 1 Hoshen-Kopelman Algorithm 2 The Parallel Algorithm 3 Results 4 g.pruessner@warwick.ac.uk (WMI) Parallelised Percolation Warwick, 05/2007 2 / 24

  3. Introduction Illustration of the model Sites occupied with Bonds active with probability p s probability p b Definition of a cluster sites connected through occupied sites and active bonds g.pruessner@warwick.ac.uk (WMI) Parallelised Percolation Warwick, 05/2007 3 / 24

  4. Introduction Illustration of the model Sites occupied with Bonds active with probability p s probability p b Definition of a cluster sites connected through occupied sites and active bonds g.pruessner@warwick.ac.uk (WMI) Parallelised Percolation Warwick, 05/2007 3 / 24

  5. Introduction Illustration of the model Sites occupied with Bonds active with probability p s probability p b Definition of a cluster sites connected through occupied sites and active bonds g.pruessner@warwick.ac.uk (WMI) Parallelised Percolation Warwick, 05/2007 3 / 24

  6. Introduction Key features I Order parameter θ : fraction in the “infinite” cluster In 2D: β = 5 / 36 g.pruessner@warwick.ac.uk (WMI) Parallelised Percolation Warwick, 05/2007 4 / 24

  7. Introduction Key features II Cluster size distribution (density of s -clusters per site): P ( s ) = as − τ G ( b ( p − p c ) s σ ) where τ = 187 / 91 and σ = 36 / 91. g.pruessner@warwick.ac.uk (WMI) Parallelised Percolation Warwick, 05/2007 5 / 24

  8. Introduction Key features III Crossing probability for different system sizes. g.pruessner@warwick.ac.uk (WMI) Parallelised Percolation Warwick, 05/2007 6 / 24

  9. Introduction Why percolation? Long history (Flory 1941) Renaissance because of Conformal Field Theory (Langlands et al. 1992, Cardy 1992) Numerics as a guide ◮ Study leading to Conformal Field Theory ◮ Multiple spanning clusters Open questions ◮ Higher dimensions ◮ universality ◮ relation lattice ← → Conformal Field Theory g.pruessner@warwick.ac.uk (WMI) Parallelised Percolation Warwick, 05/2007 7 / 24

  10. Introduction Why percolation? Long history (Flory 1941) Renaissance because of Conformal Field Theory (Langlands et al. 1992, Cardy 1992) Numerics as a guide ◮ Study leading to Conformal Field Theory ◮ Multiple spanning clusters Open questions ◮ Higher dimensions ◮ universality ◮ relation lattice ← → Conformal Field Theory g.pruessner@warwick.ac.uk (WMI) Parallelised Percolation Warwick, 05/2007 7 / 24

  11. Introduction Why percolation? Long history (Flory 1941) Renaissance because of Conformal Field Theory (Langlands et al. 1992, Cardy 1992) Numerics as a guide ◮ Study leading to Conformal Field Theory ◮ Multiple spanning clusters Open questions ◮ Higher dimensions ◮ universality ◮ relation lattice ← → Conformal Field Theory g.pruessner@warwick.ac.uk (WMI) Parallelised Percolation Warwick, 05/2007 7 / 24

  12. Introduction A brief history I Three dimensional polymers: Flory 1941 Mathematics: Hammersley and Broadbent 1954 p c = 1 / 2 in 2D bond percolation conjectured in 1955 θ ( 1 / 2 ) = 0 by Harris, 1960 p c = 1 / 2 tackled by Sykes and Essam, 1963 “Dormant state” Details: Grimmet, Percolation , 2000 g.pruessner@warwick.ac.uk (WMI) Parallelised Percolation Warwick, 05/2007 8 / 24

  13. Introduction A brief history II Back on stage: Russo, and Seymour and Welsh, 1978 Kesten: p c = 1 / 2, 1980 Uniqueness of infinite cluster: Newman and Schulman, 1981 Renaissance because of Conformal Field Theory for crossing probabilities: Langlands et al. 1992, Cardy 1992 Multiple spanning clusters: Hu and Lin 1996, Aizenman 1997, Cardy 1998 Percolation is SLE with κ = 6, Smirnov 2001 g.pruessner@warwick.ac.uk (WMI) Parallelised Percolation Warwick, 05/2007 9 / 24

  14. Hoshen-Kopelman Algorithm Outline Introduction 1 Hoshen-Kopelman Algorithm 2 The Parallel Algorithm 3 Results 4 g.pruessner@warwick.ac.uk (WMI) Parallelised Percolation Warwick, 05/2007 10 / 24

  15. Hoshen-Kopelman Algorithm The Algorithm: Hoshen-Kopelman Overview scan row by row label clusters using list of labels remember configuration of “active” sites (Hoshen and Kopelman, 1976) g.pruessner@warwick.ac.uk (WMI) Parallelised Percolation Warwick, 05/2007 11 / 24

  16. Hoshen-Kopelman Algorithm The Algorithm: Hoshen-Kopelman Step by step g.pruessner@warwick.ac.uk (WMI) Parallelised Percolation Warwick, 05/2007 12 / 24

  17. Hoshen-Kopelman Algorithm The Algorithm: Hoshen-Kopelman Step by step g.pruessner@warwick.ac.uk (WMI) Parallelised Percolation Warwick, 05/2007 12 / 24

  18. Hoshen-Kopelman Algorithm The Algorithm: Hoshen-Kopelman Step by step g.pruessner@warwick.ac.uk (WMI) Parallelised Percolation Warwick, 05/2007 12 / 24

  19. Hoshen-Kopelman Algorithm The Algorithm: Hoshen-Kopelman Step by step g.pruessner@warwick.ac.uk (WMI) Parallelised Percolation Warwick, 05/2007 12 / 24

  20. Hoshen-Kopelman Algorithm The Algorithm: Hoshen-Kopelman Step by step g.pruessner@warwick.ac.uk (WMI) Parallelised Percolation Warwick, 05/2007 12 / 24

  21. Hoshen-Kopelman Algorithm The Algorithm: Hoshen-Kopelman Step by step g.pruessner@warwick.ac.uk (WMI) Parallelised Percolation Warwick, 05/2007 12 / 24

  22. The Parallel Algorithm Outline Introduction 1 Hoshen-Kopelman Algorithm 2 The Parallel Algorithm 3 Results 4 g.pruessner@warwick.ac.uk (WMI) Parallelised Percolation Warwick, 05/2007 13 / 24

  23. The Parallel Algorithm The parallel algorithm Border Preparation (N. R. Moloney and G.P . 2003) scan around the boundary move roots into boundary g.pruessner@warwick.ac.uk (WMI) Parallelised Percolation Warwick, 05/2007 14 / 24

  24. The Parallel Algorithm The parallel algorithm Border Preparation – Comparison (N. R. Moloney and G.P . 2003) scan around the boundary move roots into boundary g.pruessner@warwick.ac.uk (WMI) Parallelised Percolation Warwick, 05/2007 15 / 24

  25. The Parallel Algorithm The Algorithm Gluing Small patches produced at slave nodes (asynchronous) Assembly at master nodes: ◮ Shift labels for uniqueness ◮ Redirect roots — larger cluster prevails related: (Rapaport, 1992) g.pruessner@warwick.ac.uk (WMI) Parallelised Percolation Warwick, 05/2007 16 / 24

  26. The Parallel Algorithm The Algorithm Features Huge lattices: 10 6 realisations of 30 000 × 30 000 or a single lattice 22 . 2 · 10 6 × 22 . 2 · 10 6 (hierarchical nodes). Flexibility (boundary conditions, aspect ratios) Reduced correlations by rotating, mirroring and permuting Asynchronous Minimal hardware (CPU, memory, network) g.pruessner@warwick.ac.uk (WMI) Parallelised Percolation Warwick, 05/2007 17 / 24

  27. Results Outline Introduction 1 Hoshen-Kopelman Algorithm 2 The Parallel Algorithm 3 Results 4 g.pruessner@warwick.ac.uk (WMI) Parallelised Percolation Warwick, 05/2007 18 / 24

  28. Results Results Cluster Size Distribution p s = 0 . 59274621, free boundaries, 30 000 × 30 000 sites g.pruessner@warwick.ac.uk (WMI) Parallelised Percolation Warwick, 05/2007 19 / 24

  29. Results Results Cluster Size Distribution Site percolation, histogram normalised, shifted and binned p s = 0 . 59274621, free boundaries, L = 1 000 and 30 000 g.pruessner@warwick.ac.uk (WMI) Parallelised Percolation Warwick, 05/2007 20 / 24

  30. Results Results Winding on a Torus Probability of winding clusters with particular winding numbers g.pruessner@warwick.ac.uk (WMI) Parallelised Percolation Warwick, 05/2007 21 / 24

  31. Results Results Winding on a Torus bond percolation, probability of ( 1 , 2 ) winding circles numerical, line analytical (Pinson, 1994) (G. P . and N. R. Moloney 2004) g.pruessner@warwick.ac.uk (WMI) Parallelised Percolation Warwick, 05/2007 22 / 24

  32. Results Summary Very large systems Very flexible (reduced correlations) Minimal hardware Asynchronous Numerical test of CFT results New open questions (exotic clusters, universality) g.pruessner@warwick.ac.uk (WMI) Parallelised Percolation Warwick, 05/2007 23 / 24

  33. Results Acknowledgements This work has been carried out at Imperial College London Supported partly by EPSRC (NRM + GP), the Beit fellowship (NRM), the NSF (GP) and the Humboldt Foundation (GP) Thanks to A. Thomas, K. Christensen, P . Anderson, M. Kaulke, O. Kilian, D. Moore, B. Maguire, and D. Erickson for their help g.pruessner@warwick.ac.uk (WMI) Parallelised Percolation Warwick, 05/2007 24 / 24

Recommend

SYLLABUS The Idea of Parallelism: A Parallelised version of the Sieve of Eratosthenes PRAM Model

SYLLABUS The Idea of Parallelism: A Parallelised version of the Sieve of Eratosthenes PRAM Model

26 07 2015 PARALLEL AND DISTRIBUTED ALGORITHMS BY DEBDEEP MUKHOPADHYAY AND ABHISHEK SOMANI http://cse.iitkgp.ac.in/~debdeep/courses_iitkgp/PAlgo/index.htm SYLLABUS The Idea of Parallelism: A Parallelised version of the Sieve of

449 views • 17 slides
Percolation Theory and Network Percolation Theory and Network Connectivity onnectivity C Jie

Percolation Theory and Network Percolation Theory and Network Connectivity onnectivity C Jie

Percolation Theory and Network Percolation Theory and Network Connectivity onnectivity C Jie Gao Computer Science Department Stony Brook University Papers Papers Geoffrey Grimmett, Percolation , first chapter, Second edition,

521 views • 41 slides
Percolation Theory Percolation Theory Jie Gao Computer Science Department Stony Brook

Percolation Theory Percolation Theory Jie Gao Computer Science Department Stony Brook

Percolation Theory Percolation Theory Jie Gao Computer Science Department Stony Brook University Paper Paper Geoffrey Grimmett, Percolation , first chapter, Second edition, Springer, 1999. E. N. Gilbert, Random plane networks .

517 views • 49 slides
GUIDING PRINCIPALS Percolation Percolation Percolation Slow it /Spread it /Sink it

GUIDING PRINCIPALS Percolation Percolation Percolation Slow it /Spread it /Sink it

ECOLOGICAL GRADING TECHNIQUES FOR STORMWATER MANAGEMENT IN THE LANDSCAPE Guiding Principals Rural Case Study Suburban Case Study Presen ented ed by by: Rick Taylor, Elder Creek Landscapes GUIDING PRINCIPALS Percolation

421 views • 11 slides
A percolation model of innovation diffusion Koen Frenken a , Luis R. Izquierdo b and Paolo Zeppini

A percolation model of innovation diffusion Koen Frenken a , Luis R. Izquierdo b and Paolo Zeppini

Introduction Standard percolation Percolation with learning Network structure A percolation model of innovation diffusion Koen Frenken a , Luis R. Izquierdo b and Paolo Zeppini a,c a Eindhoven University of Technology b University of Burgos c

635 views • 19 slides
Convergence to SLE 6 for Percolation Models (joint with I. Binder & L. Chayes) Helen K. Lei

Convergence to SLE 6 for Percolation Models (joint with I. Binder & L. Chayes) Helen K. Lei

Convergence to SLE 6 for Percolation Models (joint with I. Binder & L. Chayes) Helen K. Lei August 14, 2009 Introduction Setup & Scaling Limit Conformal Invariance & Cardys Formula Statement of Result Percolation

281 views • 27 slides
Automatic Differentiation of Parallelised Convolutional Neural Networks - Lessons from Adjoint PDE

Automatic Differentiation of Parallelised Convolutional Neural Networks - Lessons from Adjoint PDE

Automatic Differentiation of Parallelised Convolutional Neural Networks - Lessons from Adjoint PDE Solvers Jan H uckelheim, Imperial College London Paul Hovland, Argonne National Laboratory December 9, 2017 Jan H uckelheim Many-core

856 views • 52 slides
Limited Path Percolation in Complex Networks Eduardo Lpez Los Alamos Nat. Lab. LA-UR 07-0432

Limited Path Percolation in Complex Networks Eduardo Lpez Los Alamos Nat. Lab. LA-UR 07-0432

Limited Path Percolation in Complex Networks Eduardo Lpez Los Alamos Nat. Lab. LA-UR 07-0432 Outline Motivation. Percolation and its effects. Presentation of new limited path length percolation model Scaling theory of new model

698 views • 42 slides
Parallelised Bayesian Optimisation via Thompson Sampling Kirthevasan Kandasamy Akshay Jeff

Parallelised Bayesian Optimisation via Thompson Sampling Kirthevasan Kandasamy Akshay Jeff

Parallelised Bayesian Optimisation via Thompson Sampling Kirthevasan Kandasamy Akshay Jeff Barnab as Krishnamurthy Schneider P oczos AISTATS 2018 Black-box Optimisation Expensive Blackbox Function Examples: - Hyper-parameter T

594 views • 58 slides
Fixing Boolean networks asynchronously Juilio Aracena and Lilian Salinas Universidad de

Fixing Boolean networks asynchronously Juilio Aracena and Lilian Salinas Universidad de

Fixing Boolean networks asynchronously Juilio Aracena and Lilian Salinas Universidad de Concepci on, Chile Maximilien Gadouleau Durham University, UK Adrien Richard CNRS, Universit e C ote dAzur, France S eminaire Dynamique,

968 views • 74 slides
Streams API 09/12/2015 youenn/calvaris What is it? Enabling I/O processing Read chunks

Streams API 09/12/2015 youenn/calvaris What is it? Enabling I/O processing Read chunks

Streams API 09/12/2015 youenn/calvaris What is it? Enabling I/O processing Read chunks asynchronously Write chunks asynchronously Pipe from a stream to another Automatic transformations Any kind of chunk Strings

546 views • 23 slides
Asynchronously Evolving Solutions with Excessively Different Evaluation Time by Reference-based

Asynchronously Evolving Solutions with Excessively Different Evaluation Time by Reference-based

July 12-16, 2014 Genetic and Evolutionary Computation Conference (GECCO 2014)@Vancouver, BC, Canada Asynchronously Evolving Solutions with Excessively Different Evaluation Time by Reference-based Evaluation 2014/07/15 Tomohiro Harada 1,2 , Keiki

633 views • 22 slides
PERCOLATION WITHOUT FKG VINCENT BEFFARA AND DAMIEN GAYET Abstract. We prove a Russo-Seymour-Welsh

PERCOLATION WITHOUT FKG VINCENT BEFFARA AND DAMIEN GAYET Abstract. We prove a Russo-Seymour-Welsh

PERCOLATION WITHOUT FKG VINCENT BEFFARA AND DAMIEN GAYET Abstract. We prove a Russo-Seymour-Welsh theorem for large and natural perturbative families of discrete percolation models that do not necessarily satisfy the Fortuin-Kasteleyn- Ginibre

714 views • 32 slides
Bijective approach to percolation on triangulations and Liouville quantum gravity Olivier

Bijective approach to percolation on triangulations and Liouville quantum gravity Olivier

Bijective approach to percolation on triangulations and Liouville quantum gravity Olivier Bernardi - Brandeis University Joint work with Nina Holden & Xin Sun MIT, March 2019 Percolation on triangulation CLE on Liouville Quantum Gravity

943 views • 81 slides
Bootstrap Percolation on Periodic Trees Milan Bradonji work with Iraj Saniee Bell Labs,

Bootstrap Percolation on Periodic Trees Milan Bradonji work with Iraj Saniee Bell Labs,

Bootstrap Percolation on Periodic Trees Milan Bradonji work with Iraj Saniee Bell Labs, Alcatel-Lucent, Murray Hill, NJ 31 May 13 AofA 2013, Spain 1 / 34 Milan Bradonji Bootstrap Percolation on Periodic Trees Bootstrap Percolation

825 views • 47 slides
Higher Dimensional Percolation Paul Duncan Department of Mathematics OSU April 27, 2019 Bond

Higher Dimensional Percolation Paul Duncan Department of Mathematics OSU April 27, 2019 Bond

Higher Dimensional Percolation Paul Duncan Department of Mathematics OSU April 27, 2019 Bond Percolation Consider the integer lattice obtained by connected each vertex in Z d R 3 to its nearest neighbors. We can construct a random

164 views • 5 slides
Parallelised Bayesian Optimisation via Thompson Sampling Kirthevasan Kandasamy Carnegie Mellon

Parallelised Bayesian Optimisation via Thompson Sampling Kirthevasan Kandasamy Carnegie Mellon

Parallelised Bayesian Optimisation via Thompson Sampling Kirthevasan Kandasamy Carnegie Mellon University Google Research, Mountain View, CA Sep 27, 2017 Slides: www.cs.cmu.edu/~kkandasa/talks/google-ts-slides.pdf www.cs.cmu.edu/ kkandasa

1.25k views • 111 slides
Variational Formula for First Passage Percolation Arjun Krishnan Fields Institute, Toronto.

Variational Formula for First Passage Percolation Arjun Krishnan Fields Institute, Toronto.

Variational Formula for First Passage Percolation Arjun Krishnan Fields Institute, Toronto. (work done in the Courant Institute, New York) Fields Postdoc Seminar, Oct 16 2014 First Passage Percolation on the Lattice Positive random

850 views • 81 slides
Information Percolation in Segmented Markets Darrell Duffie Semyon Malamud Gustavo Manso

Information Percolation in Segmented Markets Darrell Duffie Semyon Malamud Gustavo Manso

Information Percolation in Segmented Markets Darrell Duffie Semyon Malamud Gustavo Manso Stanford EPFL Lausanne MIT Texas Monetary Conference - December 2009 Duffie, Malamud, and Manso Information Percolation 1 Information Transmission

860 views • 48 slides
Almost giant clusters for percolation on large trees Jean Bertoin Institut f ur Mathematik

Almost giant clusters for percolation on large trees Jean Bertoin Institut f ur Mathematik

Introduction Supercritical regimes Recursive trees Scale free trees Almost giant clusters for percolation on large trees Jean Bertoin Institut f ur Mathematik Universit at Z urich Jean Bertoin Almost giant clusters for percolation

616 views • 44 slides
A Universality Result for 2D Percolation Models L. Chayes 1 and H. K. Lei 1 1 Department of

A Universality Result for 2D Percolation Models L. Chayes 1 and H. K. Lei 1 1 Department of

A Universality Result for 2D Percolation Models L. Chayes 1 and H. K. Lei 1 1 Department of Mathematics, UCLA, Los Angeles, CA This abstract summarizes the talk concerning [1] that was delivered by one of us (L.C.) at the 2006 Oberwolfach meeting

492 views • 3 slides
Percolation on sparse random graphs with given degree sequence Nikolaos Fountoulakis School of

Percolation on sparse random graphs with given degree sequence Nikolaos Fountoulakis School of

Motivation Percolation on finite graphs Random graphs with a given degree sequence Why is it true... Questions for further study The End Percolation on sparse random graphs with given degree sequence Nikolaos Fountoulakis School of

934 views • 74 slides
Percolation on isoradial graphs Ioan Manolescu Joint work with Geoffrey Grimmett University of

Percolation on isoradial graphs Ioan Manolescu Joint work with Geoffrey Grimmett University of

Percolation on isoradial graphs Ioan Manolescu Joint work with Geoffrey Grimmett University of Geneva 15 August 2013 Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 1 / 25 General Percolation

1.59k views • 107 slides
Informational Analysis of Invasion Percolation Model of Hydraulic Fracturing J. Quinn Norris May

Informational Analysis of Invasion Percolation Model of Hydraulic Fracturing J. Quinn Norris May

Hydraulic Fracturing Simple Model Invasion Percolation Bursts Information Theory Tokunaga Branching Informational Analysis of Invasion Percolation Model of Hydraulic Fracturing J. Quinn Norris May 31, 2013 Hydraulic Fracturing Simple

785 views • 50 slides

More recommend