Abstract: In a sequence of major computational steps or in an iterative computation, a stencil amplifier can increase the number of data elements accessed from one or more data structures in a single major step or iteration, thereby decreasing the total number of computations and/or communication operations in the overall sequence or the iterative computation. Stencil amplification, which can be optimized according to a specified parameter such as compile time, run time, code size, etc., can improve the performance of a computing system executing the sequence or the iterative computation in terms of run time, memory load, energy consumption, etc. The stencil amplifier typically determines boundaries, to avoid erroneously accessing data elements not present in the one or more data structures.

Abstract: Technical solutions are described for machine-assisted workflow execution. An example method includes selecting a workflow for interactive execution, the workflow including a sequence of workflow steps. The method further includes pulling a preliminary update for the workflow from a data source and modifying the workflow dynamically. The method further includes selecting a workflow step from the workflow for execution, and pulling updated information for the workflow step from the data source. The method further includes executing the workflow step using the pulled updated information, the execution includes changing a target system. The method further includes accumulating execution information including attributes associated with execution of the workflow step, and pushing the execution information to the data source upon completion of the workflow step.

Abstract: Novel tools and techniques might provide for implementing communications between two or more virtual machines (“VMs”) and client devices coupled to one or more ports. In some embodiments, an orchestration agent running on a host computing system might configure, using a VM-to-Port driver, a physical port of the host device to establish two or more virtual ports associated with the physical port, and might map, using the VM-to-Port driver, each of two or more VMs running on the host computing system with corresponding each of the two or more virtual ports. When a client device is communicatively coupled to the physical port, the orchestration agent might map, using the VM-to-Port driver, each of the two or more VMs with one or more functions of the client device via corresponding each of the two or more virtual ports associated with the physical port to which the client device is communicatively coupled.

Abstract: Type safety is important property of any type system. Modern programming languages support different mechanisms to work in type safe manner, e.g., properties, methods, events, attributes (annotations) and other structures, but none of the existing, general purpose, programming languages which support reflection provide type safe type (class/structure) member metadata access. Existing solutions provide no or limited type safety which are complex and processed at runtime which by definition is not built-in type-safe metadata access, but only more or less type safe workarounds called “best practices”. Problem can be solved by introducing method for type safe type member metadata access which could be processed at compile time.

Abstract: Disclosed methods, systems, and apparatus, include computer programs encoded on computer storage media, for performing allocation of M resources among N users into K pools by solving a knapsack problem (KP) using a distributed computing system. The method includes: receiving data representing K global constraints and L local constraints of the KP; transforming the KP into a dual problem using K dual multipliers; decomposing the dual problem into N sub-problems; performing two or more iterations in solving the dual problem, wherein in one iteration, for each dual multiplier corresponding to a global constraint corresponding to a pool: determining an updated dual multiplier for the global constraint corresponding to the pool to be a non-negative threshold; and computing M decision variables of each of the N users corresponding to the updated dual multiplier in solving each of the N sub-problems corresponding to the each of the N users.

Abstract: Software packages may be installed, uninstalled and/or updated across a group of computing instances by way of a single issuance of a user request. The request may include information such as a software package name, a software package version, an action (e.g., install or uninstall), and one or more operating constraints for the software package. For an installation request, an agent on a given computing instance may process the request by accessing a manifest that indicates various computing instance characteristics (e.g., operating system types, architecture types, etc.) and various respective available versions of the software package. The agent may then select, based on characteristics of the computing instance, a package type for the computing instance. An installation request may also allow operating constraints (e.g. regarding usage of processing, memory, I/O and other resources) to be set and enforced for the software package.

Abstract: Aspects of the present invention include a method, system and computer program product determining, scoring and reporting the complexity of customer and test environments and workloads. The method includes a processor performing an accounting of factors related to complexity of a plurality of environments and workloads; determining one or more formulas to use for determining an overall score and ranking for each one of the plurality of environments and workloads; collecting relative environment and workload data; determining a complexity score for each one of the plurality of environments and workloads; and determining a complexity ranking for each one of the plurality of environments and workloads.

Abstract: A system monitors a batch process performed locally or remotely by reading output logs of the batch process during and after execution of the batch process. The system determines a baseline execution duration for the batch process based on previous runs of the batch process on a set of data. Subsequent runs of the batch process are monitored by reading an output log file while the batch process is executing. A buffer time, corresponding to a time range, is added to the baseline execution duration to produce an alert threshold. The system generates alerts and sends the alerts to a messaging system in response to the current execution duration exceeding the alert time.

Abstract: A system for managing the end to end lifecycle of a virtualization environment within an appliance includes a set of installation tools and an administration portal. A reference architecture for an appliance defines technology layers of an appliance. A partner ecosystem defines a delivery model of an appliance to a customer. A setup wizard tool is installing and configuring management software components, infrastructure software components, and application images on an appliance. An environment management module completes the installation and configuration of the management software components of a virtualization environment and provides ongoing management of the infrastructure software and management software components. An image management module stores the configuration of the application images and provides ongoing management of the application images. A catalog management module maintains a library of the application images.

Abstract: A method and associated computer program product are disclosed for generating an executable file from an object file, the object file being associated with an architecture having a predefined calling convention designating one or more call-clobbered registers. The method comprises identifying, from a first annotation included in the object file with a function call instruction, at least one restore instruction that follows the function call instruction, the function call instruction associated with a predefined function of the object file. The at least one restore instruction corresponds to at least one of the one or more call-clobbered registers. The method further comprises determining, based on at least a first list of registers that are referenced by the predefined function, the first list being included in the object file, whether to eliminate the at least one restore instruction.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for adding transaction data into a blockchain are provided. One of the methods includes: obtaining transaction data to be added into the blockchain, assigning the transaction data into transaction subsets, and executing the transaction subsets in parallel, and storing results of the execution into the blockchain. Pieces of the transaction data having at least one of: a same transaction type or an overlapping scope of data change are assigned into a same transaction subset, and pieces of the transaction data with different transaction types and with no overlapping scope of data change are assigned into different transaction subsets.

Abstract: An apparatus and method are provided for scheduling graph computing on heterogeneous platforms based on energy efficiency. A scheduling engine receives an edge set that represents a portion of a graph comprising vertices with at least one edge connecting two or more of the vertices. The scheduling engine obtains an operating characteristic for each processing resource of a plurality of heterogeneous processing resources. The scheduling engine computes, based on the operating characteristics and an energy parameter, a set of processing speed values for the edge set, each speed value corresponding to a combination of the edge set and a different processing resource of the plurality of heterogeneous processing resources. The scheduling engine identifies an optimal processing speed value from the set of computed speed values for the edge set.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for adding transaction data into a blockchain are provided. One of the methods includes: obtaining transaction data to be added into the blockchain, assigning the transaction data into transaction subsets, and executing the transaction subsets in parallel, and storing results of the execution into the blockchain. Pieces of the transaction data having at least one of: a same transaction type or an overlapping scope of data change are assigned into a same transaction subset, and pieces of the transaction data with different transaction types and with no overlapping scope of data change are assigned into different transaction subsets.

Abstract: Aspects of the present invention include a method, system and computer program product for determining, scoring and reporting the portability of customer and test environments and workloads. The method includes a processor performing an accounting of factors related to portability of a plurality of environments and workloads; determining one or more formulas to use for determining an overall score and ranking for each one of the plurality of environments and workloads; collecting relative environment and workload data; determining a portability score for each one of the plurality of environments and workloads; and determining a portability ranking for each one of the plurality of environments and workloads.

Abstract: Aspects of the present disclosure involve systems and methods for the automatic packaging and deployment of virtual machines in a virtual environment. More particularly, the disclosure involves a system that automatically packages two virtual machines, a console virtual machine and a template virtual machine, in a virtual application. The template virtual machine initiates communication with the console virtual machine to generate multiple virtual machine instances.

Abstract: Embodiments perform automatic selection of hosts and/or datastores for deployment of a plurality of virtual machines while monitoring and recovering from errors during deployment. In one example, an application can determine an optimized host list of computing devices for placing one or more virtual machines. The application can monitor a load of execution threads for overloading. Virtual machines can be deployed on a computing device from the optimized host list. The application can determine that a deployed task executed on one of the deployed virtual machines has failed and redeploy the associated virtual machine to another computing device on the optimized host list.

Abstract: Systems and methods provide an extensible, multi-stage, realtime application program processing load adaptive, manycore data processing architecture shared dynamically among instances of parallelized and pipelined application software programs, according to processing load variations of said programs and their tasks and instances, as well as contractual policies. The invented techniques provide, at the same time, both application software development productivity, through presenting for software a simple, virtual static view of the actually dynamically allocated and assigned processing hardware resources, together with high program runtime performance, through scalable pipelined and parallelized program execution with minimized overhead, as well as high resource efficiency, through adaptively optimized processing resource allocation.

Abstract: A computer-implemented method for dynamic workload bucket reassignment in a system processor includes grouping a plurality of like workloads together via a common workload attribute. The processor calculates an aggregate use of a resource across all of the workloads, and creates a finite number of buckets. The processor then assigns a target resource use for each of the finite number of buckets, and assigns workloads with a same workload attribute value to a bucket of the finite number of buckets. The workload attribute values are distributed across a plurality of the finite number of buckets such that each bucket has a unique nonintersecting range and an aggregate workload resource use in each bucket near a bucket target resource use.

Abstract: Example methods, apparatuses, and systems are presented for a software code debugger tool. The code debugger tool may be configured to access source code intended to be examined for debugging. The debugger tool may compile the source code using a specially designed compiler that incorporates state recording functionality and other debugging functionality directly into the source code. When the source code is executed, the debugging tool may be configured to record a plurality of states that the application progresses through upon executing the application. The debugger tool can read recorded states while the application runs or after its execution. Various visual indicators may also provide additional annotations to aid in debugging, such as displaying the content of variables in a visual annotation showing their historical values, and providing a temporal status indicator to provide context to the user about what the present state represents in relation to specific functions in the source code.

Abstract: Aspects of the present invention include a method, system and computer program product for more accurately porting a customer or test workload. The method includes a processor acquiring relative customer or test workload and environment data for determining portability feasibility; determining workload and environment portability scores and rankings; comparing a current workload and environment to previously ported workloads and workload port analyses; determining which workload components may be ported; determining actual workload portability feasibility; generating one or more agile workload portability data reports that indicate which workload components are candidates for agile porting; and determining to not provide for viewing a summary of the actual workload portability feasibility or the one or more agile workload portability data reports.