Abstract: A method, system, and computer program product for computer-aided software application development. A synthesizer commences upon receiving a mobile device identifier and additional information such as an application identifier, an object model, and/or a form identifier, then analyzing the additional information to determine what form(s) to implement on the mobile device. Further synthesis processing includes analyzing the forms to determine a set of functions to implement on the identified mobile device. Using the determined set of functions, native application code modules are retrieved from a repository. The retrieved native application code modules correspond to the set of functions. The code modules are integrated together to generate a native mobile application, which can be deployed to a mobile device. Messages from the mobile device are intercepted so as to emulate form processing of a back-end application. Any back-end applications that use the form can be accessed by the native mobile application.

Abstract: A method includes, in a processor, receiving first and second operations for periodic execution with respective specified time periods. Respective actual time periods having no common divisor are derived from the specified time periods. The first and second operations are executed periodically with the respective actual time periods.

Abstract: A set of source files is stored in a shared storage repository for nodes of a distributed computing environment for software compilation. An object file is created based on at least a portion of the set of source files. A directed acyclic graph (DAG) is generated corresponding to a group of software build tasks and the relationship between the software build tasks based on the set of source files. A replication factor for the object file is determined based on the number of relationships of the object file identified from the DAG. The object file is stored in a local memory cache of at least one of the number of the nodes, wherein the number of the nodes is based on the replication factor for the object file.

Abstract: Systems and methods are provided for enlisting single phase commit resources in a two phase commit transaction. An exemplary method includes accessing a global transaction having a plurality of processes requiring single phase commit (1PC) resource and a two phase commit (2PC) resource, initializing a 1PC resource manager for the 1PC resource with a first process of the plurality of processes, wherein the first process requires the 1PC resource, preparing a 2PC resource manager for the 2PC resource with a second process of the plurality of processes, wherein the second process requires the 2PC resource, generating a unique identifier for the 1PC resource, transmitting the unique identifier to the 1PC resource manager, and instructing the 1PC resource manager to commit the first process to the 1PC resource, wherein committing the first process to the 1PC resource comprises recording the unique identifier to the 1PC resource.

Abstract: A set of source files is stored in a shared storage repository for nodes of a distributed computing environment for software compilation. An object file is created based on at least a portion of the set of source files. A directed acyclic graph (DAG) is generated corresponding to a group of software build tasks and the relationship between the software build tasks based on the set of source files. A replication factor for the object file is determined based on the number of relationships of the object file identified from the DAG. The object file is stored in a local memory cache of at least one of the number of the nodes, wherein the number of the nodes is based on the replication factor for the object file.

Abstract: A computer-implemented method of controlling version branching within a software configuration management system (SCMS) can include, responsive to a user initiating a check-out operation of a file within the SCMS, identifying the file and a workspace of the user and searching nodes of the repositories of the SCMS for a successor version of the file. When a successor version of the file is located within a node that is within a predetermined distance of the workspace of the user, a notification that the successor version of the file is within the predetermined distance of the workspace of the user can be output. When a successor version of the file is not located within a node within a predetermined distance of the workspace of the user, the file can be checked-out to the workspace of the user.

Abstract: A method for controlling a network interface controller (NIC). The method includes receiving, by a host operating system (OS) executing on a computer system, an instruction to map the NIC virtual function (VF) to a first virtual machine executing on the computer system. The method further includes allocating, according to the NIC VF, first NIC resources on a physical NIC operatively connected to the computer system, mapping the NIC VF to the first virtual machine, creating, in the host OS, a shadow virtual NIC for the first NIC resources allocated to the NIC VF, assigning the shadow virtual NIC to the first virtual machine, receiving, by the physical NIC, a first packet targeting the first virtual machine, and sending the first packet directly to the first virtual machine.

Abstract: Techniques for specifying and implementing a software application targeted for execution on a multiprocessor array (MPA). The MPA may include a plurality of processing elements, supporting memory, and a high bandwidth interconnection network (IN), communicatively coupling the plurality of processing elements and supporting memory. In one embodiment, software code may include first program instructions executable to perform a function. In this embodiment, the software code may also include one or more language constructs that are configurable to specify one or more communication ports and one or more parameter inputs. In this embodiment, the one or more communication ports are configurable to specify communication with other software code. In this embodiment, the one or more parameter inputs are configurable to specify a set of hardware resources usable to execute the software code. In this embodiment, the hardware resources include multiple processors and may include multiple supporting memories.

Abstract: Specifying a dataflow graph includes: rendering, in a first user interface, a representation of a first dataflow graph. At least one component represents a computation associated with at least one of data flowing into an input port or data flowing out of an output port. A link between components is rendered based on user input indicating a flow of data. In a second user interface, a representation of a sub-graph of the first dataflow graph is rendered. A first flow junction represents a connection between: (1) a flow of data outside the sub-graph interface, and (2) a flow of data inside the sub-graph interface. A link is rendered between the first flow junction and a second flow junction based on user input indicating a relationship between a first descriptor and a second descriptor.

Abstract: The techniques described herein provide software testing of a candidate software system. In some examples, an interceptor intercepts at least one production request to a production software system. The duplicating proxy service causes the at least one intercepted request to be processed by the candidate software system being validated and the production software system being used to validate the candidate software system. The duplicating proxy service may then compare and/or analyze at least one candidate response to the intercepted request from the candidate software system and at least one production response to the intercepted request from the production software system.

Abstract: A method, system, apparatus, computer program product, and computer readable storage medium provide the ability to define an object in a parametric modeling application. Geometric parametric objects are authored and organized into a family definition. Via a user interface, enhanced computational logic is defined. The logic is compiled into the family definition such that the enhanced computational logic is embedded at an object level of the one or more geometric parametric objects. Upon a building information model requiring a regeneration operation, the compiled enhanced computational logic is automatically executed.

Abstract: When an OpenCL kernel is to be executed, a bitfield index representation to be used for the indices of the kernel invocations is determined based on the number of bits needed to represent the maximum value that will be needed for each index dimension for the kernel. A bitfield placement data structure 33 describing how the bitfield index representation is partitioned is then prepared together with a maximum value data structure 32 indicating the maximum index dimension values to be used for the kernel. A processor then executes the kernel invocations 36 across the index space indicated by the maximum value data structure 32. A bitfield index representation 35, 37, 38 configured in accordance with the bitfield placement data structure 33 is associated with each kernel invocation to indicate its index.

Abstract: A system decouples the source code language from the eventual execution environment by compiling the source code language into a unified intermediate representation that conforms to a language model allowing both parallel graphical operations and parallel general-purpose computational operations. The intermediate representation may then be distributed to end-user computers, where an embedded compiler can compile the intermediate representation into an executable binary targeted for the CPUs and GPUs available in that end-user device. The intermediate representation is sufficient to define both graphics and non-graphics compute kernels and shaders. At install-time or later, the intermediate representation file may be compiled for the specific target hardware of the given end-user computing system.

Abstract: A method and an apparatus for providing a flat array type in an object model for dynamically typed programs are described. Whether an array object is of a flat array type can be dynamically tracked for a dynamic language based program. Array elements of an array object of the flat array type may be stored in an inline storage within an object cell of the array object. The inline storage may be limited by available memory space between adjacent object cells. The flat array type of an array object may be detected based on whether the inline storage has sufficient memory space to store elements of the array. An array object of the flay array type may allow array elements of the array object to be accessed within a object cell without additional memory loading via a pointer stored in the object cell.

Abstract: In accordance with various embodiments, systems and methods are provided which facilitate composing a telecommunication application by orchestrating application components. Embodiments of the invention enhance the use of simplified programming constructs for user activities in a telecommunications network providing an invocation manager which invokes event functions in an order identified by an orchestrator. The orchestrator holds all specified event functions each with trigger chance and priority value. The event functions can be defined in Communication Beans with annotations and may be updated and selected by an XML file.

Abstract: A system includes reception of an instruction to commit a design-time artifact of a database server application to a repository of a database server, storage of the design-time artifact in the repository of the database server in association with an inactive flag, reception of a request from a user to access the design-time artifact associated with the inactive flag, and, in response to the request, generation of a private runtime representation of the design-time artifact associated with the inactive flag, and deployment of the private runtime representation of the design-time artifact for exclusive use by the user.

Abstract: Data is identified that represents a path of a transaction that includes a plurality of transaction fragments associated with a plurality of software components. The transaction returns a particular value and a particular one of the plurality of software components is identified as a source of the particular value. A test action is generated that, when executed, is to attempt to verify the particular value from the particular software component.

Abstract: Technologies are generally described for systems and methods for reconfiguring a programmable circuit. An accelerator reconfiguration device may detect a trigger. The trigger may indicate that a command has been sent to a processor to switch from execution of a first virtual machine to a second virtual machine. In response to detecting the trigger, the reconfiguration device may identify a programmable circuit and program for the programmable circuit associated with the second virtual machine. The reconfiguration device may further generate a write command to write the program to the programmable circuit.

Abstract: A method, system, and/or computer program product tests combined code changesets in a software product. One or more combinations of two or more changesets are selected, wherein a changeset is a set of changes to a software product submitted by a single developer source. For each combination of two or more changesets, an interaction between changesets is calculated, wherein the interaction is an overlapping of code found in two or more changesets. A combination of two or more changesets that has a predetermined minimum interaction between changesets is selected for building and testing.

Abstract: Provided are a computer program product, system, and method for performing code load operations on managed components in a system. A first node group comprising at least one computational node in the computer system performs code load operations for the managed components. Status of the code load operations at the managed component is written to a status data structure while the code load operations are being performed at the managed component. The first node group transfers control of the code load operations for the managed components to a second node group comprising at least computational node in the computer system while the code load operations are occurring at the managed components. A second node group reads the status data structure for the managed components to determine the status of the code load operations and continue the code load operations at managed components.