System and method of dynamically switching queue threshold
AssigneeVIA Technologies, Inc.
InventorsChih-Hao Weng, Ta-Jung Yeh
Life of this patent
Estimating the term…
Abstract
A system and method of dynamically switching the threshold of a data queue, such as FIFO, is disclosed. The data queue has a first threshold and a second threshold, wherein the first threshold is greater than the second threshold. The data queue is dynamically switched between the first threshold and the second threshold according to different power state of a central processing unit (CPU). A system memory is requested to fill the data queue with data whenever amount of the data queue is less than the switched first/second threshold.
Claims16
A system of dynamically switching queue threshold, comprising:
- a data queue, having a first threshold and a second threshold, the data queue being dynamically switched between the first threshold and the second threshold according to different power state of a central processing unit (CPU), wherein the first threshold is greater than the second threshold;
- wherein a system memory is requested to fill the data queue with data whenever amount of the data queue is less than the switched first/second threshold;
- and
- wherein the data queue is changed from the first threshold to the second threshold when the CPU changes from a first power state to a second power state, wherein the second power state saves more power than the first power state and the second threshold is equal to:
- (data unit of transportation)*[(time required to change from the second/first power state into the first/second power state)/(time unit of transportation)]+n*(data unit of transportation)
- where integer n is not less than 0.
A method of dynamically switching queue threshold, comprising:
- dynamically switching a data queue between a first threshold and a second threshold according to different power state of a central processing unit (CPU), wherein the first threshold is greater than the second threshold;
- wherein a system memory is requested to fill the data queue with data whenever amount of the data queue is less than the switched first/second threshold;
- and
- wherein the data queue is changed from the first threshold to the second threshold when the CPU changes from a first power state to a second power state, wherein the second power state saves more power than the first power state and the second threshold is equal to:
- (data unit of transportation)*[(time required to change from the second/first power state into the first/second power state)/(time unit of transportation)]+n*(data unit of transportation)
- where integer n is not less than 0.
Dependencies are inferred from the claim text.