Upgrade to Pro — share decks privately, control downloads, hide ads and more …

AOC2025_-_Lab2tile.pdf

Avatar for charline0404 charline0404
March 07, 2025
11k

Β AOC2025_-_Lab2tile.pdf

Avatar for charline0404

charline0404

March 07, 2025
Tweet

Transcript

  1. 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 𝑝𝑑 … π‘š … … … 𝑀
  2. 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 𝑝𝑑 … π‘š … … … 𝑀
  3. 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 𝑝𝑑 … π‘š … … … 𝑀
  4. 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 𝑝𝑑 … π‘š … … … 𝑀
  5. 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 𝑀 𝐹
  6. 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 𝑝𝑑 … π‘š … … … 𝑀 𝑀
  7. 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 …