The technology disclosed herein enables migrating a software build job from a first computing node to a second computing node. An example method may comprise detecting, by a processor, a first software build job executing on a first computing node; detecting a second software build job in a waiting state; determining that the first computing node is capable of executing the second software build job; responsive to determining that a second computing node is capable of executing the first software build job, migrating the first software build job to the second node; and executing the second software build job on the first node.

One or more information processing apparatuses to process information are provided. The information processing apparatus includes: a division function that divides processing information into a plurality of pieces, under a division condition that designates parallel processing among the information processing apparatuses, the processing information indicating a data processing procedure from a plurality of start points to one or more end points; a determination function that uniquely determines an assignee of each piece of the processing information divided by the division function, as any of the information processing apparatuses; and an execution function that executes a process in the information processing apparatus determined by the determination function.

According to one embodiment, a program executing apparatus includes an event management portion to configure migration timing of the program on the basis of a state of the program being executed at reception of a migration request from the program, and a state transmission portion to migrate state information of the program on the basis of the migration timing configured in the event management portion.

Technologies for batching requests in an edge infrastructure include a compute device including circuitry configured to obtain a request for an operation to be performed at an edge location. The circuitry is also configured to determine, as a function of a parameter of the obtained request, a batch that the obtained request is to be assigned to. The batch includes a one or more requests for operations to be performed at an edge location. The circuitry is also configured to assign the batch to a cloudlet at an edge location. The cloudlet includes a set of resources usable to execute the operations requested in the batch.

Embodiments directed toward a method, and a system. A method can be directed toward deciding whether to accept a virtual machine migration on a host. The method can include receiving a request to host a migrated virtual machine. The method can include determining if the host is overcommitted. The method can include selecting a low priority virtual machine in response to the host being overcommitted. The method can include determining if a resource for the low priority virtual machine can be reduced to accommodate the migrated virtual machine. The method can include reducing the resources for the low priority virtual machine in response to the resources being able to be reduced. The method can include accepting the request to host the migrated virtual machine in response to the reduction of the resources.

A graph-based program specification includes components corresponding to tasks and directed links between ports of the components, including: a first type of link configuration defined by respective output and input ports of linked components, and a second type of link configuration defined by respective output and input ports of linked components. A compiler recognizes different types of link configurations and provides in a target program specification occurrences of a target primitive for executing a function for each occurrence of a data element flowing over a link of the second type. A computing node initiates execution of the target program specification, and determines at runtime, for components associated with the occurrences of the target primitive, an order in which instances of tasks corresponding to the components are to be invoked, and/or a computing node on which instances of tasks corresponding to the components are to be executed.

A method, including receiving a request to migrate an executing application (34) that includes a library (42) having functions (46) configured to generate a log (92) tracking library resources (106). Upon suspending the application while the library has a current state (160), the library is unloaded from memory (24), and upon unloading the library, any pending resources allocated to the library are identified. The identified resources are deallocated so as to define a cleaned version of the application that does not include any of the allocated resources, and the cleaned version of the application is migrated to a destination machine (180). Execution of the migrated application is resumed on the destination machine so as to link the migrated application to an additional instance of the library, and the log is replayed so as to bring the linked additional instance of the library on the destination machine to the current state.

In a network of mobile agents, data integrity can be improved by providing an agent server that can migrate between devices operating in the region of interest (ROI). The agent server distributes agent clients onto devices in the ROI and provides agent server services to the agent clients, including receiving and storing data from the agents. When the agent server device is to leave the ROI, the agent server can migrate to any device executing an agent client and continue to provide the agent server services, including data collection and aggregation, from the device to which the agent server has migrated.

Methods and systems for implementing a highly available distributed queue using replicated messages are disclosed. An enqueue request is received from a client at a particular queue host of a plurality of queue hosts. The enqueue request comprises a message and a replica count greater than one. One or more copies of a replication request are sent from the particular queue host to one or more additional queue hosts. The replication request comprises the message. The quantity of copies of the replication request is determined based at least in part on the replica count. An initial replica of the message is enqueued at the particular queue host. One or more additional replicas of the message are enqueued at the one or more additional queue hosts. A quantity of the one or more additional replicas is determined based at least in part on the replica count.

The disclosed techniques may employ components referred to herein as atoms for computing and maintaining of states. Unlike traditional actors, atoms may be capable of binding to other atoms to form a bound combination of atoms, referred to herein as a molecule. In some examples, while bound to other atoms, an atom may operate in a manner that is different from traditional actors. For example, in some cases, atoms that are bound to one another may be prohibited from concurrently performing different operations on their own separate states. Additionally, bound atoms may be operable to collectively (e.g., synchronously) perform shared operations on their associated states. Furthermore, a shared operation performed on the states of bound atoms may be performed atomically. Also, in some examples, bound atoms may be capable of communicating synchronously with one another and of synchronously accessing each other's states.