Back to results
US 7,353,331 B2Granted
Hole-filling content addressable memory (HCAM)
AssigneeIntel Corporation
InventorUdaya Shankara
Life of this patent
Estimating the term…
Abstract
A network device comprising a content addressable memory (CAM), based on partitioning and the hole-filling technique, may utilize substantially less power by switching ON only the partitions that are being used. Also, the CAM may quickly add one or more new entries into the memory by consuming substantially less amount of time while updating the entries.
Claims26
A method of processing a plurality of entries stored in a content addressable memory comprising
- generating one or more pairs based on grouping the plurality of entries stored in adjacent locations,
- swapping a first entry and a second entry of each pair in response to determining that the first entry of each pair is invalid and the second entry of each pair is valid, and
- continuing the swapping until valid entries of the plurality of the entries are stored contiguously.
A network device comprising
- a network interface to transfer packets,
- a content addressable memory comprising a plurality of storage locations to store entries, the content addressable memory to generate at least one pair of adjacent locations, to swap a first entry and a second entry of the at least one pair in response to determining that the first entry is invalid and the second entry is valid, and
- a controller to process the packets based on the entries stored in the content addressable memory.
A system comprising
- a plurality of network devices comprising a first network device and a second network device,
- a network to couple a first network device and a second network device of the plurality of the network devices,
- the second network device to send one or more packets to the first network device, and
- the first network device to store a plurality of entries, to generate one or more pairs of the plurality of entries, each pair comprising entries stored in the adjacent locations, to swap a first entry and a second entry of each pair in response to determining that the first entry of each pair is invalid and the second entry of each pair is valid, and to continue the swapping until the valid entries are stored contiguously.
1 more element
Dependencies are inferred from the claim text.