Implementing locks in a distributed processing system

Electrical computers and digital processing systems: multicomput – Master/slave computer controlling – Slave computer locking

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C709S203000, C709S208000, C709S209000, C709S223000, C709S224000, C709S225000, C709S229000, C710S200000

Reexamination Certificate

active

07640315

ABSTRACT:
A messaging scheme to synchronize processes within a distributed memory multiprocessing computer system having two or more processing nodes interconnected using an interconnect structure of dual-unidirectional links. Each unidirectional link forms a point-to-point interconnect to transfer packetized information between two processing nodes. A lock acquisition request from a lock requesting node is placed into service by an arbitrating node when no previous lock requests are pending for service. The arbitrating node transmits a broadcast message to all nodes in the system, which, in turn, respond with a corresponding probe response message to inform the arbitrating node of cessation of issuance of new requests by the node sending the probe response message. The arbitrating node informs the lock requesting node of the requesting node's lock ownership by transmitting a target done message thereto. After completion of lock operations, the lock requesting node sends a lock release request to the arbitrating node, which, in turn, informs all processing nodes of lock release by transmitting another broadcast message within the system. The messaging protocol is completed when each node sends another probe response to the arbitrating node, which, in turn, sends a final target done message to the lock requesting node. Lock operations are performed without contention for system resources and without deadlocks among various processing nodes.

REFERENCES:
patent: 4725834 (1988-02-01), Change et al.
patent: 4750109 (1988-06-01), Kita
patent: 4807118 (1989-02-01), Lin et al.
patent: 4922408 (1990-05-01), Davis et al.
patent: 4984153 (1991-01-01), Kregness et al.
patent: 5055999 (1991-10-01), Frank et al.
patent: 5175837 (1992-12-01), Arnold et al.
patent: 5341483 (1994-08-01), Frank et al.
patent: 5351043 (1994-09-01), Hullett et al.
patent: 5495481 (1996-02-01), Duckwall
patent: 5502840 (1996-03-01), Barton
patent: 5506961 (1996-04-01), Carlson et al.
patent: 5548728 (1996-08-01), Danknick
patent: 5579504 (1996-11-01), Callander et al.
patent: 5592486 (1997-01-01), Lo et al.
patent: 5649157 (1997-07-01), Williams
patent: 5657472 (1997-08-01), Van Loo et al.
patent: 5774731 (1998-06-01), Higuchi et al.
patent: 5860159 (1999-01-01), Hagersten
patent: 5875485 (1999-02-01), Matsumoto
patent: 6148300 (2000-11-01), Singhal et al.
patent: 6163855 (2000-12-01), Shrivastava et al.
patent: 6473849 (2002-10-01), Keller et al.
patent: 6480918 (2002-11-01), McKenney et al.
patent: 6523066 (2003-02-01), Montroy et al.
patent: 6920454 (2005-07-01), Chan
Charney, Mark, “The Role of Network Bandwidth in Barrier Synchronization,” p. 202-212, 1995.
Dijkstra, E.W., “Solution of a Problem in Concurrent Programming Control,” Communications of the ACM, vol. 8, No. 9, Sep. 1965, p. 569.
Gustavson, David B., “The Scalable Coherent Interface and Related Standards Projects,” IEEE Micro, 1992, p. 10.
Cox, et al., “Adaptive Cache Coherency for Detecting Migratory Shared Data,” Proc. 20th Annual Symposium on Computer Architecture, May 1993, pp. 98-108.
Stenstrom, et al., “An Adaptive Cache Coherence Protocol Optimized for Migratory Sharing,” Proc. 20.h Annual Symposium on Computer Architecture, May 1993 IEEE, pp. 109-118.
Wolf-Dietrich Weber, et al. “Analysis of Cache Invalidation Patterns in Multiprocessors”, Computer Systems Laboratory, Stanford University, CA, pp. 243-256.
Kourosh, et al. “Two Techniques to Enhance the Performance of Memory Consistency Models,” 1991 International Conference on Parallel Processing, pp. 1-10.
Li, et al. “Memory Coherence in Shared Virtual Memory Systems,” 1986, Proceedings of the fifth annual ACM symposium on Principles of distributed computing ACM, pp. 229-239.
Magnusson, et al., “Queue Locks on Cache Coherent Multiprocessors”, IEEE, In Proceedings of the 8th International Symposium on Parallel Processing 1994.
Hagersten, et al., “Simple COMA,” Ashley Saulsbury and Anders Landin Swedish Institute of Computer Science, Jul. 1993, pp. 233-259.
Saulsbury, et al., “An Argument for Simple COMA,” Swedish Institute of Computer Science, 10 pages.
Anderson, “The Performance of Spin Lock Alternatives for Shared-memory Multiprocessors”, IEEE Transactions on Parallel and Distributed Systems, vol. 1, No. 1, Jan. 1990.

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

Implementing locks in a distributed processing system does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Implementing locks in a distributed processing system, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Implementing locks in a distributed processing system will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4076353

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