Scheduler for removing redundancy in quantized multiplications on inference accelerators

TW202638303APending Publication Date: 2026-09-16GOOGLE LLC
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
TW114149115
Authority / Receiving Office
TW · TW
Patent Type
Applications
Current Assignee / Owner
Priority Date
2025-02-03
Filing Date
2025-12-15
Publication Date
2026-09-16

Smart Images

  • Figure TWG2TA001076754_001
    Figure TWG2TA001076754_001
  • Figure TWG2TA001076754_002
    Figure TWG2TA001076754_002
  • Figure TWG2TA001076754_003
    Figure TWG2TA001076754_003
Patent Text Reader

Abstract

Methods and systems, including computer-readable media, are described for a multiplication scheduler for quantized inference (MSQI) computations. The multiplication scheduler is implemented as a MSQI hardware unit on a compute tile / unit of a special-purpose hardware integrated circuit, such as an inference accelerator or tensor processing unit (TPU). The multiplication scheduler is designed to optimize multiplication operations in hardware ML inference accelerators by minimizing or eliminating redundant computations (e.g., multiplications) on prevalent quantized formats.
Need to check novelty before this filing date? Find Prior Art