Algorithms and Parallel Computing

Index

1-D FIR filter

z-transform implementation

ad hoc techniques

adjacency matrix

input node

internal node

output node

properties

algorithm

1-D FIR filter

1-D IIR filter

2-D IIR filter

adjacency matrix

analysis

classification

components

critical path

cycles

decimation-in-frequency FFT

decimation-in-time FFT

decimator

definition

degree of parallelism

depth

directed graph

discrete Fourier transform (DFT)

fast Fourier transform (FFT)

finite-field polynomial division

full search block matching

GF(2^m) multiplication

hardware implementation

implementation phases

interpolator

matrix multiplication

non serial-parallel

parallel

parallelism

parallelization

performance

primary inputs

primary outputs

regular iterative

sequence vector

serial

serial-parallel

software implementation

string matching

video compression

work

anti-dependencies

asymmetric multiprocessor (ASMP)

banyan network

binary multiplication

parallel

serial

bit-parallel multiplication

bit-serial multiplication

bus interconnection network

butterfly operation

decimation-in-frequency

decimation-in-time

cache

block

block size

coherence

design

hierarchy

hit

line

miss

capacity misses

cold-start

compulsory miss

conflict misses

three C’s

tag

Cilk++

Cilk++ chunk

Cilk++ for loop

Cilk++ strand

cloud computing

cluster computing

cold start

communication

-bound problems

broadcast

gather

multicast

one-to-all

one-to-many

one-to-one

overhead

reduce

unicast

compiler directive

compulsory miss

computation domain

compute intensity

concurrency platforms ...