You are on page 1of 45

H

S

Te

i

w

lec

g

i

.

om

h

tc

Ce

P

h

nte

e

i

W

r

r

n

ork

fo

sho

g

r

a

p:

Se

m

n

pt 4

a

d

1 ,

n

R

997

c

o

e

u

t

in

g

a
c
10
10
10
1
1
10
10
b
d
1

a
c
10
Source
Sink
10
10
s
1
t
1
10
10
b
d
1
Step 1:
a
c
10, 10
Source
Sink
10, 10
s
1
10, 10
t
1
10
10
b
d
1

a
c
10, 10
10, 10
1
10, 10
1
10, 1
b
d
10, 1
1, 1

a
c
10, 9
10, 10
1,1
10, 10
1,1
10, 2
b
d
10, 2
1, 1

# Example of Residual Graph

a
c
10, 10
10, 10
1
10, 10
1
10
10
b
d
1
Flow is of size 10
res(v,w) = cap(v,w) – f(v,w)
c
10
10
1
a
10
1
10
10
b
d
1

a
c
10, 10
10, 10
s
1
10, 10
t
1
10, 1
b
d
10, 1
1, 1

Residual Graph
a
c
10
10
10
1
s
t
1
1
1
b
d
1
9
9

a
c
10, 9
10, 10
s
1, 1
10, 10
t
1, 1
10, 2
b
d
10, 2
1, 1

1
Residual Graph
a
c
9
10
10
1
s
1
2
2
b
d
1
8
8

A
1
B
2
C
3
D
4
E
5
F
6

A
1
B
2
C
3
D
4
E
5
F
6

A
1
B
2
C
3
D
4
E
5
F
6

A
1
B
2
C
3
D
4
E
5
F
6

A
1
B
2
C
3
D
4
E
5
F
6

A
1
B
2
C
3
D
4
E
5
F
6

Spring 2006

A
1
B
2
C
3
D
4
E
5
F
6

A
1
B
2
C
3
D
4
E
5
F
6

A
1
B
2
C
3
D
4
E
5
F
6
A
1
B
2
C
3
D
4
E
5
F
6

A
1
B
2
C
3
D
4
E
5
F
6

1
1
2
2
3
3
4
4

1
1
2
2
3
3
4
4

Requests

# Implementation

1,1
1,2
1,3
1,4
Simple combinational
logic blocks
2,1
2,2
2,3
2,4
3,1
3,2
3,3
3,4
4,1
4,2
4,3
4,4

2N-1
Requests
Match

Spring 2006

uar selection
uar selection
1
1
1
1
2
2
2
2
3
3
3
3
4
4
4
4
2: Grant
1
1
1
1
2
2
2
2
3
3
3
3
4
4
4
4

1
1
2
2
3
3
4
4

# Number of iterations to converge:

C
=
# of iterations required to resolve connections
N 2
E
[
U
]
-------
i
i
N
=
# of ports
4
=
#
of unresolved connections after iteration i
E[C]
logN
U i

Spring 2006
35

PIM with a
single iteration
Spring 2006
36

PIM with 4
iterations
Spring 2006
37

iSLIP
1
4
2
1
1
1
1
3
1
1
2
2
2
#1
2
2
2
3
3
3
3
3
3
4
4
4
4
4
4
1: Requests
2: Grant
3: Accept/Match
1
1
1
1
1
1
2
2
2
2
2
2
#2
3
3
3
3
3
3
4
4
4
4
4
4
Spring 2006

Spring 2006
42

Spring 2006
43
iSLIP
Programmable
Priority Encoder
Implementation
N
1
1
log 2 N
Grant
Accept
2
2
N
log
N
2
Grant
Accept
State
Decision
N
N
N
log
N
2
Grant
Accept