CSE 589 Applied Algorithms Spring 1999
Implicit Pointers of the Binary Heap
Heapsort
Logical Look at Heapsort
Building a Heap
Floyd’s Method (1)
Floyd’s Method (2)
Floyd’s Method (3)
Floyd’s Method (4)
Floyd’s Method (5)
Floyd’s Method (6)
Analysis of Floyd’s Method
Cache Performance of Build Heap
Spatial Locality of the Binary Heap
Poor Utilization of the Binary Heap
Cache Conscious Heap
Computing the Children and Parents of an Aligned d-Heap
Delete-Max in CC Heap
Good Utilization of the 4-Heap
Cache Performance of Heaps
Instruction Count for Heaps
Height of a d-Heap
Time to Percolate Down in a d-Heap
Plot of Instructions for Varying b
Execution Time for Heapsort
Heapsort Notes
Cache Misses for Sorting Algorithms
Instructions for Sorting Algorithms
Execution Time for Sorting Algorithms
Cache Conscious Static Search
Tree Structure for Binary Search
Spatial Locality of Binary Search
Multi-way Static Search
Organization of Search Structure
Calculating the Pointers
Example Search Path
Search Algorithm
Average Cache Line Utilization
Utilization is Not Everything
Cache Misses Per Search
Accesses per Search
Cycles per Search
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