Introduction to Algorithms
6.046J/18.401J LECTURE 5
Sorting Lower Bounds Decision trees Linear-Time Sorting Counting sort Radix sort Appendix: Punched cards Prof. Erik Demaine
September 26, 2005 Copyright 2001-5 Erik D. Demaine and Charles E. Leiserson L5
Introduction to Algorithms
6.046J/18.401J LECTURE 4
Quicksort Divide and conquer Partitioning Worst-case analysis Intuition Randomized quicksort Analysis Prof. Charles E. Leiserson
September 21, 2005 Copyright 2001-5 by Erik D. Demaine and Charles E. Leis
Introduction to Algorithms
6.046J/18.401J LECTURE 3
Divide and Conquer Binary search Powering a number Fibonacci numbers Matrix multiplication Strassen's algorithm VLSI tree layout Prof. Erik D. Demaine
September 14, 2005 Copyright 2001-5 Erik D. Demaine
Introduction to Algorithms
6.046J/18.401J LECTURE 2
Asymptotic Notation O-, -, and -notation Recurrences Substitution method Iterating the recurrence Recursion tree Master method Prof. Erik Demaine
September 12, 2005 Copyright 2001-5 Erik D. Demaine and C
Introduction to Algorithms 6.046J/18.401J
LECTURE 1
Analysis of Algorithms Insertion sort Asymptotic analysis Merge sort Recurrences
Prof. Charles E. Leiserson
Copyright 2001-5 Erik D. Demaine and Charles E. Leiserson
Course information
1. 2. 3. 4. 5. 6.
Prof Thriveni T K
Advanced Computer Architecture
Hwang, Chapter 7
Multiprocessors and Multicomputers
7.4 Message Passing Mechanisms
Message Passing in Multicomputers
Multicomputers have no shared memory,
and each computer consists of a single
processor,
Prof Thriveni T K
Advanced Computer Architecture
Hwang, Chapter 7
Multiprocessors and Multicomputers
7.2 Cache Coherence &
Synchronization
The Cache Coherence Problem
Since there are multiple levels in a memory
hierarchy, with some of these levels privat
Prof Thriveni T K
Advanced Computer Architecture
Hwang, Chapter 7
Multiprocessors and Multicomputers
7.1 Multiprocessor System
Interconnects
Generalized Multiprocessor System
Generalized Multiprocessor System
Each processor Pi is attached to its own loca
Advanced Computer Architecture
Prof Thriveni T K
Hwang, Chapter 4
Processors and Memory Hierarchy
4.1 Advanced Processor Technology
Design Space of Processors
Processors can be mapped to a space that has
clock rate and cycles per instruction (CPI) as
coo
Advanced Computer Architecture
Prof Thriveni T K
Hwang, Chapter 3
Principles of Scalable Performance
3.1 Performance Metrics and
Measures
Degree of Parallelism
The number of processors used at any instant to
execute a program is called the degree of
para
Prof Thriveni T K
Advanced Computer Architecture
Hwang, Chapter 2
Program and Network Properties
2.4 System Interconnect Architectures
System Interconnect
Architectures
Direct networks for static connections
Indirect networks for dynamic connections
Ne
Advanced Computer Architecture
Hwang, Chapter 2
Program and Network Properties
2.3 Program Flow Mechanisms
Program Flow Mechanisms
Conventional machines used control flow
mechanism in which order of program execution
explicitly stated in user programs.
Advanced Computer Architecture
Prof Thriveni T K
Hwang, Chapter 2
Program and Network Properties
2.1 Conditions of Parallelism
2.2 Program Partitioning and
Scheduling
Conditions of Parallelism
The exploitation of parallelism in computing
requires underst
Advanced Computer Architecture
Prof Thriveni T K
Hwang, Chapter 1
Parallel Computer Models
1.2 Multiprocessors and
Multicomputers
Categories of Parallel Computers
Considering their architecture only, there are two
main categories of parallel computers:
Advanced Computer Architecture
Prof Thriveni T K
Hwang, Chapter 1
Parallel Computer Models
1.1 The State of Computing
The State of Computing
Early computing was entirely mechanical:
abacus (about 500 BC)
mechanical adder/subtracter (Pascal, 1642)
differe
ADVANCED COMPUTER
ARCHITECTURE:
Parallelism, Scalability, Programmability
Kai Hwang
Professor of Electrical Engineering
and Computer Science
University of Southern California
McGraw-Hill, Inc.
New York St Louis San Francisco Auckland Bogota
Caracas Lisbon
ACA
Hwang
Chap 1-5
Computing Systems CC513
Deeper understanding of;
Computer Architecture concepts
design trade-offs for cost/performance
Advanced Architectures
trends for the future
Why?
match/choose hardware and software to solve a
problem
design be