Abstract: The present disclosure relates to systems and methods for providing cloud-based services securely to on-premises networks or other infrastructure. More particularly, the present disclosure relates to systems and methods for enriching first-party data (e.g., data collected directly by an on-premises server) stored within on-premises networks by enabling the on-premises networks to retrieve and process third-party data stored on cloud-based networks. As a technical benefit, cloud-based services can be performed on the first-party data within the on-premises networks.

Abstract: Techniques are disclosed for improved autonomous agents that can provide a recommendation in a non-intrusive, conversational manner. In an aspect, a method determines a first sentiment score for a first utterance and a second sentiment score for a second utterance, each sentiment score indicating an emotion indicated by the respective utterance. The method further identifies that a difference between the first sentiment score and the second sentiment score is greater than a threshold. The method further extracts a noun phrase from the second utterance. The method identifies a text fragment that includes an entity that corresponds to the noun phrase. The method identifies that the text fragment addresses a claim of the second utterance. The method forms a third utterance that includes the a recommendation related to the second utterance and adds the third utterance to the sequence of utterances after the second utterance.

Abstract: The present disclosure relates to systems and methods for providing cloud-based services securely to on-premises networks or other infrastructure. More particularly, the present disclosure relates to systems and methods for enriching first-party data (e.g., data collected directly by an on-premises server) stored within on-premises networks by enabling the on-premises networks to retrieve and process third-party data stored on cloud-based networks. As a technical benefit, cloud-based services can be performed on the first-party data within the on-premises networks.

Abstract: Each object is associated with one root metadata record and one or more version-specific metadata records, each corresponding to a version of object data. A conditional command may be conditioned upon whether an object is stored in a storage system. Whether the condition is satisfied is determined based on whether a root metadata record of the object exists. If the condition is satisfied, then metadata is updated to reflect execution of the conditional command. A conditional command may be conditioned upon whether a data version identifier or a metadata version identifier equals a particular value. A conditional command execution engine retrieves the relevant version identifier from a version-specific metadata record, and performs a check on whether the condition is satisfied. If the condition is satisfied, the engine ensures that the version-specific record has not been modified during the check, and updates metadata to reflect execution of the conditional command.

Abstract: An event processing system for distributing a continuous query, and processing events in an event stream, is disclosed. The system can synchronize timestamps across all partitions by adding a heartbeat propagator component propagating a heartbeat signal for silent partitions. The system can further include a timestamp tracker component that tracks the maximum observed timestamp across all partitions for each batch, and sends this to each partition. The system can distribute partitions of the events to the worker nodes, and instruct a heartbeat propagator component to generate a heartbeat for a first worker node corresponding to an event in a different partition. The system receives outputs from the worker nodes and combines these into a single result corresponding to a continuous query. The system can further implement a timestamp tracker to select a highest timestamp value of a previous batch, and send the value to the worker nodes.

Abstract: A method, system, and computer program product for managing user identification codes in an internet advertising environment. One aspect implements a system including a database engine to store a plurality of signals comprising characteristics and/or values received from a user device. A user ID generator calculates collision statistics and/or fragmentation statistics to form a first mapping function that is in turn used to generate a plurality of identification codes based at least in part a first set of selected signals. A calibration module produces measurements determined from collision quantities and/or fragmentation quantities using the first mapping function, wherein the measurements are determined by comparing the plurality of identification codes to entries in a known ID database. A sequencing module generates updated sequences of mapping functions.

Abstract: Techniques for restricting plug-in application recipes (“PIARs”) are disclosed. A PIAR management application receives a PIAR restriction via an authenticated user of the PIAR management application. The PIAR restriction is applicable to certain users of the PIAR management application. The PIAR restriction identifies functionality of the PIAR management application that would otherwise be available to a user of the PIAR management application if the user had an active account for a particular plug-in application that, once linked to that user in the PIAR management application and associated with a particular PIAR, would be capable of supplying at least part of the functionality. The PIAR management application stores the PIAR restriction, including information to block the restricted functionality. Based on the PIAR restriction, the PIAR management application blocks the restricted functionality. Many different types of functionality may be restricted, in various ways.

Abstract: Systems and methods of reserving a specific queue pair number for proprietary management traffic in a subnet of a high performance computing environment. An exemplary embodiment can provide a host channel adapter (HCA), including a control circuit with a processor and a memory, and at least one port operative to connect the HCA to a network fabric. Additionally, the HCA can include a subnet management agent (SMA) that executes on the HCA, and a configurable attribute stored in the memory of the HCA. A communication including a number value, can be received by the subnet management agent from a subnet manager of the subnet. The value of the configurable attribute can be set equal to the value of the received number. A QP number that corresponds to the set number value of the configurable attribute can then be reserved for sending and receiving proprietary network management traffic.

Abstract: Techniques are described for binding secondary services with a cloud service instance. In one or more embodiments, a service definition defines a set of secondary services that are compatible with a primary service. In response to receiving a request to perform a provisioning operation for the instance of the primary service, a provisioning engine identifies, from the set of secondary services that are compatible with the primary service, a subset of one or more secondary services that are available. The provisioning engine binds the subset of one or more secondary services to the primary service to generate a deployment configuration for the instance of the primary service. Based on the deployment configuration, the provisioning engine provisions a set of components for the instance of the primary service.

Abstract: Techniques for component-based software engineering, and more particularly, to techniques for enhancing component based development systems by making components self-aware with respect to the applications that they may be consumed in or other peer components within the applications. An exemplary technique includes determining an addition of one or more components to an interface of an application; identifying an asset definition within metadata of a component of the one or more components added to the interface of the application, where the asset definition provides self-wiring or self-configuring instructions for an asset that needs to be created for the component within a predefined scope when the component is added to the interface; and creating the asset for the component based on the asset definition.

Abstract: Techniques are described for automatically detecting and accommodating state changes in a computer-generated forecast. In one or more embodiments, a representation of a time-series signal is generated within volatile and/or non-volatile storage of a computing device. The representation may be generated in such a way as to approximate the behavior of the time-series signal across one or more seasonal periods. Once generated, a set of one or more state changes within the representation of the time-series signal is identified. Based at least in part on at least one state change in the set of one or more state changes, a subset of values from the sequence of values is selected to train a model. An analytical output is then generated, within volatile and/or non-volatile storage of the computing device, using the trained model.

Abstract: Techniques for transforming plug-in application recipe (PIAR) variables are disclosed. A PIAR definition identifies a trigger and an action. Trigger variable values, exposed by a first plug-in application, are necessary to evaluate the trigger. Evaluating the trigger involves determining whether a condition is satisfied, based on values of trigger variables. A second plug-in application exposes an interface for carrying out an action. Evaluating the action involves carrying out the action based on input variable values. A user selects, via a graphical user interface of a PIAR management application, a variable for a trigger or action operation and a transformation operation to be applied to the variable. The PIAR management application generates a PIAR definition object defining the trigger, the action, and the transformation operation, and stores the PIAR definition object for evaluation on an ongoing basis.

Abstract: Techniques are provided for authorizations in a virtual computing infrastructure using a federation token service. The techniques may include receiving a request for a launch plan from a user for launching instances in a plurality of sites, determining object permissions required for actions to be performed to launch one or more of the instances at each site of the plurality of sites, contacting an authorization caching service to obtain authorization tokens for each of the determined object permissions required for the actions, receiving the authorization tokens for each of the determined object permissions required for the actions, and forwarding the request to each site of the plurality of sites with an authentication token and the authorization tokens for each of the determined object permissions required for the actions to be performed to launch the one or more of the instances at each site of the plurality of sites.

Abstract: In accordance with an embodiment, described herein is a system and method for dynamically converting data manipulation language (DML) code embedded in a mainframe application rehosted in a mainframe rehosting platform. The DML code can include SQL scripts with SQL statements, and standalone SQL statements for accessing a source database in a mainframe computer. The DML code can be converted programmatically and immediately before the DML code is to be executed during the execution of the rehosted mainframe application. A database access script converter in an application runtime of the mainframe rehosting platform can load a database schema of a target database and a set of conversion rules, parse the rehosted mainframe application to identify the DML code, and convert each SQL statement based on one or more conversion rules and the database schema, for execution against the target database.

Abstract: A method for providing reduced signaling Internet of things (IoT) device monitoring includes steps performed in a combined and service capability exposure function (SCEF) and Diameter signaling router (DSR) including at least one processor. The method includes receiving Diameter signaling containing IoT device information. The method further includes using the IoT device information to automatically provision an IoT device information database. The method further includes receiving a monitoring subscription request. The method further includes extracting the IoT device information from the IoT device information database. The method further includes using the IoT device information to respond to the monitoring subscription request.

Abstract: Techniques are provided for moving data between partitions. Such a process may be performed without requiring any locks that block transactions that target a partition from being executed. Instead, such transactions may proceed while a move operation is being performed. The move operation involves copying data from the targeted partition to another partition that is hidden from (or “invisible” to) those transactions that attempt to read from or write to the partition. During the move operation, changes that are made to the partition are also reflected in a journal. Eventually, the changes reflected in the journal are drained and applied to the hidden partition. Once the partition and the hidden partition are synchronized, the identities of the partitions are swapped so that future transactions will target the previously-hidden partition instead of the previously-viewable partition.

Abstract: Control migration of a state machine using a dependency graph interface by: analyzing a state machine to determine objects and dependencies between the objects; generating a dependency graph that represents the objects and the dependencies between the objects, wherein the objects are represented by selectable icons; displaying the dependency graph on a display device; in response to a selection of a particular selectable icon, providing a migration option for an object represented by the selectable icon, wherein the migration option includes at least a selection between either a deep copy or a shallow copy for the object represented by the selectable icon; accepting and storing a selection of the migration option for the object represented by the particular selectable icon; and migrating the state machine to a target environment based at least in part on performing the migration option for the object represented by the particular selectable icon.

Abstract: A query optimization system is described that, at runtime, optimizes the execution pipeline generated for a query. Based upon communications between nodes in the execution pipeline, the execution pipeline generated for a query is optimized by modifying the execution pipeline to create a modified execution pipeline. The modified execution pipeline is then executed to execute the query and results obtained for the query. The changes or modifications made to an execution pipeline may include changing the capabilities (e.g., changes to inputs and/or outputs of a node, changing the task(s) or function(s) performed by the node) of one or more nodes within the execution pipeline. The changes may include changing the position of one or more nodes within a directed acyclic graph representing the execution pipeline.

Abstract: Techniques for selecting an anomaly based on a context are disclosed. A set of metrics corresponding to communications with nodes of a computer system are identified. A set of insights are generated based on the set of metrics. A context for determining a primary anomaly is determined. A subset of metrics associated with the context are identified. A subset of insights that are generated based on the subset of metrics are identified. An insight is selected from the subset of insights as the primary anomaly. A visualization associated with the primary anomaly is presented at a user interface. One or more secondary anomalies may be concurrently presented with the visualization. Additionally, the primary anomaly, the selected visualization, and/or the secondary anomaly is used to determine a new context for selecting another primary anomaly. Hence, a series of primary anomalies may be selected, each primary anomaly being related to each other.

Abstract: Techniques are described for modeling variations in correlation to facilitate analytic operations. In one or more embodiments, at least one computing device receives first metric data that tracks a first metric for a first target resource and second metric data that tracks a second metric for a second target resource. In response to receiving the first metric data and the second metric data, the at least one computing device generates a time-series of correlation values that tracks correlation between the first metric and the second metric over time. Based at least in part on the time-series of correlation data, an expected correlation is determined and compared to an observed correlation. If the observed correlation falls outside of a threshold range or otherwise does not satisfy the expected correlation, then an alert and/or other output may be generated.

Abstract: Disclosed is an improved approach for implementing a system, method, and computer program product for integrating with a social media site, which can be used to create and configure a custom audience on the social media site.

Abstract: Techniques are described for triggering conditional automated social posts. According to an embodiment, a set of one or more conditions is received through a user interface by a system executing on one or more computing devices. The system monitors one or more social media channels for target content that has been posted on at least one social media channel of the one or more social media channels. In response to detecting, by the system executing on one or more computing devices, that the target content has been posted on at least one social media channel of the one or more social media channels, the system determines whether the set of one or more conditions are satisfied. In response to determining that the set of one or more conditions are satisfied, the system triggers an action responsive to the target content.

Abstract: Operations include (a) identifying bounds corresponding to two or more inference variables corresponding to a nested method invocation context, (b) determining that resolution of a first inference variable can be determined as a function of a resolution of a second inference variable, (c) propagating bounds corresponding to the second inference variable from the nested method invocation context to an outer method invocation context without propagating bounds corresponding to the first inference variable, (d) resolving a constraint set to resolve the second inference variable, and (e) resolving the first inference variable based on the resolution of the second inference variable.

Abstract: Techniques for deploying a server stack having a cross-server dependency are disclosed. A deployment engine initiates a deployment process for a server stack. The deployment engine provisions servers of one server type (“requisite servers”). The deployment engine attempts to provision servers of another server type (“dependent servers”). The deployment engine executes a test that requires the dependent servers to invoke a service executed by the requisite servers. Based on the test results, the deployment engine determines that an operational requirement of the dependent servers is not satisfied. The deployment engine modifies a configuration for the requisite servers to satisfy the operational requirement of the dependent servers. The deployment engine re-provisions the requisite servers using the modified configuration. The deployment engine completes the deployment process for the server stack.

Abstract: An example method facilitates dynamic runtime execution of computer code that is selectively injected into messages in accordance with predetermined configuration rules for automatic execution at a message destination. The injection of code into messages, such as messages exchanged during an authenticated computing session, by a policy enforcement system, can be used to efficiently effectuate enhance computing environment security and computing resource use. For example, in a specific embodiment, code for detecting a browser-close event and then terminating a computing session can be automatically executed client side via a browser extension or plugin, thereby helping to eliminate the accumulation of stale computing sessions; thereby mitigating associated security risks and computing resource consumption of stale computing sessions. In another example embodiment, injected code encrypts session cookies, such as via a Time based One Time Password (TOTP).

Abstract: Accessing migrated members in an updated type is described. Instructions to access a migrated member may be: (a) storing a value of a particular type as a value of a migrated field, or (b) invoking a migrated method using an argument of a particular type. The argument of the particular type, specified in the instructions, is converted into a value of the type associated with the current version of the migrated member. The migrated member is accessed using the converted value. Alternatively, instructions may be: (a) fetching and returning a value of a migrated field as a value of a particular type, or (b) returning a value from a migrated method as a value of a particular type. A value is returned via accessing the current version of the migrated member. The returned value is converted into a value of the particular type specified in the instructions.

Abstract: Techniques for generating distribution approximations with low memory footprints are disclosed. In some embodiments, a system receives a first set of values that measure one or more metrics of at least one computing resource. A set of clusters are generated, within volatile or non-volatile memory, that approximate a distribution of the first set of values measuring the one or more metrics of the at least one computing resource. The set of clusters is transformed, within volatile or non-volatile memory, to a piecewise approximation of a function for the first set of values.

Abstract: System and method for supporting node role attributes in a high performance computing environment. In accordance with an embodiment, a node role attribute can comprise a vendor defined subnet management attribute. When a subnet manager attempts to discover a high performance computing environment, such as an InfiniBand subnet, or a switch topology, identifying a topology is quite complex when subnet manager can only observe connectivity, without context behind the connectivity (the roles of the different nodes in the connectivity). However, when a subnet has a node role attribute enabled, the subnet manager can map the interconnect more effectively as it can discover not only the connectivity during the initial sweep, but it can also discover the role of each node discovered, thus leading to a more efficient interconnect discovery.

Abstract: Disclosed is a system, method, and computer program product that allows multiple partition schemes to be applied to a single object. Each scheme represents the same set of partitions, but the schemes may have different partition methods, different partition keys, and/or different partition bounds.

Abstract: Techniques for language-based manipulation of data visualizations are disclosed. A system presents a data visualization representing a multidimensional data set. The system receives user input including language associated with a particular interaction with the data visualization. The particular interaction is configured to manipulate presentation of one or more subsets of the multidimensional data set. The user input does not identify any particular subset of the multidimensional data set. The system determines that the interaction is applicable to two or more candidate subsets of the multidimensional data set and presents, as candidates for the particular interaction, the two or more candidate subsets. The system receives user input selecting a particular subset from candidates. Based on the user inputs, the system generates a complete command corresponding to the particular interaction.

Abstract: A method and system for processing data are disclosed. A processor, in response to executing a software program, may write an entry in a work queue. The entry may include an operation, and a location of data stored in an input buffer, and a location in an output buffer to write processed data. The processor may also generate a notification that at least one entry in the work queue is ready to be processed. The data transformation unit may assign the entry to a data transformation circuit, and retrieve the data from the input buffer using the location. The data transformation unit may also perform to the operation on the retrieved data to generate updated data, generate a completion message in response to completion of the operation, and store the updated data in an output buffer. An interface unit may relay transactions between the processor and the data transformation unit.

Abstract: User specified build jobs are received at a centralized system. Each of the build jobs includes the load jobs for applications to execute in the centralized system. Clients and servers are created on selected hardware hosts based on the build jobs. Each of the selected hardware hosts includes one of the clients and a subset of the servers. Each of the clients and each of the servers resides in a separate container of a plurality of containers. Each of the clients and each of the servers use mutually exclusive subsets of hardware resources provided by the containers and obtain non-emulated operating system assistance. Overlapping-in-time load tests are executed on the applications. Real time performance information is collected during the executing of the load tests of the applications. After completion of a subset of the load tests, a subset of the selected hardware hosts is made available for executing subsequent load tests by removing containers.

Abstract: Systems, methods, and other embodiments associated with defining and evaluating a project initiative are described. In one embodiment, a method includes displaying an initiative definition interface for use in defining the project initiative for an entity. The example method may also include receiving an objective definition, a capability definition, a benefit definition, and an implementation roadmap definition through the initiative definition interface. The example method may also include assigning ranks to the objective definition, the capability definition, the benefit definition, and the implementation roadmap definition based upon a definition completeness metric. The example method may also include generating an initiative viability score based upon the ranks. The example method may also include displaying an initiative redefinition suggestion for redefining the project initiative based upon the initiative viability score being below a threshold.

Abstract: Nested hierarchies can be efficiently analyzed by normalizing a portion of the hierarchy as defined by a limiting factor for the hierarchy. In a project hierarchy wherein each project contains a task hierarchy, each task hierarchy can be normalized. Further, the projects can be assigned to levels such that data for each level can be indexed, partitioned, or otherwise differentiated. The data then can be efficiently rolled up by level using the partially normalized hierarchy.

Abstract: Described herein are systems and methods for replicating an original sequential data volume to a copied sequential data volume. The two sequential data volumes comprise corresponding data blocks with associated write session identifiers. The write session identifiers may correspond to an applicable write operation. When the original sequential data volume is modified, the copied sequential data volume may also be modified for consistency. The write session identifiers of the two data volumes may be sequentially compared to find a mismatch at a modified data block. The data blocks of the copied sequential data volume are replaced, beginning with the modified data block. Instead of replicating the entire original sequential data volume, the modified data block and any subsequent data blocks are replicated in the copied sequential data volume.

Abstract: System and Methods for non-uniform memory (NUMA) garbage collection are provided. Multiple memories and processors are categorized into local groups. A heap space is divided into multiple pools and stored in each of the memories. Garbage collection threads are assigned to each of the local groups. Garbage collection is performed using the garbage collection threads for objects contained in the pools using the garbage collector threads, memory, and processor assigned to each local group, minimizing remote memory accesses.

Abstract: Techniques are described that enable the dynamic and automatic life cycle management of database schemas. Temporary database schemas are dynamically and automatically allocated in response to database schema requests. Allocated schemas are also automatically reclaimed upon expiration. A dynamic schema allocation system is provided that is configured to receive database schema requests from one or more clients and dynamically and automatically, substantially free of any manual intervention, serve database schemas in response to the requests. The database schemas may be allocated from multiple database instances available to the dynamic schema allocation system. Attributes specified in a database schema request may be used to find a matching database instance and a schema is allocated for the request from the matching database instance.

Abstract: The system receives a stream of authentication events, which are associated with authentication events. Next, the system attempts to detect a formation of authentication events, wherein a formation comprises a time window of authentication events that satisfy a formation criterion, which is based on one or more of: a username for the authentication attempt, an Internet Protocol (IP) address from which the authentication attempt originated, and a resource identifier for a computing resource that the authentication attempt was directed to. If a formation is detected, the system determines a number of valid usernames in the formation. If the number of valid usernames is one or less, the system computes a username similarity score for authentication events in the formation, which is a function of a string distance between usernames in the formation. If the username similarity score exceeds a threshold value, the system reports a potential username guessing attack.

Abstract: A linear actuator includes dual bucking magnets, dual pole pieces, and dual spacers. The linear actuator includes a coil-and-housing assembly disposed around a magnet assembly. The magnet assembly includes two bucking magnets sandwiched around a central magnet. The central magnet and the bucking magnets may be separated by spacers. A housing is disposed around the magnet assembly. Between the housing and the magnet assembly, a dual coil is wound in two opposing directions to generate additive forces on the magnet assembly.

Abstract: Large quantities of data can be processed and/or queried relatively quickly using a combination of continuous event processing and a Map-Reduce algorithmic tool. The continuous event processor can continuously produce real-time results by merging (a) CQL query results from events received since a currently executing Map-Reduce job was started with (b) a most recent query result produced by a most recently completed Map-Reduce job. When the currently executing Map-Reduce job completes, its query result can be stored and made accessible to the continuous event processor, and a new Map-Reduce job can be started relative to event data that has grown in size since the execution of the last Map-Reduce job. The Map-Reduce algorithmic tool provides a convenient mechanism for analyzing and processing large quantities of data.

Abstract: A system and method is described for use with a multidimensional database computing environment to provide support for parallel calculation of multidimensional slices. Users are able to specify a set of slices and a number of parallel threads to employ. The multidimensional database environment generates tasks that include calculations and/or aggregations, which are able to be executed by the system in parallel. Also described herein are mechanisms of utilizing variables within the calculations performed by respective threads, and combining thread variables after execution.

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: Systems, methods, and other embodiments associated with multi-distance clustering are described. In one embodiment, a method includes reading a multi-distance similarity matrix S that records pair-wise multi-distance similarities between respective pairs of data points in a data set. Each pair-wise similarity is based on distances between a pair of data points calculated using K different distance functions, where K is greater than one. The method includes clustering the data points in the data set into n clusters based on the similarity matrix S. The number of clusters n is not determined prior to the clustering.

Abstract: Techniques are described for organizing data within a storage system. In one or more embodiments, a storage system monitors access to a first set of objects comprising (a) a first subset of objects associated with at least a first attributes and (b) a second subset of objects associated with at least a second attribute. Based on the monitoring, the storage system identifies a pattern of accessing objects in the second subset of objects subsequent to accessing objects in the first subset of objects. Responsive to receiving a request to store a second set of objects, the storage system generates a file in which a first object associated with at least the first attribute and a second object associated with at least the second object are stored consecutively.

Abstract: Techniques are provided for scheduling data operations for a given query based upon a query-cost model that analyzes the cost of scheduling data operations based upon their operation cost and the type of resources needed for the operation. In an embodiment, a database server receives a set of operations for a query. The database server determines a set of leaf operation nodes from the set of data operations, where the set of leaf operation nodes includes operation nodes that do not depend on the execution of other nodes within the set of data operations. The database server compares operation costs between the leaf operation nodes to determine which leaf operation node to insert into a scheduled order set. The database server inserts the leaf operation node into the scheduled order set. Then the database server iteratively determines new leaf operation nodes and performs cost analysis on remaining leaf operation nodes to generate a set of scheduled data operations.

Abstract: Implementations generally relate to inter-application sharing. In some implementations, a method includes displaying a first user interface (UI) of a first application in a display screen of a client device, wherein the first UI presents information associated with a target project. The method further includes displaying a second UI of a second application in the display screen of the client device. The method further includes receiving a user indication to transfer the information associated with the target project from the first UI to the second UI. The method further includes accessing underlying data associated with the target project. The method further includes transferring the underlying data from the first application to the second application. The method further includes displaying the information associated with the target project in the second UI after the transferring.

Abstract: Data blocks are cached in a persistent cache (“NV cache”) allocated from as non-volatile RAM (“NVRAM”). The data blocks may be accessed in place in the NV cache of a “source” computing element by another “remote” computing element over a network using remote direct memory access (“RMDA”). In order for a remote computing element to access the data block in NV cache on a source computing element, the remote computing element needs the memory address of the data block within the NV cache. For this purpose, a hash table is stored and maintained in RAM on the source computing element. The hash table identifies the data blocks in the NV cache and specifies a location of the cached data block within the NV cache.

Abstract: The embodiments disclosed herein relate to intelligent configuration of a cloud-service gateway based on a pattern recognition algorithm. A machine-learning model is trained to learn the patterns of correlation among many configuration parameters affecting the performance of the system when processing an observed or estimated workload. Training the model may be performed off-line with performance data observed during experiments performed with a variety of configurations and workloads. Once trained, the model may be used to recommend: (a) new configuration parameter values based on constraints of the system being configured, (b) an amount of work that can be performed at a certain performance level when the system is configured with certain parameter values, or (c) the expected performance level when running a certain workload on the system configured with certain configuration parameter values.

Abstract: Systems and methods for supporting SMA level abstractions at router ports for enablement of data traffic in a high performance computing environment. In accordance with an embodiment, a subnet manager in a local subnet is responsible for enabling data traffic between subnets in a high performance computing environment. The SM can configure and set a data attribute at a switch port configured as a router port such that incoming data packets can be checked against the attribute to determine whether the data packet's destination is allowed or disallowed to receive inter-subnet data traffic.

Abstract: A distributed event processing system is disclosed that receives continuous data streams, registers a continuous query against the data streams, and continuously executes the query as new data appears in the streams. In certain embodiments, the distributed event processing system deploys and executes applications (e.g., event processing applications) by distributing the execution of the application on a cluster of machines within the system. In certain embodiments, the system receive updates to an application, processes the updated application against a continuous stream of data, and continuously generates updated results to a user. In certain embodiments, the system reduces delays associated with application deployment and execution when updates to an application are received. The system enables a user to view results pertaining to an updated application quickly without experiencing the typical deployment and execution delays that occur when updates to an application are made.