Abstract: A method of data processing in which a composite data processing operation, for execution by a data processing device having a memory, is assembled by a user as a linked list of sub-operations selected from a set of possible data processing sub-operations, comprises the steps of: as a sub-operation is selected by the user for inclusion in the composite operation, loading into the memory sub-operation data defining parameters of that sub-operation including input and output interfaces of that sub-operation; and in response to an initiation of execution of a sub-operation, loading sub-operation program code into the memory for execution by the data processing device; in which the sub-operation data requires less memory space than the sub-operation program code.

Abstract: An embedded desktop which can run multiple Java applications simultaneously under one instance of a Java™ virtual machine (JVM) and which allows open applications to communicate with one another in a system independent manner. The embedded desktop functionally exists between the JVM and the multiple Java™ applications and consists of a Core and various plug-ins. When applications are launched by a user (by communication between the Core, user interface plug-in and service vendor plug-in), an application class loader for each application is invoked using the class names of the respective applications. By segregating each application into an application class loader, class name collisions and resulting application crashes are avoided. Once application class loaders have been invoked, communication between applications is facilitated through the Core, avoiding the overhead and complexity of system dependent communication through the operating system and associated hardware.

Abstract: A programming environment including a source code programming language comprising a plurality of programming constructs. A first set of constructs within the programming language are for expressing procedural operations performed on specified data. A second set of constructs within the programming language are for expressing complex data relationships of the specified data. A compiler receives programmed source code comprising user-selected and arranged portions of the first and second set of constructs and generating machine readable code capable of implementing the procedural operations and complex data relationships expressed by the source code.

Abstract: An optimization process is disclosed. The process first finds a parallel compare sequence in a program flow, for example using a flow graph. The guarding predicate (gp) is obtained for the compares. If a new dominating predicate (dp) can be found, the process proceeds to determining if compares for the dp generate the correct or needed initial value for the gp. If there are free result slots available, the proper compares are generated and folded into the initialization. If no free slots are available, it is determined if there is a use of a gp between the dp and gp. If not, the dp is renamed to gp, and the proper compares are generated and folded into the initialization. If there is such a use, the guarding predicate of the compares is found and the process reiterates until it ends with the failure to find a new dominating predicate dp.

Abstract: A system for automatic program generation which receives a number of input format descriptors and a number of output format descriptors. The system generates a program for converting an input data sequence having a format described by input format descriptors to an output data sequence having a format described by the output format descriptors. The program may then be executed responsive to an input data stream, wherein a portion of the input data stream corresponds to the input data sequence. The input data sequence and output data sequence consist of a number of data type indicators. In an exemplary embodiment, the input data type indicators correspond to fields of data units received by a forwarding device, and the output data type indicators correspond to fields of corresponding data units forwarded by the forwarding device.

Abstract: A distributed block-based programming model for control applications such as multimedia based real-time applications is described. According to one aspect of the invention, user program specifies interconnections between a plurality of program blocks distributed across a plurality of processing nodes. The user program is automatically translated into a system-level program having a program fragment for each one of the processing nodes. Each one of the program fragments comprise the program blocks located on the processing node and one or more system-level blocks for establishing connections between the processing node and a different processing node across a network.

Abstract: Disclosed is a system, method, and program for implementing conditional logic statements within a computer program. Program logic is invoked in response to processing a first method statement. During the execution of the program logic for the first method statement, at least one operation is performed and a return variable is set to at least one of two values depending on an outcome of performing the at least one operation. Program logic is invoked in response to processing a second method statement following the first method statement in the computer program. The second method statement is passed a condition parameter and the return variable. During the execution of the program logic for the second method statement, a determination is made as to whether the return variable set by the first method statement satisfies a condition specified in the condition parameter and one of at least two operations are performed, depending on whether the return variable satisfies the condition.

Abstract: A method and system of installing applications for a plurality of mobile devices from a storage source, wherein each mobile device is of a different type, includes storing on the storage source a plurality of applications. Each application is designed for a unique type of mobile device. The mobile device is connected to the storage source and the type of mobile device is detected. A selected application is then transferred to the mobile device.

Abstract: Inferring operand types within an intermediate language is disclosed. In one embodiment, a computer-implemented method first inputs an intermediate language code that has a first plurality of opcodes, including a type-indefinite opcode. The method resolves the type-indefinite opcode into a typed opcode, and generates a native code that has a second plurality of opcodes corresponding to the first plurality of opcodes, and which includes an opcode corresponding to the typed opcode. The method finally outputs the native code. An example of an intermediate language is Java.

Abstract: A system converts an application designed to run on one operating system so that it can run on a second operating system without recompiling. An application designed to run on Windows® 95, 98 or NT, for example, may be converted so that it will operate without recompiling on a Windows® CE operating system machine.

Abstract: A system and method for compiling data defining objects such as, but not necessarily limited to, components to be configured into a personal computer system. With respect to such components, a predetermined array of attributes is established to characterize particular components. At least two operators, or agents, independently acquire, from a global source of relevant data, values for the attributes. In a preferred embodiment, the agents are provided with a finite set of predetermined values, or ranges of values, that is deemed to include a value that is accurate for the attribute under consideration. The agents then respectively select values for the attribute, with the selection based on the acquired values considered with respect to the predetermined values. The respective values are error checked and then compared for equality. If the values selected by the agents are equal, a value for the attribute is written into an attribute database.

Abstract: A debugging system has a central processing unit, a register group, a tracer and a trace buffer integrated on a single semiconductor chip, a main memory for storing a target program and other data and an emulator, and the tracer is connected to a cache memory of the central processing unit and the register group through built-in signal lines patterned over the semiconductor chip so that the tracer is responsive to a high-speed data processing of the central processing unit by virtue of the built-in signal lines merely coupled with small parasitic capacitors.

Abstract: A computer-implemented method in which report program language is converted to object-oriented source code, such as Java, using the report program language compiler. The object-oriented source code emulates the behaviour of the report program language, such as VARPG. Applications written in RPG are converted to Java and therefore can run on every platform for which a Java virtual machine exists. RPG programmers now have the ability to write internet applications. Java applications and applets can be written in RPG and existing RPG applications can be converted to Java applets.

Abstract: Systems and methods are disclosed for preparing program code for a first computer, wherein the systems and methods are implemented on a second computer. The systems include a relocating module that is adapted to relocate program code by modifying locations in the program code identified by location data. The modifications made by the relocating module are based on a memory address. The systems operate on program code for the first computer, where the program code is stored on the second computer. The relocating module is provided the memory address that identifies a memory location in the first computer. The memory address is suitable as a basis for modifying the program code. The relocating module is also provided with location data that identifies locations in the program code to be adjusted based on the memory address.

Abstract: An optimizing object code translation system and method perform dynamic compilation and translation of a target object code on a source operating system while performing optimization. Compilation and optimization of the target code is dynamically executed in real time. A compiler performs analysis and optimizations that improve emulation relative to template-based translation and interpretation such that a host processor which processes larger order instructions, such as 32-bit instructions, may emulate a target processor which processes smaller order instructions, such as 16-bit and 8-bit instructions. The optimizing object code translator does not require knowledge of a static program flow graph or memory locations of target instructions prior to run time. In addition, the optimizing object code translator does not require knowledge of the location of all join points into the target object code prior to execution. During program execution, a translator records branch operations.

Abstract: The present invention analyzes an application A and computes a set reachable methods in A by determining the methods in A that may be called from another reachable method in A, or from within a class library L used by A without analyzing the classes in L. The invention may be used as an optimization to reduce application size by eliminating unreachable methods. In the alternative, the invention may be used as a basis for optimizations that reduce execution time (e.g., by means of call devirtualization), and as a basis for tools for program understanding and debugging.

Abstract: To provide an approach to software update with scaleable disturbance there is proposed a state copying method for a computation system with at least two logic partitions wherein a state of new software in a standby partition is updated to the state of old software in an executing partition while continuing execution of the old software. Data is transferred from the executing partition to the standby partition in a scaleable way and as soon as the same state is achieved for the standby partition and the executing partition the execution is switched to the new, software. This provides a scaleable degree of disturbance due to the software update.

Abstract: A method of, apparatus for and computer-readable medium for obtaining a program for a distributed memory-type parallel computer by dividing data for a program written for a serial processing computer. The method comprises changing a declaration of an array to be subjected to indirect or irregular division which is designated by the mapping array in the program into a declaration of an allocation array; inserting statements to declare the allocation array for converting subscripts and to calculate the size of the divided array during processing, and inserting a statement to preserve or to release an area for divided arrays corresponding to the calculated length of arrays to be divided and subscript conversion arrays during processing.

Abstract: A code export symbol offset table A 1128 stores sets of the identifier and the offset of the area of a code symbol. In an export symbol import step 1160, the identifier that matches the identifier of a symbol is retrieved from the code export symbol offset table A 1128, the offset corresponding to the retrieved identifier is extracted, and a predetermined calculation is performed to create an absolute address.

Abstract: A DVD authoring system in a processor-based system removes an author from consideration of the DVD Specification during authoring. According to a preferred embodiment, the authoring system provides an authoring engine having an interactive graphical authoring interface, a data management engine, an emulator, a compiler, a multiplexer and a simulator. Using summary authoring data, the compiler builds a skeleton-form PGC layout structure comprising control PGC abstractions and router PGC abstractions. The compiler then resolves the PGC abstractions according to source-target connections. During playback on a DVD player, the PGC abstractions form elements in a connection-switching abstraction superstructure. Accordingly, in response to DVD-consumer and other control events, a source PGC preferably determines target PGC information and then transfers control, via virtual connections through necessary router PGC abstractions, to a target PGC abstraction.