Exclusive lease instruction support for transient blocking...

Electrical computers and digital processing systems: memory – Storage accessing and control – Control technique

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C711S150000, C711S152000

Reexamination Certificate

active

07346747

ABSTRACT:
A computer system uses transient blocking synchronization for performing operations on shared memory. When performing operations on more than one memory location, the computer system obtains transient exclusive access to a first memory location. The computer system then obtains transient exclusive access to a second memory location, where the transient exclusive access to the second memory location does not expire prior to an expiration of the transient exclusive access to the first memory location or until explicitly unleased.

REFERENCES:
patent: 4561051 (1985-12-01), Rodman et al.
patent: 4858116 (1989-08-01), Gillet et al.
patent: 5301290 (1994-04-01), Tetzlaff et al.
patent: 5428761 (1995-06-01), Herlihy et al.
patent: 5875342 (1999-02-01), Temple
patent: 5892955 (1999-04-01), Ofer
patent: 5991845 (1999-11-01), Bohannon et al.
patent: 6370625 (2002-04-01), Carmean et al.
patent: 6745274 (2004-06-01), Snyder et al.
patent: 6782452 (2004-08-01), Williams, III
patent: 6958507 (2005-10-01), Atwood et al.
patent: 2002/0078307 (2002-06-01), Zahir
patent: 2002/0188590 (2002-12-01), Curran et al.
patent: 2004/0015642 (2004-01-01), Moir et al.
patent: 2005/0038964 (2005-02-01), Hooper et al.
patent: 2006/0036850 (2006-02-01), Enokida
Murice Herlihy, A Methodology for Implementing Highly Concurrent Data Objects, ACM Transactions on Programming Languages and Systems, vol. 15, No. 5, Nov. 1993, pp. 745-770.
Nir Shavit, et al., Elimination Trees and The Contruction of Pools and Stacks, 7th Annual Symposium on Parallel Algorithms and Architectures (SPAA), 30 pages.
Thomas E. Anderson, The Performance of Spin Lock Alternatives for Shared-Memory Multiprocessors, IEEE Transactions on Parallel and Distributed Systems, vol. 1, No. 1, Jan. 1990, pp. 6-16.
Maged M. Michael. Safe Memory Reclamation for Dynamic Lock-Free Objects Using Aomic Reads and Writes. PODC 2002 Jul. 21-24, 2002.
John M. Mellor-Crummey, et al. Algorithms for Scalable Synchronization on Shared-Memory Multiprocessors. ACM Transactions on Computer Systems, vol. 9, No. 1, Feb. 1991, pp. 21-65.
Maged M. Michael, et al. Nonblocking Algorithms and Preemption-Safe Locking on Multidprogrammed Shsred Memory Multiprocessors. Journal of Parallel and Distributed Computing 51, Article No. PC981446, 1998, pp. 1-26.
Maurice P. Herlihy, et al. Linearizability: A Correctness Condition for Concurrent Objects Objects, ACM Transactions on programming Languages and Systems, vol. 12, No. 3, Jul. 1990, pp. 463-492.
Maurice Herlihy, et al. The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized Lock-Free Data Structures. 15 pages.
Murice Herlihy, et al. Scalable Concurrent Counting. In the Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, Jul. 1992, pp. 1-31.
Nir Shavit, et al. A Steady State Analysis of Diffracting Trees. pp. 1-26.
Nir Shavit, et al. Diffracting Trees. In the Proceedings of the Annual Symposium on Parallel Algorithms and Architectures (SPAA), Jun. 1994, pp. 0-49.
Nir Shavit, et al. Combining Funnels: A Dynamic Approach To Software Combining. Principals of Distributed Computing (PODC98). pp. 1-30.
Beng-Hong Lim, et al. Waiting Algorithms for Synchronization in Large-Scale Multiprocessors. ACM Transactions on Computer Systems, vol. 11, No. 3, Aug. 1993, pp. 1-39.
Maged M. Michael, et al. Simple, Fast, adn Practical Non-Blocking and Blocking Concurrent Queue Algorithms. 8 pages.
Ravi Rajwar, et al. Speculative Lock Elision: Enabling Highly Concurrent Multithreaded Execution. In the proceedings of the 34th International Symposium on Microarchitecture (MICRO), Dec. 3-5, 2001, 12 pages.
John D. Valois. Implementing Lock-Free Queues. In proceedings of the Seventh International Conference on Parallel and Distributed Computing Systems, Las Vegas, NV, Oct. 1994, pp. 1-9.
Sundeep Prakash, et al. Non-Blocking Algorithms for Concurrent Data Structures. pp. 1-40.
John M. Mellor-Crummey, et al. Algorithms for Scalable Synchronization on Shared-Memory Multiprocessors. Jan. 1991, 42 pages.
Peter Magnusson, et al. Queue Locks on Cache Coherent Multiprocessors.7 pages.
Travis S. Craig. Building FIFO and Priority-Queuing Spin Locks from Atomic Swap. pp. 1-29.
Yehuda Afek, et al. Atomic Snapshots of Shred Memory. pp. 1-21 A Preliminary version of this paper appeared in theProceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing, (Quebec City, Quebec, Aug.) ACM, New York, 1990, pp. 1-14.
Ole Agesen, et al. DCAS-Based Concurrent Deques. 10 pages.
Maurice Herlihy. Wait-Free Synchronization. ACM Transactions on Programming Languages and Systems, vol. 11, No. 1, Jan. 1991, pp. 124-149.
Mark Moir. Practical Implementations of Non- Blocking Synchronization Primitives.10 pages.
Maurice Herlihy, et al. Obstruction-Free Synchronization: Double-Ended Queues as an Example. 8 pages.
Gray, et al.; “Leases: An Efficient Fault-Tolerant Mechanism for Distributed File Cache Consistency”; ACM, pp. 202-204, 1989.

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

Exclusive lease instruction support for transient blocking... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Exclusive lease instruction support for transient blocking..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exclusive lease instruction support for transient blocking... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3975945

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