Electrical computers and digital processing systems: interprogra – Interprogram communication using message – Message using queue
Reexamination Certificate
2005-12-13
2005-12-13
Courtenay, III, St. John (Department: 2194)
Electrical computers and digital processing systems: interprogra
Interprogram communication using message
Message using queue
C710S054000
Reexamination Certificate
active
06976260
ABSTRACT:
A single atomic instruction is used to change up to four disjoint areas in memory concurrently in an extended compare and swap operation, replacing traditional locks for serialization and providing recovery for all queue manipulations. Use count-based responsibility passing is employed so that any number of tasks can read the various message queue chains, concurrent with queue updates being made. A summary queue update sequence number is maintained to provide concurrent chain update detection, so that any number of tasks can add elements to the end, or remove elements from the middle (i.e. any where in the chain) concurrently. Concurrent footprinting is used with chain manipulation, so that all (or none) of the chaining indicators and a footprint are set with a single, non-interruptible instruction, making it possible for recovery to always take the correct action. One such use of concurrent footprinting is the concurrent footprinting of use count changes, while another is the transfer of ownership of message queue control blocks. In a preferred embodiment on an IBM S/390 platform, the Perform Locked Operation (PLO) instruction is used to perform the extended compare and swap operations.
REFERENCES:
patent: 4658351 (1987-04-01), Teng
patent: 4847754 (1989-07-01), Obermarck et al.
patent: 4908750 (1990-03-01), Jablow
patent: 5222217 (1993-06-01), Blount et al.
patent: 5313638 (1994-05-01), Ogle et al.
patent: 5333269 (1994-07-01), Calvignac et al.
patent: 5371850 (1994-12-01), Belsan et al.
patent: 5404562 (1995-04-01), Heller et al.
patent: 5548760 (1996-08-01), Healey
patent: 5577211 (1996-11-01), Annapareddy et al.
patent: 5602998 (1997-02-01), Alferness et al.
patent: 5841973 (1998-11-01), Kessler et al.
patent: 5893157 (1999-04-01), Greenspan et al.
patent: 5895492 (1999-04-01), Greenspan et al.
patent: 5895494 (1999-04-01), Scalzi et al.
patent: 5925099 (1999-07-01), Futral et al.
patent: 6029205 (2000-02-01), Alferness et al.
patent: 6058389 (2000-05-01), Chandra et al.
patent: 6134619 (2000-10-01), Futral et al.
patent: 6247064 (2001-06-01), Alferness et al.
patent: 6314501 (2001-11-01), Gulick et al.
patent: 6345327 (2002-02-01), Baskey et al.
patent: 6345329 (2002-02-01), Baskey et al.
Lumetta et al. “Managing Concurrent Access for Shared Memory Active Messages” IEEE, 1998, pp. 272-278.
IBM Publication entitled “Enterprise Systmes Architecture/390 Principles of Operation”, Document No. SA22-7201-06 (Jul. 1999).
Article by W.R. Stevens entitled “UNIX Network Programming” (1990), pp. 137-152.
U.S. Appl. No. 09/040,722, filed Mar. 18, 1998 by D.F. Ault et al., and entitled “Method And Apparatus For Performing A Semaphore Operation”.
U.S. Appl. No. 08/954,711, filed Oct. 20, 1997 by D.F. Ault et al., and entitled “Method And Apparatus For Allocating And Freeing Storage Utilizing Multiple Tiers Of Storage Allocation”.
Ault Donald F.
Cardall David R.
Schmidt Donald W.
Courtenay III St. John
Kinnaman, Jr. William A.
Nguyen Van Hoa
LandOfFree
Method and apparatus for serializing a message queue in a... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and apparatus for serializing a message queue in a..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for serializing a message queue in a... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3468107