Automatic resource sharing between FIFOs
AssigneeNVIDIA Corporation
InventorOtto L. Steinbusch
Life of this patent
Estimating the term…
Abstract
Embodiments of the present invention recite a method and system for allocating memory resources. In one embodiment, a control component coupled with a memory device determines that a data buffer adjacent to a boundary of a first FIFO queue does not contain current data. The control component also determines that a second data buffer of a second FIFO queue adjacent to the boundary does not contain current data. The control component then automatically shifts the boundary to include the second data buffer in the first FIFO queue.
Claims27
A method for automatically allocating memory resources, said method comprising:
- determining that a data buffer adjacent to a boundary of a first-in first-out (FIFO) queue does not contain current data;
- determining that a second data buffer of a second FIFO queue adjacent to said boundary does not contain current data;
- and
- in response to said determining and further based on a number of times that said FIFO queue has been full, automatically shifting said boundary to include said second data buffer in said FIFO queue.
A method for automatically allocating memory resources, said method comprising:
- receiving a signal for initiating an automatic shifting of a border between a first first-in first-out (FIFO) queue and a second FIFO queue adjacent to said FIFO queue;
- determining that a data buffer adjacent to a boundary of said first (FIFO) queue does not contain current data in response to said signal;
- determining that a second data buffer of a second FIFO queue adjacent to said boundary does not contain current data in response to said signal;
- and
- automatically shifting said boundary to include said second data buffer in said first FIFO queue in response to said determining and further based on a number of times that said first FIFO queue has been full.
A system comprising:
- a memory device comprising a plurality of adjacent first-in first-out (FIFO) queues separated by respective boundaries;
- a control component coupled with said memory device for determining that a data buffer adjacent to a boundary of a first FIFO queue does not contain current data and that a second data buffer of a second FIFO queue adjacent to said boundary does not contain current data, said control component further for automatically shifting said boundary to include said second data buffer in said first FIFO queue when a number of times that said first FIFO queue has been full exceeds a threshold value.
A method of dynamically allocating memory resources between memory spaces, said method comprising:
- recording values indicative of usage of each FIFO queue of a plurality of FIFO queues comprising a first FIFO queue and an adjacent second FIFO queue, wherein said usage comprises a number of times that said plurality of FIFO queues has been full;
- and
- based on a usage value associated with said first FIFO queue exceeding a threshold value, automatically performing a first buffer reallocation between said first FIFO queue and said second FIFO queue provided a plurality of first conditions are satisfied and wherein said first buffer reallocation increases said first FIFO and decreases said second FIFO.
Dependencies are inferred from the claim text.