Abstract: A method and apparatus for data driven and cluster specific version/update control. The apparatus includes an automated multi-clusters management apparatus that interfaces with a plurality of remote clusters to provide data driven version/update control on a cluster by cluster basis. Generally, operation includes collection/identification of cluster specific data pertaining to software, hardware, and cluster requirements. The cluster specific data is later compared/analyzed against multi-cluster data pertaining to software releases, hardware characteristics, and known bugs/issues for each. The results of the comparison/analysis can then be ranked according to various metrics to different possible solutions and to differentiate the less desirable results from the more desirable results. Thus, the automated multi-cluster management apparatus provides for selection of versions/updates that is dependent on the cluster specific data.

Abstract: A computer system includes one or more processors, one or more hardware accelerators, and control circuitry. The processors are configured to run software that executes tasks in a normal mode. The accelerators are configured to execute the tasks in an accelerated mode. The control circuitry is configured to receive one or more flows of tasks for execution by the processors and the accelerators, assign one or more initial tasks of each flow for execution by the processors, assign subsequent tasks of each flow for execution by the accelerators, and verify, for each flow, that the accelerators do not execute the subsequent tasks of the flow until the processors have fully executed the initial tasks of the flow.

Abstract: Some embodiments provide a program. The program receives through an application operating on the mobile device a request for a set of visualizations of data. The program further determines a version of application resources to use for generating the set of visualizations of data. Based on the version of application resources, the program also determines whether a set of application resources having the version is included in the application. Upon determining that the set of application resources having the version is included in the application, the program further uses the set of application resources to generate the set of visualizations of data. Upon determining that the set of application resources having the version is not included in the application; the program also retrieves the set of application resources from a computing system and using the retrieved set of application resources to generate the set of visualizations of data.

Abstract: Methods and systems for building an optimized image for an application are provided. An operating system is decomposed into granular modules. An initial configuration file to a build system is provided. The build system builds an initial image including initial modules for the application based on the initial configuration file. A monitoring system monitors performance indicators for the initial image. Using a machine learning algorithm, a subsequent configuration file based on the performance indicators is derived. The build system, builds a subsequent image for the application.

Abstract: According to one embodiment, a setting information file set in a reference information processing device is acquired in a management device, and a specific designatable item in the setting information file set by the reference information processing device is edited. An instruction describing an automatic setting procedure to be executed by a target information processing device is generated. A setting information file identified by an acquisition request received from the target information processing device is sent to the target information processing device in response to the acquisition request, the target information processing device sending the acquisition request in response to execution of the automatic setting procedure instruction by the target information processing device.

Abstract: Computer systems and methods for: (1) analyzing electronic correspondence associated with a data subject (e.g., the emails within one or more email in-boxes associated with the data subject); (2) based on the analysis, identifying at least one entity that that the data subject does not actively do business with (e.g., as evidenced by the fact that the data subject no longer opens emails from the entity, and/or has set up a rule to automatically delete emails received from the entity); and (3) in response to identifying the entity as an entity that the data subject no longer does business with, at least substantially automatically populating and/or submitting a data subject access request to the entity (e.g., to delete all personal information being processed by the entity).

Abstract: Techniques are described herein for automatic generation of multi-source breadth-first search (MS-BFS) from high-level graph processing language that can be executed in a distributed computing environment. In an embodiment, a method involves a computer analyzing original software instructions. The original software instructions are configured to perform multiple breadth-first searches to determine a particular result. Each breadth-first search originates at each of a subset of vertices of a graph. Each breadth-first search is encoded for independent execution. Based on the analyzing, the computer generates transformed software instructions configured to perform a MS-BFS to determine the particular result. Each of the subset of vertices is a source of the MS-BFS. In an embodiment, the second plurality of software instructions comprises a node iteration loop and a neighbor iteration loop, and the plurality of vertices of the distributed graph comprise active vertices and neighbor vertices.

Abstract: A method and system are for deploying a software application. The software application is deployed in a default deployment configuration onto a computing system. The default deployment configuration includes interacting software components of the software application. It is ascertained, from one or more operating indicators of an execution environment of the software application, that a critical condition of the execution environment exists. In response to having ascertained that the critical condition of the execution environment exists, an alternative deployment configuration is selected from one or more alternative deployment configurations of the software application, each alternative deployment configuration having one or more groups of the software components aggregated into corresponding aggregated software components. The software application is re-deployed in the selected alternative deployment configuration onto the computing system.

Abstract: A system including a master machine and a plurality of worker machines is disclosed. The master machine includes, for example, an API server configured to receive a job description; a resource allocation module configured to determine a number of virtual machines required to perform a job based on the job description; a container scheduling module configured to create a container containing the number of virtual machines required to perform the job, wherein at least two of the virtual machines in the container resides on different worker machines, and wherein each of the virtual machines is configured to run a same application to perform the job.

Abstract: An information processing system includes a memory and processors. The memory stores flow information and flow-identification information for each process sequence performed by using electronic data. The flow information defines program-identification information identifying programs for executing the process sequence, and an execution order of the programs. The processors execute computer-executable instructions stored in the memory to execute a process including accepting a request including information relating to the electronic data and the flow-identification information, from a device coupled to the system; acquiring the flow information associated with the flow-identification information included in the request, from the memory; and executing the process sequence using the electronic data based on the information relating to the electronic data, by executing the programs identified by the program-identification information defined in the acquired flow information, in the execution order.

Abstract: In an embodiment, a computer-implemented method for improving computer processing efficiency comprises using a main processing thread, in response to detecting an error in one or more function calls, tracing the one or more function calls at runtime and collecting stack trace data; and using a background processing thread, generating and displaying a function call tree based on the stack trace data.

Abstract: Techniques are disclosed relating to identifying types of user interface components based on one or more existing user interfaces. The disclosed techniques may include, for example, determining a plurality of visible elements of a graphical user interface, based on user interface code. Additionally, techniques include determining coordinates for bounding boxes for ones of the plurality of visible elements, based on the user interface code. Disclosed techniques may also include grouping the visible elements into at least first and second groups and determining types of elements within the first and second groups. The techniques also include, in response to detecting a match between the types of elements within the first and second groups, determining a similarity metric for the first and second groups based on the coordinates of determined bounding boxes within the first and second groups.

Abstract: In embodiments of the present invention improved capabilities are described for modifying a workflow condition including displaying a workflow component through a graphical user interface, where the workflow component includes at least one visual depiction of a function associated with the workflow component; and changing a representational view of the workflow component from a first representational level to a second representational level when a detail level selector is changed.

Abstract: Expressly turning tracing on and off at each juncture between code that a developer wants to have traced and other code may reduce trace file size but adds computational cost. Described technologies support selectively tracing a process's execution, with some extra tracing done beyond the code the developer wanted traced, but with significantly reduced computational cost, by reducing the number of trace enablement and disablement operations. A trace controller uses a tracing disablement distance variable whose values indicate the computational distance from trace disablement. A distance variable modifier automatically moves the distance variable closer to a stop-tracing value as the process executes. The amount of extra tracing is balanced against the reduction in trace enablement/disablement operations by tuning thresholds, based on information about routine size and computational cost.

Abstract: Described technologies support selectively tracing a process's execution, with some extra tracing done beyond the code the developer wanted traced, but with significantly reduced computational cost, by reducing the number of trace enablement and disablement operations. A trace controller uses a tracing disablement distance variable whose values indicate the computational distance from trace disablement. A distance variable modifier automatically moves the distance variable closer to a stop-tracing value as the process executes. A create task function is modified to include the setting of an indicator that a newly created task is to be traced if a current task or thread is being traced. An execute task function is modified to request the tracing of the newly created task when it is executed based on the indicator, thereby enabling selective tracing that operates across process boundaries and traces asynchronous code execution.

Abstract: Methods, apparatus, and processor-readable storage media related to an enterprise services framework for presentation layer management are provided herein. An example computer-implemented method includes representing user interface components related to an application in a pre-determined format, wherein the pre-determined format uses text to represent data objects; creating a first version of the application by embedding, in response to one or more user inputs, one or more of the user interface components into a design space of a presentation layer of an enterprise services framework; updating, in accordance with the embedding of the one or more user interface components into the design space, a schema associated with the multiple user interface components represented in the pre-determined format; and dynamically outputting one or more subsequent versions of the application based at least in part on the updated schema.

Abstract: A device to be utilized for testing a program is connected to a device host operating in a service provider network via a peripheral bus. A network connection is established between a testing host, which might be a virtual machine, and the device host using a peripheral-bus-over-network-protocol. A secure network connection is established between the developer computing device and the testing host. A network port utilized by a debugging client application executing on the developer computing device is forwarded to the testing host over the secure network connection. Data packets generated by the debugging client application executing on the developer computing device are forwarded to a debugging server application execution on the testing host. Peripheral devices (e.g. the requested device) accessible to the testing host can then be utilized by the developer computing device for testing execution of the program as if the device were locally connected thereto.

Abstract: A method and system for thread aware, class aware, and topology aware memory allocations. Embodiments include a compiler configured to generate compiled code (e.g., for a runtime) that when executed allocates memory on a per class per thread basis that is system topology (e.g., for non-uniform memory architecture (NUMA)) aware. Embodiments can further include an executable configured to allocate a respective memory pool during runtime for each instance of a class for each thread. The memory pools are local to a respective processor, core, etc., where each thread executes.

Abstract: A computer-implemented method includes generating static analysis data by performing static analysis on a program. A breakpoint is set in the program automatically, by a computer processor, based on the static analysis data. The breakpoint is hit during a runtime of the program. A program bug is automatically identified at a context location of the breakpoint when the breakpoint is hit during the runtime of the program. An interactive debugging session of the program is launched automatically at the context location of the breakpoint, based on the identifying the program bug.

Abstract: A method and system including two or more virtual machines; a load balancer module; a load balancer processor in communication with the load balancer module and operative to execute processor-executable process steps to cause the system to: initiate an application integration component; create a set of one or more integration steps to transfer data between a cloud-based application and a second application; receive selection of an element of a virtual machine; broadcast a current state of each virtual machine to the other virtual machines; determine which of the two or more virtual machines has a pre-set amount of the selected element; retrieve a mutual exclusion component, wherein the mutual exclusion component is retrieved by the virtual machine determined to have the pre-set amount of the selected element; and execute the integration steps at the virtual machine that retrieved the mutual exclusion component. Numerous other aspects are provided.