Linked list traversal with reduced memory accesses

Details Linked list traversal with reduced memory accesses Linked list traversal with reduced memory accesses

2011-04-19

2011-04-19

Kim, Matt (Department: 2186)

Electrical computers and digital processing systems: memory

Address formation

Hashing

C711SE12002, C707S800000

Reexamination Certificate

active

07930516

ABSTRACT:
A linked list traversal system identifies when a linked list has become inefficient, either through attack or an undue multiplicity of collisions. A data unit is parsed to extract a key. A first hash result associated with the key is calculated based on a first hash function. A first linked list is identified based on the first hash result. It is determined whether the first linked list has been compromised. A second hash result associated with the key is calculated based on a second hash function when the first linked list has been compromised. A second linked list is established based on the second hash result, where the second hash result is different from the first hash result.

REFERENCES:
patent: 6434662 (2002-08-01), Greene et al.
patent: 7020782 (2006-03-01), Rajasekaran et al.
patent: 2003/0086341 (2003-05-01), Wells et al.
patent: 2006/0085554 (2006-04-01), Shah et al.
Co-pending U.S. Appl. No. 11/427,952, filed Jun. 30, 2006, Xiangdong Jin et al., entitled “Linked List Traversal With Reduced Memory Accesses”, 26 pages.

Affiliated with

Also associated with

Rating

Linked list traversal with reduced memory accesses does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Linked list traversal with reduced memory accesses, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linked list traversal with reduced memory accesses will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2634377