Abstract: There are provided systems and method for unit test automation for business rules and applications. A service provider, such as a payment provider, may wish to integrate software and platforms offered by Pegasystems, Inc., in particular Pega RULES Process (“PRPC), which offers a business process management system. PRPC allows the service provider to create and manage business rules and build business applications and platforms, such as a customer support platform. In order to provide a more flexible and comprehensive automated unit testing mechanism, a Java framework may be utilized that runs test cases in PRPC for the business rules. The Java framework may feed data into test cases and may enable dynamic data to be entered for the test cases. Additionally, the Java framework may allow for editing of data for the PRPC test cases and may allow the test cases to be reused and deleted.

Abstract: Method and apparatuses are provided for providing preemptive task scheduling for a Real Time Operating System (RTOS). A two-level priority is assigned to each task that is created. The two-level priority includes a kernel priority and a user-defined priority. A priority bitmap corresponding to the kernel priority is created. A priority bit in the priority bitmap is enabled. The priority bit indicates a status of a respective task.

Abstract: The present invention relates to a data processing system and to a method for implementing simulation in the system, and the invention comprises: a process of inputting an application code for implementing a simulation; a process of converting the input application code into assembly data format; a process of generating basic blocks for the assembly data format; and a process of implementing the simulation via the generated basic blocks. Consequently the simulation implementation time is shortened as the simulation is implemented from instruction units to basic block units.

Abstract: Embodiments of the invention provide systems and methods for scheduling and executing user-restricted processes within distributed computing systems. More specifically, certain embodiments of the present invention describe systems and methods by which runtime requests to execute user-restricted processes may be received, processed, and scheduled via a user application of an enterprise system or other distributed computing system. Requests may be received via transaction pages of user applications to schedule and execute user-restricted processes. The user application, a process scheduler, and/or other components within the distributed computing system may determine user contexts associated with the requests, and may determine whether or not the requested processes may be scheduled and executed. Such processes may include, for example, report generation processes, processes to initiate system functions, and/or processes to perform system maintenance within the distributed computing environment.

Abstract: First and second controllers implemented on computing equipment may be used to control switches in a network. The switches may forward network packets between end hosts. The second controller may identify first and second redundant partitions of switches in the network that are each coupled to all of the end hosts. The first controller may instruct the first partition to install software while the second partition forwards network traffic and may instruct the second partition to install software while the first partition forwards network traffic. The first controller may install the software while the second controller is active and the second controller may install the software while the first controller is active. In this way, the switches and controllers may be provided with an uninterrupted software upgrade and packets may be forwarded between end hosts during the software upgrade without introducing packet loss or other noticeable reductions in network performance.

Abstract: A method, system and computer program product for generating a list of applications available for installation on a user terminal is disclosed. In one aspect, a catalogue server identifies a first and a second installation control setting corresponding to an application on the basis of user identification data from a data store comprising entries for a plurality of applications and their corresponding installation control settings. Subsequently, the catalogue server determines installation control data for at least one of the first and second application on the basis of the first and the second installation control setting. The determined installation control data is used to generate the list of application available for installation on the user terminal.

Abstract: A system and method can support transaction processing in a transactional environment. A transactional system operates to route a request to a transactional server, wherein the transactional server is connected to a resource manager (RM) instance. Furthermore, the transactional system can assign an affinity context to the transactional server, wherein the affinity context indicates the RM instance that the transactional server is associated with, and the transactional system can route one or more subsequent requests that are related to the request to the transactional server based on the affinity context.

Abstract: A method utilizes priority-based bandwidth allocation to reallocate unused bandwidth capacity of a virtualized IO resource such as a self-virtualizing IO resource to one or more virtual functions in an allocation pool based upon priorities assigned to such virtual functions.

Abstract: Embodiments of the present provide a method, system and computer program product for reviewer selection during distributed software development. In an embodiment of the invention, a method for reviewer selection during distributed software development can include receiving a request to review a module of source code stored in a source code repository and managed by an IDE executing in memory of a computer. The method also can include retrieving meta-data for the module of source code referencing different collaborators previously accessing the module of source code in the IDE. The method yet further can include ranking the collaborators according to at least one user centric characteristic of the module of source code. Finally, the method can include selecting a highest ranked one of the collaborators to review the module of source code.

Abstract: Techniques are disclosed for governed or constrained deployment of one or more applications on trusted infrastructure of a cloud infrastructure environment. For example, a repository of metadata (e.g., metadata lake) is maintained. The metadata repository includes metadata associated with applications, metadata associated with content associated with the applications, and metadata associated with a cloud infrastructure environment in which the applications are deployable. A deployment is determined for a given application on a trusted infrastructure within the cloud infrastructure environment based on at least a subset of the metadata maintained in the metadata repository. The determination of the deployment of the given application based on the subset of the metadata includes mapping trust-based criteria associated with the given application with a portion of infrastructure of the cloud infrastructure environment that satisfies the trust-based criteria.

Abstract: A method and a system environment are disclosed that allow for installation of an instance of an ensemble application into a container in excess capacity of an existing server and that allows the instance to coexist with a legacy application on the server and communicate with other instances of the ensemble application on other servers.

Abstract: Methods and apparatuses of converting a program, which may enhance an execution speed of a computer program, are provided. The method may include receiving a program, detecting at least one loop statement including at least one branch statement within the program, determining whether the loop statement may be split into at one or more sub-loop statements which perform the same function as a function of the loop statement and from which the branch statement has been removed, splitting the loop statement into the sub-loop statements and removing the branch statement included in the loop statement if it is determined that the loop statement may be split as a result of the determination, and outputting a result of removing the branch statement.

Abstract: A method and apparatus for remote purchase, installation, and licensing of software is disclosed. The method comprising receiving, from a mobile device, a request for a software application; determining compatibility between at least one registered device and the software application; providing, to the mobile device, a list comprising compatible registered devices; placing the software application on an installation queue for the selected registered device in response to an input; and downloading the queued software application to the registered device.

Abstract: Context information associated with asynchronous tasks executing in a multithread computer processing environment can be captured. An identifier block having context information associated with tasks executed in the thread is stored in a call stack of a thread. For asynchronous tasks that execute in the thread, a context trace component causes the thread to place an identifier block in the stack of the thread. The identifier block stores context information associated with the currently executing task and with one or more previously executed tasks. Context information currently stored in an identifier block can be retrieved and stored in subsequent identifier blocks, thereby enabling capture of a sequential context trace of asynchronous tasks that execute in the thread. The context trace information stored in the identifier block can be retrieved to support failure analysis when a task fails to execute properly.

Abstract: Disclosed herein are technologies for a generic annotation seeker to generate an index of class annotation, mapping classes with annotations during build time. Files may be dynamically registered and scanned by a registration seeker for revised and updated annotation. This Abstract is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims.

Abstract: A streams manager monitors data tuples processed by a streaming application represented by an operator graph. The streams manager includes a tuple breakpoint mechanism that allows defining a tuple breakpoint that fires when a tuple has been in the operator graph too long. What constitutes too long can be defined in a number of different ways, including a time limit, a processing limit for multiple operators, and a processing limit for an individual operator. When the tuple breakpoint fires, one or more operators in the operator graph are halted according to specified halt criteria. Information corresponding to the breakpoint that fired is then displayed. The tuple breakpoint mechanism thus provides a way to debug a streaming application that may have data tuples that stay in the operator graph too long.

Abstract: A streams manager monitors data tuples processed by a streaming application represented by an operator graph. The streams manager includes a tuple breakpoint mechanism that allows defining a tuple breakpoint that fires when a tuple has been in the operator graph too long. What constitutes too long can be defined in a number of different ways, including a time limit, a processing limit for multiple operators, and a processing limit for an individual operator. When the tuple breakpoint fires, one or more operators in the operator graph are halted according to specified halt criteria. Information corresponding to the breakpoint that fired is then displayed. The tuple breakpoint mechanism thus provides a way to debug a streaming application that may have data tuples that stay in the operator graph too long.

Abstract: Methods for dynamically instrumenting a program while the program is executing are described. In some embodiments, profiling hooks may be selectively inserted into and removed from a program while the program is running. The hooks may gather profiling information, such as the frequency and duration of function calls, for a selected set of functions. The hooks may be inserted into the program without requiring a special build or modifications to the binary by modifying machine-level instructions for the program stored in system memory. The ability to selectively insert instrumentation into the machine-level instructions stored in the system memory allows a set of functions to be selected during execution of the program and hooks for each function of the set of functions to be dynamically inserted or removed during execution of the program to precisely capture profiling information for the set of functions.

Abstract: Migrating a process from a source system with a source operating system to a target system with a target operating system is provided, where the source and target systems or source and target operating system are incompatible. The migrating includes: employing an emulator at the target system to execute code associated with the process being migrated, the emulator performing: translating of system calls and runtime library calls for the source operating system to calls of the target operating system using a system call translator and runtime library translator; translating source application code associated with the process into binary target application code executable on the target system, using a compiler where the source application code has not been translated; and executing the translated binary target application code on the target system, and discontinuing emulation of the process at the target system once the executing begins.

Abstract: A method may include receiving, by a device, information associated with a model. The method may include determining, by the device, performance criteria for program code generated based on the model. The method may include determining, by the device, profiling information associated with the program code. The method may include determining, by the device and based on the profiling information, that the performance criteria is not satisfied. The method may include applying, by the device and based on determining that the performance criteria is not satisfied, a modification technique to a portion of the model to create a modified model. The modification technique may be applied to the portion of the model to cause program code, generated based on the modified model, to satisfy the performance criteria.