System and method for lock caching for compound atomic...

G - Physics – 06 – F

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

G06F 15/167 (2006.01) G06F 9/22 (2006.01) G06F 9/52 (2006.01) G06F 12/00 (2006.01) G06F 12/14 (2006.01) G06F 13/18 (2006.01)

Patent

CA 2435148

A system and method for lock caching for compound atomic operations (i.e. a read or write operation to more than one 4-byte word) on shared memory is provided. In a computer system including a memory shared among a plurality of processing entities, for example, multiple threads, a method of performing compound atomic operations comprises providing a pool of lacks for synchronizing access to the memory; assigning the locks among the plurality of entities to minimize lock contention; and performing the compound atomic operations using the assigned locks. Each lock may be assigned in accordance with an address of the shared memory from the processing entity's compound atomic operations. Assigning locks may be performed in a manner to minimize concurrent atomic updates to the same or overlapping portions of the shared memory. For example, the addresses of the memory from the compound atomic operations may be aliased in accordance with a known upper bound on the amount of the shared memory that may be affected by any atomic operation.

LandOfFree

Say what you really think

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

Rating

System and method for lock caching for compound atomic... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with System and method for lock caching for compound atomic..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for lock caching for compound atomic... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFCA-PAI-O-1466391

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