Abstract: A method for software processing includes obtaining change information, which records changes that have been performed in respective locations in software code. The change information is processed so as to assign to at least some of the locations respective priorities, which are indicative of respective likelihoods that the locations contain program faults. The at least some of the locations are presented to a user in accordance with the assigned priorities.

Abstract: A coverage analysis tool may determine coverage in respect to heterogeneous coverage tasks associated with different hierarchy levels of a tasks hierarchy. The coverage analysis tool may iteratively refine coverage tasks to determine coverage of sub-tasks. In some cases, coverage tasks may be unrefined in order to reduce overhead of coverage analysis in performance of the software under test, such that the software under test may perform in an essentially similar manner as in non-testing mode.

Abstract: A coverage analysis tool may determine coverage in respect to heterogeneous coverage tasks associated with different hierarchy levels of a tasks hierarchy. The coverage analysis tool may iteratively refine coverage tasks to determine coverage of sub-tasks. In some cases, coverage tasks may be unrefined in order to reduce overhead of coverage analysis in performance of the software under test, such that the software under test may perform in an essentially similar manner as in non-testing mode.

Abstract: An apparatus, program product and method guarantee a period of time in which a partition's use of a resource will not be preempted by a hypervisor. An inquiry communication from the partition prompts the hypervisor to determine if work is pending for the hypervisor. If not, the hypervisor sends a guarantee response ensuring the period of uninterrupted use of the resource by the partition.

Abstract: Provided is a method, system, deployment and program for resource allocation unit queuing in which an allocation unit associated with a task is classified. An allocation unit freed as the task ends is queued for use by another task in a queue at a selected location within the queue in accordance with the classification of said allocation unit. In one embodiment, an allocation unit is queued at a first end of the queue if classified in a first class and is queued at a second end of the queue if classified in said second class. Other embodiments are described and claimed.

Abstract: A method for transferring data over a network operating in accordance with a protocol, such as the ESCON protocol, that supports a limited logical address range includes establishing a logical path over the network from a host or other device to a second device, such as a storage system, using path logical addresses within the given logical address range. A virtual path is created over the logical path to carry the data from the source to the target, wherein the target logical subsystem has a subsystem logical address which is outside the given logical address range.