Abstract: A method for maintaining fault tolerance in a storage cluster is provided. Embodiments include receiving, by a management component associated with a distributed data store on a cluster of host machines, a request to place a first host machine of the cluster of host machines in a maintenance mode, wherein the first host machine stores given data of the distributed data store. Embodiments include determining whether a second host machine that does not currently store any data of the distributed data store exists in the cluster of host machines. Embodiments include determining, based on whether the second host machine exists in the cluster of host machines, whether to transfer the given data of the distributed data store from the first host machine to the second host machine. Embodiments include initiating the maintenance mode on the first host machine.

Abstract: The present disclosure relates to querying data cores for data items that correspond to a specified time range. Probabilistic data structures corresponding to associated data cores are used to filter the plurality of data cores to identify a subset of data cores that contain data items corresponding to the specified time range. Only the subset of the plurality of data cores determined to contain relevant data items are searched.

Abstract: The present disclosure relates to health measurement and remediation of distributed systems upgrades. One method includes communicating a request for a health status to a cluster store provided by a cluster of hosts of a software-defined datacenter, wherein the cluster store includes a plurality of process instances undergoing a rolling upgrade, receiving a health status indication in response to the request, the health status indication determined based on a determination of whether the cluster store is available and a determination of whether the cluster store is operational, and taking a remediation action in response to the health status indication exceeding a threshold.

Abstract: The present disclosure relates to using maintenance mode to upgrade a distributed system. One method includes determining that a first host of a cluster of a software-defined datacenter (SDDC) is to be upgraded as a part of a rolling upgrade of the hosts of the cluster, wherein the first host is executing a process instance of a cluster store, demoting the process instance to a proxy, creating a replica of the process instance using a different proxy on a second host of the cluster, instructing the first host to enter a maintenance mode, upgrading the first host, and instructing the first host to leave the maintenance mode.

Abstract: The present disclosure relates to using maintenance mode to upgrade a distributed system. One method includes determining that a first host of a cluster of a software-defined datacenter (SDDC) is to be upgraded as a part of a rolling upgrade of the hosts of the cluster, wherein the first host is executing a process instance of a cluster store, demoting the process instance to a proxy, creating a replica of the process instance using a different proxy on a second host of the cluster, instructing the first host to enter a maintenance mode, upgrading the first host, and instructing the first host to leave the maintenance mode.

Abstract: The present disclosure relates generally to techniques for processing asynchronous queries across multiple data cores including secondary data cores stored in the secondary storage system in a distributed computing system. Secondary data cores are recovered in the data plane from secondary storage in order to be accessible for searching. Using this technique, asynchronous queries are run in parallel allowing the client to dynamically manage the queries and receive notifications when results are available.

Abstract: The present disclosure relates generally to techniques for processing asynchronous queries across multiple data cores including secondary data cores stored in the secondary storage system in a distributed computing system. Secondary data cores are recovered in the data plane from secondary storage in order to be accessible for searching. Using this technique, asynchronous queries are run in parallel allowing the client to dynamically manage the queries and receive notifications when results are available.

Abstract: The present disclosure relates to querying data cores for data items that correspond to a specified time range. Probabilistic data structures corresponding to associated data cores are used to filter the plurality of data cores to identify a subset of data cores that contain data items corresponding to the specified time range. Only the subset of the plurality of data cores determined to contain relevant data items are searched.

Abstract: The present disclosure relates to querying data cores for data items that correspond to a specified time range. Probabilistic data structures corresponding to associated data cores are used to filter the plurality of data cores to identify a subset of data cores that contain data items corresponding to the specified time range. Only the subset of the plurality of data cores determined to contain relevant data items are searched.

Abstract: The present disclosure relates generally to techniques for processing asynchronous queries across multiple data cores including secondary data cores stored in the secondary storage system in a distributed computing system. Secondary data cores are recovered in the data plane from secondary storage in order to be accessible for searching. Using this technique, asynchronous queries are run in parallel allowing the client to dynamically manage the queries and receive notifications when results are available.

Abstract: The present disclosure relates to querying data cores for data items that correspond to a specified time range. Probabilistic data structures corresponding to associated data cores are used to filter the plurality of data cores to identify a subset of data cores that contain data items corresponding to the specified time range. Only the subset of the plurality of data cores determined to contain relevant data items are searched.

Abstract: Exemplary embodiments provide systems and methods for connecting services, including web services, using intermediate data exchange objects to create composition services. Data exchange objects may be service independent objects that represent the inputs and/or outputs of various services. The systems and methods may employ data exchange objects to determine whether two services are composable and to implement and execute composite services according to the data exchange objects.

Abstract: The subject embodiments provide a method such as a web service method. The method is used to execute two or more web services that have respective web user interfaces, and are operationally independent of each other. The method comprises: (i) executing the two or more web services under manual operation of a user; (ii) recording a script based on activities of the user in the execution; (iii) securing the recorded script; and (iv) executing the two or more web services by playing said secured script without individually executing them. The method is user friendly; highly customizable; and safe with respect to document retrieval and submission.

Abstract: A method of implementing a business process may include receiving business process information associated with a business process. The business process information may include a graph representing one or more activities to be performed to complete the business process. The method may include identifying, by a computing device, a number of groups associated with the business process information. Each group may be capable of performing at least a portion of the activities. The method may include partitioning, by the computing device, the graph into a number of fragments that is greater than or equal to the number of identified groups. Each fragment may include one or more activities from the graph. The method may include, for each fragment, transmitting the fragment to an identified group that is capable of performing each activity associated with the fragment, and orchestrating the performance of the activities associated with each fragment by each group.

Abstract: Exemplary embodiments provide systems and methods for connecting services, including web services, using intermediate data exchange objects to create composition services. Data exchange objects may be service independent objects that represent the inputs and/or outputs of various services. The systems and methods may employ data exchange objects to determine whether two services are composable and to implement and execute composite services according to the data exchange objects.

Abstract: A service workflow including ordered services is received, and a heuristic utility value is calculated for each service. A best node having a smallest heuristic utility value for a service is selected, and a best node identifier is placed in a node list. If the best node includes a parallel sub-workflow, potential next nodes are identified by generating potential next nodes from a data center that can perform a service associated with the best node with a minimum run-time value. Otherwise, potential next nodes are generated based on a data center associated with the service. A heuristic utility value is determined for each potential next node, and a new best node is selected based on the heuristic utility values. The identifying, determining, and selecting operations are repeated until the best node contains only the last ordered service. Data centers for each ordered service are identified based on the best node.

Abstract: A service workflow including ordered services is received, and a heuristic utility value is calculated for each service. A best node having a smallest heuristic utility value for a service is selected, and a best node identifier is placed in a node list. If the best node includes a parallel sub-workflow, potential next nodes are identified by generating potential next nodes from a data center that can perform a service associated with the best node with a minimum run-time value. Otherwise, potential next nodes are generated based on a data center associated with the service. A heuristic utility value is determined for each potential next node, and a new best node is selected based on the heuristic utility values. The identifying, determining, and selecting operations are repeated until the best node contains only the last ordered service. Data centers for each ordered service are identified based on the best node.

Abstract: The subject embodiments provide a method such as a web service method. The method is used to execute two or more web services that have respective web user interfaces, and are operationally independent of each other. The method comprises: (i) executing the two or more web services under manual operation of a user; (ii) recording a script based on activities of the user in the execution; (iii) securing the recorded script; and (iv) executing the two or more web services by playing said secured script without individually executing them. The method is user friendly; highly customizable; and safe with respect to document retrieval and submission.