reflective parallel programming
play

Reflective Parallel Programming Nicholas D. Matsakis, Thomas R. - PowerPoint PPT Presentation

Nov 16, 2023 •121 likes •1.31k views

Reflective Parallel Programming Nicholas D. Matsakis, Thomas R. Gross ETH Zurich 1 Friday, June 18, 2010 Reflective Parallelism Reflection : Ability for a program to reason about its own structure Reflective Parallelism : Ability for

  1. Querying the Schedule a.end.hb(b.start)? a true (lock) a.locks(lock)? true b.end.hb(a.start)? b b.locks(lock)? 23 Friday, June 18, 2010

  2. Querying the Schedule a.end.hb(b.start)? a true (lock) a.locks(lock)? true ? b.end.hb(a.start)? b b.locks(lock)? 23 Friday, June 18, 2010

  3. Querying the Schedule a.end.hb(b.start)? a true (lock) a.locks(lock)? true ? b.end.hb(a.start)? b false b.locks(lock)? 23 Friday, June 18, 2010

  4. Querying the Schedule a.end.hb(b.start)? a true (lock) a.locks(lock)? true b.end.hb(a.start)? b false b.locks(lock)? 23 Friday, June 18, 2010

  5. Querying the Schedule a.end.hb(b.start)? a true (lock) a.locks(lock)? true b.end.hb(a.start)? b false b.locks(lock)? false 23 Friday, June 18, 2010

  6. Monotonicity • Edges and locks can only be added, not removed • Necessary for static analysis: • Compiler knows that edges and locks it sees cannot be removed at runtime 24 Friday, June 18, 2010

  7. Outline • What is reflective parallel programming? • Why do we need a new model? • Intervals model • Example: Data-race detection 25 Friday, June 18, 2010

  8. Outline • What is reflective parallel programming? • Why do we need a new model? • Intervals model • Example: Data-race detection 25 Friday, June 18, 2010

  9. Data Race Detection • Key Idea: • User defines conditions in which a field can be accessed • Use the reflective API to determine whether conditions are met 26 Friday, June 18, 2010

  10. Locked Fields class TheClass { final Lock theLock; @GuardedBy(theLock) String theString; ... } 27 Friday, June 18, 2010

  11. Locked Fields class TheClass { final Lock theLock; @GuardedBy(theLock) String theString; ... } 27 Friday, June 18, 2010

  12. Locked Fields class TheClass { final Lock theLock; @GuardedBy(theLock) String theString; ... } 27 Friday, June 18, 2010

  13. Locked Fields class TheClass { final Lock theLock; @GuardedBy(theLock) String theString; ... } 27 Friday, June 18, 2010

  14. Locked Fields class TheClass { final Lock theLock; @GuardedBy(theLock) String theString; ... } 27 Friday, June 18, 2010

  15. Dynamic Checking void setString() { assert current.locks(theLock); theString = "..."; } 28 Friday, June 18, 2010

  16. Dynamic Checking void setString() { assert current.locks(theLock); theString = "..."; } 28 Friday, June 18, 2010

  17. Dynamic Checking void setString() { assert current.locks(theLock); theString = "..."; } 28 Friday, June 18, 2010

  18. Dynamic Checking void setString() { assert current.locks(theLock); theString = "..."; } 28 Friday, June 18, 2010

  19. Static Checking void staticCheck() { Interval x = interval { assert current.locks(theLock); theString = "..."; } x.addLock(theLock); x.ready(); } 29 Friday, June 18, 2010

  20. Static Checking void staticCheck() { Interval x = interval { assert current.locks(theLock); theString = "..."; } x.addLock(theLock); x.ready(); } 29 Friday, June 18, 2010

  21. Static Checking void staticCheck() { Interval x = interval { assert current.locks(theLock); theString = "..."; } x.addLock(theLock); x.ready(); } 29 Friday, June 18, 2010

  22. Static Checking void staticCheck() { Interval x = interval { assert current.locks(theLock); theString = "..."; } x.addLock(theLock); x.ready(); } 29 Friday, June 18, 2010

  23. Static Checking void staticCheck() { Interval x = interval { assert current.locks(theLock); theString = "..."; } x.addLock(theLock); x x.ready(); } 29 Friday, June 18, 2010

  24. Static Checking void staticCheck() { Interval x = interval { assert current.locks(theLock); theString = "..."; } x.addLock(theLock); x x.ready(); } 29 Friday, June 18, 2010

  25. Static Checking void staticCheck() { Interval x = interval { assert current.locks(theLock); theString = "..."; } x.addLock(theLock); x x.ready(); (theLock) } 29 Friday, June 18, 2010

  26. Static Checking void staticCheck() { Interval x = interval { assert current.locks(theLock); theString = "..."; } x.addLock(theLock); x x.ready(); (theLock) } 29 Friday, June 18, 2010

  27. Static Checking void staticCheck() { Interval x = interval { assert current.locks(theLock); theString = "..."; } x.addLock(theLock); x x.ready(); (theLock) } 29 Friday, June 18, 2010

  28. Static Checking void staticCheck() { Interval x = interval { assert current.locks(theLock); theString = "..."; } x.addLock(theLock); x x.ready(); (theLock) } 29 Friday, June 18, 2010

  29. Guard Objects • Our compiler automatically enforces these kind of checks using guard objects • Guard object defines methods that check each read and write for validity • When possible, checks are performed statically 30 Friday, June 18, 2010

  30. Guard Object Annotations class TheClass { final Lock theLock; @GuardedBy(theLock) String theString; ... } 31 Friday, June 18, 2010

  31. Guard Object Annotations class TheClass { final Lock theLock; @GuardedBy(theLock) String theString; ... } 31 Friday, June 18, 2010

  32. Guard Object Annotations class TheClass { final Lock theLock; @GuardedBy(theLock) String theString; ... } 31 Friday, June 18, 2010

  33. Custom Guards • Example Conditions • Written only by one interval • Dynamic monitoring • Lock only on writes, not reads • Select lock dynamically 32 Friday, June 18, 2010

  34. Summary • User defines conditions to access a field by writing code against the reflective API • Compiler runs checks statically if possible • Runtime can run checks with live schedule 33 Friday, June 18, 2010

  35. Related Work • Smalltalk • Reflective objects for stack frames, etc • Debuggers and other tools require no special support from VM • Traditional threading model • More in the paper 34 Friday, June 18, 2010

  36. Conclusion • Reflective parallelism empowers users: • Custom tools for safety checking and monitoring • Reflective parallelism as foundation for static analysis: • Seamless integration of static and dynamic checks 35 Friday, June 18, 2010

  37. Thank You • Intervals library is available for download: • http://intervals.inf.ethz.ch 36 Friday, June 18, 2010

  38. Spare Slides 37 Friday, June 18, 2010

  39. Schedule Model Hierarchical Structure 38 Friday, June 18, 2010

  40. Illegal Additions • Schedule is being built and executed simultaneously • Certain additions are illegal 39 Friday, June 18, 2010

  41. Adding Edges void method( a Interval a, Interval b) { a.end.addHb(b.start); b } 40 Friday, June 18, 2010

  42. Adding Edges void method( a Interval a, Interval b) { a.end.addHb(b.start); b } What if b had already begun execution? 40 Friday, June 18, 2010

  43. Adding Edges c void method( a Interval a, Interval b) { a.end.addHb(b.start); b } If method is part of c, b cannot have started. 41 Friday, June 18, 2010

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

PARALLEL Joachim Nitschke PROGRAMMING Project Seminar Parallel Programming, Summer

PARALLEL Joachim Nitschke PROGRAMMING Project Seminar Parallel Programming, Summer

PARALLEL Joachim Nitschke PROGRAMMING Project Seminar Parallel Programming, Summer Semester 2011 CONTENT Introduction Parallel program design Patterns for parallel programming A: Algorithm structure B: Supporting

831 views • 40 slides
Parallel Numerical Algorithms Chapter 2 Parallel Thinking Section 2.2 Parallel

Parallel Numerical Algorithms Chapter 2 Parallel Thinking Section 2.2 Parallel

Parallel Programming Paradigms MPI Message-Passing Interface OpenMP Portable Shared Memory Programming Parallel Numerical Algorithms Chapter 2 Parallel Thinking Section 2.2 Parallel Programming Michael T. Heath and Edgar

788 views • 45 slides
Parallel Programming http://www.cs.bham.ac.uk/~hxt/2013/ parallel-programming/ based on: David

Parallel Programming http://www.cs.bham.ac.uk/~hxt/2013/ parallel-programming/ based on: David

Parallel Programming http://www.cs.bham.ac.uk/~hxt/2013/ parallel-programming/ based on: David B. Kirk and Wen-mei W. Hwu: Programming Massively Parallel Processors: A Hands-on Approach (second edition), 2013 and Nvidia documentation May 1,

809 views • 70 slides
How to Think Algorithmically in Parallel? Or, Parallel Programming through Parallel Algorithms

How to Think Algorithmically in Parallel? Or, Parallel Programming through Parallel Algorithms

How to Think Algorithmically in Parallel? Or, Parallel Programming through Parallel Algorithms Uzi Vishkin Context Will review variant of context part in August 22 talk given at Hot Interconnects, Stanford, CA. Please relax and listen. This

1.02k views • 72 slides
Distributed Data-Parallel Programming Parallel Programming and Data Analysis Heather Miller

Distributed Data-Parallel Programming Parallel Programming and Data Analysis Heather Miller

Distributed Data-Parallel Programming Parallel Programming and Data Analysis Heather Miller Data-Parallel Programming So far: Today: implementation of this paradigm. Data parallelism on a single multicore/multi-processor machine.

884 views • 54 slides
Introduction to Parallel Programming January 14, 2015 www.cac.cornell.edu What is Parallel

Introduction to Parallel Programming January 14, 2015 www.cac.cornell.edu What is Parallel

Introduction to Parallel Programming January 14, 2015 www.cac.cornell.edu What is Parallel Programming? Theoretically a very simple concept Use more than one processor to complete a task Operationally much more difficult to

578 views • 25 slides
Lecture 10: Parallel Patterns: The What and How of Parallel Programming G63.2011.002/G22.2945.001

Lecture 10: Parallel Patterns: The What and How of Parallel Programming G63.2011.002/G22.2945.001

Lecture 10: Parallel Patterns: The What and How of Parallel Programming G63.2011.002/G22.2945.001 November 9, 2010 Embarrassing Partition Pipelines Reduction Scan Tentative Plan for Rest of Class Today: Parallel Patterns Nov 16:

989 views • 86 slides
Introduction to Parallel Programming using OpenMP Shared Memory Parallel Programming Part I

Introduction to Parallel Programming using OpenMP Shared Memory Parallel Programming Part I

WestGrid Compute Canada - Online Workshop 2017 Introduction to Parallel Programming using OpenMP Shared Memory Parallel Programming Part I Dr. Ali Kerrache WestGrid, Univ. of Manitoba, Winnipeg E -mail: ali.kerrache@umanitoba.ca

890 views • 48 slides
Concurrent Programming with Parallel Extensions to .NET Joe Duffy Architect & Development

Concurrent Programming with Parallel Extensions to .NET Joe Duffy Architect & Development

Concurrent Programming with Parallel Extensions to .NET Joe Duffy Architect & Development Lead Parallel Extensions Talk Outline Overview 5 things about Parallel Extensions 1. Tasks and futures 2. Parallel loops 3. Parallel LINQ

650 views • 36 slides
2110412 Parallel Comp Arch Parallel Programming Paradigm Natawut Nupairoj, Ph.D. Department of

2110412 Parallel Comp Arch Parallel Programming Paradigm Natawut Nupairoj, Ph.D. Department of

2110412 Parallel Comp Arch Parallel Programming Paradigm Natawut Nupairoj, Ph.D. Department of Computer Engineering, Chulalongkorn University Outline Overview Parallel Architecture Revisited Parallelism Parallel Algorithm Design

763 views • 63 slides
Parallel Programming Patterns Overview and Concepts Practical Outline Why parallel

Parallel Programming Patterns Overview and Concepts Practical Outline Why parallel

Parallel Programming Patterns Overview and Concepts Practical Outline Why parallel programming? Decomposition Geometric decomposition Task farm Pipeline Loop parallelism Performance metrics and scaling Amdahls

636 views • 36 slides
Parallel programming Luis Alejandro Giraldo Len Topics 1. Philosophy 2. KeyWords 3.

Parallel programming Luis Alejandro Giraldo Len Topics 1. Philosophy 2. KeyWords 3.

Parallel programming Luis Alejandro Giraldo Len Topics 1. Philosophy 2. KeyWords 3. Parallel algorithm design 4. Advantages and disadvantages 5. Models of parallel programming 6. Multi-processor architectures 7. Common Languages

732 views • 31 slides
Parallel Programming with Spark Qin Liu The Chinese University of Hong Kong 1 Previously on

Parallel Programming with Spark Qin Liu The Chinese University of Hong Kong 1 Previously on

Parallel Programming with Spark Qin Liu The Chinese University of Hong Kong 1 Previously on Parallel Programming OpenMP: an API for writing multi-threaded applications A set of compiler directives and library routines for parallel

823 views • 53 slides
Introduction to Parallel Computing George Karypis Parallel Programming Platforms Elements of a

Introduction to Parallel Computing George Karypis Parallel Programming Platforms Elements of a

Introduction to Parallel Computing George Karypis Parallel Programming Platforms Elements of a Parallel Computer Hardware Multiple Processors Multiple Memories Interconnection Network System Software Parallel Operating

806 views • 33 slides
Shared Memory Programming with OpenMP Lecture 3: Parallel Regions Parallel region directive

Shared Memory Programming with OpenMP Lecture 3: Parallel Regions Parallel region directive

Shared Memory Programming with OpenMP Lecture 3: Parallel Regions Parallel region directive Code within a parallel region is executed by all threads. Syntax: Fortran: !$OMP PARALLEL block !$OMP END PARALLEL C/C++: #pragma omp

321 views • 15 slides
Lecture 2: Parallel Architectures Lecture 2: Parallel Architectures and Programming Models

Lecture 2: Parallel Architectures Lecture 2: Parallel Architectures and Programming Models

ECE 451/566 - Intro. to Parallel & Distributed Prog. ECE-451/ECE-566 - Introduction to Parallel and Distributed Programming Lecture 2: Parallel Architectures Lecture 2: Parallel Architectures and Programming Models Department of Electrical

480 views • 32 slides
Error Handling via the Happens-Before Relation Nicholas D. Matsakis Thomas R. Gross ETH Zurich

Error Handling via the Happens-Before Relation Nicholas D. Matsakis Thomas R. Gross ETH Zurich

Error Handling via the Happens-Before Relation Nicholas D. Matsakis Thomas R. Gross ETH Zurich 1 Sunday, April 18, 2010 Exception Handling Goal of this talk: Extend exception handling into a parallel setting 2 Sunday, April 18,

1.7k views • 98 slides
VHE Gamma-Ray Astronomy via Particle Detection at the Ground Level Or A biased review of VHE

VHE Gamma-Ray Astronomy via Particle Detection at the Ground Level Or A biased review of VHE

VHE Gamma-Ray Astronomy via Particle Detection at the Ground Level Or A biased review of VHE Gamm-Ray Survey Instruments Petra Huentemeyer petra@mtu.edu The Players: EAS Arrays Particle Sampling Gamma Rays Tibet AS- 1990-present

418 views • 27 slides
How Can Science Study History? Beth Haven Creation Conference May 13, 2017 Limits of empirical

How Can Science Study History? Beth Haven Creation Conference May 13, 2017 Limits of empirical

How Can Science Study History? Beth Haven Creation Conference May 13, 2017 Limits of empirical knowledge Galaxies 22 20 Man created to have dominion Solar over nature starting with the 18 System correspondence God created 16 between

292 views • 12 slides
r i i r r camera Computer 3D synthetic tone model Graphics: models

r i i r r camera Computer 3D synthetic tone model Graphics: models

Logistics Checkpoint 2 Texture Mapping Still grading Note on grading Checkpoint 3 Due Monday Project Proposals All should have received e-mail feedback. Logistics Projects Grad students Approx 26-28 projects

259 views • 12 slides
Linda and Its Tuple Spaces Abhinav S Bhatele (CS498lvk) Introduction It is essentially a

Linda and Its Tuple Spaces Abhinav S Bhatele (CS498lvk) Introduction It is essentially a

Linda and Its Tuple Spaces Abhinav S Bhatele (CS498lvk) Introduction It is essentially a shared-memory programming model based on tuple-spaces Only cares about process creation and co- ordination How and what the process computes is

130 views • 11 slides
ECDA EARLY CHILDHOOD CONFERENCE 2018 Building Professional Capacity Concurrent Workshop B

ECDA EARLY CHILDHOOD CONFERENCE 2018 Building Professional Capacity Concurrent Workshop B

ECDA EARLY CHILDHOOD CONFERENCE 2018 Building Professional Capacity Concurrent Workshop B Effective pedagogical leadership for programme quality - A case study 5 Oct 2018 Dr Sandra Wu National Institute of Education, Nanyang Technological

436 views • 24 slides
COMP80142: Academic Writing and Impact Studies Jonathan Shapiro Bijan Parsia School of Computer

COMP80142: Academic Writing and Impact Studies Jonathan Shapiro Bijan Parsia School of Computer

COMP80142: Academic Writing and Impact Studies Jonathan Shapiro Bijan Parsia School of Computer Science University of Manchester February 3, 2019 Announcement Announcement The students (you) do not seem to be on Blackboard. I have

806 views • 41 slides
RSVP-TE Summary Fast Reroute Extensions drafu-mtaillon-rsvpte-summary-frr-04 Authors: Mike

RSVP-TE Summary Fast Reroute Extensions drafu-mtaillon-rsvpte-summary-frr-04 Authors: Mike

IETF 95 Buenos Aires April 2016 RSVP-TE Summary Fast Reroute Extensions drafu-mtaillon-rsvpte-summary-frr-04 Authors: Mike Taillon (mtaillon@cisco.com) Tarek Saad (tsaad@cisco.com) - Presenter Nicholas Tan (ntan@arista.com) Abhishek

389 views • 11 slides

More recommend