Abstract:
An approach is provided for vectorizing misaligned references in compiled code for SIMD architectures that support only aligned loads and stores. In this framework, a loop is first simdized as if the memory unit imposes no alignment constraints. The compiler then inserts data reorganization operations to satisfy the actual alignment requirements of the hardware. Finally, the code generation algorithm generates SIMD codes based on the data reorganization graph, addressing realistic issues such as runtime alignments, unknown loop bounds, residual iteration counts, and multiple statements with arbitrary alignment combinations. Loop peeling is used to reduce the computational overhead associated with misaligned data. A loop prologue and epilogue are peeled from individual iterations in the simdized loop, and vector-splicing instructions are applied to the peeled iterations, while the steady-state loop body incurs no additional computational overhead.
Abstract:
Methods, apparatus, or products for displaying an image of an object placed on a surface computer, the surface computer including a surface, surface computer capable receiving multi-touch input through the surface and rendering display output on the surface, the surface computer including a scanner, that include: detecting, by the surface computer, an object placed on the surface; identifying, by the surface computer, a region of the surface upon which the object is placed; scanning, by the surface computer using the scanner, the identified region of the surface to create an object image of the object; and rendering, by the surface computer, the object image within the identified region without modifying portions of any other images rendered on the surface outside the identified region.
Abstract:
A system and method for using a single test case to test each sector within multiple congruence classes is presented. A test case generator builds a test case for accessing each sector within a congruence class. Since a congruence class spans multiple congruence pages, the test case generator builds the test case over multiple congruence pages in order for the test case to test the entire congruence class. During design verification and validation, a test case executor modifies a congruence class identifier (e.g., patches a base register), which forces the test case to test a specific congruence class. By incrementing the congruence class identifier after each execution of the test case, the test case executor is able to test each congruence class in the cache using a single test case.
Abstract:
A system and method for cache optimized data formatting is presented. A processor generates images by calculating a plurality of image point values using height data, color data, and normal data. Normal data is computed for a particular image point using pixel data adjacent to the image point. The computed normalized data, along with corresponding height data and color data, are included in a limited space data stream and sent to a processor to generate an image. The normalized data may be computed using adjacent pixel data at any time prior to inserting the normalized data in the limited space data stream.
Abstract:
Adaptive span computation when ray casting is presented. A processor uses start point fractional values during view screen segment computations that start a view screen segment's computations a particular distance away from a down point. This prevents an excessive sampling density during image generation without wasting processor resources. The processor identifies a start point fractional value for each view screen segment based upon each view screen segment's identifier, and computes a view screen segment start point for each view screen segment using the start point fractional value. View screen segment start points are “tiered” and are a particular distance away from the down point. This stops the view screen segments from converging to a point of severe over sampling while, at the same time, providing a pseudo-uniform sampling density.
Abstract:
A system and method for optimal selection of payment authorization in a complex commerce system is presented. A commerce system uses an algorithm to select an optimum payment authorization for a particular payment deposit. The algorithm allows the commerce system to support multiple types of authorizations while minimizing the number of payment transactions if possible. The algorithm also handles payment instrument priority, sufficient authorization amount availability, and a selection of a favorable set of payment authorizations for which to apply the payment deposit. Once the algorithm selects an optimum payment authorization for a particular payment deposit, the commerce system applies the payment deposit towards the optimum payment authorization in order to receive funds from an external payment provider.
Abstract:
A system and method that gathers activity level from users and provides a “busy gauge” to others that indicates the user's activity level. In one embodiment, the user's activity is computed automatically based upon the user's interaction with their computer system. In the automatic method, an input tracking routine records the user's input frequency, such as mouse clicks, voice inputs, keyboard inputs, and other inputs in order to determine the user's activity level. The recorded activity data is compared with activity level thresholds that can be either default thresholds or user-specified. The user can select to use a manual input level in which the user specifies the user's activity level despite the number of input actions received at the user's computer.
Abstract:
A user enters control settings into a content receiver whereby the control settings correspond to a particular viewer or a particular time-of-day. The content receiver receives a media signal and metadata that includes censorship level information. The content receiver uses the control settings to identify an applicable censorship level and uses the metadata to de-scramble the media signal to a censorship level corresponding to the identified applicable censorship level. The content receiver provides the de-scrambled media signal to a viewer's display.
Abstract:
Disclosed is a method, apparatus, computer program and computer program product for adjusting the frequency at which data is backed up. This involves receiving a target recovery time. A current estimated recovery time is then determined and the current and target times are compared. If it is determined that the current estimated recovery time has reached a predetermined threshold relative to the received target recovery time a new backup should be initiated.
Abstract:
A system and method for a high frequency stall design is presented. An issue unit includes a first instruction stage, a second instruction stage, and issue control logic. During a first instruction cycle, the issue unit performs two tasks, which are 1) the instructions located in the first instruction stage are moved to a second instruction stage, and 2) the issue control logic determines whether to issue or stall the instructions that are moved to the second instruction stage based upon their particular instruction attributes and the issue control unit's previous state. During a second instruction cycle that immediately follows the first instruction cycle, the second instruction stage's instructions are either issued or stalled based upon the issue control logic's decision from the first instruction cycle.