Sap Se

Sap Ag

Thilo-Alexander Ginkel

Boris Klinker

Matthias Miltz

Soeren Balko

Sören Balko

Reiner Hille-Doering

Joachim Lindenberg

Methods and apparatus, including computer program products, are provided for transporting processes within a distributed computing system, such as a cluster. In one aspect, the computer-implemented method may receive an event at a first node. The event may correspond to a process instance for handling the received event. The process instance may be transported from a second node to the first node. The process instance may be transported from a persistence when the process instance is inactive and, when the process instance is active, the process instance may be persisted to enable transport to the first node. Related apparatus, systems, methods, and articles are also described.

Cluster-based business process management through eager displacement and on-demand recovery

Methods and apparatus, including computer program products, are provided for distributed process execution. In one aspect, the computer-implemented method may provide an indication announcing that a structural change to the cluster will occur. The indication may enable at least one node of the cluster to respond with an existing view. The existing view may include a first set of authoritative data representing existing processes handled at the at least one node. The method may also include providing, to at least one of the nodes, an index representing a subsequent view of the cluster after the structural change. The subsequent view may include a second set of authoritative data representing processes handled at the at least one node after the structural change. The method may also activate the subsequent view of the cluster. Related apparatus, systems, methods, and articles are also described.

Failover mechanism for distributed process execution

A system, method and computer program product is presented for versioning a business process model. The business process model is decomposed into a number of artifacts. A hierarchical dependency graph is generated for the number of artifacts to produce, for each artifact, a set of referencing artifacts and a set of referenced artifacts. The set of referenced artifacts are compiled by creating a runtime format and computing a unique version identifier for each referenced artifacts, and the unique version identifier for each referenced artifact is incorporated into a version identifier of each associated referencing artifact from the set of referencing artifacts. At least one of the referenced artifacts is modified to produce a new version of the associated referencing artifact.

Stable linking and patchability of business processes through hierarchical versioning

Growing community of inventors

Heidelberg, Germany

Thilo-Alexander Ginkel