In general, embodiments of the present invention provide systems, methods and computer readable media for a universal relevance service framework for ranking and personalizing items.

In general, embodiments of the present invention provide systems, methods and computer readable media for a universal relevance service framework for ranking and personalizing items.

The disclosed technology includes techniques for secure access to data associated with an organization and includes providing a user device access to a user interface that is configurable by a user of the user device to execute function requests. Upon receipt of a function request, a router can randomly select an available computer from a computer cluster to execute the function. The computer can access a predetermined portion of the organization's data, generate an output by executing the requested function based on the predetermined portion of the organization's data, and transmit the output to the user device.

The disclosed technology includes techniques for secure access to data associated with an organization and includes providing a user device access to a user interface that is configurable by a user of the user device to execute function requests. Upon receipt of a function request, a router can randomly select an available computer from a computer cluster to execute the function. The computer can access a predetermined portion of the organization's data, generate an output by executing the requested function based on the predetermined portion of the organization's data, and transmit the output to the user device.

Methods and architecture for load-correcting requests for serverless functions to reduce latency of serverless computing are provided. An example technique exploits knowledge that a given server node does not have a serverless function ready to run or is overloaded. Without further processing overhead or communication, the server node shifts the request to a predetermined alternate node without assessing a current state of the alternate node, an efficient decision based on probability that a higher chance of fulfillment exists at the alternate node than at the current server, even with no knowledge of the alternate node. In an implementation, the server node refers the request but also warms up the requested serverless function, due to likelihood of repeated requests or in case the request is directed back. An example device has a front-end redirecting server and a backend serverless system in a single component.

Methods and architecture for load-correcting requests for serverless functions to reduce latency of serverless computing are provided. An example technique exploits knowledge that a given server node does not have a serverless function ready to run or is overloaded. Without further processing overhead or communication, the server node shifts the request to a predetermined alternate node without assessing a current state of the alternate node, an efficient decision based on probability that a higher chance of fulfillment exists at the alternate node than at the current server, even with no knowledge of the alternate node. In an implementation, the server node refers the request but also warms up the requested serverless function, due to likelihood of repeated requests or in case the request is directed back. An example device has a front-end redirecting server and a backend serverless system in a single component.

A computer-implemented method for the random-based leader election in a distributed network of data processing devices, said distributed network including a plurality of identified asynchronous processes, wherein all said identified processes or a subset thereof are running processes participating in the leader election, including the following steps: a) a random information is generated by each running process and shared with the other running processes, so that each running process maintains a set of said random information, b) a distributed random information is calculated by each running process from the set of random information by applying a first shared transformation function, so that the same distributed random information is made available to each running process, c) a designator of a single one of said running processes is calculated from the distributed random information by means of a second shared transformation function, d) said designator is used to elect a leader amongst said running processes.

A first example network security platform disclosed herein is to store a cryptographic session key from a server, the cryptographic session key associated with an encrypted network traffic flow between the server and a client different from the first network security platform. This disclosed first example network security platform is also to access a query from a second network security platform requesting the cryptographic session key, and generate a response including the cryptographic session key to send to the second network security platform.

The disclosed technology includes techniques for secure access to data associated with an organization and includes providing a user device access to a user interface that is configured execute function requests. Upon receipt of a function request, a computer can access a predetermined portion of the organization's data, generate an output by executing the requested function based on the predetermined portion of the organization's data, and transmit the output to the user device.

The disclosed technology includes techniques for secure access to data associated with an organization and includes providing a user device access to a user interface that is configured execute function requests. Upon receipt of a function request, a computer can access a predetermined portion of the organization's data, generate an output by executing the requested function based on the predetermined portion of the organization's data, and transmit the output to the user device.