Abstract: Embodiments of the invention relate to implementing run-time instrumentation sampling in transactional-execution mode. An aspect of the invention includes determining, by a processor, that the processor is configured to execute instructions of an instruction stream in a transactional-execution mode, the instructions defining a transaction. Completion of storage operations of the instructions is interlocked to prevent instruction-directed storage until completion of the transaction. A sample point is recognized during execution of the instructions while in the transactional-execution mode. Run-time-instrumentation-directed storing is performed, upon successful completion of the transaction, run-time instrumentation information obtained at the sample point.

Abstract: A system may include computer code for analyzing an upgrade from a first version to a second version of a software program that has been customized without performing the upgrade. The system may provide default state information of default program objects. The default program objects would be included in a default installation of the second version of the software program. The computer code may retrieve current state information of current program objects from an application database. The software program that has been customized may include the current program objects. The system may generate upgrade information based on a comparison between the current state information and the default state information. The upgrade information may identify a subset of the current program objects that would be impacted by the upgrade.

Abstract: Embodiments of the invention relate to implementing run-time instrumentation sampling in transactional-execution mode. An aspect of the invention includes a method for implementing run-time instrumentation sampling in transactional-execution mode. The method includes determining, by a processor, that the processor is configured to execute instructions of an instruction stream in a transactional-execution mode, the instructions defining a transaction. The method also includes interlocking completion of storage operations of the instructions to prevent instruction-directed storage until completion of the transaction. The method further includes recognizing a sample point during execution of the instructions while in the transactional-execution mode. The method additionally includes run-time-instrumentation-directed storing, upon successful completion of the transaction, run-time instrumentation information obtained at the sample point.

Abstract: A method and system for governing information is provided. The method includes receiving, by a processor, data defining a scope and context of an information governance project and information requirements data associated with the data. The processor classifies the information requirements data into concepts in accordance with a meta-model profile. The processor generates conceptual models and realization models in accordance with the meta-model profile. Governance roles are defined and assigned to informational assets within the conceptual models The processor selects a final architecture option and generates policy models in accordance with the governance roles, the informational assets, the meta-model profile and user input. A final architecture option is deployed and monitored, and governance events triggered and reports generated in response to changes in this deployed architecture option.

Abstract: A user's search experience may be enhanced by providing additional content based upon an understanding of the user's intent. Query tagging, the assigning of semantic labels to terms within a query, is one technique that may be utilized to determine the context of a user's search query. Accordingly, as provided herein, a query tagging model may be updated using one or more stratified lexicons. A list data structure (e.g., lists of phrases obtained from web pages) and seed distribution data (e.g., pre-labeled probability data) may be used by a graph learning technique to obtain an expanded set of phrases and their respective probabilities of corresponding with particular lexicons (e.g., semantic class lexicons). The expanded set of phrases may be used to group phrases into stratified lexicons. The stratified lexicons may be used as features for updating and/or executing the query tagging model.

Abstract: A system and method for providing an infrastructure that can be provisioned for use with dynamic business applications. In accordance with an embodiment, the business application infrastructure comprises a plurality of drop-in components which can be added or provisioned as necessary to create a dynamic business application. For example, an integrated composition environment component can be provisioned to allow end-users to quickly develop business applications from an overall business process perspective. In accordance with other embodiments, the business application infrastructure can incorporate additional components as necessary to better support a particular business application, or a particular execution environment.

Abstract: Aspects of this disclosure relate to a method of compiling high-level software instructions to generate low-level software instructions. In an example, the method includes identifying, with a computing device, a set of high-level (HL) control flow (CF) instructions having one or more associated texture load instructions, wherein the set of HL CF instructions comprises one or more branches. The method also includes converting, with the computing device, the identified set of HL CF instructions to low-level (LL) instructions having a predicate structure. The method also includes outputting the converted (LL) instructions having the predicate structure.

Abstract: Provided are a method and apparatus for increasing task-execution speed, and, more particularly, a method and apparatus for increasing task-execution speed by compiling code to bytecodes, and executing native code in units of blocks instead of bytecodes, in which a block is a group of a series of bytecodes. The apparatus includes a receiving unit which receives a bytecode, a control unit which identifies whether the received bytecode is the last bytecode of a block, and a transmitting unit which transmits an address of a first native code of one or more native codes that correspond to one or more bytecodes included in the block based on the identification result.

Abstract: In a distributed computer system with cluster architecture, a number of service requests are redirected from a first instance of the cluster to a second instance of the cluster for execution. A software patch is applied to one or more software components running on an application server node of the first instance of the cluster. A number of service requests are redirected from the second instance of the cluster to the first instance of the cluster for execution. The software patch is applied on the one or more software components running on an application server node of the second instance of the cluster. A number of new service requests are directed to the upgraded second instance of the cluster for processing.

Abstract: A computer-implemented method for creating a threaded package of computer executable instructions from software compiler generated code includes allocating, through a computer processor, the computer executable instructions into a plurality of stacks, differentiating between different types of computer executable instructions for each computer executable instruction allocated to each stack of the plurality of stacks, creating switch points for each stack of the plurality of stacks based upon the differentiating, and inserting the switch points within each stack of the plurality of stacks.

Abstract: A method, system, and computer program product for improving software component placement on software execution platforms are provided in the illustrative embodiments. A computer determines whether a code corresponding to the software component includes business process logic. The computer determines a granularity level of the code. The granularity level of the code is a categorization of the code according to whether a number of external references in the code exceed a threshold value. The computer, responsive to determining the granularity level of the code, recommends placement of a first portion of the code on a first platform in the set of software execution platforms.

Abstract: Systems for creating, generating, distributing and applying self-contained modifications (i.e., changes) to source code are described herein. At least some embodiments include a system including a client computer with processing logic, a storage device (including source code files), and a communication interface. The interface receives a container file including a transformation including a search pattern that identifies source code segments, and transformation instructions that modify the source code based at least partially on identified code segments. Processing logic software searches a representation of the source code for search pattern occurrences, and identifies the source code segments that include elements with structure and relationships that are matched by the corresponding elements represented by the search pattern.

Abstract: Methods, systems, and computer-readable media for deploying an updated image to nodes propagated throughout a distributed computing platform are provided. Upon receiving an indication to install a patch to an operating system residing on the nodes, an existing image of the operating system is accessed at a staging service. The staging service generates the updated image by applying the patch to the existing image. The process of applying the patch includes mounting the existing image of the operating system to a virtual machine, copying the patch to the mounted existing image, setting a command within the existing image that executes upon activating the virtual machine, and activating the virtual machine, thereby executing the command. This directs the patch to be installed. The updated image is pushed to the nodes. The nodes are configured to utilize the updated image as the operating system without performing an individual installation of the patch.

Abstract: Techniques for optimizing code include methods, systems, and computer program products that implement operations including: identifying a decision table having values arranged in one or more cells in a row and column format, the values defining business rules; evaluating the decision table to generate one or more temporary tables, at least one temporary table including the values associated with particular positions of a string variable of undefined length; evaluating the one or more temporary tables to set the positions of the string variable based on comparisons of the values with inputs; and generating a portion of code defining the business rules based on the evaluation of the one or more temporary tables.

Abstract: Each of a group of user interface element representations that each represents one node of a captured graphical logic flow is translated, by a computing device, into one of a group of numerical strings that represents the respective node and connections to and from the respective node. The group of numerical strings is sequenced based upon the connections to and from each represented node.

Abstract: A compiler is loaded by a computing device using an evaluation function that is included in a program in a compiled form. The evaluation function causes the compiler to compile source code for the program, wherein the source code includes new instructions that are uncompiled, and wherein compiling the source code generates compiled code that includes the new instructions. The evaluation function loads the compiled code into memory, retrieves the new instructions, and executes the new instructions. The evaluation function may perform these operations during runtime of the program that includes the evaluation function.

Abstract: A method and a system for providing customizable, process-specific Just-In-Time debugging in operating system is provide in this invention. The method comprises the following steps: obtaining process-specific JIT debugging information, in response to the occurrence of an trap event in operating system; invoking the debugger corresponding to the process according to the obtained process-specific JIT debugging information. This method and system supports per-process JIT debugging configuration.

Abstract: Described herein is a system and method for dynamically managing service-level objectives (SLOs) for workloads of a cluster storage system. Proposed states/solutions of the cluster may be produced and evaluated to select one that achieves the SLOs for each workload. A planner engine may produce a state tree comprising nodes, each node representing a proposed state/solution. New nodes may be added to the state tree based on new solution types that are permitted, or nodes may be removed based on a received time constraint for executing a proposed solution or a client certification of a solution. The planner engine may call an evaluation engine to evaluate proposed states, the evaluation engine using an evaluation function that considers SLO, cost, and optimization goal characteristics to produce a single evaluation value for each proposed state. The planner engine may call a modeler engine that is trained using machine learning techniques.

Abstract: A method and system for invoking Just-In-Time debugger is described, which can provide more efficient JIT debugging for complex code mixed applications. A method for invoking a Just-In-Time (JIT) debugger according to one embodiment includes checking a code type of a code address where a JIT debugging request is triggered from a process of a code-mixed application in response to the JIT debugging request from the process; acquiring corresponding JIT debugging information for different code types of the code-mixed application; and invoking a JIT debugger corresponding to the code type in response to the checked code type of the code address in the process and the acquired corresponding JIT debugging information.

Abstract: A technique for parallelizing model checking using breadth-first search in order to detect deadlocks and safety property violations is disclosed. The technique is based on Parallel Structured Duplicate Detection (PSDD) and preserves a model checker's ability to perform partial order reduction with parallel breadth-first search. PSDD also uses much less memory and is able to achieve better parallel speedup and verify models more quickly. Also, PSDD used herein is able to make use of external memory, such as hard disks, to reduce the memory requirements of verification.