Merge protocol for clustered computer system

Electrical computers and digital processing systems: multicomput – Computer conferencing – Cooperative computer processing

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C718S106000

Reexamination Certificate

active

06968359

ABSTRACT:
An apparatus, program product and method utilize ordered messages in a clustered computer system to defer the execution of a merge protocol in a cluster group until all pending protocols in each partition of a group are handled, typically by ensuring either cancellation or completion of each pending protocol prior to execution of the merge protocol. From the perspective of each group member, the execution of the merge protocol is deferred by inhibiting processing of the merge request by such member until after processing of all earlier-received pending requests has been completed.

REFERENCES:
patent: 4709365 (1987-11-01), Beale et al.
patent: 5146590 (1992-09-01), Lorie et al.
patent: 5179699 (1993-01-01), Iyer et al.
patent: 5502818 (1996-03-01), Lamberg
patent: 5528605 (1996-06-01), Ywoskus et al.
patent: 5563878 (1996-10-01), Blakeley et al.
patent: 5640554 (1997-06-01), Take
patent: 5704032 (1997-12-01), Badovinatz et al.
patent: 5729687 (1998-03-01), Rothrock et al.
patent: 5787249 (1998-07-01), Badovinatz et al.
patent: 5805786 (1998-09-01), Badovinatz et al.
patent: 5883939 (1999-03-01), Friedman et al.
patent: 5926619 (1999-07-01), Badovinatz et al.
patent: 5973724 (1999-10-01), Riddle
patent: 6006259 (1999-12-01), Adelman et al.
patent: 6065062 (2000-05-01), Periasamy et al.
patent: 6078957 (2000-06-01), Adelman et al.
patent: 6108699 (2000-08-01), Moiin
patent: 6115749 (2000-09-01), Golestani et al.
patent: 6138251 (2000-10-01), Murphy et al.
patent: 6185666 (2001-02-01), Murray et al.
patent: 6192411 (2001-02-01), Chan et al.
patent: 6216150 (2001-04-01), Badovinatz et al.
patent: 6292905 (2001-09-01), Wallach et al.
patent: 6298041 (2001-10-01), Packer
patent: 6317867 (2001-11-01), Elnozahy
patent: 6338092 (2002-01-01), Chao et al.
patent: 6343320 (2002-01-01), Faichild et al.
patent: 6363495 (2002-03-01), MacKenzie et al.
patent: 6367029 (2002-04-01), Mayhead et al.
patent: 6381215 (2002-04-01), Hamilton et al.
patent: 6392993 (2002-05-01), Hamilton et al.
patent: 6408310 (2002-06-01), Hart
patent: 6425014 (2002-07-01), Aiken et al.
patent: 6427148 (2002-07-01), Cossock
patent: 6446219 (2002-09-01), Slaughter et al.
patent: 6449641 (2002-09-01), Moiin et al.
patent: 6449734 (2002-09-01), Shrivastava et al.
patent: 6453426 (2002-09-01), Gamache et al.
patent: 6460039 (2002-10-01), Pinter et al.
patent: 6496481 (2002-12-01), Wu et al.
patent: 6507863 (2003-01-01), Novaes
patent: 6529958 (2003-03-01), Oba et al.
patent: 6545981 (2003-04-01), Garcia et al.
patent: 6564372 (2003-05-01), Babaian et al.
patent: 6574668 (2003-06-01), Gubbi et al.
patent: 6578032 (2003-06-01), Chandrasekar et al.
patent: 6611923 (2003-08-01), Mutalik et al.
patent: 6625118 (2003-09-01), Hadi Salim et al.
patent: 6625639 (2003-09-01), Miller et al.
patent: 6718361 (2004-04-01), Basani et al.
patent: 6757698 (2004-06-01), McBride et al.
patent: 6823512 (2004-11-01), Miller et al.
patent: 6839752 (2005-01-01), Miller et al.
patent: 6847984 (2005-01-01), Midgley et al.
patent: 2002/0161889 (2002-10-01), Gamache et al.
patent: 2002/0165977 (2002-11-01), Novaes
patent: 2003/0041138 (2003-02-01), Kampe et al.
patent: 2004/0153711 (2004-08-01), Brunelle et al.
patent: 05-204811 (1993-08-01), None
patent: 07-311753 (1995-11-01), None
patent: 09-245010 (1997-09-01), None
patent: 11-328136 (1999-11-01), None
patent: 2000-156706 (2000-06-01), None
patent: 2000-196677 (2000-07-01), None
D. A. Agarwal et al, “A Reliable Ordered Delivery Protocol for Interconnected Local-Area Networks”. In Proc. of the International Conference on Network Protocols, pp. 365-374, Tokyo, Japan, Nov. 1995.
Wanlei Zhou et al, “Parallel Recovery in a Replicated Object Environment”, 1996.
Pei et al, “Totally Ordered Reliable Multicast for Whiteboard Application”, Department of Computer Science and Technology, Tsinghua University, Beijing, 1999.
Lilien, L., “Quasi-partitioning: a new paradigm for transaction execution in partitioned distributed Data base systems”, Data Engineering, 1989. Proceedings. Fifth International Conference on , Feb. 6-10, 1989 Page(s): 546-553.
Jing-Chiou Liou et al,“A comparison of general approaches to multiprocessor scheduling ”, Parallel Processing Symposium, 1997. Proceedings., 11th International , Apr. 1-5, 1997, Page(s): 152-156.
A. Banerji, D et al, “High-Performance Distributed Shared Memory Substrate for Workstation Clusters”, In Proc. of the Second IEEE Int'l Symp. on High Performance Distributed Computing, 1993.
U.S. Appl. No. 09/697,398, entitled “Group Data Sharing During Membership Change in Clustered Computer System,” filed on Oct. 27, 2000 by Miller et al. (ROC920000129US1).
U.S. Appl. No. 09/732,189, entitled “Peer Protocol Status Query in Clustered Computer System,” filed on Dec. 7, 2000 by Miller (ROC920000125US1).
Timothy Roy Block, IBM Patent Application filed Nov. 22, 2000, U.S. Appl. No. 09/718,924, “Apparatus and Method for Communicating Between Computer Systems Using a Sliding Send Window for Ordered Messages in a Clustered Computing Environment.”
Paul et al., “Reliable Multicast Transport (RMTP),” Apr. 1997, IEEE Journal of Selected Areas in Communications, vol. 15, No. 3, pp. 407-421.

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

Merge protocol for clustered computer 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 Merge protocol for clustered computer system, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Merge protocol for clustered computer system will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3483575

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