Скачать презентацию Back to George One More Time O
a5e95c62e498187c886a2445d13e8068.ppt
- Количество слайдов: 104
Скачать презентацию Back to George One More Time O
Скачать презентацию Back to George One More Time O
Back to George One More Time
O() Analysis Reasonable vs. Unreasonable Algorithms Using O() Analysis in Design Concurrent Systems Parallelism
Recipe for Determining O()
LB Comparing Data Structures and Methods
Reasonable vs. Unreasonable Algorithms
Algorithmic Performance Thus Far
The Power of Exponents
The Wise Peasant’s Pay
LB So the King cut off the peasant’s head.
The Towers of Hanoi
The Towers of Hanoi
The Towers of Hanoi
The Towers of Hanoi
The Towers of Hanoi
The Towers of Hanoi
The Towers of Hanoi
The Towers of Hanoi
The Towers of Hanoi
The Towers of Hanoi
The Towers of Hanoi
The Towers of Hanoi
The Towers of Hanoi
The Towers of Hanoi
The Towers of Hanoi
The Towers of Hanoi
The Towers of Hanoi
Towers of Hanoi - Complexity
The Bounded Tile Problem
The Bounded Tile Problem
Tiling a 5 x 5 Area
Tiling a 5 x 5 Area
Tiling a 5 x 5 Area
Tiling a 5 x 5 Area
Tiling a 5 x 5 Area
Analysis of the Bounded Tiling Problem
Tiling (N!) Runtime
A Faster Computer
Where Does this Leave Us?
Performance Categories of Algorithms
Reasonable vs. Unreasonable
Reasonable vs. Unreasonable
Two Categories of Algorithms
Summary
Questions?
Using O() Analysis in Design
Questions?
Concurrent Systems
Sequential Processing
A Non-sequential Example
Another Non-sequential Example
Concurrent Systems
Advantages of Concurrency
Disadvantages of Concurrency
Achieving Concurrency
Achieving Concurrency
Concurrency vs. Parallelism
Types of Concurrent Systems
Multiprogramming
Multiprogramming
Multiprogramming
Multiprocessing
Multiprocessing
Multiprocessing
Multitasking
Multitasking
Multitasking
Distributed Systems
Distributed Systems
Questions?
Parallelism
Parallelism
Parallelism
Parallelism
Pipeline Processing
Example
One Load
Three Loads
Examples of Pipelined Tasks
Task Queues
Parallelizing Algorithms
Parallel Bubblesort
Completion Time of Bubblesort
Product Complexity
Ceiling of Improvement
Number of Processors
Adding Processors
Overhead of Parallelization
What We Know about Tasks
Questions?
Matrix Multiplication
Inner Product Procedure
Questions?
Скачать презентацию Back to George One More Time O
a5e95c62e498187c886a2445d13e8068.ppt