COPE-09 Architecture.indd
46
9
A
rc
h
it
e
ct
u
re
©
2
0
2
1
U
w
e
R
.
Z
im
m
er
, T
h
e
A
u
st
ra
li
an
N
at
io
n
al
U
n
iv
er
si
ty
p
ag
e
4
6
9
o
f
4
9
0
(
ch
ap
te
r
9
:
“A
rc
h
it
ec
tu
re
”
u
p
t
o
p
ag
e
4
8
7
)
46
7
9
A
rc
h
it
ec
tu
re
U
w
e
R
.
Z
im
m
er
–
T
h
e
A
u
st
ra
li
an
N
at
io
n
al
U
n
iv
er
si
ty
C
o
m
p
u
te
r
O
rg
an
is
at
io
n
&
P
ro
g
ra
m
E
xe
cu
ti
o
n
2
02
1
47
0
A
rc
h
it
e
ct
u
re
©
2
0
2
1
U
w
e
R
.
Z
im
m
er
, T
h
e
A
u
st
ra
li
an
N
at
io
n
al
U
n
iv
er
si
ty
p
ag
e
4
7
0
o
f
4
9
0
(
ch
ap
te
r
9
:
“A
rc
h
it
ec
tu
re
”
u
p
t
o
p
ag
e
4
8
7
)
D
efi
n
it
io
n
:
P
ro
ce
ss
o
r
H
ar
d
w
ar
e
o
ri
gi
n
s
18
th
c
e
n
tu
ry
m
ac
h
in
e
s
L’
Ec
ri
va
in
1
7
7
0
P
ro
g
ra
m
m
ab
le
,
ye
t
n
o
t
a
co
m
p
u
te
r
in
t
o
d
ay
’s
d
e
fi
n
it
io
n
(
n
o
t
Tu
ri
n
g
c
o
m
p
le
te
)
L’
Ec
ri
va
in
(
17
70
)
P
ie
rr
e
J
aq
u
e
t-
D
ro
z,
H
e
n
ri
-L
o
u
is
J
aq
u
e
t-
D
ro
z
&
J
e
an
-F
ré
d
é
ri
c
Le
sc
h
o
46
8
A
rc
h
it
e
ct
u
re
©
2
0
2
1
U
w
e
R
.
Z
im
m
er
, T
h
e
A
u
st
ra
li
an
N
at
io
n
al
U
n
iv
er
si
ty
p
ag
e
4
6
8
o
f
4
9
0
(
ch
ap
te
r
9
:
“A
rc
h
it
ec
tu
re
”
u
p
t
o
p
ag
e
4
8
7
)
R
ef
er
en
ce
s
fo
r
th
is
c
h
ap
te
r
[P
at
te
rs
o
n
17
]
D
av
id
A
. P
at
te
rs
o
n
&
J
o
h
n
L
. H
e
n
n
e
ss
y
C
o
m
p
u
te
r
O
rg
an
iz
at
io
n
a
n
d
D
e
si
g
n
–
T
h
e
H
ar
d
w
ar
e
/S
o
ft
w
ar
e
I
n
te
rf
ac
e
C
h
ap
te
r
4
“T
h
e
P
ro
ce
ss
o
r”
,
C
h
ap
te
r
6
“P
ar
al
le
l P
ro
ce
ss
o
rs
f
ro
m
C
li
e
n
t
to
C
lo
u
d
”
A
R
M
e
d
it
io
n
, M
o
rg
an
K
au
fm
an
n
2
01
7
47
3
A
rc
h
it
e
ct
u
re
©
2
0
2
1
U
w
e
R
.
Z
im
m
er
, T
h
e
A
u
st
ra
li
an
N
at
io
n
al
U
n
iv
er
si
ty
p
ag
e
4
7
3
o
f
4
9
0
(
ch
ap
te
r
9
:
“A
rc
h
it
ec
tu
re
”
u
p
t
o
p
ag
e
4
8
7
)
C
o
m
p
u
te
r
A
rc
h
it
ec
tu
re
s
vo
n
N
e
u
m
an
n
A
rc
h
it
e
ct
u
re
•
C
o
n
tr
o
l
u
n
it
S
e
q
u
e
n
ti
al
ly
a
d
d
re
ss
e
s
p
ro
g
ra
m
a
n
d
d
at
a
m
e
m
o
ry
a
n
d
f
e
tc
h
e
s
n
e
xt
i
n
st
ru
ct
io
n
.
C
o
n
tr
o
ls
n
e
xt
A
LU
o
p
e
ra
ti
o
n
s
an
d
d
e
te
rm
in
e
s
th
e
n
e
xt
i
n
st
ru
ct
io
n
(b
as
e
d
o
n
A
LU
s
ta
tu
s)
.
•
A
ri
th
m
et
ic
L
o
gi
c
U
n
it
(
A
LU
)
Fe
tc
h
e
s
d
at
a
fr
o
m
m
e
m
o
ry
.
Ex
e
cu
te
s
ar
it
h
m
e
ti
c/
lo
g
ic
o
p
e
ra
ti
o
n
.
W
ri
te
s
d
at
a
to
m
e
m
o
ry
.
•
In
p
u
t/
O
u
tp
u
t
•
M
em
o
ry
P
ro
g
ra
m
a
n
d
d
at
a
is
n
o
t
d
is
ti
n
g
u
is
h
e
d
P
ro
g
ra
m
s
ca
n
c
h
an
g
e
t
h
e
m
se
lv
e
s.
Memory
C
o
n
tr
o
l
u
n
it
A
ri
th
m
e
ti
c
L
o
gi
c
U
n
it
C
o
n
tr
o
l
S
ta
tu
s
Address
Input/Output
Data
Instructions
47
1
A
rc
h
it
e
ct
u
re
©
2
0
2
1
U
w
e
R
.
Z
im
m
er
, T
h
e
A
u
st
ra
li
an
N
at
io
n
al
U
n
iv
er
si
ty
p
ag
e
4
7
1
o
f
4
9
0
(
ch
ap
te
r
9
:
“A
rc
h
it
ec
tu
re
”
u
p
t
o
p
ag
e
4
8
7
)
D
efi
n
it
io
n
:
P
ro
ce
ss
o
r
D
ig
it
al
C
o
m
p
u
te
rs
H
ar
d
w
ar
e
o
ri
g
in
s
•
Pa
te
n
ts
b
y
K
o
n
ra
d
Z
u
se
(
G
e
rm
an
y)
, 1
93
6.
•
Fi
rs
t
d
ig
it
al
c
o
m
p
u
te
r:
Z
1
(
G
e
rm
an
y)
, 1
93
7:
R
e
–
la
ys
, p
ro
g
ra
m
m
ab
le
v
ia
p
u
n
ch
t
ap
e
, c
lo
ck
: 1
H
z,
64
w
o
rd
s
m
e
m
o
ry
à
2
2-
b
it
, 2
r
e
g
is
te
rs
, fl
o
at
in
g
p
o
in
t
u
n
it
, w
e
ig
h
t:
1
t.
•
Fi
rs
t
fr
e
e
ly
p
ro
g
ra
m
m
ab
le
(
Tu
ri
n
g
c
o
m
p
le
te
)
re
la
ys
c
o
m
p
u
te
r:
Z
3
(
G
e
rm
an
y)
, 1
94
1:
5
.3
H
z
•
A
ta
n
as
o
ff
B
er
ry
C
o
m
p
u
te
r
(U
S
)
19
42
: V
ac
u
u
m
t
u
b
e
s,
(
n
o
t
Tu
ri
n
g
c
o
m
p
le
te
).
•
C
o
lo
ss
u
s
M
ar
k
1
(
U
K
)
19
44
: V
ac
u
u
m
t
u
b
e
s
(n
o
t
Tu
ri
n
g
c
o
m
p
le
te
).
•
“F
ir
st
D
ra
ft
o
f
a
R
e
p
o
rt
o
n
t
h
e
E
D
V
A
C
”
(E
le
ct
ro
n
ic
D
is
cr
e
te
V
ar
ia
b
le
A
u
to
m
at
ic
C
o
m
p
u
te
r)
b
y
Jo
h
n
v
o
n
N
eu
m
an
n
(
U
S
),
1
94
5:
I
n
fl
u
e
n
ti
al
a
rt
ic
le
a
b
o
u
t
co
re
e
le
m
e
n
ts
o
f
a
co
m
p
u
te
r:
A
ri
th
m
et
ic
u
n
it
, c
o
n
tr
o
l
u
n
it
(
S
e
q
u
e
n
ce
r)
, m
em
o
ry
(
h
o
ld
in
g
d
at
a
an
d
p
ro
g
ra
m
),
a
n
d
I
/O
.
•
Fi
rs
t
h
ig
h
l
e
ve
l
p
ro
g
ra
m
m
in
g
l
an
g
u
ag
e
: P
la
n
ka
lk
ü
l (
“P
la
n
C
al
cu
lu
s”
)
b
y
K
o
n
ra
d
Z
u
se
, 1
94
5.
•
EN
IA
C
(
El
e
ct
ro
n
ic
N
u
m
e
ri
ca
l
In
te
g
ra
to
r
A
n
d
C
o
m
p
u
te
r)
(
U
S
)
19
46
: p
ro
g
ra
m
e
d
b
y
p
lu
g
b
o
ar
d
,
Fi
rs
t
Tu
ri
n
g
c
o
m
p
le
te
v
ac
u
u
m
t
u
b
e
s
b
as
e
d
c
o
m
p
u
te
r,
c
lo
ck
: 1
00
k
H
z,
w
e
ig
h
t:
2
7
t
o
n
1
67
m
2
.
K
o
n
ra
d
Z
u
se
w
it
h
Z
1,
©
D
r.
H
o
rs
t
Z
u
se
(r
e
p
li
ca
o
f
th
e
1
93
7
co
m
p
u
te
r)
EN
IA
C
1
94
6,
G
le
n
B
e
ck
(
b
ac
k
g
ro
u
n
d
),
B
e
tt
y
Je
n
n
in
g
s
(f
o
re
g
ro
u
n
d
)
47
4
A
rc
h
it
e
ct
u
re
©
2
0
2
1
U
w
e
R
.
Z
im
m
er
, T
h
e
A
u
st
ra
li
an
N
at
io
n
al
U
n
iv
er
si
ty
p
ag
e
4
7
4
o
f
4
9
0
(
ch
ap
te
r
9
:
“A
rc
h
it
ec
tu
re
”
u
p
t
o
p
ag
e
4
8
7
)
C
o
m
p
u
te
r
A
rc
h
it
ec
tu
re
s
A
s
im
p
le
p
ro
ce
ss
o
r
(C
P
U
)
•
D
ec
o
d
er
/S
eq
u
en
ce
r
C
an
b
e
a
m
ac
h
in
e
i
n
i
ts
e
lf
w
h
ic
h
b
re
ak
s
C
P
U
in
st
ru
ct
io
n
s
in
to
c
o
n
cu
rr
e
n
t
m
ic
ro
c
o
d
e
.
•
Ex
ec
u
ti
o
n
U
n
it
/
A
ri
th
m
e
ti
c-
Lo
g
ic
-U
n
it
(
A
LU
)
A
c
o
ll
e
ct
io
n
o
f
tr
an
sf
o
rm
at
io
n
al
l
o
g
ic
.
•
M
em
o
ry
•
R
eg
is
te
rs
In
st
ru
ct
io
n
p
o
in
te
r,
s
ta
ck
p
o
in
te
r,
g
e
n
e
ra
l
p
u
rp
o
se
a
n
d
s
p
e
ci
al
iz
e
d
r
e
g
is
te
rs
.
•
Fl
ag
s
In
d
ic
at
in
g
t
h
e
s
ta
te
s
o
f
th
e
la
te
st
c
al
cu
la
ti
o
n
s.
•
C
o
d
e/
D
at
a
m
an
ag
em
en
t
Fe
tc
h
in
g
, C
ac
h
in
g
, S
to
ri
n
g
.
A
L
U
Memory
S
e
q
u
e
n
ce
r
D
e
co
d
e
r
C
o
d
e
m
an
ag
e
m
e
n
t
R
e
gi
st
e
rs
IP S
P
F
la
gs
D
at
a
m
an
ag
e
m
e
n
t
47
2
A
rc
h
it
e
ct
u
re
©
2
0
2
1
U
w
e
R
.
Z
im
m
er
, T
h
e
A
u
st
ra
li
an
N
at
io
n
al
U
n
iv
er
si
ty
p
ag
e
4
7
2
o
f
4
9
0
(
ch
ap
te
r
9
:
“A
rc
h
it
ec
tu
re
”
u
p
t
o
p
ag
e
4
8
7
)
C
o
m
p
u
te
r
A
rc
h
it
ec
tu
re
s
H
ar
va
rd
A
rc
h
it
e
ct
u
re
•
C
o
n
tr
o
l
u
n
it
C
o
n
cu
rr
e
n
tl
y
ad
d
re
ss
e
s
p
ro
g
ra
m
a
n
d
d
at
a
m
e
m
o
ry
a
n
d
f
e
tc
h
e
s
n
e
xt
i
n
st
ru
ct
io
n
.
C
o
n
tr
o
ls
n
e
xt
A
LU
o
p
e
ra
ti
o
n
s
an
d
d
e
te
rm
in
e
s
th
e
n
e
xt
i
n
st
ru
ct
io
n
(b
as
e
d
o
n
A
LU
s
ta
tu
s)
.
•
A
ri
th
m
et
ic
L
o
gi
c
U
n
it
(
A
LU
)
Fe
tc
h
e
s
d
at
a
fr
o
m
m
e
m
o
ry
.
Ex
e
cu
te
s
ar
it
h
m
e
ti
c/
lo
g
ic
o
p
e
ra
ti
o
n
.
W
ri
te
s
d
at
a
to
m
e
m
o
ry
.
•
In
p
u
t/
O
u
tp
u
t
•
P
ro
gr
am
m
em
o
ry
•
D
at
a
m
em
o
ry
Program memory
C
o
n
tr
o
l
u
n
it
A
ri
th
m
e
ti
c
L
o
gi
c
U
n
it
Data memory
C
o
n
tr
o
l
S
ta
tu
s
Address
Input/Output
Data
Address
Instructions
47
7
A
rc
h
it
e
ct
u
re
©
2
0
2
1
U
w
e
R
.
Z
im
m
er
, T
h
e
A
u
st
ra
li
an
N
at
io
n
al
U
n
iv
er
si
ty
p
ag
e
4
7
7
o
f
4
9
0
(
ch
ap
te
r
9
:
“A
rc
h
it
ec
tu
re
”
u
p
t
o
p
ag
e
4
8
7
)
P
ro
ce
ss
o
r
A
rc
h
it
ec
tu
re
s
P
ip
e
lin
e
h
az
ar
d
s
St
ru
ct
u
ra
l
h
az
ar
d
L
ac
k
o
f
h
ar
d
w
ar
e
to
r
u
n
o
p
e
ra
ti
o
n
s
in
p
ar
al
le
l,
…
e
.g
. l
o
ad
a
n
n
e
w
i
n
st
ru
ct
io
n
a
n
d
lo
ad
n
e
w
d
at
a
in
p
ar
al
le
l.
C
o
n
tr
o
l
h
az
ar
d
A
d
ec
is
io
n
d
e
p
e
n
d
s
o
n
t
h
e
p
re
vi
o
u
s
in
st
ru
ct
io
n
.
…
e
.g
. a
c
o
n
d
it
io
n
al
b
ra
n
ch
b
as
e
d
o
n
t
h
e
fl
ag
s
fr
o
m
t
h
e
p
re
vi
o
u
s
in
st
ru
ct
io
n
.
D
at
a
h
az
ar
d
N
e
e
d
e
d
d
at
a
is
n
o
t
ye
t
av
ai
la
b
le
…
e
.g
. t
h
e
r
e
su
lt
o
f
an
a
ri
th
m
e
ti
c
o
p
e
ra
ti
o
n
is
n
e
e
d
e
d
i
n
t
h
e
n
e
xt
i
n
st
ru
ct
io
n
.
A
L
U
Memory
S
e
q
u
e
n
ce
r
D
e
co
d
e
r
C
o
d
e
m
an
ag
e
m
e
n
t
R
e
gi
st
e
rs
IP S
P
F
la
gs
D
at
a
m
an
ag
e
m
e
n
t
e
nn
t
n
t
n
ttt
S
e
q
u
e
n
ce
r
D
e
co
d
e
r
C
o
d
e
m
an
ag
e
m
e
n
t
D
at
a
m
an
ag
e
m
e
n
t
D
at
a
m
an
ag
e
m
e
n
t
S
e
In
t.
47
5
A
rc
h
it
e
ct
u
re
©
2
0
2
1
U
w
e
R
.
Z
im
m
er
, T
h
e
A
u
st
ra
li
an
N
at
io
n
al
U
n
iv
er
si
ty
p
ag
e
4
7
5
o
f
4
9
0
(
ch
ap
te
r
9
:
“A
rc
h
it
ec
tu
re
”
u
p
t
o
p
ag
e
4
8
7
)
P
ro
ce
ss
o
r
A
rc
h
it
ec
tu
re
s
P
ip
e
lin
e
S
o
m
e
C
P
U
a
ct
io
n
s
ar
e
n
at
u
ra
ll
y
se
q
u
e
n
ti
al
(e
.g
. i
n
st
ru
ct
io
n
s
n
e
e
d
t
o
b
e
fi
r
st
l
o
ad
e
d
, t
h
e
n
d
e
co
d
e
d
b
e
fo
re
t
h
e
y
ca
n
b
e
e
xe
cu
te
d
).
M
o
re
fi
n
e
g
ra
in
e
d
s
e
q
u
e
n
ce
s
ca
n
b
e
i
n
tr
o
d
u
ce
d
b
y
b
re
ak
in
g
C
P
U
in
st
ru
ct
io
n
s
in
to
m
ic
ro
c
o
d
e
.
O
ve
rl
ap
p
in
g
t
h
o
se
s
e
q
u
e
n
ce
s
in
t
im
e
w
il
l
le
ad
t
o
t
h
e
c
o
n
ce
p
t
o
f
p
ip
e
li
n
e
s.
S
am
e
l
at
e
n
cy
, y
e
t
h
ig
h
e
r
th
ro
u
g
h
p
u
t.
(
C
o
n
d
it
io
n
al
)
b
ra
n
ch
e
s
m
ig
h
t
b
re
ak
t
h
e
p
ip
e
li
n
e
s
B
ra
n
ch
p
re
d
ic
to
rs
b
e
co
m
e
e
ss
e
n
ti
al
.
A
L
U
Memory
S
e
q
u
e
n
ce
r
D
e
co
d
e
r
C
o
d
e
m
an
ag
e
m
e
n
t
R
e
gi
st
e
rs
IP S
P
F
la
gs
D
at
a
m
an
ag
e
m
e
n
t
e
nn
t
n
t
n
ttt
S
e
q
u
e
n
ce
r
D
e
co
d
e
r
C
o
d
e
m
an
ag
e
m
e
n
t
D
at
a
m
an
ag
e
m
e
n
t
D
at
a
m
an
ag
e
m
e
n
t
S
e
In
t.
47
8
A
rc
h
it
e
ct
u
re
©
2
0
2
1
U
w
e
R
.
Z
im
m
er
, T
h
e
A
u
st
ra
li
an
N
at
io
n
al
U
n
iv
er
si
ty
p
ag
e
4
7
8
o
f
4
9
0
(
ch
ap
te
r
9
:
“A
rc
h
it
ec
tu
re
”
u
p
t
o
p
ag
e
4
8
7
)
P
ro
ce
ss
o
r
A
rc
h
it
ec
tu
re
s
O
u
t
o
f
o
rd
e
r
ex
e
cu
ti
o
n
B
re
ak
in
g
t
h
e
s
e
q
u
e
n
ce
i
n
si
d
e
e
ac
h
p
ip
e
–
li
n
e
l
e
ad
s
to
‘o
u
t
o
f
o
rd
e
r’
C
P
U
d
e
si
g
n
s.
R
e
p
la
ce
p
ip
e
li
n
e
s
w
it
h
h
ar
d
w
ar
e
s
ch
e
d
u
le
r.
R
e
su
lt
s
n
e
e
d
t
o
b
e
“r
e
-s
e
q
u
e
n
ti
al
iz
e
d
”
o
r
p
o
ss
ib
ly
d
is
ca
rd
e
d
.
“
C
o
n
d
it
io
n
al
b
ra
n
ch
p
re
d
ic
ti
o
n
”
e
xe
cu
te
s
th
e
m
o
st
l
ik
e
ly
b
ra
n
ch
o
r
m
u
lt
ip
le
b
ra
n
ch
e
s.
W
o
rk
s
b
e
tt
e
r
if
t
h
e
p
re
se
n
te
d
c
o
d
e
se
q
u
e
n
ce
h
as
m
o
re
i
n
d
e
p
e
n
d
e
n
t
in
st
ru
ct
io
n
s
an
d
f
e
w
e
r
co
n
d
it
io
n
al
b
ra
n
ch
e
s.
T
h
is
h
ar
d
w
ar
e
w
il
l
re
q
u
ir
e
(
e
xt
e
n
si
ve
)
co
d
e
o
p
ti
m
iz
at
io
n
t
o
b
e
f
u
ll
y
u
ti
li
ze
d
.
A
L
U
Memory
S
e
q
u
e
n
ce
r
D
e
co
d
e
r
C
o
d
e
m
an
ag
e
m
e
n
t
R
e
gi
st
e
rs
IP S
P
F
la
gs
D
at
a
m
an
ag
e
m
e
n
t
F
la
AAAA
L
U
A
L
U
ee
A
L
U
A
L
U
D
at
a
m
an
ag
e
m
e
n
t
D
at
a
m
an
ag
e
m
e
n
tee
C
o
d
e
m
an
ag
e
m
e
n
t
S
e
q
u
e
n
ce
r
D
e
co
d
e
r
D
at
a
m
an
ag
e
m
e
n
t
D
at
a
m
an
ag
e
m
e
n
t
S
e
In
t.
47
6
A
rc
h
it
e
ct
u
re
©
2
0
2
1
U
w
e
R
.
Z
im
m
er
, T
h
e
A
u
st
ra
li
an
N
at
io
n
al
U
n
iv
er
si
ty
p
ag
e
4
7
6
o
f
4
9
0
(
ch
ap
te
r
9
:
“A
rc
h
it
ec
tu
re
”
u
p
t
o
p
ag
e
4
8
7
)
P
ro
ce
ss
o
r
A
rc
h
it
ec
tu
re
s
Pa
ra
lle
l p
ip
e
lin
e
s
Fi
ll
in
g
p
ar
al
le
l
p
ip
e
li
n
e
s
(b
y
al
te
rn
at
in
g
i
n
co
m
in
g
c
o
m
m
an
d
s
b
e
tw
e
e
n
p
ip
e
li
n
e
s)
m
ay
e
m
p
lo
y
m
u
lt
ip
le
A
LU
’s
.
(
C
o
n
d
it
io
n
al
)
b
ra
n
ch
e
s
m
ig
h
t
ag
ai
n
b
re
ak
t
h
e
p
ip
e
li
n
e
s.
I
n
te
rd
e
p
e
n
d
e
n
ci
e
s
m
ig
h
t
li
m
it
th
e
d
e
g
re
e
o
f
co
n
cu
rr
e
n
cy
.
S
am
e
l
at
e
n
cy
, y
e
t
e
ve
n
h
ig
h
e
r
th
ro
u
g
h
p
u
t.
C
o
m
p
il
e
rs
n
e
e
d
t
o
b
e
a
w
ar
e
o
f
th
e
o
p
ti
o
n
s.
A
L
U
Memory
S
e
q
u
e
n
ce
r
D
e
co
d
e
r
C
o
d
e
m
an
ag
e
m
e
n
t
R
e
gi
st
e
rs
IP S
P
F
la
gs
D
at
a
m
an
ag
e
m
e
n
t
S
e
q
u
e
n
ce
r
D
e
co
d
e
r
C
o
d
e
m
an
ag
e
m
e
n
t
D
at
a
m
an
ag
e
m
e
n
t
D
at
a
m
an
ag
e
m
e
n
t
F
la
AA
L
U
A
L
U
A
L
U
A
L
U
e
r
e
rrtt
A
L
U
A
L
U
D
at
a
m
an
ag
e
m
e
n
t
D
at
a
m
an
ag
e
m
e
n
t
S
e
In
t.
48
1
A
rc
h
it
e
ct
u
re
©
2
0
2
1
U
w
e
R
.
Z
im
m
er
, T
h
e
A
u
st
ra
li
an
N
at
io
n
al
U
n
iv
er
si
ty
p
ag
e
4
8
1
o
f
4
9
0
(
ch
ap
te
r
9
:
“A
rc
h
it
ec
tu
re
”
u
p
t
o
p
ag
e
4
8
7
)
P
ro
ce
ss
o
r
A
rc
h
it
ec
tu
re
s
M
u
lt
i-
co
re
C
P
U
s
Fu
ll
r
e
p
li
ca
ti
o
n
o
f
m
u
lt
ip
le
C
P
U
c
o
re
s
o
n
t
h
e
s
am
e
c
h
ip
p
ac
k
ag
e
.
•
O
ft
e
n
c
o
m
b
in
e
d
w
it
h
h
yp
e
r-
th
re
ad
–
in
g
a
n
d
/o
r
m
u
lt
ip
le
o
th
e
r
m
e
an
s
(a
s
in
tr
o
d
u
ce
d
a
b
o
ve
)
o
n
e
ac
h
c
o
re
.
•
C
le
an
e
st
a
n
d
m
o
st
e
xp
li
ci
t
im
p
le
m
e
n
ta
ti
o
n
o
f
co
n
cu
rr
e
n
cy
o
n
t
h
e
C
P
U
l
e
ve
l.
R
eq
u
ir
es
s
yn
ch
ro
n
iz
ed
a
to
m
ic
o
p
er
at
io
n
s.
R
eq
u
ir
es
p
ro
gr
am
m
in
g
la
n
gu
ag
es
w
it
h
im
p
li
ci
t
o
r
ex
p
li
ci
t
co
n
cu
rr
en
cy
.
H
is
to
ri
ca
ll
y
th
e
i
n
tr
o
d
u
ct
io
n
o
f
m
u
lt
i-
co
re
C
P
U
s
e
n
d
e
d
t
h
e
“
G
H
z
ra
ce
”
in
t
h
e
e
ar
ly
2
00
0’
s.
A
L
U
Memory
S
e
q
u
e
n
ce
r
D
e
co
d
e
r
C
o
d
e
m
an
ag
e
m
e
n
t
R
e
gi
st
e
rs
IP S
P
F
la
gs
D
at
a
m
an
ag
e
m
e
n
t
gi
st
e
rs
RR
e
gi
s
RR
e
gi
S
P
SS
P
S
PPPPPP
C
o
d
IIIIIIIIIIPIIPIIIPIPIPIPIPPPPPPPPP
D
at
a
SSS
PPP
gsgsgg
FF
l
FF
l
F
l
FF
lllllalallllaa
gggsg
F
llaa
ggsgsgsgsggggggsgsgsggg
F
la
F
la
F
la
F
la
F
lllaaa
ggggg
F
lalaa
gggg
S
e
q
u
e
n
ce
r
D
e
co
d
e
r
F
la
gs
F
la
gs
R
e
gi
st
e
rs
IP S
PR
e
gi
st
e
rs
IP S
P
S
e
q
u
e
n
ce
r
D
e
co
d
e
r
In
t.
47
9
A
rc
h
it
e
ct
u
re
©
2
0
2
1
U
w
e
R
.
Z
im
m
er
, T
h
e
A
u
st
ra
li
an
N
at
io
n
al
U
n
iv
er
si
ty
p
ag
e
4
7
9
o
f
4
9
0
(
ch
ap
te
r
9
:
“A
rc
h
it
ec
tu
re
”
u
p
t
o
p
ag
e
4
8
7
)
P
ro
ce
ss
o
r
A
rc
h
it
ec
tu
re
s
S
IM
D
A
LU
u
n
it
s
P
ro
vi
d
e
s
th
e
f
ac
il
it
y
to
a
p
p
ly
t
h
e
s
am
e
i
n
–
st
ru
ct
io
n
t
o
m
u
lt
ip
le
d
at
a
co
n
cu
rr
e
n
tl
y.
A
ls
o
r
e
fe
rr
e
d
t
o
a
s
“v
e
ct
o
r
u
n
it
s”
.
Ex
am
p
le
s:
A
lt
iv
e
c,
M
M
X
, S
S
E[
2|
3|
4]
, …
R
eq
u
ir
es
s
p
ec
ia
li
ze
d
c
o
m
p
il
er
s
o
r
p
ro
gr
am
m
in
g
la
n
gu
ag
es
w
it
h
im
p
li
ci
t
co
n
cu
rr
en
cy
.
G
P
U
p
ro
ce
ss
in
g
G
ra
p
h
ic
s
p
ro
ce
ss
o
r
as
a
v
e
ct
o
r
u
n
it
.
U
n
if
yi
n
g
a
rc
h
it
e
ct
u
re
l
an
g
u
ag
e
s
ar
e
u
se
d
(
O
p
e
n
C
L,
C
U
D
A
, G
P
G
P
U
).
A
L
U
Memory
S
e
q
u
e
n
ce
r
D
e
co
d
e
r
C
o
d
e
m
an
ag
e
m
e
n
t
R
e
gi
st
e
rs
IP S
P
F
la
gs
D
at
a
m
an
ag
e
m
e
n
t
egee
L
U
A
L
AA
L
U
A
LL
U
A
L
AAAA
UUUUU
AAAAAAAAA
eee
mmmmmmm
e
n
tt
m
e
n
t
n
ttt
mm
e
n
e
n
tt
n
ttttttttttttttttt
A
L
U
A
L
U
A
L
U
A
L
U
In
t.
48
2
A
rc
h
it
e
ct
u
re
©
2
0
2
1
U
w
e
R
.
Z
im
m
er
, T
h
e
A
u
st
ra
li
an
N
at
io
n
al
U
n
iv
er
si
ty
p
ag
e
4
8
2
o
f
4
9
0
(
ch
ap
te
r
9
:
“A
rc
h
it
ec
tu
re
”
u
p
t
o
p
ag
e
4
8
7
)
P
ro
ce
ss
o
r
A
rc
h
it
ec
tu
re
s
V
ir
tu
al
m
e
m
o
ry
Tr
an
sl
at
e
s
lo
g
ic
al
m
e
m
o
ry
a
d
d
re
ss
e
s
in
to
p
h
ys
ic
al
m
e
m
o
ry
a
d
d
re
ss
e
s
an
d
p
ro
vi
d
e
s
m
e
m
o
ry
p
ro
te
ct
io
n
f
e
at
u
re
s.
•
D
o
e
s
n
o
t
in
tr
o
d
u
ce
c
o
n
cu
rr
e
n
cy
b
y
it
se
lf
.
I
s
st
il
l
e
ss
e
n
ti
al
f
o
r
co
n
cu
rr
e
n
t
p
ro
g
ra
m
m
in
g
as
h
ar
d
w
ar
e
m
e
m
o
ry
p
ro
te
ct
io
n
g
u
ar
an
te
e
s
m
e
m
o
ry
i
n
te
g
ri
ty
f
o
r
in
d
iv
id
u
al
p
ro
ce
ss
e
s
/
th
re
ad
s.
A
L
U
Memory
S
e
q
u
e
n
ce
r
D
e
co
d
e
r
C
o
d
e
m
an
ag
e
m
e
n
t
R
e
gi
st
e
rs
IP S
P
F
la
gs
D
at
a
m
an
ag
e
m
e
n
t
Physical memory
Virtual memory
In
t.
48
0
A
rc
h
it
e
ct
u
re
©
2
0
2
1
U
w
e
R
.
Z
im
m
er
, T
h
e
A
u
st
ra
li
an
N
at
io
n
al
U
n
iv
er
si
ty
p
ag
e
4
8
0
o
f
4
9
0
(
ch
ap
te
r
9
:
“A
rc
h
it
ec
tu
re
”
u
p
t
o
p
ag
e
4
8
7
)
P
ro
ce
ss
o
r
A
rc
h
it
ec
tu
re
s
H
yp
e
r-
th
re
ad
in
g
Em
u
la
te
s
m
u
lt
ip
le
v
ir
tu
al
C
P
U
c
o
re
s
b
y
m
e
an
s
o
f
re
p
li
ca
ti
o
n
o
f:
•
R
e
g
is
te
r
se
ts
•
S
e
q
u
e
n
ce
r
•
Fl
ag
s
•
In
te
rr
u
p
t
lo
g
ic
w
h
il
e
k
e
e
p
in
g
t
h
e
“
e
xp
e
n
si
ve
”
re
so
u
rc
e
s
li
k
e
t
h
e
A
LU
c
e
n
tr
al
y
e
t
ac
ce
ss
ib
le
b
y
m
u
lt
ip
le
h
yp
e
r-
th
re
ad
s
co
n
cu
rr
e
n
tl
y.
R
eq
u
ir
es
p
ro
gr
am
m
in
g
la
n
gu
ag
es
w
it
h
im
p
li
ci
t
o
r
ex
p
li
ci
t
co
n
cu
rr
en
cy
.
Ex
am
p
le
s:
I
n
te
l
Pe
n
ti
u
m
4
, C
o
re
i
5/
i7
, X
e
o
n
,
A
to
m
, S
u
n
U
lt
ra
S
PA
R
C
T
2
(8
t
h
re
ad
s
p
e
r
co
re
)
A
L
U
Memory
S
e
q
u
e
n
ce
r
D
e
co
d
e
r
C
o
d
e
m
an
ag
e
m
e
n
t
R
e
gi
st
e
rs
IP S
P
F
la
gs
D
at
a
m
an
ag
e
m
e
n
t
gi
st
e
rs
RR
e
gi
s
RR
e
gi
S
P
SS
P
S
PPPPPP
C
o
d
IIIIIIIIIIIPIPIIIIPIPIPPPPPPPPPPPP
D
at
a
SSS
PPP
gsgsgg
F
l
F
l
F
l
F
l
F
l
F
lallalallla
gggsg
F
llaa
ggsgsgsgsgggggsgsggg
F
la
F
la
F
la
F
l
F
lalaaa
ggggg
F
lalaa
ggg
S
e
q
u
e
n
ce
r
D
e
co
d
e
r
F
la
gs
F
la
gs
R
e
gi
st
e
rs
IP S
PR
e
gi
st
e
rs
IP S
P
S
e
q
u
e
n
ce
r
D
e
co
d
e
r
In
t.
48
5
A
rc
h
it
e
ct
u
re
©
2
0
2
1
U
w
e
R
.
Z
im
m
er
, T
h
e
A
u
st
ra
li
an
N
at
io
n
al
U
n
iv
er
si
ty
p
ag
e
4
8
5
o
f
4
9
0
(
ch
ap
te
r
9
:
“A
rc
h
it
ec
tu
re
”
u
p
t
o
p
ag
e
4
8
7
)
A
lt
er
n
at
iv
e
P
ro
ce
ss
o
r
A
rc
h
it
ec
tu
re
s:
I
B
M
C
el
l
p
ro
ce
ss
o
r
(2
0
0
1
)
th
e
o
re
ti
ca
l 2
5.
6
G
FL
O
P
S
at
3
.2
G
H
z
8
co
re
s
fo
r
sp
e
ci
al
iz
e
d
h
ig
h
–
b
an
d
w
id
th
fl
o
at
in
g
p
o
in
t
o
p
e
ra
ti
o
n
s
an
d
1
28
b
it
r
e
g
is
te
rs
M
u
lt
ip
le
i
n
te
rc
o
n
n
e
ct
t
o
p
o
lo
g
ie
s
64
b
it
Po
w
e
rP
C
c
o
re
C
ac
h
e
48
3
A
rc
h
it
e
ct
u
re
©
2
0
2
1
U
w
e
R
.
Z
im
m
er
, T
h
e
A
u
st
ra
li
an
N
at
io
n
al
U
n
iv
er
si
ty
p
ag
e
4
8
3
o
f
4
9
0
(
ch
ap
te
r
9
:
“A
rc
h
it
ec
tu
re
”
u
p
t
o
p
ag
e
4
8
7
)
A
lt
er
n
at
iv
e
P
ro
ce
ss
o
r
A
rc
h
it
ec
tu
re
s:
P
ar
al
la
x
P
ro
p
el
le
r
48
6
A
rc
h
it
e
ct
u
re
©
2
0
2
1
U
w
e
R
.
Z
im
m
er
, T
h
e
A
u
st
ra
li
an
N
at
io
n
al
U
n
iv
er
si
ty
p
ag
e
4
8
6
o
f
4
9
0
(
ch
ap
te
r
9
:
“A
rc
h
it
ec
tu
re
”
u
p
t
o
p
ag
e
4
8
7
)
M
u
lt
i-
C
P
U
s
ys
te
m
s
Sc
al
in
g
u
p
:
•
M
u
lt
i-
C
P
U
o
n
t
h
e
s
am
e
m
e
m
o
ry
m
u
lt
ip
le
C
P
U
s
o
n
s
am
e
m
o
th
e
rb
o
ar
d
a
n
d
m
e
m
o
ry
b
u
s,
e
.g
. s
e
rv
e
rs
, w
o
rk
st
at
io
n
s
•
M
u
lt
i-
C
P
U
w
it
h
h
ig
h
-s
p
e
e
d
i
n
te
rc
o
n
n
e
ct
s
va
ri
o
u
s
su
p
e
rc
o
m
p
u
te
r
ar
ch
it
e
ct
u
re
s,
e
.g
. C
ra
y
X
E6
:
•
12
-c
o
re
A
M
D
O
p
te
ro
n
, u
p
t
o
1
92
p
e
r
ca
b
in
e
t
(2
30
4
co
re
s)
•
3D
t
o
ru
s
in
te
rc
o
n
n
e
ct
(
16
0
G
B
/s
e
c
ca
p
ac
it
y,
4
8
p
o
rt
s
p
e
r
n
o
d
e
)
•
C
lu
st
e
r
co
m
p
u
te
r
(M
u
lt
i-
C
P
U
o
ve
r
n
e
tw
o
rk
)
m
u
lt
ip
le
c
o
m
p
u
te
rs
c
o
n
n
e
ct
e
d
b
y
n
e
tw
o
rk
i
n
te
rf
ac
e
,
e
.g
. S
u
n
C
o
n
st
e
ll
at
io
n
C
lu
st
e
r
at
A
N
U
:
•
14
92
n
o
d
e
s,
e
ac
h
: 2
x
Q
u
ad
c
o
re
I
n
te
l
N
e
h
al
e
m
, 2
4
G
B
R
A
M
•
Q
D
R
I
n
fi
n
ib
an
d
n
e
tw
o
rk
, 2
.6
G
B
/s
e
c
48
4
A
rc
h
it
e
ct
u
re
©
2
0
2
1
U
w
e
R
.
Z
im
m
er
, T
h
e
A
u
st
ra
li
an
N
at
io
n
al
U
n
iv
er
si
ty
p
ag
e
4
8
4
o
f
4
9
0
(
ch
ap
te
r
9
:
“A
rc
h
it
ec
tu
re
”
u
p
t
o
p
ag
e
4
8
7
)
A
lt
er
n
at
iv
e
P
ro
ce
ss
o
r
A
rc
h
it
ec
tu
re
s:
P
ar
al
la
x
P
ro
p
el
le
r
(2
0
0
6
)
Lo
w
c
o
st
3
2
b
it
p
ro
ce
ss
o
r
($
8)
8
co
re
s
w
it
h
2
k
B
l
o
ca
l
m
e
m
o
ry
40
k
B
s
h
ar
e
d
m
e
m
o
ry
N
o
i
n
te
rr
u
p
ts
!
8
se
m
ap
h
o
re
s
48
7
A
rc
h
it
e
ct
u
re
©
2
0
2
1
U
w
e
R
.
Z
im
m
er
, T
h
e
A
u
st
ra
li
an
N
at
io
n
al
U
n
iv
er
si
ty
p
ag
e
4
8
7
o
f
4
9
0
(
ch
ap
te
r
9
:
“A
rc
h
it
ec
tu
re
”
u
p
t
o
p
ag
e
4
8
7
)
A
rc
h
it
e
ct
u
re
•
H
is
to
ry
•
A
rc
h
it
ec
tu
re
s
•
P
ip
e
li
n
e
s
•
Pa
ra
ll
e
l
p
ip
e
li
n
e
s
•
O
u
t
o
f
o
rd
e
r
e
xe
cu
ti
o
n
•
V
e
ct
o
r
m
ac
h
in
e
s
•
M
u
lt
i-
co
re
C
P
U
s
•
V
ir
tu
al
m
e
m
o
ry
Su
m
m
ar
y