Abstract: Methods for generating a characterizing summary and generating a collection of relevant preservation objects in a preservation system are provided. A characterizing summary is generated by collecting first information about a preservation object; collecting second information about other preservation objects or other metadata; generating a characterizing summary according to the first information and the second information; and adding the characterizing summary to the preservation object. A collection of relevant preservation objects is generated by accessing one or more preservation objects by way of one or more metadata included in a target preservation object constructed for content data; determining whether each of the accessed preservation objects is relevant to the target preservation object; adding each relevant preservation object to a list of relevant preservation objects; and generating the collection of relevant preservation objects according to the list of relevant preservation objects.

Abstract: A method for communication in a computing environment is provided. The method comprises transmitting a first data packet to one or more receiving units in a first set; receiving one or more acknowledgement messages (ACKs) from one or more receiving units in a second set, wherein the second set is a subset of the first set; removing the first data packet from a queue, in response to receiving at least one ACK from N receiving units within a time threshold; and re-transmitting the first data packet to the first set, in response to failing to receive at least one ACK from N receiving units within the time threshold.

Abstract: Systems and methods for solving a constraint satisfaction problem (CSP) defined by one or more variables, constraints and probabilistic requests (PRs) are provided. In one embodiment, each PR is mapped onto a set of constraints that implement the PR. The CSP solver then finds a series of solutions to the CSP. For each solution, if a constraint associated with a PR is satisfied, then a success counter for that PR is incremented; else a failure counter for that PR is incremented. If the constraint was not considered for the purpose of solving the CSP, then the failure counter for the PR associated with the constraint is incremented.

Abstract: Systems and methods for detecting a potential deadlock in a computing execution environment are provided. A plurality of locks taken during one or more test runs are monitored. A runtime identity and a code location for each of the plurality of locks are identified during each test run. One or more locks among the plurality of locks are classified as same locks based on the runtime identity and code location identified for each lock.

Abstract: A method for managing multiple values assigned to a variable during various stages of a software pipelined process executed in a computing environment. The method comprises allocating two or more slots in a vector register to two or more values associated with said variable during two or more stages of a pipeline process; and rotating values in each slot responsive to an instruction.

Abstract: A method for managing memory in a nested virtualization environment is provided. The method comprises implementing a first virtual machine (VM) for a first software such that a first guest memory is allocated to the first software; maintaining a first data structure to translate one or more memory addresses in the first guest memory to corresponding memory addresses in a physical memory; maintaining a second data structure to translate one or more memory addresses in the second guest memory to corresponding memory addresses in the physical memory. The first software implements a second VM for a second software such that a second guest memory is allocated to the second software and maintains a third data structure to translate one or more memory addresses in the second guest memory to corresponding memory addresses in the first guest memory.

Abstract: Some embodiments include, for example, devices, systems, and methods of classifying a workload of a software service. A method of classifying a workload of a software service may include, for example, sampling a plurality of values of at least one parameter of the software service by performing out-of-band monitoring of the at least one parameter; and classifying the workload of the software service by selecting a workload classification from a plurality of predefined workload classifications based on the plurality of values. Other embodiments are described and claimed.

Abstract: A method for managing communication between nodes in a virtual network is provided. A first computing system utilizes first information to forward first data to the second computing system in a physical network. If the first information is incorrect, the second computing system forwards an unlearning request to the first computing system, and the first computing system updates or deletes the first information. If the first information is not available, the first computing system forwards the first data to a group of computing systems in the physical network by way of a multicast service. Upon receiving the first data, the second computing system or a third computing system in the physical network forwards a learning request to the first computing system, and the first computing system utilizes the learning request to generate the first information.

Abstract: A method for transmitting data in a communications network is provided. The method comprises identifying a first data packet associated with a first transmission priority, wherein the first data packet encapsulates a plurality of messages designated for transmission to a destination; adding one or more additional messages to a second data packet associated with a second transmission priority to more optimally utilize capacity of the second data packet to encapsulate a plurality of messages, while the first data packet is being finalized for transmission, wherein the second transmission priority is less than the first transmission priority; and transmitting the first data packet before transmitting the second data packet.

Abstract: A method uses a SAT solver operating to cycle k to find bugs in a model having finite computation paths therein, wherein said bugs are on computation paths of less than length k. Another method includes adding an additional state variable to a model to be checked, where a governing state machine of the additional variable has a “sink” state. The method includes having a translation using the additional variable whenever a state indicates a bad state and performing satisfiability solving with the model and the translation.

Abstract: A computer implemented method is disclosed, for energy-saving operation of a storage device with a read/write head. The method includes monitoring workload of the storage device, calculating current mean workload and adjusting seek speed of the read/write head of the storage device to one of a plurality seek speeds depending on the calculated current mean workload. The step of adjusting the seek speed of the read/write head includes adjusting the seek speed of the read/write head to be a first seek speed if the calculated current mean workload is below a first threshold, adjusting the seek speed of the read/write head to be a second seek speed if the calculated current mean workload is between the first threshold and a second threshold, and adjusting the seek speed of the read/write head to be the first seek speed if the calculated current mean workload is greater than the second threshold. A computer program product and a data processing system are also disclosed.

Abstract: A method for detecting the occurrence of rare events in an executable logic code includes assigning a first probability of a chance of traversal of one or more decision paths, in which each path connects two decision points defined by execution of the logic code. As a result of execution of the logic code, the decision paths traversed are evaluated to determine whether said traversal conforms to a predefined performance function. The performance function defines a goal to be achieved pursuant to the execution of the logic code. A second probability is assigned to the chance of traversal of at least one of said one or more decision paths to increase the likelihood that the one or more decision paths are traversed in a subsequent execution of the logic code in a closer conformity with the predefined performance function.

Abstract: Systems and methods for optimizing performance in a computing environment are provided. The system comprises means for monitoring execution of annotated logic code associated with a software component to determine whether a condition has been satisfied, wherein annotations in the logic code provide one or more details about the software component, the details being useful to a healing agent to correct a problem associated with said condition during the execution of the logic code.

Abstract: A method, system and computer program product for storing transient state information, the method includes: defining a first logical storage space within at least one storage device in response to at least one characteristic of a processing system logical memory space utilized for storing current transient state information of the processing system; repetitively storing current transient state information at a logical location within the first logical storage space that corresponds to a logical location of the current transient state information within the processing system logical memory space and storing, within a second logical storage space, previous transient state information.