Abstract: A distributed computing system is described that leverages a nearline storage layer to minimize the downtime required for bootstrapping a new computing cluster in the distributed computing system. The system executes a computing cluster comprising a set of computing nodes and determines a set of one or more data segments to be written to a nearline storage system. The system writes the data segments to the nearline storage system. In certain examples, the system receives a request to create a second computing cluster and responsive to the request, bootstraps the second computing cluster using the set of data segments stored on the nearline storage system. The system additionally leverages the nearline storage layer to accelerate query processing by the computing nodes of a computing cluster.

Abstract: In accordance with an embodiment, described herein is a system and method for loading and transforming data to a cloud database, using a hybrid set-based extract, load, transform approach. During the loading and transforming of large amounts of data, from one or more data sources, a data synchronization application sends small batches of data, in parallel streams, to the database, which operates as a transformation engine to load the data. Each stream can be associated with a separate staging table in the database. For each staging table, the subset of data therein is transformed and loaded, before the next subset is processed. A transform and merge process operating at the database can then be used to transform and merge the data, from each of the staging tables, to the target table.

Abstract: Techniques for processing top-K queries are provided. In one technique, a database statement is received that requests top-K results related to a database object and that indicates two columns thereof: a first column by which to partition a result set and a second column by which to order the result set. A buffer is generated. For each of multiple rows in the database object: a first key value that associated with a first value in the first column of said each row is identified; a second key value that associated with a second value in the second column of said each entry is identified; a slot in the buffer is identified based on the first key value and the second key value; and the slot in the buffer may be updated based on the second key value. A response to the database statement is generated based on the buffer.

Abstract: A type restriction contextually modifies an existing type descriptor. The type restriction is imposed on a data structure to restrict the values that are assumable by the data structure. The type restriction does not cancel or otherwise override the effect of the existing type descriptor on the data structure. Rather the type restriction may declare that a value of the data structure's type is forbidden for the data structure. Additionally or alternatively, the type restriction may declare that an element count allowable for a data structure's type is forbidden for the data structure. Type restriction allows optionality (where only a singleton value for a data structure is allowed), empty sets (where no value for a data structure is allowed), and multiplicity (where only a limited element count for a data structure) to be injected into a code set independent of data type. Type restriction allows certain optimizations to be performed.

Abstract: The present invention relates to machine learning (ML) explainability (MLX). Herein are local explanation techniques for black box ML models based on coalitions of features in a dataset. In an embodiment, a computer receives a request to generate a local explanation of which coalitions of features caused an anomaly detector to detect an anomaly. During unsupervised generation of a new coalition, a first feature is randomly selected from features in a dataset. Which additional features in the dataset can join the coalition, because they have mutual information with the first feature that exceeds a threshold, is detected. For each feature that is not in the coalition, values of the feature are permuted in imperfect copies of original tuples in the dataset. An average anomaly score of the imperfect copies is measured. Based on the average anomaly score of the imperfect copies, a local explanation is generated that references (e.g. defines) the coalition.

Abstract: Techniques are disclosed for applying a trained machine learning model to incoming voice communications to determine whether the voice communications are genuine or not genuine. The trained machine learning model may identify vocal attributes within the target call and use the identified attributes, and the training, determine whether the target call is genuine or not genuine. An applied trained machine learning model may include multiple different types of trained machine learning models, where each of different types of machine learning models is trained and/or configured for a different function within the analysis.

Abstract: For a communication channel having a first endpoint in a customer on-premise network and a second endpoint on a primary host machine in a cloud service provider infrastructure, the primary host machine determines a change in a state information of the communication channel and identifies a backup host machine for the communication channel. The primary host machine causes the change in the state information to be replicated to the backup host machine, wherein the replicated state information stored by the backup host machine is usable by the backup host machine after a failover causes the backup host machine to become the second endpoint of the communication channel.

Abstract: Systems, methods, and other embodiments for sorting-based assignment to optimize order fulfillment with short supply. One embodiment includes identifying a set of one or more distributions within a series of days. Sorting all demands of a first priority level occurring in the series of days by ascending order of size of the demand. For each demand of the first priority level in sorted order, (a) selecting an initial distribution during which the demand is scheduled to be fulfilled from the set of distributions, and (b) generating an indication that the demand can cannot be completely fulfilled, based on the size of the demand and the amount of supply available. Automatically arranging a graphical representation of a schedule of supplies and met and unmet demands for the series of days in a graphical user interface based at least on the indications generated for each demand.

Abstract: In accordance with an embodiment, described herein are systems and methods for use with an analytic applications environment, for determination of recommendations and alerts in such environments. A data pipeline or process can operate in accordance with an analytic applications schema adapted to address particular analytics use cases or best practices, to receive data from a customer's (tenant's) enterprise software application or data environment, for loading into a data warehouse instance. When provided as part of a software-as-a-service (SaaS) or cloud environment, the data sourced from a plurality of organizations can be aggregated, to leverage information gleaned from the collective or shared data. The system can be used to generate semantic alerts, including obtaining permission from; and analyzing the collective data of; the plurality of organizations, to determine operational advantages indicated by the data, and providing alerts associated with those operational advantages.

Abstract: A data catalog system is disclosed that provides capabilities for uniquely identifying and retrieving data entities stored in diverse data sources managed by an organization. The data catalog system includes capabilities for generating a unique external identifier for a data entity (e.g., a data asset or a data object) by identifying a set of immutable configuration parameters associated with the data asset and identifying a set of data object attributes that uniquely identify data objects within the data asset. The generated unique external identifiers are stored as part of the metadata harvested by the data catalog system. The external identifiers are used to enforce a single representation of the data assets and the data objects in the data catalog system. The external object identifiers are used to perform data lookups and reconcile states of data entities during the metadata harvesting process.

Abstract: Systems and methods for implementing extensible attributes in ETL are disclosed. In some examples, attributes configured at a source file may be extracted from the source file. The extracted attributes can be mapped to a target column of a data warehouse table, and then a dynamic ETL script may be generated. The dynamic script may be executed to move data associated with the attributes to an appropriate new column of the data warehouse.

Abstract: The present embodiments relate to implementing change data on no-master NoSQL data stores. An optimized node can be identified from a plurality of NoSQL data storage nodes and a specialized node can be connected (e.g., collocated) to the optimized node. The specialized node can maintain change data capture (CDC) data provided by client nodes in a hash map that can be used as a point of truth for coordinating CDC data across the plurality of NoSQL data storage nodes. The plurality of NoSQL data storage nodes can identify and coordinate all read/write data obtained from multiple client devices in a geographically separated large-scale (e.g., planet scale) system to identify change data in a distributed data store. The specialized data can provide read data to devices in the large-scale system to reconcile inconsistencies in change data across nodes in the large-scale system.

Abstract: Systems and methods for using queue pair 1 (QP1) for receiving multicast based announcements in multiple partitions in a high performance computing. In accordance with an embodiment, by extending the scope of QP1 to also include receiving and sending multicast packets in any partition defined for the port, it is possible to implement generic MC based announcement and discovery without requiring the complexity of unique QPs for individual partitions, nor any update of QP configuration as a consequence of change of partition membership.

Abstract: Systems and methods for reducing latency of probing operations of remotely located linear hash tables are described herein. In an embodiment, a system receives a request to perform a probing operation on a remotely located linear hash table based on a key value. Prior to performing the probing operation, the system dynamically predicts a number of slots for a single read of the linear hash table to minimize total cost for an average probing operation. The system determines a hash value based on the key value and determines a slot of the linear hash table to which the hash value corresponds. After predicting the number of slots, the system issues an RDMA request to perform a read of the predicted number of slots from the linear hash table starting at the slot to which the hash value corresponds.

Abstract: Aspects of the present disclosure are directed to extracting textual information from image documents. In one embodiment, a system, upon receiving a request to extract textual information from an image document, a digital processing system performs character recognition based on content of the image document using multiple approaches to generate corresponding texts. The texts are then combined to determine a result text representing the textual information contained in the image document. The result is then provided as a response to the request.

Abstract: Systems, devices, and methods of the present invention involve discourse trees. In some aspects, a system creates a discourse tree by identifying elementary discourse units in text. The discourse tree includes nodes, each nonterminal node representing a rhetorical relationship between two elementary discourse units and each terminal node associated with an elementary discourse unit. The system identifies, in a reference sentence of the discourse tree, a rhetorical relation of type elaboration or joint. The system selects a candidate sentence having a highest syntactic generalization score of a set of syntactic generalization scores. The system identifies a semantic relation corresponding to the candidate sentence. The semantic relation corresponds to a word in the candidate sentence and defines a role in the candidate sentence.

Abstract: The present disclosure relates to a system and techniques for preventing corruption of snapshot data by limiting the visibility of committed data. To do this, the system may maintain an index that indicates the highest transaction identifier value such that no future commits will have a transaction identifier less than or equal to the indexed transaction identifier value. In embodiments, if a read is performed, only transactions having a transaction identifier less than or equal to the index value can be read. Each time that a transaction is committed, the index value is updated to the transaction identifier for the transaction having the highest transaction identifier without any intermediary transactions.

Abstract: Techniques for implementing user interfaces, systems, and processes for multidimensional clustering and analysis are described herein. In one aspect, an application or cloud service receives a request to cluster a set of records where the request identifies a first set of one or more dimensions to use for clustering and a second set of one or more dimensions to analyze for correlation patterns. Responsive to receiving the request to cluster the set of records, the system generates clusters based at least in part on variances in the first set of one or more dimensions, wherein each cluster includes at least one record from the set of records. The system may generate, for each respective cluster, an analytic result that identifies how strongly the second set of one or more dimensions correlate to the respective cluster. The system may present the clusters and analytic results for further processing.

Abstract: Techniques for enhancing actionable opportunities through machine learning are disclosed. In some embodiments, a system includes an event listener for detecting an opportunity to perform an action using one or more computing resources. When a new opportunity is detected, the system generates a set of search criteria, which is used to search a set of external web resources for current events. The system may then generate, using a machine learning model as a function of one or more features extracted from current events satisfying the search criteria, a score representing a likelihood of success that the action leads to an optimal result. The system may tune the machine learning model based on feedback received that is indicative of how the current events affected the likelihood of success for the action.

Abstract: Techniques are provided for block-level fail atomicity on byte-level non-volatile media. In one technique, an offset table and application data that stores content of a file are stored for a file. The offset table includes multiple entries, each entry being associated with a different offset value and storing a logical block address (LBA) that references a location in the application data. In response to receiving a request, that includes an input buffer and an offset value, to update the file: (a) an entry, in the offset table, that corresponds to the offset value and comprises a first LBA is identified; (b) a second LBA that is considered free is identified; (c) the second LBA is replaced with the first LBA; (d) the input buffer is written to a location, in the application data, that the second LBA references; and (e) the second LBA is added in the entry.

Abstract: Techniques are described herein for managing transactions between data consumers and data providers using a blockchain. In some embodiments, a blockchain network receive smart contracts that govern access rights to data sets provided by blockchain members and smart contracts that execute blockchain transactions based on the usage of data sets. When a data set is provided to a blockchain member through the blockchain network, usage of the data set may be tracked. Responsive to detecting usage of the data set, one or more smart contracts may execute one or more blockchain transactions within the blockchain network.

Abstract: Techniques for recommending runbook operations during a runbook generation process are disclosed. A system recommends operations for including in the runbook based on attributes of a detected event. The system presents event attributes associated with the detected event to a user in a runbook generation interface. When the user selects an event attribute, the system presents a set of candidate runbook operations associated with the event attribute. Based on user selections of runbook operations to include in a runbook, the system generates and stores a template of the runbook in which the attribute values associated with the detected event are omitted. Upon execution of the runbook at a future time, the system, or a user, may populate the event attributes in the runbook with values that correspond to the future event of the same event type.

Abstract: A computer system may receive one or more requests for access to one or more cloud services and may store the one or more requests in a request log. The computer system may receive one or more access rules applicable to cloud service access rights. The computer system may aggregate the one or more requests of the request log to determine access requirements for a container, the container being configured to store one or more applications. The computer system may generate and store container access policies that define access of a container and the one or more cloud services, the container access policies based at least in part on the aggregated one or more requests and the one or more access rules. The computer system may send the container access policies to a request forwarder of a compute instance in a production environment.

Abstract: Systems and methods for cloud security monitoring and threat intelligence in accordance with embodiments of the invention are disclosed. In one embodiment, a process for monitoring and remediation of security threats includes generating a threat model using a first portion of activity data, identifying, based upon the threat model, a threat using a second portion of activity data, selecting a security policy to implement in response to the identified threat, identifying cloud security controls in a remotely hosted cloud application server system to modify in accordance with the selected security policy, establishing a secure connection to the remotely hosted cloud application server system using login credentials associated with a tenant account with the cloud application, and sending instructions to the remotely hosted cloud application server system to set the identified cloud security controls with respect to the tenant account in accordance with the selected security policy.

Abstract: Techniques for recommending runbook operations during a runbook generation process are disclosed. The system recommends operations for including in the runbook based on user activity. Generating operations of a runbook based on user activity generates a runbook that captures a user's behavior. The recommended operations may be different than any operations performed by the user. The recommended operations may be based in part on data sets accessed by the user frequently, periodically, or continuously.

Abstract: Techniques are described herein for routing queries to particular nodes of a multi-node database system based on the query. A database table is partitioned into a plurality of affinity groups. Each affinity group is assigned a particular node as the master node of the affinity group. A mapping is sent to a query router indicating the master node for each affinity group of the plurality of affinity groups. The query router determines, for a particular query, a target node to which to send the particular query based on the mapping and the particular query.

Abstract: A method for updating software in one or more servers in a managed system includes bootstrapping of shared secrets to secure communication, using an object store with publicly accessible URLs as a mailbox system between a patch agent locally at the managed system and a patch management server located remotely. The object store provides for indirect and asynchronous communication, allowing the patch management server to manage the updates, whereas the patch agent executes the updates. The patch management server keeps track of update results, and when an update is unsuccessful it performs and supports a remediation process. Both the patch agent and the patch management server keep full logs of the update results to allow for auditing.

Abstract: A computing device may receive a plurality of scanning requests with at least one scanning request in the plurality identifying a target address of a target network. The computing device may for at least a subset of the plurality of scanning requests: generate a scanner instance and a virtual network interface card (VNIC) in response to the scanning request. The scanner instance and the VNIC communicating with a routing namespace that can communicate with two or more scanner instances simultaneously. Until the target address has been scanned: one or more packets can be sent from the scanner instance to the target address via the routing namespace and VNIC. The one or more packets can be wrapped in one or more packet wrappers identifying the target address and the target network. In response to the target address being scanned, the scanner instance and VNIC can be decommissioned.

Abstract: An example system and method for selectively conveying content via User Interface (UI) display screen sections of Business Intelligence (BI) software and for facilitating user interaction therewith, e.g., so as to impart usefulness or preference ratings thereto, which can then affect subsequently displayed content. An example method includes providing one or more UI controls enabling a user to provide an input query and to interact with resulting content (i.e., query results, also called search results), where the user interaction with the content provides information (e.g., context information) indicative of a usefulness or preference rating pertaining to the content; thereby enabling modifications to subsequently retrieved content in accordance with the usefulness or preference rating(s). Such rating(s) may be aggregated from plural users of an associated software application.

Abstract: Techniques are disclosed for automatic scene detection and character extraction. In one example, audiovisual content with video frames, an audio recording, and timing information is received. A score, based on the frame's visual characteristics, is determined for a first frame and subsequent frames. The first frame's score and subsequent frame's scores are compared to determine if the difference between the scores is above a threshold. When the difference in scores is above a threshold, the subsequent frame is classified as a new scene. The audiovisual content is segmented into scenes and textual characters are identified in at least one frame from each scene. The characters are stored and indexed in a searchable database with the timing information for the scene where the characters were identified. The audio recording is transcribed and the transcribed words are stored and indexed in the searchable database with timing information.

Abstract: A method may include determining that a non-constant value of a variable corresponding to a variable node of the abstract syntax tree flows into an operator node in the abstract syntax tree. The method may further include adding, to the abstract syntax tree, a check taint node including functionality to: make a taint status determination that the non-constant value is tainted, and return the non-constant value to the operator node. The operator node generates a result value by executing an operator using the non-constant value. The method may further include adding, to the abstract syntax tree, a set taint node that stores, based on the taint status determination, the result value in a second tainted object, and performing, using the abstract syntax tree, a taint analysis of the source code to identify a vulnerability in the source code.

Abstract: Embodiments decrypt or partially decrypt an encoded message or a private key, the encoded message or private key encoded by a public-key cryptography algorithm. Embodiments encode the public-key cryptography algorithm using a language of a program synthesizer and construct a grammar for the program synthesizer. Embodiments train the program synthesizer with training data comprising input-output pairs and execute the trained program synthesizer to generate a mathematical formula. Embodiments validate the generated mathematical formula and then perform the decrypting using the trained and validated program synthesizer.

Abstract: Systems and methods for providing multicast group (MCG) membership relative to partition membership in a high performance computing environment. In allowing a subnet manager of a local subnet to be instructed that all ports that are members of the relevant partition should be set up as members for a specific multicast group, the SM can perform a more efficient multicast-routing process. It is also possible to limit the IB client interaction with subnet administration conventionally required to handle join and leave operations. Additionally, subnet manager overhead can be reduced by creating a spanning tree for the routing of multicast packets that includes each of the partition members added to the multicast group, instead of creating a spanning tree after each multicast group join request is received, as conventionally required.

Abstract: Techniques are disclosed for summarizing, diagnosing, and correcting the cause of anomalous behavior in computing systems. In some embodiments, a system identifies a plurality of time series that track different metrics over time for a set of one or more computing resources. The system detects a first set of anomalies in a first time series that tracks a first metric and assigns a different respective range of time to each anomaly. The system determines whether the respective range of time assigned to an anomaly overlaps with timestamps or ranges of time associated with anomalies from one or more other time series. The system generates at least one cluster that groups metrics based on how many anomalies have respective ranges of time and/or timestamps that overlap. The system may preform, based on the cluster, one or more automated actions for diagnosing or correcting a cause of anomalous behavior.

Abstract: Techniques are disclosed for efficient generation and maintenance of interface components in an infrastructure-as-a-service (IaaS) environment. A system may receive a request to display a dashboard of components. A declarative metadata set of components is generated and a multi-use agent to parse the declarative metadata set. The multi-use agent may be replicated according to the parsed declarative definition in order to create multiple instances of the multi-use agent corresponding to the one or more determined interface components. The multiple instances of the multi-use agent may then generate and maintain the interface components in real-time. Component generation may be distributed among systems to prevent excessive data transfers and wasteful communications.

Abstract: A method for optimized routing of service based interface (SBI) request messages to remote network function (NF) repository functions (NRFs) using indirect communications via a service communication proxy (SCP) includes, at an SCP including at least one processor, receiving an SBI request message. The method further includes forwarding the SBI request message to a remote NRF. The method further includes determining that the remote NRF is unable to process the SBI request message, and, in response to determining that the remote NRF is unable, identifying a georedundant mate of the remote NRF. The method further includes forwarding the SBI request message to the georedundant mate NRF of the remote NRF that is unable to process the SBI request message.

Abstract: Techniques for generating an interactive visualization tool for building nested queries are disclosed. The interactive nested query visualization tool allows a user to observe, analyze, and modify query characteristics and attributes of a set of nested queries. A system displays an interactive visual depiction of a set of nested queries. Visual representations of the nested queries are positioned relative to each other based on the relationships between the nested queries. The system displays, simultaneously with the set of nested queries, editable fields for a selected query. The system modifies a functionality of a user interface based on which of the nested queries is selected.

Abstract: Unsorted sparse dictionary encodings are transformed into unsorted-dense or sorted-dense dictionary encodings. Sparse domain codes have large gaps between codes that are adjacent in order. Unlike spare codes, dense codes have smaller gaps between adjacent codes; consecutive codes are dense codes that have no gaps between adjacent codes. The techniques described herein are relational approaches that may be used to generate sparse composite codes and sorted codes.

Abstract: A server system provided according to an aspect of the present disclosure provides a shared connection pool to parallel execution entities accessing database instances of a distributed database when processing requests. A shared connection pool implies that each pool connection of the connection pool may be used for serving different execution entities requiring access to different database instances. In an embodiment, the database instances correspond to shards together implementing a distributed database, and the parallel execution entities correspond to threads.

Abstract: Techniques for managing network-accessible infrastructure metadata are provided. A method includes receiving a resource request comprising resource metadata corresponding to a network-accessible infrastructure resource, determining whether to commit the resource request based at least in part on a constraint associated with the network-accessible infrastructure resource, and, in accordance with a determination to commit the resource request: generating, by the computer system, a resource identifier describing resource metadata in accordance with the resource request, storing, by the computer system, the resource metadata in a data store in communication with the computer system, receiving, by the computer system, a data request to provide the resource metadata described by the resource identifier, and providing, by the computer system, the resource metadata described by the resource identifier in accordance with the data request.

Abstract: In a computer embodiment, in a polyglot database management system (DBMS) that contains a guest language runtime environment, a database buffer is configured that the guest language runtime environment does not manage. In the polyglot DBMS, logic that is defined in a guest language is invoked to retrieve, into the database buffer, a value stored in a database in the polyglot DBMS. Compiling the logic causes semantic analyzing the logic to detect that usage of the retrieved value cannot occur after the retrieved value is overwritten in the database buffer. When detecting that such usage of the retrieved value cannot occur, the logic is executed without, after the retrieved value is overwritten in the database buffer, retaining a copy of the retrieved value in a memory region that the guest language runtime environment manages.

Abstract: Techniques for management of data storage in distributed storage systems are provided. A method may include receiving, by a computer system, a request to write data to a volume. The method may include identifying, by the computer system, a zone segment mapped to the volume. The zone segment may include a plurality of zones. The method may include identifying, by the computer system, a segment pointer indicating a write location in a zone of the zone segment. The method may include writing, by the computer system, the data to one or more zones of the plurality of zones of the zone segment, starting at the write location. The method may also include updating, by the computer system, the segment pointer according to a data endpoint of the data in the zone segment.

Abstract: Techniques to efficiently assign available workers to executing multiple graph queries concurrently on a distributed graph database are disclosed. The techniques comprise a runtime engine assigning multiple workers to executing portions of multiple graph queries, each worker in each assignment asynchronously executing a portion of a graph query within a parallel-while construct that includes return statements at different locations, and the runtime engine reassigning a worker to executing another portion of the same or a different graph query to optimize the overall performance of all workers.

Abstract: Service cells may be utilized to limit the blast radius and reduce the probability of operational incidents (e.g., attacks, load spikes, distributed thrash, and the like). Techniques discussed herein provide any suitable number of service cells, each if which include a management plane and a data plane. A work request that includes an intended state of the service cell can be received and stored. One or more execution tasks can be executed by a management plane of the service cell to bring the data plane to a state corresponding to the intended state. The management plane can monitor the actual state of the data plane with respect to the intended state (e.g., the state requested by a user). Over time, the management plane can make modifications to the service cell to ensure the resources of the data plane are ever in conformance with the intended state requested by the user.

Abstract: In one embodiment, a method for auditing the results of a machine learning model includes: retrieving a set of state estimates for original time series data values from a database under audit; reversing the state estimation computation for each of the state estimates to produce reconstituted time series data values for each of the state estimates; retrieving the original time series data values from the database under audit; comparing the original time series data values pairwise with the reconstituted time series data values to determine whether the original time series and reconstituted time series match; and generating a signal that the database under audit (i) has not been modified where the original time series and reconstituted time series match, and (ii) has been modified where the original time series and reconstituted time series do not match.

Abstract: A Bayesian test of demographic parity for learning to rank may be applied to determine ranking modifications. A fairness control system receiving a ranking of items may apply Bayes factors to determine a likelihood of bias for the ranking. These Bayes factors may include a factor for determining bias in each item and a factor for determining bias in the ranking of the items. An indicator of bias may be generated using the applied Bayes factors and the fairness control system may modify the ranking if the determines likelihood of bias satisfies modification criteria for the ranking.

Abstract: Disclosed is an improved approach to implement a mechanism to provide customer control over access to cloud infrastructure by the cloud provider's operator employees. This mechanism allow customer controlled access to any cloud infrastructure that belongs to or is otherwise allocated to the customer.

Abstract: Methods, systems, and computer readable media for ingress message rate limiting are disclosed. One method includes, at a network node, receiving a service request message from a service consumer network function and extracting, from the received service request message, an access token that includes a consumer network function instance identifier identifying the service consumer network function. The method further includes determining, using the consumer network function instance identifier, that an allowed ingress message rate associated with the service consumer network function has been reached or exceeded and in response to determining that the allowed ingress message rate associated with the service consumer network function has been reached or exceeded, performing a message rate limiting action.

Abstract: Techniques for implementing an orchestration service for data replication are provided. In one technique, a recipe is stored that comprises (1) a set of configuration parameters and (2) executable logic, for a data replication operation, that comprises multiple sub-steps. Each sub-step corresponds to one or more configuration parameters in the set of configuration parameters, which includes a first parameter that is associated with a default value and a second parameter that is not so associated. User input that specifies a value for the second parameter is received. The set of configuration parameters is updated to associate the value with the second parameter. The data replication operation is then initiated by processing the executable logic, which processing comprises, for each sub-step of one or more sub-steps, making an API call to a data replication service. In response to each API call, a response is received from the data replication service.

Abstract: A computer system including one or more processors and persistent, word-addressable memory implements a persistent atomic multi-word compare-and-swap operation. On entry, a list of persistent memory locations of words to be updated, respective expected current values contained the persistent memory locations and respective new values to write to the persistent memory locations are provided. The operation atomically performs the process of comparing the existing contents of the persistent memory locations to the respective current values and, should they match, updating the persistent memory locations with the new values and returning a successful status. Should any of the contents of the persistent memory locations not match a respective current value, the operation returns a failed status. The operation is performed such that the system can recover from any failure or interruption by restoring the list of persistent memory locations.