cpsc 320 intermediate algorithm design and analysis
play

CPSC 320: Intermediate Algorithm Design and Analysis Schedule - PDF document

Mar 29, 2024 •263 likes •424 views

CPSC 320: Intermediate Algorithm Design and Analysis Schedule transformation example Schedule transformation example Theorem: If S j is a reduced schedule that is the same as S FF for the first requests, then there is a reduced schedule S j+1

  1. CPSC 320: Intermediate Algorithm Design and Analysis Schedule transformation example Schedule transformation example Theorem: If S j is a reduced schedule that is the same as S FF for the first requests, then there is a reduced schedule S j+1 that is the same as S FF for the first j+1 requests, and incurs no more misses than S j . CPSC 320 – 2013W T2 2

  2. Initial state Request S FF S 0 S 1 Initial Cache a f c e a f c e a f c e c a f c e a f c e x x f c e x f c e i x f c i x i c e c x f c i x i c e f x f c i x i c f g x g c i x i g f x x g c i x i g f i x g c i x i g f y x g y i x i g y z z g y i x i g z i z g y i x i g z y z g y i x y g z CPSC 320 – 2013W T2 3 Case 1: item is already in the cache Request S FF S 0 S 1 Initial Cache a f c e a f c e a f c e c a f c e a f c e a f c e x x f c e x f c e x f c e i x f c i x i c e x i c e c x f c i x i c e x i c e f x f c i x i c f x i c f g x g c i x i g f x i g f x x g c i x i g f x i g f i x g c i x i g f x i g f y x g y i x i g y x i g y z z g y i x i g z x i g z i z g y i x i g z x i g z y z g y i x y g z x y g z CPSC 320 – 2013W T2 4

  3. Case 2: S evicts the same item as S FF Request S FF S 1 S 2 Initial Cache a f c e a f c e a f c e c a f c e a f c e a f c e x x f c e x f c e x f c e i x f c i x i c e x i c e c x f c i x i c e x i c e f x f c i x i c f x i c f g x g c i x i g f x i g f x x g c i x i g f x i g f i x g c i x i g f x i g f y x g y i x i g y x i g y z z g y i x i g z x i g z i z g y i x i g z x i g z y z g y i x y g z x y g z CPSC 320 – 2013W T2 5 Case 3a: S evicts a different item from S FF Request S FF S 2 S 3 Initial Cache a f c e a f c e a f c e c a f c e a f c e a f c e x x f c e x f c e x f c e i x f c i x i c e x i c e c x f c i x i c e x i c e f x f c i x i c f x i c f g x g c i x i g f x i g f x x g c i x i g f x i g f i x g c i x i g f x i g f y x g y i x i g y x i g y z z g y i x i g z x i g z i z g y i x i g z x i g z y z g y i x y g z x y g z CPSC 320 – 2013W T2 6

  4. Case 3a: S evicts a different item from S FF Request S FF S 2 S 3 Initial Cache a f c e a f c e a f c e c a f c e a f c e a f c e x x f c e x f c e x f c e i x f c i x i c e x f c i c x f c i x i c e x i c e f x f c i x i c f x i c f g x g c i x i g f x i g f x x g c i x i g f x i g f i x g c i x i g f x i g f y x g y i x i g y x i g y z z g y i x i g z x i g z i z g y i x i g z x i g z y z g y i x y g z x y g z CPSC 320 – 2013W T2 7 Case 3a: S evicts a different item from S FF Request S FF S 2 S 3 Initial Cache a f c e a f c e a f c e c a f c e a f c e a f c e x x f c e x f c e x f c e i x f c i x i c e x f c i c x f c i x i c e x f c i f x f c i x i c f x i c f g x g c i x i g f x i g f x x g c i x i g f x i g f i x g c i x i g f x i g f y x g y i x i g y x i g y z z g y i x i g z x i g z i z g y i x i g z x i g z y z g y i x y g z x y g z CPSC 320 – 2013W T2 8

  5. Case 3a: S evicts a different item from S FF Request S FF S 2 S 3 Initial Cache a f c e a f c e a f c e c a f c e a f c e a f c e x x f c e x f c e x f c e i x f c i x i c e x f c i c x f c i x i c e x f c i f x f c i x i c f x f c i g x g c i x i g f x i g f x x g c i x i g f x i g f i x g c i x i g f x i g f y x g y i x i g y x i g y z z g y i x i g z x i g z i z g y i x i g z x i g z y z g y i x y g z x y g z CPSC 320 – 2013W T2 9 Case 3a: S evicts a different item from S FF Request S FF S 2 S 3 Initial Cache a f c e a f c e a f c e c a f c e a f c e a f c e x x f c e x f c e x f c e i x f c i x i c e x f c i c x f c i x i c e x f c i f x f c i x i c f x f c i g x g c i x i g f x i g f x x g c i x i g f x i g f i x g c i x i g f x i g f y x g y i x i g y x i g y z z g y i x i g z x i g z i z g y i x i g z x i g z y z g y i x y g z x y g z CPSC 320 – 2013W T2 10

  6. Case 1 again. Request S FF S 3 S 4 Initial Cache a f c e a f c e a f c e c a f c e a f c e a f c e x x f c e x f c e x f c e i x f c i x f c i x f c i c x f c i x f c i x f c i f x f c i x f c i x f g i g x g c i x f g i x f g i x x g c i x f g i x f g i i x g c i x f g i x y g i y x g y i x y g i x z g i z z g y i x z g i x z g i i z g y i x z g i x z g i y z g y i x z g y x z g y CPSC 320 – 2013W T2 11 Case 1 again. Request S FF S 4 S 5 Initial Cache a f c e a f c e a f c e c a f c e a f c e a f c e x x f c e x f c e x f c e i x f c i x f c i x f c i c x f c i x f c i x f c i f x f c i x f c i x f c i g x g c i x f g i x f g i x x g c i x f g i x f g i i x g c i x f g i x y g i y x g y i x y g i x z g i z z g y i x z g i x z g i i z g y i x z g i x z g i y z g y i x z g y x z g y CPSC 320 – 2013W T2 12

  7. Case 3b: S evicts a different item from S FF Request S FF S 5 S 6 Initial Cache a f c e a f c e a f c e c a f c e a f c e a f c e x x f c e x f c e x f c e i x f c i x f c i x f c i c x f c i x f c i x f c i f x f c i x f c i x f c i g x g c i x f g i x f g i x x g c i x f g i x f g i i x g c i x f g i x y g i y x g y i x y g i x z g i z z g y i x z g i x z g i i z g y i x z g i x z g i y z g y i x z g y x z g y CPSC 320 – 2013W T2 13 Case 3b: S evicts a different item from S FF Request S FF S 5 S 6 Initial Cache a f c e a f c e a f c e c a f c e a f c e a f c e x x f c e x f c e x f c e i x f c i x f c i x f c i c x f c i x f c i x f c i f x f c i x f c i x f c i g x g c i x f g i x g c i x x g c i x f g i x f g i i x g c i x f g i x y g i y x g y i x y g i x z g i z z g y i x z g i x z g i i z g y i x z g i x z g i y z g y i x z g y x z g y CPSC 320 – 2013W T2 14

  8. Case 3b: S evicts a different item from S FF Request S FF S 5 S 6 Initial Cache a f c e a f c e a f c e c a f c e a f c e a f c e x x f c e x f c e x f c e i x f c i x f c i x f c i c x f c i x f c i x f c i f x f c i x f c i x f c i g x g c i x f g i x g c i x x g c i x f g i x g c i i x g c i x f g i x y g i y x g y i x y g i x z g i z z g y i x z g i x z g i i z g y i x z g i x z g i y z g y i x z g y x z g y CPSC 320 – 2013W T2 15 Case 3b: S evicts a different item from S FF Request S FF S 5 S 6 Initial Cache a f c e a f c e a f c e c a f c e a f c e a f c e x x f c e x f c e x f c e i x f c i x f c i x f c i c x f c i x f c i x f c i f x f c i x f c i x f c i g x g c i x f g i x g c i x x g c i x f g i x g c i i x g c i x f g i x g c i y x g y i x y g i x z g i z z g y i x z g i x z g i i z g y i x z g i x z g i y z g y i x z g y x z g y CPSC 320 – 2013W T2 16

Recommend

CPSC 320: Intermediate Algorithm Design and Analysis July 18, 2014 1 Course Outline

CPSC 320: Intermediate Algorithm Design and Analysis July 18, 2014 1 Course Outline

CPSC 320: Intermediate Algorithm Design and Analysis July 18, 2014 1 Course Outline Introduction and basic concepts Asymptotic notation Greedy algorithms Graph theory Amortized analysis Recursion

638 views • 25 slides
CPSC 320: Intermediate Algorithm Design and Analysis July 28, 2014 1 Course Outline

CPSC 320: Intermediate Algorithm Design and Analysis July 28, 2014 1 Course Outline

CPSC 320: Intermediate Algorithm Design and Analysis July 28, 2014 1 Course Outline Introduction and basic concepts Asymptotic notation Greedy algorithms Graph theory Amortized analysis Recursion

536 views • 25 slides
CPSC 320: Intermediate Algorithm Design and Analysis July 25, 2014 1 Course Outline

CPSC 320: Intermediate Algorithm Design and Analysis July 25, 2014 1 Course Outline

CPSC 320: Intermediate Algorithm Design and Analysis July 25, 2014 1 Course Outline Introduction and basic concepts Asymptotic notation Greedy algorithms Graph theory Amortized analysis Recursion

301 views • 18 slides
CPSC 320: Intermediate Algorithm Design and Analysis August 6, 2014 1 Schedule Monday: BC Day,

CPSC 320: Intermediate Algorithm Design and Analysis August 6, 2014 1 Schedule Monday: BC Day,

CPSC 320: Intermediate Algorithm Design and Analysis August 6, 2014 1 Schedule Monday: BC Day, no classes Wednesday: Quiz 5 (NP and NP completeness) Review: Amortized Analysis Friday: Survey (bonus marks)

518 views • 14 slides
Amortized Analysis of Union/Find operations CPSC 320 2012W T1 1 Potential Function

Amortized Analysis of Union/Find operations CPSC 320 2012W T1 1 Potential Function

CPSC 320: Intermediate Algorithm Design and Analysis Amortized Analysis of Union/Find operations CPSC 320 2012W T1 1 Potential Function Relationships between a node N and its parent P: N is close if log 2 rank(N) = log 2

351 views • 14 slides
Asymptotic Behavior Algorithm : Design & Analysis [2] In the last class Goal of the

Asymptotic Behavior Algorithm : Design & Analysis [2] In the last class Goal of the

Asymptotic Behavior Algorithm : Design & Analysis [2] In the last class Goal of the Course Algorithm: the Concept Algorithm Analysis: the Contents Average and Worst-Case Analysis Lower Bounds and the Complexity of

819 views • 34 slides
Algorithm Analysis October 12, 2016 CMPE 250 Algorithm Analysis October 12, 2016 1 / 66

Algorithm Analysis October 12, 2016 CMPE 250 Algorithm Analysis October 12, 2016 1 / 66

Algorithm Analysis October 12, 2016 CMPE 250 Algorithm Analysis October 12, 2016 1 / 66 Problem Solving: Main Steps Problem definition 1 Algorithm design / Algorithm specification 2 Algorithm analysis 3 Implementation 4 Testing 5

943 views • 66 slides
CS141: Intermediate Data Structures and Algorithms Analysis of Algorithms Amr Magdy Analyzing

CS141: Intermediate Data Structures and Algorithms Analysis of Algorithms Amr Magdy Analyzing

CS141: Intermediate Data Structures and Algorithms Analysis of Algorithms Amr Magdy Analyzing Algorithms Algorithm Correctness 1. Termination a. Produces the correct output for all possible input. b. Algorithm Performance 2. Either

579 views • 47 slides
CPSC 320: NP-Completeness CPSC 320 2013W2 CPSC 320: NP-Completeness Up to now: We have been

CPSC 320: NP-Completeness CPSC 320 2013W2 CPSC 320: NP-Completeness Up to now: We have been

CPSC 320: NP-Completeness CPSC 320 2013W2 CPSC 320: NP-Completeness Up to now: We have been learning recipes to design efficient algorithms. Every problem we looked at can be solved in O(n), or O(n log n), or O(n 2 ), or maybe O(n 3

740 views • 29 slides
CSE 101 Algorithm Design and Analysis Sanjoy Dasgupta, Russell Impagliazzo, Ragesh Jaiswal

CSE 101 Algorithm Design and Analysis Sanjoy Dasgupta, Russell Impagliazzo, Ragesh Jaiswal

CSE 101 Algorithm Design and Analysis Sanjoy Dasgupta, Russell Impagliazzo, Ragesh Jaiswal Modification vs. Reduction: The Max Bandwidth path problem Thanks, Miles Jones ALGORITHM MINING TECHNIQUES Deeper Analysis: What else does the

609 views • 47 slides
Analysis of Algorithms Amr Magdy Analyzing Algorithms Algorithm Correctness 1. Termination a.

Analysis of Algorithms Amr Magdy Analyzing Algorithms Algorithm Correctness 1. Termination a.

CS141: Intermediate Data Structures and Algorithms Analysis of Algorithms Amr Magdy Analyzing Algorithms Algorithm Correctness 1. Termination a. Produces the correct output for all possible input. b. Algorithm Performance 2. Either

1.02k views • 64 slides
CPSC 231 - Lab CONIDITONS I Let's make pasta! What is algorithm? A process or set of

CPSC 231 - Lab CONIDITONS I Let's make pasta! What is algorithm? A process or set of

CPSC 231 - Lab CONIDITONS I Let's make pasta! What is algorithm? A process or set of rules to be followed in calculations or other problem-solving operations, especially by a computer. Pasta Algorithm! Boil water in a large pot: use at

959 views • 14 slides
Algorithm Design Maria-Florina (Nina) Balcan Carnegie Mellon University Analysis and Design of

Algorithm Design Maria-Florina (Nina) Balcan Carnegie Mellon University Analysis and Design of

Sample Complexity for Data Driven Algorithm Design Maria-Florina (Nina) Balcan Carnegie Mellon University Analysis and Design of Algorithms Classic algo design: solve a worst case instance. Easy domains, have optimal poly time algos.

993 views • 43 slides
DFS Search on Undirected Graphs Algorithm : Design & Analysis [13] In the last class

DFS Search on Undirected Graphs Algorithm : Design & Analysis [13] In the last class

DFS Search on Undirected Graphs Algorithm : Design & Analysis [13] In the last class Directed Acyclic Graph Topological Order Critical Path Analysis Strongly Connected Component Strong Component and Condensation

421 views • 24 slides
MergeSort [5] In the last class Insertion sort Analysis of insertion sorting algorithm

MergeSort [5] In the last class Insertion sort Analysis of insertion sorting algorithm

Algorithm : Design & Analysis MergeSort [5] In the last class Insertion sort Analysis of insertion sorting algorithm Lower bound of local comparison based sorting algorithm General pattern of divide-and-conquer

623 views • 26 slides
Algorithm Design and Analysis L ECTURES 37+ Randomized Algorithms Min-cut

Algorithm Design and Analysis L ECTURES 37+ Randomized Algorithms Min-cut

Algorithm Design and Analysis L ECTURES 37+ Randomized Algorithms Min-cut Adam Smith 11/3/10 A. Smith; based on slides by E. Demaine, C. Leiserson, S. Raskhodnikova, K. Wayne Final Exam Cumulative Less

673 views • 23 slides
Data Driven Algorithm Design Maria-Florina (Nina) Balcan Carnegie Mellon University Analysis and

Data Driven Algorithm Design Maria-Florina (Nina) Balcan Carnegie Mellon University Analysis and

Data Driven Algorithm Design Maria-Florina (Nina) Balcan Carnegie Mellon University Analysis and Design of Algorithms Classic algo design: solve a worst case instance. Easy domains, have optimal poly time algos. E.g., sorting, shortest

768 views • 43 slides
Computer Science & Engineering 423/823 Introduction Design and Analysis of Algorithms

Computer Science & Engineering 423/823 Introduction Design and Analysis of Algorithms

CSCE423/823 Computer Science & Engineering 423/823 Introduction Design and Analysis of Algorithms Bellman-Ford Algorithm Lecture 05 Single-Source Shortest Paths (Chapter 24) SSSPs in Directed Acyclic Graphs Dijkstras Algorithm

763 views • 36 slides
Computer Science & Engineering 423/823 Introduction Design and Analysis of Algorithms

Computer Science & Engineering 423/823 Introduction Design and Analysis of Algorithms

CSCE423/823 Computer Science & Engineering 423/823 Introduction Design and Analysis of Algorithms Kruskals Algorithm Lecture 04 Minimum-Weight Spanning Trees (Chapter 23) Prims Algorithm Stephen Scott (Adapted from

336 views • 18 slides
+ Design of Parallel Algorithms Course Introduction + CSE 4163/6163 Parallel Algorithm Analysis

+ Design of Parallel Algorithms Course Introduction + CSE 4163/6163 Parallel Algorithm Analysis

+ Design of Parallel Algorithms Course Introduction + CSE 4163/6163 Parallel Algorithm Analysis & Design n Course Web Site: http://www.cse.msstate.edu/~luke/Courses/fl16/CSE4163 n Instructor: Ed Luke n Office: Butler 330 (or HPCC

214 views • 19 slides
Introduction to Algorithm Analysis Algorithm : Design & Analysis [1] As soon as an

Introduction to Algorithm Analysis Algorithm : Design & Analysis [1] As soon as an

Introduction to Algorithm Analysis Algorithm : Design & Analysis [1] As soon as an Analytical Engine exists, it will necessarily guide the future As soon as an Analytical Engine exists, it will necessarily guide the future course of the

599 views • 31 slides
Dynamic Programming - II Algorithm : Design & Analysis [17] In the last class

Dynamic Programming - II Algorithm : Design & Analysis [17] In the last class

Dynamic Programming - II Algorithm : Design & Analysis [17] In the last class Recursion and Subproblem Graph Basic Idea of Dynamic Programming Least Cost of Matrix Multiplication Extracting Optimal Multiplication Order

666 views • 28 slides
Welcome to CSCI 256: Algorithm Design and Analysis Quick Logistics Please mute yourself if

Welcome to CSCI 256: Algorithm Design and Analysis Quick Logistics Please mute yourself if

Welcome to CSCI 256: Algorithm Design and Analysis Quick Logistics Please mute yourself if you are on the zoom call! Students want to see the slides; if you are unmuted and make a noise it will switch to your camera Make sure your

576 views • 41 slides
CSE 101 Algorithm Design and Analysis Russell Impagliazzo Miles Jones mej016@eng.ucsd.edu

CSE 101 Algorithm Design and Analysis Russell Impagliazzo Miles Jones mej016@eng.ucsd.edu

CSE 101 Algorithm Design and Analysis Russell Impagliazzo Miles Jones mej016@eng.ucsd.edu russell@eng.ucsd.edu Russells Office 4248 CSE Bulding Miles Office 4208 CSE Building Kruskals algorithm for finding the minimum spanning tree

755 views • 32 slides

More recommend