Table of Contents
Csci 2111: Data and File Structures Week 6, Lectures 1 & 2
Definition
Overview
A Model for Implementing Cosequential Processes: Matching I
A Model for Implementing Cosequential Processes: Matching II
A Model for Implementing Cosequential Processes: Matching III
A Model for Implementing Cosequential Processes: Merging I
Application of the Cosequential Model to a General Ledger Program I
Application of the Cosequential Model to a General Ledger Program II
Application of the Cosequential Model to a General Ledger Program III
Application of the Cosequential Model to a General Ledger Program IV
Application of the Cosequential Model to a General Ledger Program V
A K-Way Merge Algorithm
A Selection Tree for Merging Large Number of Lists
Keeping Trees of Losers rather than Trees of Winners I
Keeping Trees of Losers rather than Trees of Winners II
An Efficient Approach to Sorting in Memory
Overlapping Processing and I/O: Heapsort
Building the Heap
Building the Heap while Reading the File I
Building the Heap while Reading the File II
Heap Sorting I
Heap Sorting II
Heap Sorting while Writing to the File
An Efficient way of Sorting Large Files on Disks: MergeSort
MergeSort: Advantages
How much Time does a MergeSort take?
What kinds of I/O take place during the Sort and the Merge phases?
The Cost of Increasing the File Size
What can be done to Improve MergeSort Performance?
Hardware-Based Improvements
Decreasing the Number of Seeks Using Multiple-Step Merges
Increasing Run Lengths Using Replacement Selection
Analysis of Run Length Selection
Replacement Selection + MultiStep Merging
Using Two Disk Drives with Replacement Selection
More Drives? More Processor?
|