Abstract: A system for emulating a telematics client is provided. The system includes a workstation in communication with a display screen. A software stack configured to be executed by the workstation to implement functionality for a telematics client is included. The software stack imitates a configuration of an in-vehicle telematics stack of a telematics control unit (TCU). The software stack includes a service gateway for loading an emulator. A user interface (UI) manager configured to communicate with the loaded emulator is included with the software stack. The UI manager enables a presentation of TCU user interface without accessing the TCU. Methods to emulate a user interface and loading an emulator on a workstation are also provided.

Abstract: A method, system, and apparatus for providing a contract between an application server and a resource adapter that allows an application server to manage the lifecycle of a resource adapter. When a resource adapter is deployed (or during application server startup), an application server must bootstrap an instance of the resource adapter in an appropriate address space. In those situations where a resource adapter is undeployed (or during application server shutdown), the application server requires a mechanism to notify the resource adapter instance to stop functioning so that it can be safely unloaded. In this way, the lifecycle management contract provides a mechanism for an application server to manage the lifecycle of a resource adapter instance. This allows an application server to bootstrap a resource adapter instance during resource adapter deployment or application server startup and also to expose some of its useful facilities to the resource adapter instance.

Abstract: Solutions to a value recycling problem facilitate implementations of computer programs that may execute as multithreaded computations in multiprocessor computers, as well as implementations of related shared data structures. Some exploitations allow non-blocking, shared data structures to be implemented using standard dynamic allocation mechanisms (such as malloc and free). Some exploitations allow non-blocking, indeed even lock-free or wait-free, implementations of dynamic storage allocation for shared data structures. In some exploitations, our techniques provide a way to manage dynamically allocated memory in a non-blocking manner without depending on garbage collection. While exploitations of solutions to the value recycling problem that we propose include management of dynamic storage allocation wherein values managed and recycled tend to include values that encode pointers, they are not limited thereto.

Abstract: A technique for arbitrating and selecting one access request to a shared memory from among multiple contenders is disclosed. In a first aspect, the invention includes a method for accessing a shared memory. The method includes receiving a plurality of access requests; presenting a plurality of characteristics for each access request; ascertaining a plurality of operational characteristics; and selecting one of the access requests for processing upon consideration of the access request characteristics and the operational characteristics. In a second aspect, the invention includes an arbitration and select logic (“ASL”) unit. The ASL unit comprises a plurality of input sorting units, each input sorting unit capable of receiving a respective access request and a merge and interleave unit (“MIU”).

Abstract: The present invention provides an efficient implementation of multiprecision arithmetic, such as for a microprocessor. In one embodiment, a method includes executing a generate carry instruction on a microprocessor, the generate carry instruction determining the carry bit of the addition of a first operand and a second operand. The generate carry instruction can be executed in parallel on the microprocessor with an add (without carry) instruction of the first operand and the second operand. In one embodiment, a generate borrow instruction is similarly provided for an efficient implementation of multiprecision subtraction operations executed on the microprocessor. Accordingly, multiprecision arithmetic can be provided on a microprocessor without the use of a dedicated condition code register for the carry bit or borrow bit of multiprecision arithmetic operations.

Abstract: In general, a method and apparatus for decoding an encoded digital image is disclosed. An image decoder receives an encoded digital image and determines if the image can be directly decoded and displayed on a display monitor. By directly decoding the encoded digital image, the image decoder eliminates unnecessary intermediate decoding processes.

Abstract: Modified full-rail differential logic circuits are activated by a delayed clock and include a sense amplifier circuit that is triggered by a second delayed clock. The addition of the sense amplifier circuit, and second delayed clock signal allows the sense amplifier circuit to act as the driver and therefore there is no need for increasing the size of the differential logic network to provide a driver function. Consequently, the modified full-rail differential logic circuits of the invention are capable of operating efficiently under heavy load conditions without the increased size and the significant reduction in speed associated with prior art full-rail differential logic circuits.

Abstract: A method and structure for supply gating low power electronic components uses low threshold gating transistors. The low power components operate at supply voltages of less than one volt and typically in the range of 150 to 400 millivolts. Using low threshold gating transistors, the leakage current of the devices, and therefore the standby power dissipation, can be minimized by using any one, or a combination of, four methods including: overdriving the low threshold gating transistors on; overdriving the low threshold gating transistors off; combining very low threshold device transistors with low threshold gating transistors; and providing the low threshold gating transistors with back bias.

Abstract: Scrolling techniques for computing devices are disclosed which respond to the amount of tilt, measured against a reference, experienced by a control unit. The user set the reference by activating a switch while the control unit is in an orientation selected by the user. Once the reference is set, the direction and rate of scrolling is determined by the direction and amount of tilt. The control unit may be built into a hand held computing device such as the Sun Pad.

Abstract: A method and apparatus for optimizing the insertion of decoupling capacitance onto an integrated circuit is provided. Further, a sliding grid based technique for arraying decoupling capacitors into a white-space of an integrated includes sliding a bounded grid across the white-space in order to determine an optimal decap insertion for the white-space. The bounded grid is slid across the white-space in discrete steps. At each discrete step, a potential decap layout is calculated for the region of the white-space that intersects the bounded grid. After a set of potential decap layouts have been calculated for the white-space, the potential decap layout that yields optimal decap insertion is selected, and decap cells are arrayed into the area(s) of the white-space that are demarcated by the selected decap layout.

Abstract: A graphics system comprises a rendering unit, a sample buffer, and a sample-to-pixel calculation unit. The rendering unit receives vertices defining a triangle, and generates first and second octant identifier words for first and second edges of the triangle respectively. In most cases, the two octant identifier words determine the triangle orientation. However, in a few special cases (i.e. when the octant identifier words specify the same or opposite octants), the triangle orientation is resolved based on a comparison of the slopes of the first and second edge. Further rendering operations on the triangle may be conditioned on the value of the triangle orientation. The triangle orientation may be used to determine the interior side of each triangle edge. Sample positions falling on the interior side of all three edges are labeled as interior samples. Color values are computed for interior samples.

Abstract: Broadly speaking, the present invention provides apparatus and methods for determining whether a byte code formatted computer program handles pointer device events. It is determined whether the computer program includes byte codes that process a pointer device event, and a tag is associated with the examined byte code that has been determined to process a pointer device event. In still another embodiment, the invention pertains to a computer-implemented method for examining a computer program having byte codes. The computer program may contain code for displaying a graphical user interface (GUI) component on a display device. The byte codes of the GUI component are examined to determine whether the GUI component is associated with a pointer device event. If it is determined that the GUI component is associated with a pointer device event, a tag is associated with the GUI component. The tag indicates that the GUI component responds to pointer device events.

Abstract: A software fault tolerant computer system includes a primary virtual machine and a secondary virtual machine. The secondary virtual machine is operable to replicate the primary virtual machine by replicating operations performed on the primary virtual machine. The primary and the secondary virtual machines are further operable to test for equivalent operation of the primary and secondary virtual machines at predetermined stages of operation. This provides software fault tolerance wherein both a unit of replication and a component that implements the fault tolerance mechanisms is a virtual machine (VM). Since a VM as used by the invention has full knowledge of the semantics of application-level code, fault tolerance mechanisms can be provided by the VMs without requiring any increase in application complexity. Co-ordination of replicated states and computations is achieved with characteristics of both active and passive replication.

Abstract: A method and apparatus for supporting a pure client. In an embodiment of the invention, a client process is executing on a local host machine, whereas server software for supporting the client is physically stored on a remote host machine. The remote host machine also includes an active server process. The remote server software that supports the client is identified in the local host machine using an automatic, system generated reference, such as an NFS mount table entry. The mount table entry associated with the remote server software identifies the hostname of the remote host machine in which the remote server software is physically mounted. When the client process has a server request, the client process locates the remote server software entry in the mount table. A hostname specified in the mount table entry is used by the client process to contact the active server process at the remote host machine having that hostname.

Abstract: A digital communication system is presented implementing a data transmission method which allows each of a pair of communication devices coupled to a transmission line to both transmit and receive data during each cycle of a clock signal (i.e., simultaneous bidirectional data transmission). The digital communication system includes a first and second communication devices coupled to opposite ends of a transmission line. Both the first and second communication devices operate in response to a periodic clock signal. The first and second communication devices simultaneously: (i) drive an output data signal upon the transmission line during a first portion of a period of the clock signal, and (ii) receive an input signal from the transmission line during a remainder of the period of the clock signal. The communication devices may be coupled to receive the clock signal via a clock signal line, or may include circuitry to generate and synchronize two separate clock signals.

Abstract: A method for reducing dynamic memory allocation includes designing a software program using a memory allocation module for allocating memory, analyzing the software program to determine a bound on dynamic memory allocation and modifying the program based on the analyzing. According to one aspect, the program is modified to use static memory allocation in lieu of dynamic memory allocation based on the analyzing. According to another aspect, the program is modified to reduce the amount of dynamically allocated memory based on the analyzing.

Abstract: A method for portable device memory management includes determining an operational mode of a program configured to execute on the portable device based on validating the presence of one or more memory markers in the memory. The one or more memory marker includes a memory line having a predetermined length and including a data portion and a tag. The method also includes allowing one or more commands based on the operational mode and terminating execution of the program if at least one but less than a predetermined number of memory markers are validly present in the memory.

Abstract: In order to diagnose applications, a specialized knowledge base may be created that is static upon creation but may become dynamic when traversed. The knowledge base may be defined as a decision tree having one or more diagnosis nodes, one or more analysis nodes, and one or more symptom branches. The diagnosis nodes are leaf nodes and indicate proposed diagnoses and/or proposed remedies for an application. The symptom branches may connect analysis nodes to other analysis nodes or analysis nodes to diagnosis nodes, and may indicate possible symptoms of the application. The analysis nodes may be non-leaf nodes and indicate information required to determine which symptom branches to follow during traversal. Additionally, the analysis nodes may indicate additional information required from a collector agent before traversal can be continued. This allows the knowledge base to be utilized dynamically, improving performance and reliability.

Abstract: A system and method of comparing a first XML document and a second XML document includes hashing the first and the second XML documents. The first hashed XML document is compared to the second hashed XML document and a difference report is output.

Abstract: A method for statically allocating a procedure return address includes separating a software program including multiple procedures into a cyclic part and an acyclic part, allocating a static address for the return address of a procedure in the acyclic part and modifying at least one of the procedures to refer to the static address for the procedure return address.