547results about "Transformation of program code" patented technology

The invention comprises (i) a compilation method for automatically converting a single-threaded software program into an application-specific supercomputer, and (ii) the supercomputer system structure generated as a result of applying this method. The compilation method comprises: (a) Converting an arbitrary code fragment from the application into customized hardware whose execution is functionally equivalent to the software execution of the code fragment; and (b) Generating interfaces on the hardware and software parts of the application, which (i) Perform a software-to-hardware program state transfer at the entries of the code fragment; (ii) Perform a hardware-to-software program state transfer at the exits of the code fragment; and (iii) Maintain memory coherence between the software and hardware memories. If the resulting hardware design is large, it is divided into partitions such that each partition can fit into a single chip. Then, a single union chip is created which can realize any of the partitions.

Many different users may access, revise and update the same shared object simultaneously through several different transports. Revisions to the shared object are automatically synchronized such that all users can view the revisions to the shared object. Conflicting revisions are reconciled and merged into a current version of the shared object. A client may request the current version of the shared object from a store when the current version of the shared object is not available from the store. The current version of the shared object is synchronized with the client when the store receives the current version of the share object.

A system optimizes two or more stream processing programs based upon the data exchanged between the stream processing programs. The system alternately processes each stream processing program to identify and remove dead program code, thereby improving execution performance. Dead program code is identified by propagating constants received as inputs from other stream processing programs and by analyzing a first stream processing program and determining the outputs of a second stream processing program that are unused by the first stream processing program. The system may perform multiple iterations of this optimization is previous iterations introduce additional constants used as inputs to a stream processing program. Following optimization of the stream processing programs, the optimized stream processing programs are compiled to a format adapted to be executed by a stream processing system.

A native binding technique is provided for inserting calls to native functions during translation of subject code to target code, such that function calls in the subject program to subject code functions are replaced in target code with calls to native equivalents of the same functions. Parameters of native function calls are transformed from target code representations to be consistent with native code representations, native code calling conventions, and native function prototypes.

Client software is modified by a translator to use unique variant of linguistic interface of a service. An interceptor pre-processes subsequent client service requests from translated unique linguistic interface to standard linguistic interface implemented by service. Usage of linguistic interfaces of service is contained, rendering service incapable of executing arbitrary input, even if such input is crafted specifically for the service interface.

A method for diagnosing problems in a computer system by providing a user interface for visualizing flows through subsystems of the computer system, and allowing a user to explore relationships between a triage map which graphically depicts subsystems, and a transaction trace graph, which depicts a time sequence of invoked components of the subsystems. In one aspect, in response to a user selecting a portion of the transaction trace graph which depicts an invoked component, the user interface visually distinguishes one of the subsystems which invokes the invoked component. In another aspect, the transaction trace can be played back so that subsystems in the triage map are highlighted in turn, in a time sequence, as components of different subsystems are invoked. A time marker can skip to selected time points which result in updating of the triage map.

A method for developing a test program for a semiconductor test system is disclosed. The method includes describing a test plan file in a test program language (TPL), where the test plan file describes at least one test of the test program, describing a test class file in a system program language (SPL) and a corresponding pre-header file of the test class file in the TPL, where the test class file describes an implementation of the at least one test of the test program, and generating the test program using the test plan file, the test class file, and the pre-header file.