R E C U R S I O N I N L I N I N G I N L L V M - PowerPoint PPT Presentation

Sep 02, 2023 •336 likes •389 views

R E C U R S I O N I N L I N I N G I N L L V M P a b l o B a r r i o , A R M C h a n d l e r C a r r u t h , G o o g l e J a m e s M o l l o y , A R M Wh y ? Performance

R E C U R S I O N I N L I N I N G I N L L V M P a b l o B a r r i o , A R M C h a n d l e r C a r r u t h , G o o g l e J a m e s M o l l o y , A R M
Wh y ? ● Performance improvements observed of up to ~20%. ● Potentially improve chances for other optimization passes: ● Increase function size. ● Increase knowledge of the context. ● Current status: ● GCC inlines recursive function calls up to a certain depth. ● LLVM marks recursive functions as noinline. ● Code size and register pressure must be controlled.
# 1 I n l i n e i t e r a t i v e l y f(x): if x == 0 return 1 f(x): a = g(x) if x == 0 return 1 if a == 0 a = g(x) b = 1 L e v e l 1 b = f(a) else: return a + h(b) a1 = g(a) i n l i n e b1 = f(a1) b = a1 + h(b1) return a + h(b)
# 2 R e m o v e r e c u r s i o n w i t h a s t a c k f(x): x1 = x f(x): while x1 != 0: if x == 0 a = g(x) return 1 x1 = a a = g(x) push(a) b = f(a) return a + h(b) b = 1 while S not empty: a = pop() a i s l i v e b = a + h(b) return b
F i b o n a c c i T i m e r e l a t i v e t o G C C b a s e G C C C l a n g B a s e ( - O 3 ) 1 . 0 0 1 . 9 7 S t a c k 2 . 5 3 1 . 1 9 I t e r a t i v e i n l i n i n g 1 . 0 0 1 . 0 4 O b j e c t s i z e ( k B ) G C C C l a n g B a s e ( - O 3 ) 3 . 5 0 2 . 5 4 S t a c k 2 . 6 7 2 . 7 1 I t e r a t i v e i n l i n i n g 3 . 5 0 2 . 7 4

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

Advanced #2: Recursion SAMS SENIOR CS TRACK Learning Goals Understand what recursion means

Advanced #2: Recursion SAMS SENIOR CS TRACK Learning Goals Understand what recursion means Identify base and recursive cases in code Write code using recursive calls What is Recursion? The core idea of recursion is that you can manipulate the

509 views • 16 slides

Java Recursion Slides provided by the University of Washington Computer Science & Engineering

Java Recursion Slides provided by the University of Washington Computer Science & Engineering department. Adapted from slides by Marty Stepp, Stuart Reges & Allison Obourn. Recursion - recursion : The definition of an operation in terms

222 views • 9 slides

Recursion Suppose You Are Waiting in L ine HI YOU! A Very Long Line You want to

Recursion Suppose You Are Waiting in L ine HI YOU! A Very Long Line You want to determine how many people are in front of you, but you cannot see and youre not allowed to move . You are only allowed to speak to the person in front of

549 views • 18 slides

Recursion q Specify it in a comment before method's header n Precondition q What is assumed to be

2/14/16 Preliminaries: programming as a contract n Specifying what each method does Recursion q Specify it in a comment before method's header n Precondition q What is assumed to be true before the method is executed q Caller obligation Chapter

460 views • 9 slides

Recursion Announcements Recursive Functions Recursive Functions Definition : A function is

Recursion Announcements Recursive Functions Recursive Functions Definition : A function is called recursive if the body of that function calls itself, either directly or indirectly Implication : Executing the body of a recursive function may

320 views • 18 slides

Recursion Calling a Function from Within Itself Recursion: What is it? Recursive functions are

Recursion Calling a Function from Within Itself Recursion: What is it? Recursive functions are functions which rely on themselves to calculate part of the answer. Recursive functions usually have a base case that causes the recursion to end.

382 views • 10 slides

Recursion What happens when a function calls itself? This is known as a recursive function

Recursion What happens when a function calls itself? This is known as a recursive function Recursion What happens when a function calls itself? This is known as a recursive function Every function call is added to the stack

482 views • 19 slides

Recursion: Introduction and Correctness Lecture B Jones MWF 9-9:50am PCNYN 109 Lecture D

Recursion: Introduction and Correctness Lecture B Jones MWF 9-9:50am PCNYN 109 Lecture D Russell MWF 4-4:50am Center 101 http://cseweb.ucsd.edu/classes/sp16/cse21-bd/ April 11, 2016 Today's plan 1. What's recursion? 2. Correctness of

716 views • 40 slides

Structures for Structural Recursion Paul Downen Philip Johnson-Freyd Zena M. Ariola University

Structures for Structural Recursion Paul Downen Philip Johnson-Freyd Zena M. Ariola University of Oregon ICFP15, August 31 September 2, 2015 Induction and Co-induction Well-founded recursion Well-foundedness implies termination of

517 views • 24 slides

,4 ,4-((

277 views • 3 slides

CS 310 Advanced Data Structures and Algorithms Recursion June 27, 2017 Tong Wang UMass

CS 310 Advanced Data Structures and Algorithms Recursion June 27, 2017 Tong Wang UMass Boston CS 310 June 27, 2017 1 / 20 Recursion Recursion means defining something, such as a function, in terms of itself Recursion is a powerful

219 views • 20 slides

Foundations of Computer Science Lecture 7 Recursion Powerful but Dangerous Recursion and

Foundations of Computer Science Lecture 7 Recursion Powerful but Dangerous Recursion and Induction Recursive Sets and Structures Last Time 1 With induction, it may be easier to prove a stronger claim. 2 Leaping induction. n 3 < 2 n for

183 views • 16 slides

INF421, Lecture 3 Stacks and recursion Leo Liberti LIX, Ecole Polytechnique, France INF421,

INF421, Lecture 3 Stacks and recursion Leo Liberti LIX, Ecole Polytechnique, France INF421, Lecture 3 p. 1 Course Objective : to teach you some data structures and associated algorithms Evaluation : TP not en salle info le 16

1.13k views • 64 slides

RECURSION Chapter 5 Recursive Thinking Section 5.1 1 11/2/2017 Recursive Thinking

11/2/2017 RECURSION Chapter 5 Recursive Thinking Section 5.1 1 11/2/2017 Recursive Thinking Recursion is a problem-solving approach that can be used to generate simple solutions to certain kinds of problems that are difficult to solve

530 views • 30 slides

Experimental Analysis Guidelines for Presenting Data 3. Examples Marco Chiarandini Results Task

Outline DM811 HEURISTICS AND LOCAL SEARCH ALGORITHMS 1. Experimental Algorithmics FOR COMBINATORIAL OPTIMZATION Definitions Performance Measures 2. Exploratory Data Analysis Lecture 13 Sample Statistics Scenarios of Analysis Experimental

737 views • 18 slides

An empirical study of Gaussian belief propagation and application in the detection of F-formations

Regularized Gaussian belief propagation Empirical Study F-formation detection Concluding Remarks An empirical study of Gaussian belief propagation and application in the detection of F-formations Francois Kamper Stellenbosch University

578 views • 20 slides

Advice for applying Machine Learning Andrew Ng Stanford University Andrew Y. Ng Todays

Advice for applying Machine Learning Andrew Ng Stanford University Andrew Y. Ng Todays Lecture Advice on getting learning algorithms to work. Most of today s material is not very mathematical. But it s also some of the

387 views • 26 slides

Adding Factors and Interactions Danielle Quinn PhD Candidate, Memorial University Regression

Regression Modeling in R: Case Studies REGRESSION MODELING IN R : CASE STUDIES Adding Factors and Interactions Danielle Quinn PhD Candidate, Memorial University Regression Modeling in R: Case Studies Identifying additional factors

620 views • 33 slides

Visualization of Linear Models Correlation and Regression Possums > ggplot(data = possum,

CORRELATION AND REGRESSION Visualization of Linear Models Correlation and Regression Possums > ggplot(data = possum, aes(y = totalL, x = tailL)) + geom_point() Correlation and Regression Through the origin > ggplot(data = possum,

406 views • 23 slides

Vis u ali z ation of Linear Models C OR R E L ATION AN D R E G R E SSION IN R Ben Ba u mer

Vis u ali z ation of Linear Models C OR R E L ATION AN D R E G R E SSION IN R Ben Ba u mer Assistant Professor at Smith College Poss u ms ggplot(data = possum, aes(y = totalL, x = tailL)) + geom_point() CORRELATION AND REGRESSION IN R Thro

440 views • 23 slides

MACHINE LEARNING kernels 1 MACHINE LEARNING 2012 MACHINE LEARNING Kernels: Intuition How

MACHINE LEARNING 2012 MACHINE LEARNING MACHINE LEARNING kernels 1 MACHINE LEARNING 2012 MACHINE LEARNING Kernels: Intuition How to separate the red class from the grey class? x 2 360 r x 1 Polar coordinates Data

1.04k views • 44 slides

Linear & nonlinear classifiers Machine Learning Hamid Beigy Sharif University of Technology

Linear & nonlinear classifiers Machine Learning Hamid Beigy Sharif University of Technology Fall 1393 Hamid Beigy (Sharif University of Technology) Linear & nonlinear classifiers Fall 1393 1 / 34 Table of contents Introduction 1

2.42k views • 34 slides

Web Mining and Recommender Systems Supervised learning Regression Learning Goals Introduce

Web Mining and Recommender Systems Supervised learning Regression Learning Goals Introduce the concept of Supervised Learning Understand the components (inputs and outputs) of supervised learning problems Introduce linear

1.36k views • 122 slides

Sco$ Speidel, Colorado State University 6/1/17 Brief Stayability

Sco$ Speidel, Colorado State University 6/1/17 Brief Stayability introduction Challenges associated with the evaluation of Stayability Progression toward improvement Random Regression What is it?

258 views • 6 slides