Abstract:
An example method of integrating a plurality of heterogeneous peer-to-peer communication participants includes retrieving from a first input queue coupled to a duplex service a first message. The first message includes a message identifier and is from a sender. The method also includes applying a first operation on the first message, determining a first output of the first message based on the first operation, and sending the first output of the first message to a target. The method further includes retrieving from a second input queue coupled to the duplex service a second message. The second message includes the message identifier and is from a target. The method also includes applying a second operation on the second message, determining a second output of the second message based on the second operation, and sending the second output of the second message to the sender.
Abstract:
A system and method of server selection using competitive evaluation includes receiving a service request at an arbiter running on a computing device, determining whether the service request is associated with a preferred server, and forwarding the service request to the preferred server when the service request is associated with the preferred server. When the service request is not associated with the preferred server, the method further includes using the arbiter to coordinate a competitive evaluation among a plurality of active servers, selecting as the preferred server a first one of the active servers that completes processing of the service request first, and associating the preferred server with the service request. The method further includes receiving a response to the service request from the preferred server and returning the response to a client. The service request is received from the client.
Abstract:
An example system for distributing a workload of an application includes a class identifier that identifies a remotely instantiable class in an instruction. Execution of the instruction includes processing a workload. The example system also includes a distributor that selects a remote node to process a portion of the workload, sends a message to the selected remote node to cause (i) the selected remote node to instantiate the remotely instantiable class and (ii) the selected remote node to process the portion of the workload by invoking a method of the instantiated class, and receives a result of the processed portion of the workload.
Abstract:
Systems and methods are provided for data hub architecture to provide actionable data from remote sensor feeds. An exemplary method includes receiving, by a master hub of a plurality of data hubs, a request to access at least one first sensor in a first location and at least one second sensor in a second location from a data client, wherein the master hub is closest to the data client of the plurality of data hubs on a network, determining a first data hub that is closest to the at least one first sensor on the network, and determining a second data hub that is closest to the at least one second sensor on the network. The method further includes querying the first data hub and the second data hub for data and communicating the data to the data client.
Abstract:
A method and system for processing a request is provided. An example system includes a security module that authenticates a request from a client. The system also includes a Web service that determines whether the set of operations includes an input/output (I/O) operation and determines whether a result of the authentication has been determined. While the request is pending authentication, the Web service may initiate processing of the request and may ensure that no I/O operations are performed within the processing of the request until a request of the authentication has been determined.
Abstract:
A cache system stores a number of different datasets. The cache system includes a number of cache units, each in a state associated with one of the datasets. In response to determining that a hit ratio of a cache unit drops below a threshold, the state of the cache unit is changed and the dataset is replaced with that associated with the new state.
Abstract:
A system and method of dynamic collaboration during query processing includes determining a load factor for a data source, receiving a query at a query assistant running on a computer server, determining a complexity of the query, adjusting the complexity by the load factor, simplifying the query by removing one or more first query elements from the query when the adjusted complexity is above a threshold, forming a query plan where the first query elements are designated for processing outside the data source, and performing the query plan by sending one or more abbreviated queries to the data source and processing the first query elements using the query assistant. The abbreviated queries are based on the query with the first query elements removed. In some examples, the query may be iteratively simplified until a second adjusted complexity of a simplified version of the query falls below the threshold.
Abstract:
A system and method of processing service queries includes receiving a first request for services from a client, the first request for services includes a service query including identifiers for an action, one or more candidate services, a services template, and an aggregation; parsing the services query to identify the action, the candidate services, the services template, and the aggregation; determining one or more combinations of candidate services based on types of the candidate services; applying the services template to each of the combinations of candidate services to determine results for each of the combinations of candidate services; aggregating the results based on the aggregation; selecting a preferred combination of candidate services based on the applied aggregation; and forwarding the results corresponding to the preferred combination to the action.
Abstract:
A cache system stores a number of different datasets. The cache system includes a number of cache units, each in a state associated with one of the datasets. In response to determining that a hit ratio of a cache unit drops below a threshold, the state of the cache unit is changed and the dataset is replaced with that associated with the new state.
Abstract:
A method performed by a computing system includes creating a graph, wherein nodes of the graph represent data objects of a data storage cluster, wherein edges of the graph represent joins between data objects represented by both nodes of respective edges, wherein node values of the nodes and weights of the edges are based on statistics related to use of the data objects. The method further includes assigning a first subset of the data objects to a relational database storage node within the data storage cluster, the first subset of data objects being represented by nodes within a cluster of the graph, and assigning a second subset of the data objects to a non-relational database storage node within the data storage cluster, the second subset of data objects being represented by nodes within the graph that are not part of a cluster.