Abstract: A memory unit is presented employing a least recently used (LRU) replacement strategy. The memory unit may include a memory subunit for storing data items, circuitry coupled to the memory subunit for determining if the memory subunit contains a needed data item, and a control unit for controlling the storing of data items within the memory subunit. The memory subunit may include n entry locations where n≧2. The memory unit may generate a first signal indicating which of the n entry locations are currently in use (i.e., contain valid data items), and the circuitry coupled to the memory subunit may produce a second signal indicating which of the n entry locations contains the needed data item. A new data item to be stored within the memory subunit may be accompanied by a control signal identifying which of the n entry locations is to be used to store the new data item. The control unit may receive the first and second signals and produce the control signal dependent upon the first and second signals.

Abstract: A least recently used (LRU) cache replacement algorithm is implemented with a set of N pointer registers that point to respective ways of an N-way set of memory blocks. One of the pointer registers is an LRU pointer, pointing to a least recently used way and another of the pointer registers is a most recently used (MRU) pointer, pointing to a most recently used way. For a cache fill operation in which a new memory block is written to one of the N ways, the new memory block is written into the way (wayn), pointed to by the LRU pointer. All the pointers except the MRU pointer are promoted to point to a way pointed to by respective newer neighboring pointers, the newer neighboring pointers being neighbors towards the MRU pointer. The MRU pointer is updated to point to the wayn in which the new memory block was written.

Abstract: When a data input signal having R plus X groups of M digits is received, the digits are segmented such that X different first counter-detectors receive M digits and a second counter-detector receives the R digits. The counter-detectors determine a number of most significant count digits leading a most significant non-count digit and detect the presence of a non-count digit. A decoder receives the outputs of the first counter-detectors and, responsive to a non-count digit detection in a most significant group of M digits having a non-count digit, communicates the corresponding count number to a concatenator. A third counter-detector determines and communicates a number of most significant groups of M digits having no non-count digits. An output of the third counter detector is concatenated with an output of the decoder where the decoder output is represented by Z digits where M=N.sup.Z (X, M, R, N, and Z are non-negative integers). The concatenation represents the number of leading count digits.

Abstract: When a data input signal having R plus X groups of M digits is received, the digits are segmented such that X different first counter-detectors receive M digits and a second counter-detector receives the R digits. The counter-detectors determine a number of most significant count digits leading a most significant non-count digit and detect the presence of a non-count digit. A decoder receives the outputs of the first counter-detectors and, responsive to a non-count digit detection in a most significant group of M digits having a non-count digit, communicates the corresponding count number to a concatenator. A third counter-detector determines and communicates a number of most significant groups of M digits having no non-count digits. An output of the third counter detector is concatenated with an output of the decoder where the decoder output is represented by Z digits where M=N.sup.Z (X, M, R, N, and Z are non-negative integers). The concatenation represents the number of leading count digits.