Method and apparatus for supporting parity protection in a...

Electrical computers and digital processing systems: memory – Storage accessing and control – Specific memory composition

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C711S163000, C714S006130, C714S800000

Reexamination Certificate

active

06950901

ABSTRACT:
The present invention discloses a method, apparatus, and article of manufacture for implementing a locking structure for supporting parity protection in a RAID clustered environment. When updating parity, the parity is locked so that other nodes cannot access or modify the parity. Accordingly, the parity is locked, read, generated, written, and unlocked by a node. An enhanced protocal may combine the lock and read functions and the write and unlock functions. Further, the SCSI RESERVE and RELEASE commands may be utlized to lock/unlock the parity data. By locking the parity in this maner, overhead is mininized and does not increase as the number of nodes increases.

REFERENCES:
patent: 4604694 (1986-08-01), Hough
patent: 4864559 (1989-09-01), Perlman
patent: 5243596 (1993-09-01), Port et al.
patent: 5263161 (1993-11-01), Barth et al.
patent: 5280612 (1994-01-01), Lorie
patent: 5339443 (1994-08-01), Lockwood
patent: 5392433 (1995-02-01), Hammersley et al.
patent: 5450600 (1995-09-01), Abe
patent: 5463733 (1995-10-01), Forman et al.
patent: 5502840 (1996-03-01), Barton
patent: 5513354 (1996-04-01), Dwork et al.
patent: 5530948 (1996-06-01), Islam
patent: 5574882 (1996-11-01), Menon
patent: 5577261 (1996-11-01), Harinarayan et al.
patent: 5623670 (1997-04-01), Bohannon et al.
patent: 5630140 (1997-05-01), Modiri et al.
patent: 5682470 (1997-10-01), Dwork et al.
patent: 5729749 (1998-03-01), Ito
patent: 5892955 (1999-04-01), Ofer
patent: 6101615 (2000-08-01), Lyons
patent: 6105099 (2000-08-01), Freitas et al.
patent: 6219751 (2001-04-01), Hodges
Schimmel, UNIX Systems for Modern Architectures Symmetric Multiprocessing and Caching for Kernel Programmers. 1994, Corporate & Professional Publishing Group, pp. 155-160.
IBM Technical Disclosure Bulletin, “Limited Distributed DASD Checksum”, Sep. 1992, vol. No. 35, Issue No. 4A, pp. 404-405.
R.J. Anderson et al., “Wait-free Parallel Algorithms for the Union-Find Problem,”Proceedings 23, ACM STOC, 1991, pp. 370-380.
Bernstein et al., “Concurrency Control and Recovery in Database Systems,” Chapters 7.3-7.4, pp. 222-240.
T.D. Chandra et al., “On the Impossibility of Group Membership,” ACM 1996, p. 322.
T.D. Chandra, “Polylog Randomized Wait-Free Consensus,” Proceedings of 15thACM Symposium on Principles of Distributed Computing, 1996, pp. 166-175.
T.D. Chandra et al., “Unreliable Failure Detectors for Asynchronous Systems,” Proceedings of 10thACM Symposium on Principles of Distributed Computing, 1991, pp. 325-340.
S. Chaudhuri et al., “Understanding the Set Consensus Partial Order Using the Borowsky-Gafni Simulation,” Proceedings of 10thInternational Workshop on Distributed Algorithms, Italy, 1996, pp. 362-379.
D. Dolev, “A Framework for Partitionable Membership Service,” 1996, ACM, 10 pgs.
I. Keidar et al., “Efficient Message Ordering in Dynamic Networks,” Proceedings, 15thAnnual ACM Symposium on Principles of Distributed Computing, 1996, pp. 68-76.
C. Dwork, “Collective Consistency,” LN in CS 1151 WDAG Proceedings, 1996, p. 234.
C. Dwork, “Collective Consistency (Work in Progress),” ACM 1996, p. 341.
F. Jahanian et al., “Processor Group Membership Protocols: Specification, Design and Implementation,” 12thSymposium on Reliable Distributed Systems, Oct. 1993, pp. 1-11.
B. Hajek et al., “The Time Complexity of Maximum Matching by Simulated Annealing,” 1988, Journal of the Association for Computing Machinery, 35(2):387-403.
B.W. Lampson, “How to Build a Highly Available System Using Consensus,” 19thInternational Workshop—Distributed Algorithms, Italy, 1996, pp. 1-17.
G. Neiger, “A New Look at Membership Services,” ACM 1996, p. 331.
J.D. Palmer et al., Method and Apparatus for Ordered Reliable Multicast with Asymmetric Safety in a Multiprocessing System, U.S. Appl. No. 08/972,111 filed Nov. 17, 1997, pp. 1-42.
A. Ricciardi, “Impossibility of (Repeated) Reliable Broadcast,” ACM 1996, p. 342.
D.A. Patterson et al., 1988, “A Case for Redundant Arrays . . . (RAID),” ACM, pp. 109-116.
TechWeb, TechEncyclopedia, RAID, Jul. 19, 2000, 7 pages.
IBM Disk Storage Systems, “SCSI Command Reference 2105 Model B09,” 1998, 119 pages.

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

Method and apparatus for supporting parity protection 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 supporting parity protection in a..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for supporting parity protection in a... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3389671

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