HIGH-LOAD BUSINESS PROCESS SCALABILITY

• US 20150066571A1
• Filed: 08/30/2013
• Published: 03/05/2015
• Est. Priority Date: 08/30/2013
• Status: Active Grant

• Current Assignee: SAP SE
• Original Assignee: SAP SE
• Inventors: Balko, Soeren
• Granted Patent: US 9,741,040 B2
• Time in Patent Office: Days
• US Class Current: 705/7.26
• CPC Class Codes: G06Q 30/00 Commerce

Abstract

The present disclosure involves systems, software, and computer implemented methods for providing high-load business process scalability in cloud-based infrastructures. One process includes operations for receiving a message at a first computer node executing a first business process instance. A second business process instance associated with the message is identified. The message is sent to a messaging queue for retrieval by the second business process instance if the second business process instance is not located at the first computer node.

Claims

1-20. -20. (canceled)

21. A computer-implemented method, comprising:

initiating a polling request from a computer node to a messaging queue;

identifying a message in the messaging queue for retrieval based on the polling request;

retrieving and dequeueing the message from the messaging queue; and

processing, by operation of a computer, the message using a process instance associated with the message.

22. The method of claim 21, wherein the polling request comprises periodic requests to the messaging queue to determine whether an incoming message assigned for processing by the computer node has been received.

23. The method of claim 22, wherein the periodic requests are sent to the messaging queue at a particular interval between the periodic requests.

24. The method of claim 23, wherein the particular interval is operable to be adjusted based on a context associated with the process instance.

25. The method of claim 23, wherein an immediate polling request is sent to the messaging queue if a notification is received indicating availability of the message in the messaging queue, wherein the immediate polling request is sent before a subsequent periodic request is to be sent at the particular interval.

26. The method of claim 21, further comprising obtaining a lock on a shared state variable associated with the process instance before retrieving the message from the messaging queue.

27. The method of claim 26, wherein obtaining the lock on the shared state variable comprises preventing other components or process instances other than the process instance associated with the message from accessing the shared state variable.

28. A computer-accessible, non-transitory, storage medium encoded with computer-readable instructions configured to cause one or more data processing apparatus to:

initiate a polling request from a computer node to a messaging queue;

identify a message in the messaging queue for retrieval based on the polling request;

retrieve and dequeue the message from the messaging queue; and

process the message using a process instance associated with the message.

29. The medium of claim 28, wherein the polling request comprises periodic requests to the messaging queue to determine whether an incoming message assigned for processing by the computer node has been received.

30. The medium of claim 29, wherein the periodic requests are sent to the messaging queue at a particular interval between the periodic requests.

31. The medium of claim 30, wherein the particular interval is operable to be adjusted based on a context associated with the process instance.

32. The medium of claim 30, wherein an immediate polling request is sent to the messaging queue if a notification is received indicating availability of the message in the messaging queue, wherein the immediate polling request is sent before a subsequent periodic request is to be sent at the particular interval.

33. The medium of claim 28, further configured to obtain a lock on a shared state variable associated with the process instance before retrieving the message from the messaging queue.

34. The medium of claim 33, wherein obtaining the lock on the shared state variable comprises preventing other components or process instances other than the process instance associated with the message from accessing the shared state variable.

35. A computer-implemented system, comprising:

memory operable to store a messaging queue; and

at least one hardware processor interoperably coupled to the memory and operable to;

initiate a polling request from a computer node to the messaging queue;

identify a message in the messaging queue for retrieval based on the polling request;

retrieve and dequeue the message from the messaging queue; and

process the message using a process instance associated with the message.

36. The system of claim 35, wherein the polling request comprises periodic requests to the messaging queue to determine whether an incoming message assigned for processing by the computer node has been received.

37. The system of claim 36, wherein the periodic requests are sent to the messaging queue at a particular interval between the periodic requests.

38. The system of claim 37, wherein the particular interval is operable to be adjusted based on a context associated with the process instance.

39. The system of claim 37, wherein an immediate polling request is sent to the messaging queue if a notification is received indicating availability of the message in the messaging queue, wherein the immediate polling request is sent before a subsequent periodic request is to be sent at the particular interval.

40. The system of claim 35, further operable to obtain a lock on a shared state variable associated with the process instance before retrieving the message from the messaging queue, wherein obtaining the lock on the shared state variable comprises preventing other components or process instances other than the process instance associated with the message from accessing the shared state variable.