Non-blocking growable arrays

Details Non-blocking growable arrays Non-blocking growable arrays

2007-01-30

2007-01-30

Lane, Jack A. (Department: 2185)

Electrical computers and digital processing systems: memory

Storage accessing and control

Memory configuring

C711S220000

Reexamination Certificate

active

10866570

ABSTRACT:
A computer system stores a dynamically sized array as a base array that contains references to subarrays in which the (composite) array's data elements reside. Each of the base-array elements that thus refers to a respective subarray is associated with a respective subarray size. Each base-array index is thereby at least implicitly associated with a cumulative base value equal to the sum of all preceding base indexes' associated subarray sizes. In response to a request for access to the element associated with a given (composite-array) index, the array-access system identifies the base index associated with the highest cumulative base value not greater than the composite-array index and performs the access to the subarray identified by the element associated with that base index. Composite-array expansion can be performed in a multi-threaded environment without locking, simply by employing a compare-and-swap or similar atomic operation.

REFERENCES:
patent: 2003/0187877 (2003-10-01), Kuboyama et al.

Affiliated with

Also associated with

Rating

Non-blocking growable arrays does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Non-blocking growable arrays, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Non-blocking growable arrays will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3790319