for dynamic programs (dp) recursive divide- consider the ...esaule/nsf-pi-csr-2017...our wr-dps use...

1

We can even autogenerate those recursive algorithms (known as R-DPs)! But R-DPs may have lower parallelism than iterative wavefront algorithms Consider the DP for the Longest Common Subsequence (LCS) problem as an example But LCS R-DP loses parallelism due to false dependencies! Our WR-DPs use “timing functions” to launch recursive functions in wavefront order WR-DPs are efficient in theory For Dynamic Programs (DP) recursive divide- &-conquer has advantages over iterative codes! LCS has a simple R-DP using linear space We can systematically transform an R-DP to WR-DP by incorporating the timing functions WR-DPs are also efficient in practice WR-DPs have good bounds under state-of-the- art schedulers for shared-memory programs We propose recursive wavefront algorithms (WR-DPs) – R-DPs with improved parallelism Other work partially supported by CNS-1553510 (PI: Rezaul Chowdhury)

Upload: others

Post on 26-Jun-2020

2 views

Category:

Documents

0 download

Report

Download

Embed Size (px):

TRANSCRIPT

Page 1: For Dynamic Programs (DP) recursive divide- Consider the ...esaule/NSF-PI-CSR-2017...Our WR-DPs use "timing functions" to launch For Dynamic Programs (DP) recursive divide- L if X

We can even autogenerate thoserecursive algorithms (known as R-DPs)!

But R-DPs may have lower parallelism than iterative wavefront algorithms

Consider the DP for the Longest Common Subsequence (LCS) problem as an example

But LCS R-DP loses parallelism due to false dependencies!

Our WR-DPs use “timing functions” to launch recursive functions in wavefront order

WR-DPs are efficient in theory

For Dynamic Programs (DP) recursive divide-&-conquer has advantages over iterative codes!

LCS has a simple R-DP using linear space We can systematically transform an R-DP to WR-DP by incorporating the timing functions

WR-DPs are also efficient in practice

WR-DPs have good bounds under state-of-the-art schedulers for shared-memory programs

We propose recursive wavefront algorithms (WR-DPs) – R-DPs with improved parallelism

Other work partially supported by CNS-1553510 (PI: Rezaul Chowdhury)

8.5 Using Recursive Rules with Sequences - Big Ideas Math · Evaluate recursive rules for sequences. Write recursive rules for sequences. Translate between recursive and explicit

Divide-and-Conquer UNC Chapel HillZ. Guo. Divide-and-Conquer It’s a technique instead of an algorithm Recursive in structure – Divide the problem into

Recursive Algorithms - homepages.math.uic.eduhomepages.math.uic.edu/~jan/mcs275/recursion.pdf · Recursive Algorithms 1 Recursive Functions ... Computes the factorial of nbr recursively

FPtree/FPGrowth. FP-Tree/FP-Growth Algorithm Use a compressed representation of the database using an FP-tree Then use a recursive divide-and-conquer

Recursive Static Route · Information About Recursive Static Route Recursive Static Routes Arecursivestaticrouteisaroutewhosenexthopandthedestinationnetworkarecoveredbyanotherlearned

Divide and Conquer Strategy for Problem Solving - Recursive …web.eecs.umich.edu/~aprakash/eecs282/lectures/11-recursion.pdf · Divide and Conquer Strategy for Problem Solving -

Merge and Quick Sort - homepages.math.uic.eduhomepages.math.uic.edu/~jan/mcs275/quicksort.pdf · Merge and Quick Sort 1 Divide and Conquer applied to sorting recursive and iterative

Recursion - RISC · The most famous one is probably the factorial function . ... Which computes correctly: Recursion is usually a divide ... Write a recursive procedure to compute

LECTURE 6: DP, GREEDY ALGORITHMS ADVANCED …theory.cs.utah.edu/fall18/algorithms/slides/lecture6.pdfLECTURE 6 LAST CLASS 3 Dynamic programming Recursive algorithms — observe that

16-May-15 Dynamic Programming. 2 Algorithm types Algorithm types we will consider include: Simple recursive algorithms Backtracking algorithms Divide

Divide-and-Conquer Recursive in structure –Divide the problem into several smaller sub-problems that are similar to the original but smaller in size –Conquer

Recursive Algorithms Recursive procedure

Quicksort. 2 A short list of categories Algorithm types we will consider include: Simple recursive algorithms Backtracking algorithms Divide and conquer

0 Recursive Markov Decision Processes and Recursive ...homepages.inf.ed.ac.uk/kousha/j_sub_rmdp_rssg.pdf · Recursive Markov Decision Processes and Recursive Stochastic Games 0:3

Completely Subtyping Iso-recursive Types - USFligatti/papers/subIsoTR.pdfCompletely Subtyping Iso-recursive Types ... cused more on equi-recursive than iso-recursive systems. For exam-

Recursive Data Structures and Grammars Themes Recursive Description of Data Structures Recursive Definitions of Properties of Data Structures Recursive

1 Today’s Material Divide & Conquer (Recursive) Sorting Algorithms –QuickSort External Sorting

noter ch.3 Modeling recursive structure by class hierarchy ... · Recursive data structures noter ch.3 Modeling recursive structure by class hierarchy Recursive traversal of structure

Chapter 11 – Recursion Recursive Processes Writing a Recursive Method A Recursive Factorial Method Comparison of Recursive and Iterative Solutions Recursive

Recursive Dynamic CS: Recursive Recovery of Sparse Signal ...home.engineering.iastate.edu/~namrata/TSP_RecRecon_Paper_4.pdf · Recursive Dynamic CS: Recursive Recovery of Sparse Signal

Divide and Conquer Sorting Strategy Merge Sort Quick Sort · Merge Sort Implementation Need 2 functions MergeSort() function A Recursive function that divide the array into pieces

Divide and Conquer. Recall Complexity Analysis – Comparison of algorithm – Big O Simplification From source code – Recursive

Recursive Neural Networks - Technion – Israel this assignment” Recursive Neural Networks for Structure Predicon Recursive Neural Networks for Structure Predicon A standard Recursive

DESIGN OF NON-RECURSIVE AND RECURSIVE … OF NON-RECURSIVE AND RECURSIVE DIGITAL BAND PASS FILTERS FOR GENERAL PURPOSE APPLICATIONS Barreto Guerra, Jean Paul [email protected]

Recursive data structures noter ch.3 Modeling recursive structure by class hierarchy Recursive traversal of structure

1 Dynamic Programming (DP) Like divide-and-conquer, solve problem by combining the solutions to sub-problems. Differences between divide-and-conquer and

1 Divide & Conquer Algorithms Part 4. 2 Recursion Review A function that calls itself either directly or indirectly through another function Recursive

Backtracking. 2 A short list of categories Algorithm types we will consider include: Simple recursive algorithms Backtracking algorithms Divide and conquer

Lecture6 - Analysing Recursive Algorithms - Divide and Conquer; Sorting

Recursive Deﬁnitions and Structural Induction 1 Recursive

CS 312 - Divide and Conquer/Recurrence Relations1 Recurrence Relations Time complexity for Recursive Algorithms – Can be more difficult to solve than for

Data Structures and Algorithms 1 - edX...– Sequential search for value K •Backtracking、search – Eight queens problem、traversal of trees and graphs •A recursive divide and

Recursive Static Route - cisco.com · Recursive Static Route TheRecursiveStaticRoutefeatureenablesyoutoinstallarecursivestaticrouteintotheRoutingInformation …

1 Today’s Material Recursive (Divide & Conquer) Algorithms –Design –Analysis

Four different groups of recursive tests Forward recursive tests