# US 7,412,500 B2 · Method and apparatus for using a serial cable as a cluster quorum device > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 7,412,500 B2 - Document ID: US7412500B2 - Status: Granted - Kind: B2 - Application number: 11/034,694 - Filed: 2005-01-13 - Published: 2006-02-23 - Granted: 2008-08-12 - Earliest claimed: 2004-08-23 - Assignees: Sun Microsystems, Inc. - Inventors: Stephen J. Mckinty; Jean-Pascal Mazzilli - Web page: https://patentgrep.com/patent/US7412500B2 ## CPC - G06F 9/5072: {Grid computing} - H04L 69/40: for recovering from a failure of a protocol instance or entity, e.g. service redundancy protocols, protocol state redundancy or protocol service redirection (management of faults, events, alarms or notifications in data switching networks H04L41/06) - G06F 11/18: using passive fault-masking of the redundant circuits {(error detection by comparing the output of redundant processing systems with continued operation after detection of the error G06F11/165)} - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) - H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M) ## Abstract A method for obtaining a quorum vote by a first node using a quorum cable, wherein the quorum cable comprises a first end connected to the first node and a second end connected to a second node, including determining whether the quorum cable is reserved by the second node using a remote reservation input (RRI) on the first end, if the quorum cable is not reserved by the second node asserting a local reservation input (LRI) on the first end by the first node, monitoring a local reservation output (LRO) on the first end by the first node to determine whether the LRO on the first end is asserted in response to asserting the LRI on the first end, and obtaining the quorum vote by the first node, if the LRO on the first end is asserted. ## Claims ### Claim 1 A method for obtaining a quorum vote by a first node using a quorum cable, comprising: determining that a network connection between the first node and a second node is inactive, wherein the network connection is associated with a local area network; determining whether the quorum cable is reserved by the second node using a remote reservation input (RRI) on a first end; if the quorum cable is not reserved by the second node: asserting a local reservation input (LRI) on the first end by the first node; monitoring a local reservation output (LRO) on the first end by the first node to determine whether the LRO on the first end is asserted in response to asserting the LRI on the first end; and obtaining the quorum vote by the first node, if the LRO on the first end is asserted, wherein the quorum vote is obtained without direct communication between the first node and the second node, wherein the quorum cable comprises the first end directly connected to the first node and the second end directly connected to a second node. ### Claim 2 (depends on 1) The method of claim 1, further comprising, prior to obtaining the quorum vote: waiting for a collision detection timeframe to elapse, if the first LRO was asserted; monitoring the RRI on the first end by the first node to determine whether the RRI on the first end is asserted after the collision detection timeframe has elapsed, if the LRO on the first end was asserted; and executing a collision detection algorithm if the RRI on the first end is asserted after the collision detection timeframe has elapsed. ### Claim 3 (depends on 2) The method of claim 2, wherein executing the collision detection algorithm, comprises: stopping assertion of the LRI on the first end by the first node; stopping assertion of a LRI on the second end by the second node; reasserting the LRI on the first end by the first node after a first pre-determined amount of time; and reasserting the LRI located on the second end by the second node after a second pre-determined amount of time. ### Claim 4 (depends on 3) The method of claim 3, wherein the first pre-determined amount of time and the second pre-determined amount of time are randomly determined. ### Claim 5 (depends on 3) The method of claim 3, wherein the first pre-determined amount of time is determined using information associated with the first node and the second pre-determined amount of time is determined using information associated with the second node. ### Claim 6 (depends on 2) The method of claim 2, wherein executing the collision detection algorithm, comprises: obtaining a first priority information associated with the first node; obtaining a second priority information associated with the second node; determining whether the first node or the second node has priority to reserve the quorum cable using the first priority information and the second priority information; stopping assertion of a LRI on the second end by the second node, if the first node has priority; and stopping assertion of the LRI on the first end by the first node, if the second node has priority. ### Claim 7 (depends on 1) The method of claim 1, using the RRI on the first end to determine whether the quorum cable is reserved, wherein determining whether the quorum cable is reserved comprises determining whether the RRI on the first end is asserted. ### Claim 8 A cluster comprising: a quorum cable having a first end and a second end; a first node directly connected to the first end; and a second node directly connected to the second end, wherein the first node and the second node comprise functionality to reserve the quorum cable, thereby obtaining a quorum vote, wherein the quorum vote is obtained without direct communication between the first node and the second node, wherein the first end comprises a first local reservation input (LRI), a first local reservation output (LRO), and a first remote reservation input (RRI), and the second end comprises a second LRI, a second LRO, and a second RRI, wherein the first node and the second node are connected via a network connection associated with a local area network. ### Claim 9 (depends on 8) The cluster of claim 8, wherein the first LRO is connected to the second RRI, the first RRI is connected to the second LRI, the second LRO is connected to the first RRI, and the second RRI is connected to the first LRI. ### Claim 10 (depends on 8) The cluster of claim 8, wherein functionality to reserve the quorum cable by the first node comprises functionality to: determine whether the quorum cable is reserved using the first RRI; if the quorum cable is not reserved by the second node: assert the first LRI by the first node; monitor the first LRO by the first node to determine whether the first LRO is asserted in response to asserting the first LRI; and obtain the quorum vote by the first node, if the first LRO is asserted. ### Claim 11 (depends on 10) The cluster of claim 10, further comprising functionality to: prior to obtaining the quorum vote: wait for a collision detection timeframe to elapse, if the first LRO was asserted; monitor the first RRI by the first node to determine whether the first RRI is asserted after the collision detection timeframe has elapsed, if the first LRO was asserted; and execute a collision detection algorithm if the first RRI is asserted after the collision detection timeframe has elapsed. ### Claim 12 (depends on 11) The cluster of claim 11, wherein executing the collision detection algorithm, comprises functionality to: stop assertion of the first LRI by the first node; stop assertion of the second LRI byte second node; reassert the first LRI by the first node after a first pre-determined amount of time; and reassert the second LRI by the second node after a second pre-pre-determined amount of time.