CSE 589Applied AlgorithmsSpring 1999

Table of Contents

CSE 589Applied AlgorithmsSpring 1999

Recursive Mergesort

Mergesort Call Tree

Merging Pattern of Recursive Mergesort

Notes on Recursive Mergesort

Reorder the Merging Steps

Interative Mergesort

Interative Mergesort Access Pattern

Analysis of Access Pattern

Performance of Iterative Mergesort

Cache Performance Matters

Cache Model

Cache Miss Terminolgy

Cache Conscious Mergesort Execution Performance

Cache Conscious Mergesort

Cache Conscious Mergesort

Traversal Analysis

Traversal Longer than Cache

Analysis of Cache Misses

Iterative Mergesort Cache Misses

Cache Conscious Merge Sort Analysis

Cache Conscious Misses

Simulated Cache Performance

Instruction Counts

What About Recursive Mergesort?

Notes on Cache Performance

Some Guiding Principles

Heapsort

Insert

Insert (2)

Insert (3)

Insert (3)

Delete-Max

Delete-Max (2)

Delete-Max (3)

Delete-Max (4)

Delete-Max (5)

Delete-Max (5)

Analysis of the Heap Operation

Implicit Pointers

Heapsort

Email: ladner@cs.washington.edu

Home Page: http://www.cs.washington.edu/education/courses/589/CurrentQtr/

Other information:
CSE 589: Applied Algorithms

Download presentation source