AOC2025_-_Lab2tile.pdf - Speaker Deck

AOC2025_-_Lab2tile.pdf

by charline0404

Slide 1

Slide 1 text

AI System Lab Eyeriss Tiling 1

Slide 2

Slide 2 text

AI System Lab Eyeriss — Processing Pass 2 Processing Pass The PE array can run multiple 2-D convolutions from up to 𝑞 × 𝑟 channels of 𝑝 × 𝑡 filters simultaneously. Multiple ifmaps can also be processed sequentially through the PE array. 𝐶 𝑊 𝐻 𝑊 𝑈 𝑒 − 1 + 𝑅 ifmap filter ofmap 𝑝 ∗ 𝑡 𝑀 𝑆 𝑅 𝐶 𝑚 𝑀 𝐹 𝐸 𝐹 𝑒 𝑚 1 𝑝𝑡 … 𝑚 … … … 𝑀

Slide 3

Slide 3 text

AI System Lab Eyeriss — Computation Ordering 3 Computation Ordering (𝑚, 𝐶, 𝐸, 𝑀) = (1, 1, 1, 1) ~ (𝑝𝑡, 𝑞𝑟, 𝑒, 1) For the sake of convenience, we take the following assumption for instance 𝑚 = 2𝑝𝑡 𝑀 = 2𝑚 𝐶 = 2𝑞𝑟 𝐸 = 2𝑒 m → C → E → M 𝐶 𝑊 𝐻 ifmap filter ofmap 𝑝 ∗ 𝑡 𝑀 𝑆 𝑅 𝐶 𝑚 𝑀 𝐹 𝐸 1 𝑝𝑡 … 𝑚 … … … 𝑀

Slide 4

Slide 4 text

AI System Lab Eyeriss — Computation Ordering 4 Computation Ordering (𝑚, 𝐶, 𝐸, 𝑀) = (𝑝𝑡 + 1, 1, 1, 1) ~ (2𝑝𝑡, 𝑞𝑟, 𝑒, 1) For the sake of convenience, we take the following assumption for instance 𝑚 = 2𝑝𝑡 𝑀 = 2𝑚 𝐶 = 2𝑞𝑟 𝐸 = 2𝑒 m → C → E → M 𝐶 𝑊 𝐻 ifmap filter 𝑝 ∗ 𝑡 𝑀 𝑆 𝑅 𝐶 𝑚 𝐸 ofmap 𝑀 𝐹 1 𝑝𝑡 … 𝑚 … … … 𝑀

Slide 5

Slide 5 text

AI System Lab Eyeriss — Computation Ordering 5 Computation Ordering (𝑚, 𝐶, 𝐸, 𝑀) = (1, 𝑞𝑟 + 1, 1, 1) ~ (𝑝𝑡, 𝐶, 𝑒, 1) For the sake of convenience, we take the following assumption for instance 𝑚 = 2𝑝𝑡 𝑀 = 2𝑚 𝐶 = 2𝑞𝑟 𝐸 = 2𝑒 m → C → E → M 𝐶 𝑊 𝐻 ifmap filter 𝑝 ∗ 𝑡 𝑀 𝑆 𝑅 𝐶 𝑚 𝐸 ofmap 𝑀 𝐹 1 𝑝𝑡 … 𝑚 … … … 𝑀

Slide 6

Slide 6 text

AI System Lab 𝐶 𝑊 𝐻 Eyeriss — Computation Ordering 6 Computation Ordering (𝑚, 𝐶, 𝐸, 𝑀) = (1, 1, 𝑒 + 1, 1) ~ (𝑝𝑡, 𝑞𝑟, 𝐸, 1) For the sake of convenience, we take the following assumption for instance 𝑚 = 2𝑝𝑡 𝑀 = 2𝑚 𝐶 = 2𝑞𝑟 𝐸 = 2𝑒 m → C → E → M ifmap filter 𝑝 ∗ 𝑡 𝑀 𝑆 𝑅 𝐶 𝑚 𝐸 1 𝑝𝑡 … 𝑚 … … … 𝑀 ofmap 𝑀 𝐹

Slide 7

Slide 7 text

AI System Lab Eyeriss — Computation Ordering 7 Computation Ordering (𝑚, 𝐶, 𝐸, 𝑀) = (1, 1, 1, 𝑚 + 1) ~ (𝑝𝑡, 𝑞𝑟, 𝑒, 𝑀) For the sake of convenience, we take the following assumption for instance 𝑚 = 2𝑝𝑡 𝑀 = 2𝑚 𝐶 = 2𝑞𝑟 𝐸 = 2𝑒 m → C → E → M 𝐶 𝑊 𝐻 ifmap filter ofmap 𝑝 ∗ 𝑡 𝑀 𝑆 𝑅 𝐶 𝑚 𝑀 𝐹 𝐸 1 𝑝𝑡 … 𝑚 … … … 𝑀 𝑀

Slide 8

Slide 8 text

AI System Lab Eyeriss — Computation Ordering 8 Computation Ordering (𝑚, 𝐶, 𝐸, 𝑀) = (𝑝𝑡 + 1, 𝑞𝑟 + 1, 𝑒 + 1, 𝑚 + 1) ~ (𝑚, 𝐶, 𝐸, 𝑀) For the sake of convenience, we take the following assumption for instance 𝑚 = 2𝑝𝑡 𝑀 = 2𝑚 𝐶 = 2𝑞𝑟 𝐸 = 2𝑒 m → C → E → M 𝐶 𝑊 𝐻 ifmap filter ofmap 𝑝 ∗ 𝑡 𝑀 𝑆 𝑅 𝐶 𝑚 𝑀 𝐹 𝐸 1 𝑝𝑡 … 𝑚 … … 𝑀 Final Round …