Abstract:
A computer implemented method and system for uniform, consistent, stateless, and deterministic consistent hashing for fixed size partitions. The method comprises receiving server information for a plurality of servers in a server pool; ordering the server information for the plurality of servers; calculating a mean number of partitions per server in the server pool; calculating a first maximum allowed number of partitions for a server by applying a floor function to the calculated mean number of partitions per server in the server pool; in the order of the ordered server information, assigning partitions to servers based on a hashing function, using the first maximum allowed number of partitions per server; calculating a second maximum allowed number of partitions for a server by applying a ceiling function to the calculated mean number of partitions per server in the server pool; in the order of the ordered server information, assigning partitions to servers based on a hashing function, using the second maximum allowed number of partitions per server; and assigning unassigned partitions wherein assigning comprises: for each unassigned partition, mapping the partition to a server with the least number of assigned partitions at a time of the mapping.
Abstract:
A computer implemented method and system for secure initial secret delivery for collocated containers with shared resources techniques is disclosed. The method comprises providing an application type identifier and a token for accessing a secrets management service; creating asynchronously, a plurality of collocated containers with shared resources; initiating a request for a creation for an initial secret; validating the request, requesting an identity for the collocated containers; validating the identity; starting an application instance; and using the initial secret to retrieve other secrets for the application instance.
Abstract:
A server for providing a generic actor system container application comprising: status and control graphical user interfaces, a listener service, a cluster manager, an actor registry and discovery service, a system configurator, a plurality of handles, a plurality of listeners, and a plurality of generic actors, wherein the generic actor system container application is configured to: receive information associated with a plurality of customized domain specific actors; receive a plurality of domain specific connection information; generate the plurality of domain specific actors based on the information associated with the plurality of customized domain specific actors; register the plurality of domain specific actors; and execute and monitor a domain specific actor system using the domain specific actors based on the domain specific connection information.
Abstract:
A server for providing a generic actor system container application comprising: status and control graphical user interfaces, a listener service, a cluster manager, an actor registry and discovery service, a system configurator, a plurality of handles, a plurality of listeners, and a plurality of generic actors, wherein the generic actor system container application is configured to: receive information associated with a plurality of customized domain specific actors; receive a plurality of domain specific connection information; generate the plurality of domain specific actors based on the information associated with the plurality of customized domain specific actors; register the plurality of domain specific actors; and execute and monitor a domain specific actor system using the domain specific actors based on the domain specific connection information.
Abstract:
A method for the reorganization of messages in queuing systems is disclosed. The method comprising receiving a statement to reorganize one or more messages within an ordered data structure; translating the statement into a first set of instructions for identifying one or more messages on which to perform one or more operations, a second set of instructions for performing the one or more operations on the identified one or more messages, and a third set of instructions for storing, in a memory, the identified one or more messages after the one or more operations have been performed; executing the first set of instructions, the second set of instructions, and the third set of instructions on each message in the ordered data structure; and transmitting the operated upon messages.
Abstract:
A computer implemented method and system for uniform, consistent, stateless, and deterministic consistent hashing for fixed size partitions. The method comprises receiving server information for a plurality of servers in a server pool; ordering the server information for the plurality of servers; calculating a mean number of partitions per server in the server pool; calculating a first maximum allowed number of partitions for a server by applying a floor function to the calculated mean number of partitions per server in the server pool; in the order of the ordered server information, assigning partitions to servers based on a hashing function, using the first maximum allowed number of partitions per server; calculating a second maximum allowed number of partitions for a server by applying a ceiling function to the calculated mean number of partitions per server in the server pool; in the order of the ordered server information, assigning partitions to servers based on a hashing function, using the second maximum allowed number of partitions per server; and assigning unassigned partitions wherein assigning comprises: for each unassigned partition, mapping the partition to a server with the least number of assigned partitions at a time of the mapping.
Abstract:
A computer implemented method and system for secure initial secret delivery for collocated containers with shared resources techniques is disclosed. The method comprises providing an application type identifier and a token for accessing a secrets management service; creating asynchronously, a plurality of collocated containers with shared resources; initiating a request for a creation for an initial secret; validating the request, requesting an identity for the collocated containers; validating the identity; starting an application instance; and using the initial secret to retrieve other secrets for the application instance.
Abstract:
A method for the reorganization of messages in queuing systems is disclosed. The method comprising receiving a statement to reorganize one or more messages within an ordered data structure; translating the statement into a first set of instructions for identifying one or more messages on which to perform one or more operations, a second set of instructions for performing the one or more operations on the identified one or more messages, and a third set of instructions for storing, in a memory, the identified one or more messages after the one or more operations have been performed; executing the first set of instructions, the second set of instructions, and the third set of instructions on each message in the ordered data structure; and transmitting the operated upon messages.