Techniques for dynamically padding data
AssigneeNVIDIA Corporation
InventorsRangharajan VENKATESAN, Benjamin Andrew KELLER, Thierry TAMBE
Life of this patent
Estimating the term…
Abstract
One embodiment of a method for padding data includes storing one or more memory addresses at which padding is to be added in a queue; determining whether a first memory address is stored in the queue; if the first memory address is stored in the queue, then writing a zero to a register; if the first memory address is not stored in the queue, then writing a first value that is read from a first memory to the register; and performing at least one computation based on the first value that is written to the register to generate an output.
Claims20
A computer-implemented method for padding data, the method comprising:
- storing one or more memory addresses at which padding is to be added in a queue;
- determining whether a first memory address is stored in the queue;
- if the first memory address is stored in the queue, then writing a zero to a register;
- if the first memory address is not stored in the queue, then writing a first value that is read from a first memory to the register;
- and
- performing at least one computation based on the first value that is written to the register to generate an output.
A processor comprising:
- a first memory;
- and
- circuitry configured to:
- store one or more memory addresses at which padding is to be added in a queue,
- determine whether a first memory address is stored in the queue,
- if the first memory address is stored in the queue, then write a zero to a register,
- if the first memory address is not stored in the queue, then write a first value that is read from the first memory to the register, and
- perform at least one computation based on the first value that is written to the register to generate an output.
A system, comprising:
- a memory;
- and
- a processor that is coupled to the memory and configured to perform the steps of:
- storing one or more memory addresses at which padding is to be added in a queue,
- determining whether a first memory address is stored in the queue,
- if the first memory address is stored in the queue, then writing a zero to a register,
- if the first memory address is not stored in the queue, then writing a value that is read from the memory to the register, and
- performing at least one computation based on the value that is written to the register to generate an output.
Dependencies are inferred from the claim text.