Entry locking for large data structures

Electrical computers and digital data processing systems: input/ – Access locking

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C707S793000

Reexamination Certificate

active

07051136

ABSTRACT:
The invention is based on the idea that for a large data structure with N entries, memory space for the locks corresponding to the entries can be saved by performing a hashing function on a value that represents an entry into a hashed value 1 to M. This hashed value is used to index the table of M locks. The value of M is typically much smaller than the value of N thereby reducing memory space requirements. If M is chosen large enough and a good hashing function is selected, problems with collisions will be very small. Additionally, problems relating to deadlock occurring, when the hashed value of a second entry equals the hashed value of a first entry, are being addressed by swapping the hashed values of the first and second entries, when the hashed value of the second entry is smaller than the hashed value of the first entry.

REFERENCES:
patent: 4480304 (1984-10-01), Carr et al.
patent: 5109511 (1992-04-01), Nitta et al.
patent: 5339427 (1994-08-01), Elko et al.
patent: 5737611 (1998-04-01), Vicik
patent: 6360220 (2002-03-01), Forin
patent: 6529905 (2003-03-01), Bray et al.
“Resource management in software-programmable router operating systems” by Yan., D.K.Y., Xianging Chen (abstract only) Publication Date: Mar. 2001.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Entry locking for large data structures does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Entry locking for large data structures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Entry locking for large data structures will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3626476

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.