ccgo
play

CCGO CENTER FOR COMPUTATIONAL GEOSCIENCES & OPTIMIZATION - PowerPoint PPT Presentation

Feb 22, 2023 •340 likes •1.36k views

Low-Cost Parallel Algorithms for 2:1 Octree Balance Toby Isaac 1 , Carsten Burstedde 2 , Omar Ghattas 134 1 Institute for Computational Engineering and Sciences, UT-Austin 3 Jackson School of Geosciences, UT-Austin 4 Dept. of Mechanical Engineering,

  1. Concept: coarsest balanced octree The coarsest balanced neighborhood can be extended to the coarsest balanced octree T k ( o ) . It does not look the same for all octants. 1 -balance 2 -balance Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 21 / 46

  2. Formal definition of a Balance algorithm Definition ( T k ( S ) ) Given an arbitrary set of octants S , T k ( S ) is equal to the o ∈ S T k ( o ) . leaves (i.e. non-ancestor) octants in � The purpose of a Balance algorithm is to convert a linear octree T into T k ( T ) . Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 22 / 46

  3. Ripple effect Example (2D, 1 -balance) This octree would be balanced if the blue octants were not present. The presence of the blue octants causes changes across the whole diameter of the octree. This has big implications for parallel algorithms. Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 23 / 46

  4. Ripple effect Example (2D, 1 -balance) This octree would be balanced if the blue octants were not present. The presence of the blue octants causes changes across the whole diameter of the octree. This has big implications for parallel algorithms. Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 23 / 46

  5. Ripple effect Example (2D, 1 -balance) This octree would be balanced if the blue octants were not present. The presence of the blue octants causes changes across the whole diameter of the octree. This has big implications for parallel algorithms. Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 23 / 46

  6. Ripple effect Example (2D, 1 -balance) This octree would be balanced if the blue octants were not present. The presence of the blue octants causes changes across the whole diameter of the octree. This has big implications for parallel algorithms. Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 23 / 46

  7. Serial 2:1 Balance algorithm Serial 2:1 Balance algorithm Start: unbalanced linear octree T for o ∈ T T ← T ∪ N k ( o ) ( T no longer linear octree: not ordered, overlaps) order T and remove overlaps Recognizing and eliminating redundant octants from this process greatly improves its performance. For more information, see Section 3 of our paper. Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 24 / 46

  8. Parallel 2:1 Balance Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 25 / 46

  9. Parallel Balance: the Ripple algorithm p q r s ↔ ↔ ↔ local balance using a serial algorithm exchange neighboring information local rebalance using neighboring information repeat O ( P ) rounds of communication may be necessary. This algorithm is appropriate in low latency settings. Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 26 / 46

  10. Parallel Balance: the Ripple algorithm p q r s ↔ ↔ ↔ local balance using a serial algorithm exchange neighboring information local rebalance using neighboring information repeat O ( P ) rounds of communication may be necessary. This algorithm is appropriate in low latency settings. Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 26 / 46

  11. Parallel Balance: the Ripple algorithm p q r s ↔ ↔ ↔ local balance using a serial algorithm exchange neighboring information local rebalance using neighboring information repeat O ( P ) rounds of communication may be necessary. This algorithm is appropriate in low latency settings. Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 26 / 46

  12. Parallel Balance: the Ripple algorithm p q r s ↔ ↔ ↔ local balance using a serial algorithm exchange neighboring information local rebalance using neighboring information repeat O ( P ) rounds of communication may be necessary. This algorithm is appropriate in low latency settings. Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 26 / 46

  13. Parallel Balance: the One-Pass algorithm local balance using a serial algorithm exchange neighboring and remote information local rebalance using all pertinent information Na¨ ıvely requires all-to-all communication Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 27 / 46

  14. The insulation layer I ( r ) When enforcing 2:1 balance, an octant is only affected by octants within its insulation layer [3]. process q greatly reduces number of processes that must communicate relationship is not symmetric p does not know a priori it affects q An efficient scheme for determining process p communicating pairs is required. See section 5 of our paper. Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 28 / 46

  15. The insulation layer I ( r ) When enforcing 2:1 balance, an octant is only affected by octants within its insulation layer [3]. process q greatly reduces number of processes that must communicate r relationship is not symmetric p does not know a priori it affects q An efficient scheme for determining process p communicating pairs is required. I ( r ) See section 5 of our paper. p affects q Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 28 / 46

  16. The insulation layer I ( r ) When enforcing 2:1 balance, an octant is only affected by octants within its insulation layer [3]. process q greatly reduces number of processes that must communicate r relationship is not symmetric p does not know a priori it affects q An efficient scheme for determining process p communicating pairs is required. I ( r ) See section 5 of our paper. p affects q q does not affect p Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 28 / 46

  17. One-pass communication process q process p Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 29 / 46

  18. One-pass communication process q r ⇒ send r to p Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 29 / 46

  19. One-pass communication r o process p ⇒ send o to q Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 29 / 46

  20. One-pass communication process q r o Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 29 / 46

  21. One-pass communication process q r o Once remote octants are received, how do we determine their effect? Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 29 / 46

  22. Rebalancing with remote octants, old algorithm process q r o Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 30 / 46

  23. Rebalancing with remote octants, old algorithm process q r o Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 30 / 46

  24. Rebalancing with remote octants, old algorithm process q r o Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 30 / 46

  25. Rebalancing with remote octants, old algorithm process q o Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 30 / 46

  26. Rebalancing with remote octants, old algorithm process q o This method is not O ( 1 ) , represent redundant work Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 30 / 46

  27. Determining remote balance process q ℓ ? δ y o δ x We want an O ( 1 ) method to determine the size ℓ from displacement δ Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 31 / 46

  28. Illustration: 2D, 2 -balance Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 32 / 46

  29. Illustration: 2D, 2 -balance Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 32 / 46

  30. Illustration: 2D, 2 -balance Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 32 / 46

  31. Illustration: 2D, 2 -balance Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 32 / 46

  32. Illustration: 2D, 2 -balance Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 32 / 46

  33. Illustration: 2D, 2 -balance Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 32 / 46

  34. Illustration: 2D, 2 -balance 2 ℓ ∼ max { δ x , δ y } Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 32 / 46

  35. Illustration: 2D, 1 -balance Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 33 / 46

  36. Illustration: 2D, 1 -balance Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 33 / 46

  37. Illustration: 2D, 1 -balance Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 33 / 46

  38. Illustration: 2D, 1 -balance Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 33 / 46

  39. Illustration: 2D, 1 -balance Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 33 / 46

  40. Illustration: 2D, 1 -balance Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 33 / 46

  41. Illustration: 2D, 1 -balance 2 ℓ ∼ δ x + δ y Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 33 / 46

  42. Illustration: 3D, 3 -balance Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 34 / 46

  43. Illustration: 3D, 3 -balance Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 34 / 46

  44. Illustration: 3D, 3 -balance Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 34 / 46

  45. Illustration: 3D, 3 -balance Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 34 / 46

  46. Illustration: 3D, 3 -balance Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 34 / 46

  47. Illustration: 3D, 3 -balance Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 34 / 46

  48. Illustration: 3D, 3 -balance 2 ℓ ∼ max { δ x , δ y , δ z } Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 34 / 46

  49. Illustration: 3D, 2 -balance Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 35 / 46

  50. Illustration: 3D, 2 -balance Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 35 / 46

  51. Illustration: 3D, 2 -balance Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 35 / 46

  52. Illustration: 3D, 2 -balance Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 35 / 46

  53. Illustration: 3D, 2 -balance Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 35 / 46

  54. Illustration: 3D, 2 -balance Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 35 / 46

  55. Computing the Sierpinski profile The size 2 ℓ can be computed using ternary addition: Reinterpret the binary displacement δ as a base-3 number. Set λ = δ x + δ y + δ z , base-3. Reinterpret λ as a binary number. Return λ . We only need the most significant bit of λ , so we can approximate it with the expression Carry 3 ( δ x , δ y , δ z ) : = max { δ x , δ y , δ z , δ x + δ y + δ z − ( δ x | δ y | δ z ) } . Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 36 / 46

  56. Illustration: 3D, 1 -balance Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 37 / 46

  57. Illustration: 3D, 1 -balance Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 37 / 46

  58. Illustration: 3D, 1 -balance Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 37 / 46

  59. Illustration: 3D, 1 -balance Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 37 / 46

  60. Illustration: 3D, 1 -balance Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 37 / 46

  61. Illustration: 3D, 1 -balance Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 37 / 46

  62. Illustration: 3D, 1 -balance 2 ℓ ∼ Carry 3 ( δ y + δ z , δ z + δ x , δ x + δ y ) Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 37 / 46

  63. Results Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 38 / 46

  64. Weak scaling Compared old and new algorithms on the Jaguar XT5 supercomputer at Oak Ridge National Laboratory. Fractal refinement pattern, increasing refinement proportional to the number of cpus. ∼ 1.3 Million octants per cpu. Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 39 / 46

  65. Weak scaling: full one-pass algorithm Old New 6 5 Seconds per (million elements / core) 4 3 2 1 0 12 96 768 6144 49152 112128 Number of CPU cores Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 40 / 46

  66. Weak scaling: components Old New Old New 3 2.5 2.5 Seconds per (million elements / core) Seconds per (million elements / core) 2 2 1.5 1.5 1 1 0.5 0.5 0 0 12 96 768 6144 49152 112128 12 96 768 6144 49152 112128 Number of CPU cores Number of CPU cores Local balance (serial algorithm) Local rebalance (remote balancing) Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 41 / 46

  67. Strong scaling Compared old and new algorithms on the Jaguar XT5 supercomputer at Oak Ridge National Laboratory. Mesh of Antarctic ice sheet, with localized refinement to resolve the transition from grounded to floating ice, with ∼ 90 million octants. Doubling processor counts from 12 to 6,144. Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 42 / 46

  68. Strong scaling: full one-pass algorithm Perfect Scaling Old New 100 10 Seconds 1 0.1 12 24 48 96 192 384 768 1536 3072 6144 Number of CPU cores Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 43 / 46

  69. Strong scaling: components Perfect Scaling Old New Perfect Scaling Old New 10 10 1 1 Seconds Seconds 0.1 0.1 0.01 0.01 0.001 12 24 48 96 192 384 768 1536 3072 6144 12 24 48 96 192 384 768 1536 3072 6144 Number of CPU cores Number of CPU cores Local balance (serial algorithm) Local rebalance (remote balancing) Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 44 / 46

  70. Thank you Isaac, Burstedde, Ghattas (UT Austin, Uni Bonn) Algorithms for 2:1 Octree Balance IEEE IPDPS12, Shanghai 45 / 46

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Java Collections

Java Collections

Abstract Data Types Data Structure Grand Tour Java Collections http://gcc.gnu.org/onlinedocs/libstdc++/images/pbds_different_underlying_dss_1.png Stacks and Queues Hopefully you have met with your partner to start Hopefully you

936 views • 27 slides
Presentation Outline Technical Orientation Welcome / Introduction Jeff Farbman

Presentation Outline Technical Orientation Welcome / Introduction Jeff Farbman

An NGFN W An NGFN Webina binar FOOD HUBS IN FARM TO SCHOOL October 17, 2013 Presentation Outline Technical Orientation Welcome / Introduction Jeff Farbman Wallace Center at Winrock International Gourmet Gorilla Cherry

695 views • 51 slides
Adaptive Algorithms for Stochastic Computation Fred J. Hickernell Department of Applied

Adaptive Algorithms for Stochastic Computation Fred J. Hickernell Department of Applied

Problem Digital Net Cubature Error Bounds Attaining Error Tolerances Numerical Examples Discussion References Adaptive Algorithms for Stochastic Computation Fred J. Hickernell Department of Applied Mathematics, Illinois Institute of

780 views • 22 slides
CS 115 Lecture 2 Fundamentals of computer science, computers, and programming Neil Moore

CS 115 Lecture 2 Fundamentals of computer science, computers, and programming Neil Moore

CS 115 Lecture 2 Fundamentals of computer science, computers, and programming Neil Moore Department of Computer Science University of Kentucky Lexington, Kentucky 40506 neil@cs.uky.edu 1 September 2015 What is programming? CS 115 is titled

1.92k views • 179 slides
Mixed models in R using the lme4 package Part 1: Linear mixed models with simple, scalar random

Mixed models in R using the lme4 package Part 1: Linear mixed models with simple, scalar random

Mixed models in R using the lme4 package Part 1: Linear mixed models with simple, scalar random effects Douglas Bates 8 th International Amsterdam Conference on Multilevel Analysis <Bates@R-project.org> 2011-03-16 Douglas Bates

1.18k views • 75 slides
Click to go to website: www.njctl.org Slide 2 / 45 Forces & Interactions Classwork and

Click to go to website: www.njctl.org Slide 2 / 45 Forces & Interactions Classwork and

Slide 1 / 45 New Jersey Center for Teaching and Learning Progressive Science Initiative This material is made freely available at www.njctl.org and is intended for the non-commercial use of students and teachers. These materials may not be

852 views • 45 slides
Forces & Interactions Classwork and Homework www.njctl.org Slide 3 / 45 Classwork #1:

Forces & Interactions Classwork and Homework www.njctl.org Slide 3 / 45 Classwork #1:

Slide 1 / 45 New Jersey Center for Teaching and Learning Progressive Science Initiative This material is made freely available at www.njctl.org and is intended for the non-commercial use of students and teachers. These materials may not be

479 views • 15 slides
The Ultimate Guide to HTTP Resource Prioritization Robin Marx @programmingart FOSDEM 2020 A

The Ultimate Guide to HTTP Resource Prioritization Robin Marx @programmingart FOSDEM 2020 A

The Ultimate Guide to HTTP Resource Prioritization Robin Marx @programmingart FOSDEM 2020 A healthy, well- balanced meal time me A healthy, well- balanced meal time me girlfriend A healthy, well- balanced meal time me girlfriend

1.09k views • 87 slides
at Ash River William Miller from the couch Assembly Team doing all the work March 1st, 2017v2

at Ash River William Miller from the couch Assembly Team doing all the work March 1st, 2017v2

Update on Trial Assembly at Ash River William Miller from the couch Assembly Team doing all the work March 1st, 2017v2 proto Cable Update We are starting to make some process on cable management and location of cable trays Matt has

253 views • 13 slides
Back to School Night Sample Title Sample Subtitle Timber Lane Elementary Teacher Introductions

Back to School Night Sample Title Sample Subtitle Timber Lane Elementary Teacher Introductions

Back to School Night Sample Title Sample Subtitle Timber Lane Elementary Teacher Introductions Ms. Mrs. McAdams Ciarcia Mrs. Ms. Movahed Weber 2 Teacher Introductions Dr. Lohr ESOL Teacher Mrs. Bessey Special Education Assistant

336 views • 29 slides
Q1 2020 RESULTS APRIL 2020 Cautionary Notes CAUTIONARY NOTE ON FORWARD LOOKING INFORMATION

Q1 2020 RESULTS APRIL 2020 Cautionary Notes CAUTIONARY NOTE ON FORWARD LOOKING INFORMATION

Q1 2020 RESULTS APRIL 2020 Cautionary Notes CAUTIONARY NOTE ON FORWARD LOOKING INFORMATION COMPLIANCE WITH NI 43-101 This document may contain forward-looking information within the meaning of Canadian securities legislation and

695 views • 15 slides
Q3 2020: GROWTH AND INNOVATION OCTOBER 2020 Participants On Todays Call Jerrold Annett

Q3 2020: GROWTH AND INNOVATION OCTOBER 2020 Participants On Todays Call Jerrold Annett

Q3 2020: GROWTH AND INNOVATION OCTOBER 2020 Participants On Todays Call Jerrold Annett Darren Pylot Mike Wickersham Raman Randhawa Brad Mercer VP, Strategy and President and CEO Mine GM, Pinto Valley SVP and CFO SVP, Exploration and

698 views • 26 slides
Brian Lindsay Brian Lindsay CEO, CEO, NSK Americas NSK Americas Ch i Ch i Chairman,

Brian Lindsay Brian Lindsay CEO, CEO, NSK Americas NSK Americas Ch i Ch i Chairman,

ABMA Update ABMA Update Brian Lindsay Brian Lindsay CEO, CEO, NSK Americas NSK Americas Ch i Ch i Chairman, Chairman, American Bearing American Bearing Manufacturers Association Manufacturers Association Who is ABMA? Who is ABMA?

738 views • 39 slides
BANGOR AREA MARKET OVERVIEW Bev Uhlenhake, CCIM Epstein Commercial Real Estate January 22, 2015

BANGOR AREA MARKET OVERVIEW Bev Uhlenhake, CCIM Epstein Commercial Real Estate January 22, 2015

BANGOR AREA MARKET OVERVIEW Bev Uhlenhake, CCIM Epstein Commercial Real Estate January 22, 2015 Bangor Area Market Overview, Bev Uhlenhake, CCIM MEREDA, January 22, 2015 WHAT DO THE FOLLOWING HAVE IN COMMON? MEREDA, January 22, 2015

755 views • 43 slides
Operational Challenges in Energy and Chemical Recovery in Kraft Pulp Mills Honghi Tran University

Operational Challenges in Energy and Chemical Recovery in Kraft Pulp Mills Honghi Tran University

Operational Challenges in Energy and Chemical Recovery in Kraft Pulp Mills Honghi Tran University of Toronto Toronto, ON, CANADA Roberto Villarroel Eldorado Brazil Sao Paulo, BRAZIL The 7 th International Colloquium on Eucalyptus Pulp Vitoria,

204 views • 18 slides
On the mathematics of simple juggling patterns G abor Cz edli . held in Szeged, 19

On the mathematics of simple juggling patterns G abor Cz edli . held in Szeged, 19

On the mathematics of simple juggling patterns G abor Cz edli . held in Szeged, 19 April 2013 , within Budapest Semester of Mathematics 2013. aprilis 19. http://www.math.u-szeged.hu/ czedli/ 1 2 / 58 Introduction

476 views • 31 slides
sensing properties of Jens Martensson 15/05/2020 - 31/05/2020 Nb 2 O 5 thin films. K. Lazarova 1

sensing properties of Jens Martensson 15/05/2020 - 31/05/2020 Nb 2 O 5 thin films. K. Lazarova 1

Influence of the size of coal ash FAU zeolites used as dopants on the 2nd Coatings and Interfaces Web Conference sensing properties of Jens Martensson 15/05/2020 - 31/05/2020 Nb 2 O 5 thin films. K. Lazarova 1 , S. Boycheva 2 , M. Vasileva 1

629 views • 16 slides
Review: Rough Structure <!DOCTYPE html> <!DOCTYPE html> <html> <html>

Review: Rough Structure <!DOCTYPE html> <!DOCTYPE html> <html> <html>

Break Out Animate, Game Elements Canvas Tutorial Breakout Bill Mill con$nue Modified Tutorial Simple Game: Break Out So=ware developer in Maryland What it Looks Like Review: Rough Structure <!DOCTYPE html>

281 views • 5 slides
Capital Improvement Program Workshop July 17, 2014 Agenda Capital Planning Overview

Capital Improvement Program Workshop July 17, 2014 Agenda Capital Planning Overview

2014 Summer Capital Improvement Program Workshop July 17, 2014 Agenda Capital Planning Overview Financial Management Strategy 2014 Bond Program Overview Implementation Schedule Communication Plan Reporting Strategy

752 views • 73 slides
Machine Learning and Data Science Research and Applications in Industry 4.0 a Prof. Dr.

Machine Learning and Data Science Research and Applications in Industry 4.0 a Prof. Dr.

Machine Learning and Data Science Research and Applications in Industry 4.0 a Prof. Dr. Katharina Morik, Knstliche Intelligenz, TU Dortmund Overview Introduction: Collaborative research center SFB 876 Big data and small devices

773 views • 33 slides
The frame of the metric hedgehog and a cardinal extension of normality Javier Gutirrez Garca 1

The frame of the metric hedgehog and a cardinal extension of normality Javier Gutirrez Garca 1

The frame of the metric hedgehog and a cardinal extension of normality Javier Gutirrez Garca 1 University of the Basque Country UPV/EHU, Spain 1 Joint work with I. Mozo Carollo, J. Picado, and J. Walters-Wayland. September 2018: University of

2.37k views • 166 slides
The Measurement Problem Klaas Landsman The measurement problem is Born (1926) Quantum

The Measurement Problem Klaas Landsman The measurement problem is Born (1926) Quantum

Masterclass, Trinity College, 14 May 2016 The Measurement Problem Klaas Landsman The measurement problem is Born (1926) Quantum mechanics then gives a completely definite answer to the question of the e fg ect of a collision; however, one is

823 views • 51 slides
Prelude Adagio molto from Piano Sonata Op. 10, No. 1 by Ludwig Van Beethoven Call to Worship

Prelude Adagio molto from Piano Sonata Op. 10, No. 1 by Ludwig Van Beethoven Call to Worship

Prelude Adagio molto from Piano Sonata Op. 10, No. 1 by Ludwig Van Beethoven Call to Worship Most patient God: Hold your laughter yet a little while, long enough for us to learn the richness and the grace in the neighborhood (and the

816 views • 39 slides
Peer Operated Respite Bidders Conference Stacy A. Smith Adult Mental Health Team Lead

Peer Operated Respite Bidders Conference Stacy A. Smith Adult Mental Health Team Lead

Peer Operated Respite Bidders Conference Stacy A. Smith Adult Mental Health Team Lead January 7, 2019 Peer Operated Respite Bidders Conference This conference will be recorded and posted on the DMHDDSAS website, where the Peer

417 views • 24 slides

More recommend