Pseudo-first in, first out (FIFO) tag line replacement
AssigneeTexas Instruments Incorporated
InventorSureshkumar Govindaraj
Life of this patent
Estimating the term…
Abstract
A method is provided that includes searching tags in a tag group comprised in a tagged memory system for an available tag line during a clock cycle, wherein the tagged memory system includes a plurality of tag lines having respective tags and wherein the tags are divided into a plurality of non-overlapping tag groups, and searching tags in a next tag group of the plurality of tag groups for an available tag line during a next clock cycle when the searching in the tag group does not find an available tag line.
Claims18
A method comprising:
- searching tags in a first tag group comprised in a tagged memory system for an available tag line during a first clock cycle, wherein the tagged memory system comprises a plurality of tag lines having respective tags and wherein the tags are divided into a plurality of non-overlapping tag groups;
- and
- searching tags in a next tag group of the plurality of non-overlapping tag groups for an available tag line during a next clock cycle when the searching in the first tag group does not find an available tag line;
- wherein the searching tags in the first tag group starts with a tag in the first tag group immediately after a tag associated with a tag line that was allocated in a previous search.
A tagged memory system comprising:
- a plurality of tag lines;
- a plurality of tags, wherein each tag is associated with a respective tag line of the plurality of tag lines and the plurality of tags is divided into a plurality of non-overlapping tag groups;
- and
- a storage allocation component configured to perform pseudo-first-in-first-out (FIFO) tag replacement in which a first tag group of the plurality of non-overlapping tag groups is searched for an available tag line during a first clock cycle, and a next tag group of the plurality of non-overlapping tag groups is searched for an available tag line during a next clock cycle when searching in the first tag group does not find an available tag line;
- wherein the first tag group is searched beginning with a tag in the first tag group immediately after a tag associated with a tag line allocated in a previous search.
A tagged memory system comprising:
- a plurality of tag lines;
- a plurality of tags, wherein each tag is associated with a respective tag line of the plurality of tag lines and the plurality of tags is divided into a plurality of non-overlapping tag groups;
- and
- a storage allocation component configured to search each tag group of the plurality of non-overlapping tag groups in round robin order until an available tag line is located or all of the plurality of non-overlapping tag groups have been searched, wherein the search begins with the tag group comprising a tag associated with a tag line allocated in a previous search and wherein each tag group searched is searched in a single clock cycle.
Dependencies are inferred from the claim text.