Abstract: Disclosed are various embodiments for executing multiple applications in a single virtual machine. The classes of an application executing in the virtual machine are traversed to identify non-sharable static fields. Upon identifying a non-sharable static field, mapping data is created that corresponds to the non-sharable static field. During another traversal of the classes of the application, access to the identified non-sharable static field is translated into an access to the mapping data that is associated with the non-sharable static field.

Abstract: An interactive intermediate representation (IR) viewer displays a view of the intermediate representation of client side code during a just-in-time compilation of the client side code in a live environment. The interactive IR viewer allows a developer to request the intermediate representation generated during one or more of the phases of the JIT compilation of the client side code. Modifications may be made to the intermediate representation before executable code is generated. The analysis of the intermediate representation during the live environment provides a developer with insight as to how the executable code is being compiled so that improvements may be made to improve the performance of the client side code.

Abstract: A data processing system (100) includes a main list (126) of tasks, main scheduling scheme, a starvation list (128) of tasks, and a secondary scheduling scheme. A method identifies tasks in the main list that are potentially-starving tasks and places the potentially-starving tasks in the starvation list. A starvation monitor (130) controls starvation of tasks in the system by determining when to use the secondary scheduling scheme to schedule, for execution on a CPU (132), a highest priority task in the starvation list prior to scheduling, pursuant to the main scheduling scheme, other tasks in the main list. The starvation monitor determines a number of times that a task in the main list is pre-empted, by other tasks in the main list, from being scheduled for execution on the CPU. A counter (131) is incremented each occasion that any task not in the starvation list is executed on the CPU.

Abstract: A computer identifies one or more pairs of scalar statements and performs a cost analysis of operations of each of the one or more pairs of scalar statements to determine both a benefit and a cost of operations. The computer determines, based, at least in part, on the cost analysis, a gain for each of the one or more pairs of scalar statements. The computer creates based, at least in part, on the gain, a sorted list of each of the one or more pairs of scalar statements and selects a first pair from the sorted list. The computer issues a query to a hash table using a statement of the first pair and selects from results received from the query, a second pair. The computer then extends, based, at least in part, on the second pair, the first pair to create a pack.

Abstract: In various embodiments, a data integration system is disclosed which enables users to create a logical design which is platform and technology independent. The user can create a logical design that defines, at a high level, how a user wants data to flow between sources and targets. The tool can analyze the logical design, in view of the user's infrastructure, and create a physical design. The logical design can include a plurality of components corresponding to each source and target in the design, as well as operations such as joins or filters, and access points. Each component when transferred to the physical design generates code to perform operations on the data. Depending on the underlying technology (e.g., SQL Server, Oracle, Hadoop, etc.) and the language used (SQL, pig, etc.) the code generated by each component may be different.

Abstract: An optimizing compiler includes a vector optimization mechanism that optimizes vector instructions by eliminating one or more vector element reverse operations. The compiler can generate code that includes multiple vector element reverse operations that are inserted by the compiler to account for a mismatch between the endian bias of the instruction and the endian preference indicated by the programmer or programming environment. The compiler then analyzes the code and reduces the number of vector element reverse operations to improve the run-time performance of the code.

Abstract: A dispatcher stack is allocated to each of a plurality of processors sharing a run queue. Each processor, in process dispatch processing, saves in a switch-source process stack the context of a switch-source process (the process being run), saves in the dispatcher stack of each of the processors a dispatcher context, inserts the switch-source process into the run queue, removes a switch-destination process from the run queue, and, in addition, restores the context of the switch-destination process from the switch-destination process stack.

Abstract: Embodiments of the present invention provide a method, system and computer program product for the automated suggestion of code usage patterns in an IDE. In an embodiment of the invention, a method for automated suggestion of code usage patterns in an IDE is provided. The method includes receiving input of a code snippet for a source code file of a software development project loaded into memory of a host computer for display through an IDE. The method further includes matching terms of the received input to terms in different blocks of code in different source code files of the software development project. The method yet further includes selecting one of the different blocks of code as a code completion choice for insertion into the source code file in the IDE. Finally, the method includes inserting the selected one of the different blocks of code into the source code file in the IDE.

Abstract: An optimizing compiler includes a vector optimization mechanism that optimizes vector instructions by eliminating one or more vector element reverse operations. The compiler can generate code that includes multiple vector element reverse operations that are inserted by the compiler to account for a mismatch between the endian bias of the instruction and the endian preference indicated by the programmer or programming environment. The compiler then analyzes the code and reduces the number of vector element reverse operations to improve the run-time performance of the code.

Abstract: Methods and apparatus for storing and transmitting historical configuration data associated with information technology assets are disclosed. The system reads and stores a first version of data with a timestamp. The system then performs a local update by reading a second version of data with a timestamp, replacing the first set of data and timestamp, and storing the changes between the first and second versions of data. The system also may receive update requests from a remote location for the latest version of data. The changes between versions of data are sent to the remote location, where the changes between versions of data are stored and are usable to create the requested latest version of data and/or prior versions of data.

Abstract: Embodiments of the present invention disclose a method, computer program product, and system for customizing help screens. A computer receives a request for help content. The computer identifies an annotated help file that corresponds to the request for help content. The computer identifies one or more variables in the identified annotated help file. The computer retrieves a value for each of the one or more variables from a software product. The computer replaces each of the one or more variables in the identified annotated help file with the retrieved value to generate customized help content.

Abstract: A non-transitory computer-readable medium including a program, which when executed by a computer, causes the computer to execute a process including obtaining first information indicating a load in the computer, second information indicating a first amount of communication handled by a virtual switch executed in the computer, and third information indicating a second amount of communication between the computer and another computer; and determining whether to switch from a first mode, in which the virtual machine executes a switch operation, to a second mode, in which the virtual switch and a physical switch that relays a communication of the computer cooperatively execute the switch operation, on the basis of the first information, the second information and the third information.

Abstract: Embodiments include methods, and computer program products of cognitive programming editor system in a computer system. Aspects include: providing programmers' cognitive characteristics patterns and programming policies to a code controller, collecting computer code from programmers through cognitive skill agents, analyzing collected code by code controller using a cognitive vulnerability checker, providing collaborative programming by sharing online editor with programmers, and storing obtained cognitive characteristics patterns of programmers to a database. The analyzing may include assessing and responding to cognitive needs of the programmers through the cognitive skill agents. Cognitive vulnerability checker may include character pattern matching, type qualifier, data flow analysis, vulnerability pattern-based model checking, and individual programmer vulnerability analysis.

Abstract: Disclosed are a content recording method and device, for use in software development. The method includes: capturing the content displayed on a screen in the software development process; acquiring a mouse event related to the content displayed on the screen; and processing the mouse event and the content displayed on the screen to obtain the recorded content, the recorded content containing the content displayed on the screen and the mouse event. The technical solution can record a screen capture and a mouse/keyboard operation related thereto in the software test development process, thus effectively recording the test and development process, and improving test and development efficiency.

Abstract: The invention relates to a computer system that may include a processor, an accessibility API, a GUI, and a test module. The test module may use the accessibility API for analyzing GUI elements of the GUI and for automatically identifying GUI element features and inter-GUI-element dependencies. The test module may use the GUI element features and inter-GUI-element dependencies to generate a graph. The test module may traverse the graph and analyzes the GUI element features assigned to each currently accessed node or said node's child or sibling node. Thereby, the test module may identify predefined GUI element patterns in the graph and in the GUI. In case a matching GUI element pattern was identified, the test module may automatically identify one or more test routines associated with the identified GUI element pattern and automatically perform the one or more identified test routines on the GUI.

Abstract: The disclosed embodiments provide a system that facilitates the use of a computer system with virtualization software. During operation, the system obtains a set of hardware attributes from the computer system and a hardware compatibility list (HCL) for the virtualization software. Next, the system uses the hardware attributes and the HCL to predict a compatibility of a hardware component in the computer system with the virtualization software. The system then uses the predicted compatibility to manage use of the computer system with the virtualization software.

Abstract: Embodiments of the present invention provide a method, system and computer program product for extensible definition of interactive system productivity facility (ISPF) panels. In an embodiment of the invention, a method for extensibly defining ISPF panels can include loading a panel defined by different panel definition statements recognizable by an ISPF facility, and identifying a panel input exit facility amongst the panel definition statements defining the panel. Of note, the panel input exit facility references an external exit module. The method also can include determining an external exit module referenced by the panel input exit facility. Finally, the method includes passing records of the panel to the external input exit facility for pre-processing of the panel outside of the ISPF facility.

Abstract: A sequence for distributing at least one of a plurality of code packages to the at least one facility according to different states of a fixed state machine is set. The at least one of the plurality of code packages is maintained in at least one staging area in a valid, dormant mode while the fixed state machine is stopped. Pursuant to a resumption of the fixed state machine at a subsequent time, a current code package is swapped with the at least one of the plurality of code packages in the at least one staging area to activate the at least one of the plurality of code packages.

Abstract: Systems, methods, and computer program products to discover weak consistency errors in an application, by executing, by a debugger, a first thread of the application, by, determining that a first instruction in the first thread specifies to store a first value at a first memory address, setting a current value stored in the first memory address as an old value for the first memory address in a container for the first thread, executing the first instruction to store the first value at the first memory address, and setting the first value as a new value for the first memory address in the container for the first thread. The debugger then executes a second thread of the application, by restoring old values in the containers for all other threads and restoring a new value for each memory address specified in a container for the second thread to its respective memory address.

Abstract: Methods to discover weak consistency errors in an application, by executing, by a debugger, a first thread of the application, by, determining that a first instruction in the first thread specifies to store a first value at a first memory address, setting a current value stored in the first memory address as an old value for the first memory address in a container for the first thread, executing the first instruction to store the first value at the first memory address, and setting the first value as a new value for the first memory address in the container for the first thread. The debugger then executes a second thread of the application, by restoring old values in the containers for all other threads and restoring a new value for each memory address specified in a container for the second thread to its respective memory address.