Technical data

Index
A
Amdahl’s Law • 1–19, A–3
Arithmetic
data path chip • 2–4
instructions • 2–5
unit • 2–5 to 2–18, 2–19, 2–21
Arithmetic pipeline • 3–11
Array • 1–2, 1–6, 1–8, 1–13
Array index • 1–6
Attached vector processor • 1–6, 1–7
B
Basic linear algebra subroutines (BLAS) • A–2
BLAS 2 routines • A–4
BLAS 3 routine • A–5
BLAS level 1 • A–2
Bus master • 2–5
C
Cache • 1–7, 2–5, 2–7, 2–8, 2–12 to 2–16,
2–18, 3–5, A–4
Cache miss • 3–18, 3–21, 3–22
Chaining • 1–8, 1–18, 2–5
Chain into store • 2–18, 3–16
Chime • 1–13
Concurrent execution • 1–3, 1–12
Cooley-Tukey
algorithm • A–7
butterfly graph • A–9
Crossover point • 1–22, 3–5
D
Data
cache • 2–8
registers • 2–9
Data dependencies • A–1
Deferred instruction • 2–20, 3–16, 3–20
Discrete Fourier transform • A–7
Double-precision • 2–6
Duplicate
tag • 2–14, 2–15
tag store • 2–16
D_floating • 2–21
E
Element • 1–2
Equation solvers • A–2
Exception reporting • 3–6
Execution time • 2–21
F
Fast Fourier transform • A–7
Floating-point operations • 1–19
FORTRAN • 1–8, 3–2
Fourier transform • A–7
Function unit • 1–11, 1–18
F_floating • 2–21
G
Gather • 1–15, 1–17, 2–19
Gather instruction • 3–15, A–7
G_floating • 2–21
I
Imprecise exceptions • 3–10
Index vector • 1–17
Inhibiting constructs • 3–2
Instruction
chaining • 1–18
decomposition • 2–17
execution
overlap • 3–12
time • 3–16
Index–1