US7647595B2 — Efficient event notification in clustered computi…

Claim 1

Independent Claim 129 words

A method for communicating data in a clustered computing system, the method comprising: receiving an initial indication that an event was generated at a first node of the clustered computing system; receiving one or more subsequent indications that the event was generated at the first node of the clustered computing system; determining that information from the initial indication is identical to information from said one or more subsequent indications; in response to determining that the information from the initial indication is identical to the information from said one or more subsequent indications, coalescing the information from the initial indication with the information from said one or more subsequent indications into a coalesced event notification; and propagating the coalesced event notification to a receiving node of the clustered computing system.

Claim 2

Independent Claim 129 words

A method for communicating data in a clustered computing system, the method comprising: receiving an initial indication that an event was generated at a first node of the clustered computing system; receiving one or more subsequent indications that the event was generated at the first node of the clustered computing system; determining that information from the initial indication is identical to information from said one or more subsequent indications; in response to determining that the information from the initial indication is identical to the information from said one or more subsequent indications, coalescing the information from the initial indication with the information from said one or more subsequent indications into a coalesced event notification; and propagating the coalesced event notification to a receiving node of the clustered computing system.

Claim 3

Dependent Claim 16 words

The method of claim 1 , wherein said clustered computing system comprises a database management system.

Claim 4

Dependent Claim 34 words

A computer-readable storage medium carrying one or more sequences of instructions, which when executed by one or more processors, causes the one or more processors to perform the method recited in claim 2 .

Claim 5

Dependent Claim 17 words

The computing environment of claim 1 , wherein said clustered computing system comprises a shared-disk database system.

Claim 6

Dependent Claim 34 words

A computer-readable storage medium carrying one or more sequences of instructions, which when executed by one or more processors, causes the one or more processors to perform the method recited in claim 4 .

Claim 7

Dependent Claim 19 words

The computing environment of claim 1 , wherein said clustered computing system comprises a shared-cache parallel database management system.

Claim 8

Dependent Claim 34 words

A computer-readable storage medium carrying one or more sequences of instructions, which when executed by one or more processors, causes the one or more processors to perform the method recited in claim 6 .

Claim 9

Dependent Claim 18 words

The computing environment of claim 1 , wherein said clustered computing system comprises a shared-nothing database management system.

Claim 10

Dependent Claim 34 words

A computer-readable storage medium carrying one or more sequences of instructions, which when executed by one or more processors, causes the one or more processors to perform the method recited in claim 8 .

Claim 11

Dependent Claim 18 words

The computing environment of claim 1 , wherein said clustered computing system comprises a distributed database management system.

Claim 12

Dependent Claim 34 words

A computer-readable storage medium carrying one or more sequences of instructions, which when executed by one or more processors, causes the one or more processors to perform the method recited in claim 10 .

Claim 13

Dependent Claim 34 words

A computer-readable storage medium carrying one or more sequences of instructions, which when executed by one or more processors, causes the one or more processors to perform the method recited in claim 1 .

Claim 14

Dependent Claim 54 words

A computer apparatus comprising: a processor; and a memory coupled to the processor, the memory containing one or more sequences of instructions for communicating data in a clustered computing environment, wherein execution of the one or more sequences of instructions by the processor causes the processor to perform the method of claim 1 .

Claim 15

Dependent Claim 55 words

The method of claim 1 , wherein the step of propagating comprises: appending, onto an existing message, the coalesced event notification that includes information that describes a single instance of said event; wherein the message is destined to be propagated to the receiving node, wherein the receiving node is not a node sending the message.

Claim 16

Dependent Claim 27 words

The method of claim 14 , where the step of appending includes piggybacking the coalesced event notification on a message that is otherwise unrelated to the event.

Claim 17

Dependent Claim 34 words

A computer-readable storage medium carrying one or more sequences of instructions, which when executed by one or more processors, causes the one or more processors to perform the method recited in claim 15 .

Claim 18

Dependent Claim 35 words

The method of claim 14 , wherein the method further comprises: setting an identifier indicating that the information describing an identical event is to be appended onto a message and propagated to a particular node.

Claim 19

Dependent Claim 38 words

The method of claim 14 , wherein the message has a fixed size, and the method further comprises: appending additional information that describes additional events onto existing message traffic until free space in the fixed-size message is filled.

Claim 20

Dependent Claim 34 words

A computer-readable storage medium carrying one or more sequences of instructions, which when executed by one or more processors, causes the one or more processors to perform the method recited in claim 18 .

Claim 21

Dependent Claim 21 words

The method of claim 14 , wherein the method further comprises: placing the information describing an identical event in a queue.

Claim 22

Dependent Claim 38 words

The method of claim 20 , wherein the queue includes at least a priority queuing mechanism in order to determine a priority for events such that high priority events would supercede a low priority event in the queue.

Claim 23

Dependent Claim 34 words

A computer-readable storage medium carrying one or more sequences of instructions, which when executed by one or more processors, causes the one or more processors to perform the method recited in claim 21 .

Claim 24

Dependent Claim 24 words

The method of claim 14 , wherein an in-memory hash index is used to determine if an event exists in a shared-memory event buffer.

Claim 25

Dependent Claim 15 words

The method of claim 23 , wherein the shared-memory event buffer has a fixed size.

Claim 26

Dependent Claim 34 words

A computer-readable storage medium carrying one or more sequences of instructions, which when executed by one or more processors, causes the one or more processors to perform the method recited in claim 24 .

Claim 27

Dependent Claim 49 words

The method of claim 14 , wherein the method further comprises: partitioning a shared-memory event buffer; generating an event buffer entry of the shared memory event buffer; placing an event identifier into the event buffer entry; and inserting the information describing an identical event into the event buffer entry.

Claim 28

Dependent Claim 62 words

The method of claim 26 , the method further comprising: if between a fastest head pointer and a tail pointer there does not exist a buffer entry in the shared memory event buffer for an identical event, generating a new event buffer entry, and wherein the inserting further comprises inserting the information describing said identical event into the new event buffer entry.

Claim 29

Dependent Claim 34 words

A computer-readable storage medium carrying one or more sequences of instructions, which when executed by one or more processors, causes the one or more processors to perform the method recited in claim 27 .

Claim 30

Dependent Claim 48 words

The method of claim 26 , wherein the inserting comprises: if between a fastest head pointer and a tail pointer there exists a buffer entry in the shared memory event buffer for the identical event, updating the buffer entry so that the buffer entry represents the subsequent occurrence.

Claim 31

Dependent Claim 34 words

A computer-readable storage medium carrying one or more sequences of instructions, which when executed by one or more processors, causes the one or more processors to perform the method recited in claim 29 .

Claim 32

Dependent Claim 33 words

The method of claim 26 , further comprising using a round robin method and the shared memory event buffer to determine to which existing message to append the information describing an identical event.

Claim 33

Dependent Claim 34 words

A computer-readable storage medium carrying one or more sequences of instructions, which when executed by one or more processors, causes the one or more processors to perform the method recited in claim 31 .

Claim 34

Dependent Claim 22 words

The method of claim 14 , wherein the method further comprises the step of: maintaining information that describes a plurality of events.

Claim 35

Dependent Claim 27 words

The method of claim 33 , wherein the method further comprises the step of: maintaining information that describes the plurality of events in a shared-memory event buffer.

Claim 36

Independent Claim 159 words

A method for communicating data in a clustered computing system, the method comprising: receiving an indication that an event was generated at a first node of the clustered computing system; receiving one or more subsequent indications that the event was generated at the first node of the clustered computing system; determining that information from said indication is identical to information from said one or more subsequent indications; in response to determining that the information from the initial indication is identical to the information from said one or more subsequent indications, coalescing the information from the initial indication with the information from said one or more subsequent indications into a coalesced event notification; appending onto an existing message the coalesced event notification that describes a single instance of said event, wherein the message was destined to be propagated to a receiving node that is not a node sending the message; and propagating the coalesced event notification to the receiving node.

Claim 37

Independent Claim 159 words

A method for communicating data in a clustered computing system, the method comprising: receiving an indication that an event was generated at a first node of the clustered computing system; receiving one or more subsequent indications that the event was generated at the first node of the clustered computing system; determining that information from said indication is identical to information from said one or more subsequent indications; in response to determining that the information from the initial indication is identical to the information from said one or more subsequent indications, coalescing the information from the initial indication with the information from said one or more subsequent indications into a coalesced event notification; appending onto an existing message the coalesced event notification that describes a single instance of said event, wherein the message was destined to be propagated to a receiving node that is not a node sending the message; and propagating the coalesced event notification to the receiving node.

Claim 38

Dependent Claim 34 words

A computer-readable storage medium carrying one or more sequences of instructions, which when executed by one or more processors, causes the one or more processors to perform the method recited in claim 35 .

Annuity Stage	Window Opens	Payment Deadline	Surcharge Period Until	Estimated Fee	Status
3.5 Years (Year 4)	2013-01-11	2013-07-13	2014-01-12	$2000.00	Window Closed / Lapsed
7.5 Years (Year 8)	2017-01-11	2017-07-13	2018-01-12	$3760.00	Window Closed / Lapsed
11.5 Years (Year 12)	2021-01-11	2021-07-13	2022-01-12	$7700.00	Window Closed / Lapsed

Efficient event notification in clustered computing environments

Abstract

Inventors

Bibliographic Details

Claims Analysis

References Cited (Backward Citations)

USPTO Annuity & Maintenance Windows

Assigned Categories & Tags

Assign Category Tag