Abstract: Hot restart of a hypervisor by replacing a running first hypervisor by a second hypervisor with minimally perceptible downtime to guest partitions. A first hypervisor is executed on a computing system. The first hypervisor is configured to create one or more guest partitions. During the hot restart, a service partition is generated and initialized with a second hypervisor. At least a portion of runtime state of the first hypervisor is migrated and synchronized to the second hypervisor using inverse hypercalls. After the synchronization, the second hypervisor is devirtualized from the service partition to replace the first hypervisor. Devirtualizing includes transferring control of hardware resources from the first hypervisor to the second hypervisor, using the previously migrated and synchronized runtime state.

Abstract: Various methods, apparatuses/systems, and media for implementing an application release management module are provided. A receiver receives a release branch and a fix version as input in connection with an application. A processor implements a hook with the release branch and the fix version as the input that automatically integrates project tracking systems as part of the deployment pipeline. The hook is configured to automatically trigger the following processes: receive the release branch as the input and connecting to a repository to fetch all project tracking system identifications (IDs) for a commit in connection with the application; connect to corresponding project tracking systems to fetch detail information data for those project tracking systems based the IDs fetched from the repository; and validate for status of the project tracking systems based on scanning and analyzing the fetched detail information data prior to approving the received request for the UAT deployment.

Abstract: A method may include receiving an indication that an electronic alert is to be transmitted to a user; obtaining contextual information associated with the user; determining a first time for presenting the electronic alert to the user based in part on the contextual information; transmitting the electronic alert to a computing device associated with the user at the first time; storing the electronic alert in a message feed data structure; receiving a request to view the electronic alert at a second time, the second time occurring after the first time; in response to the request, retrieving the electronic alert from the message feed data structure; and transmitting the electronic alert at the second time.

Abstract: Hot restart of a hypervisor by replacing a running first hypervisor by a second hypervisor with minimally perceptible downtime to guest partitions. A first hypervisor is executed on a computing system. The first hypervisor is configured to create one or more guest partitions. During the hot restart, a service partition is generated and initialized with a second hypervisor. At least a portion of runtime state of the first hypervisor is migrated and synchronized to the second hypervisor using inverse hypercalls. After the synchronization, the second hypervisor is devirtualized from the service partition to replace the first hypervisor. Devirtualizing includes transferring control of hardware resources from the first hypervisor to the second hypervisor, using the previously migrated and synchronized runtime state.

Abstract: A method for creating a space-filling solid model includes (a) defining a three-dimensional (3D) domain, (b) defining a Voronoi site geometry for each of a plurality of Voronoi sites, (c) defining a spatial arrangement of the plurality of Voronoi sites, (d) arranging the plurality of Voronoi sites within the 3D domain according to the defined spatial arrangement, and (e) partitioning the 3D domain based on the Voronoi site geometry of each the plurality of Voronoi sites defined in (b) and the spatial arrangement of the plurality of Voronoi sites defined in (c) using a distance function to create the space-filling solid model.

Abstract: Various methods, apparatuses/systems, and media for implementing an application release management module are provided. A receiver receives a release branch and a fix version as input in connection with an application. A processor implements a hook with the release branch and the fix version as the input that automatically integrates project tracking systems as part of the deployment pipeline. The hook is configured to automatically trigger the following processes: receive the release branch as the input and connecting to a repository to fetch all project tracking system identifications (IDs) for a commit in connection with the application; connect to corresponding project tracking systems to fetch detail information data for those project tracking systems based the IDs fetched from the repository; and validate for status of the project tracking systems based on scanning and analyzing the fetched detail information data prior to approving the received request for the UAT deployment.

Abstract: Hot restart of a hypervisor by replacing a running first hypervisor by a second hypervisor with minimally perceptible downtime to guest partitions. A first hypervisor is executed on a computing system. The first hypervisor is configured to create one or more guest partitions. During the hot restart, a service partition is generated and initialized with a second hypervisor. At least a portion of runtime state of the first hypervisor is migrated and synchronized to the second hypervisor using inverse hypercalls. After the synchronization, the second hypervisor is devirtualized from the service partition to replace the first hypervisor. Devirtualizing includes transferring control of hardware resources from the first hypervisor to the second hypervisor, using the previously migrated and synchronized runtime state.

Abstract: A method may include receiving an indication that an electronic alert is to be transmitted to a user; obtaining contextual information associated with the user; determining a first time for presenting the electronic alert to the user based in part on the contextual information; transmitting the electronic alert to a computing device associated with the user at the first time; storing the electronic alert in a message feed data structure; receiving a request to view the electronic alert at a second time, the second time occurring after the first time; in response to the request, retrieving the electronic alert from the message feed data structure; and transmitting the electronic alert at the second time.

Abstract: The embodiment herein provides a system and method for providing a novel leader election mechanism in distributed systems that is randomized in twin dimensions of space and time using the concept of a colliding random walk (CRW). Leader election is randomized in space in terms of the node identified as the leader and the time taken to identify the leader. A source node is enabled to generate left and right coupons in a quantum resistant manner for random walks. A novel fault tolerance mechanism is provided to identify several leaders for same set of coupons. In this system and method, the source vertex generates multiple CRWs for each piece of work that needs to be done. The fault tolerance mechanism reduces the time to collision, increases the number of leaders and also offers increased resilience and tolerance to faults.

Abstract: Hot restart of a hypervisor by replacing a running first hypervisor by a second hypervisor with minimally perceptible downtime to guest partitions. A first hypervisor is executed on a computing system. The first hypervisor is configured to create one or more guest partitions. During the hot restart, a service partition is generated and initialized with a second hypervisor. At least a portion of runtime state of the first hypervisor is migrated and synchronized to the second hypervisor using inverse hypercalls. After the synchronization, the second hypervisor is devirtualized from the service partition to replace the first hypervisor. Devirtualizing includes transferring control of hardware resources from the first hypervisor to the second hypervisor, using the previously migrated and synchronized runtime state.

Abstract: The embodiments herein provide a fair, high speed and lightweight consensus mechanism for leader election in distributed systems using coupons. The consensus mechanism uses a leader election mechanism that is randomized in twin dimensions of space and time using the concept of a colliding random walk. A source node is enabled to generate left and right coupons in a quantum resistant manner for random walks. Two novel coupon processing mechanisms called Process Execution Time Synchronization (PETS) mechanism and Single Queue (SQ) mechanism are used to process the coupons and find matches. The use of PETS optimizes memory and time requirements while SQ is extremely fast and efficient to handle large volumes of coupons. Also, the coupon forwarding to neighbouring nodes is performed based on three algorithms namely Uniform, Delay and Adaptive Delay forward. These forwarding algorithms effect high fairness even in case of open networks.

Abstract: A system, method, and computer media are provided for operating an interactive virtual retirement tool, comprising inputting user information into a memory of a computer system related to a plurality of quantifiable life goal elements, receiving a selection of one of the life goal elements, generating display information for the selected life goal element along with: a) image data associated with a value of the selected life goal element, and b) an adjustment control associated with the selected life goal element that allows modifying a value associated with the selected life goal element, receiving an adjustment from the adjustment control to modify the value to a new value, obtaining new image data associated with the new value using a processor of the computer system, and generating display information for the new image data.

Abstract: A method may include receiving an indication that an electronic alert is to be transmitted to a user; obtaining contextual information associated with the user; determining a first time for presenting the electronic alert to the user based in part on the contextual information; transmitting the electronic alert to a computing device associated with the user at the first time; storing the electronic alert in a message feed data structure; receiving a request to view the electronic alert at a second time, the second time occurring after the first time; in response to the request, retrieving the electronic alert from the message feed data structure; and transmitting the electronic alert at the second time.

Abstract: The disclosed technology is generally directed to the patching of executing binaries. In one example of the technology, at separate times, a plurality of hot patch requests is received. Each hot patch request of the plurality of hot patch requests includes a corresponding hot patch to hot patch the executing binary. A cardinality of the plurality of hot patch requested is greater than the fixed number of logical patch slots. with the executing binary continuing to execute, each time a request to apply a hot patch to the executing binary is received, the corresponding hot patch is assigned to an inactive logical patch slot of the fixed number of logical patch slots. The corresponding hot patch is executed from the assigned logical patch slot to hot patch the executing binary based on the corresponding hot patch.

Abstract: Speculative side channels exist when memory is accessed by speculatively-executed processor instructions. Embodiments use uncacheable memory mappings to close speculative side channels that could allow an unprivileged execution context to access a privileged execution context's memory. Based on allocation of memory location(s) to the unprivileged execution context, embodiments map these memory location(s) as uncacheable within first page table(s) corresponding to the privileged execution context, but map those same memory locations as cacheable within second page table(s) corresponding to the unprivileged execution context. This prevents a processor from carrying out speculative execution of instruction(s) from the privileged execution context that access any of this memory allocated to the unprivileged execution context, due to the unprivileged execution context's memory being mapped as uncacheable for the privileged execution context.

Abstract: The embodiment herein provides a system and method for providing a novel leader election mechanism in distributed systems that is randomized in twin dimensions of space and time using the concept of a colliding random walk (CRW). Leader election is randomized in space in terms of the node identified as the leader and the time taken to identify the leader. A source node is enabled to generate left and right coupons in a quantum resistant manner for random walks. A novel fault tolerance mechanism is provided to identify several leaders for same set of coupons. In this system and method, the source vertex generates multiple CRWs for each piece of work that needs to be done. The fault tolerance mechanism reduces the time to collision, increases the number of leaders and also offers increased resilience and tolerance to faults.

Abstract: The embodiments herein provide a fair, high speed and lightweight consensus mechanism for leader election in distributed systems using coupons. The consensus mechanism uses a leader election mechanism that is randomized in twin dimensions of space and time using the concept of a colliding random walk. A source node is enabled to generate left and right coupons in a quantum resistant manner for random walks. Two novel coupon processing mechanisms called Process Execution Time Synchronization (PETS) mechanism and Single Queue (SQ) mechanism are used to process the coupons and find matches. The use of PETS optimizes memory and time requirements while SQ is extremely fast and efficient to handle large volumes of coupons. Also, the coupon forwarding to neighbouring nodes is performed based on three algorithms namely Uniform, Delay and Adaptive Delay forward. These forwarding algorithms effect high fairness even in case of open networks.

Abstract: The disclosed technology is generally directed to the patching of executing binaries. In one example of the technology, at separate times, a plurality of hot patch requests is received. Each hot patch request of the plurality of hot patch requests includes a corresponding hot patch to hot patch the executing binary. A cardinality of the plurality of hot patch requested is greater than the fixed number of logical patch slots. with the executing binary continuing to execute, each time a request to apply a hot patch to the executing binary is received, the corresponding hot patch is assigned to an inactive logical patch slot of the fixed number of logical patch slots. The corresponding hot patch is executed from the assigned logical patch slot to hot patch the executing binary based on the corresponding hot patch.

Abstract: Speculative side channels exist when memory is accessed by speculatively-executed processor instructions. Embodiments use uncacheable memory mappings to close speculative side channels that could allow an unprivileged execution context to access a privileged execution context's memory. Based on allocation of memory location(s) to the unprivileged execution context, embodiments map these memory location(s) as uncacheable within first page table(s) corresponding to the privileged execution context, but map those same memory locations as cacheable within second page table(s) corresponding to the unprivileged execution context. This prevents a processor from carrying out speculative execution of instruction(s) from the privileged execution context that access any of this memory allocated to the unprivileged execution context, due to the unprivileged execution context's memory being mapped as uncacheable for the privileged execution context.

Abstract: In embodiments of load balanced and prioritized data connections, a first connection is established to communicate first data from a first server to a second server over a public network, where the first data is communicated from a private network to a first device or subnet that is connected to the second server. A second connection is established to communicate second data from the first server to the second server over the public network, where the second data is communicated from the private network to a second device or subnet that is connected to the second server. The second server can distinguish the first data from the second data according to an authentication certificate field that identifies one of a first communication interface of the first connection or a second communication interface of the second connection.