Abstract:
A method for tailored compiler optimization is provided. The method includes extracting kernels from an application program, performance tuning the kernels to determine a tailored optimization strategy for each of the kernels, the tailored optimization strategy different than a default optimization strategy of a compiler for each of the kernels, and annotating the application program, using a computer, to identify the tailored optimization strategy determined for each of the kernels. In an embodiment, the method also includes the design and implementation for adjusting a compiler to customize optimization strategies for different kernels.
Abstract:
The invention relates to a method for providing organic, semi-organic, mineral, inorganic and hybrid thin layers and thin layers containing nanoparticles, by simultaneous or alternate spraying of solutions of reactive partners (that is polymer/polymer interacting by hydrogen bonding, polyelectrolyte/small oligo-ion, inorganic compounds, etc.) on the surface of a solid substrate.
Abstract:
A control method, system and function entity for reporting a bearer event of a signaling IP flow are provided. A 5-tuple is generated for a signaling IP flow and a media IP flow so as to unify a mechanism for reporting a signaling path status and a mechanism for reporting a bearer event of a media IP flow, so that the mechanism for reporting a signaling path status is not limited by the parameter of Flow Usage, the PDP context with a signaling tag, thereby establishing corresponding PCC rules for signaling and the association between a signaling IP flow and a bearer. A method for reporting a signaling path status is further provided in the invention. In the method, for a default PDP context or a PDP context of a signaling IP flow, the predefined PCC rules are activated or signaling PCC rules generated in accordance with an Application Function address are installed, thereby an IP signaling path status is reported in accordance with rule names of the predefine PCC rules or the signaling PCC rules.
Abstract:
A target operation in a normalized target loop, susceptible of vectorization and which may, after compilation into a vectorized form, seek to operate on data in nonconsecutive physical memory, is identified in source code. Hardware instructions are inserted into executable code generated from the source code, directing a system that will run the executable code to create a representation of the data in consecutive physical memory. A vector loop containing the target operation is replaced, in the executable code, with a function call to a vector library to call a vector function that will operate on the representation to generate a result identical to output expected from executing the vector loop containing the target operation. On execution, a representation of data residing in nonconsecutive physical memory is created in consecutive physical memory, and the vectorized target operation is applied to the representation to process the data.
Abstract:
A method for generating code, including identifying at least one portion of source code that is simdizable and has a dependence, analyzing the dependence for characteristics, based upon the characteristics, selecting a transformation from a predefined group of transformations, applying the transformation to the at least one portion to generate SIMD code for the at least one portion.
Abstract:
A method and a system of realizing event detection are provided, which detect a status of an Internet Protocol (IP) connectivity access network (IP-CAN) bearer corresponding to a policy and charging control (PCC) rule by binding an Event-Trigger parameter to the PCC rule, thereby realizing small-granularity detection for the specific PCC rule and reducing the load of the system. Furthermore, a status of the IP-CAN bearer or an IP flow is realized by binding the Event-Trigger parameter to an IP-CAN identifier (ID) or an IP flow ID, so as to avoid the problem about too large granularity of the binding of event detection and IP-CAN session and reduce the burden of the IP-CAN bearer detection and message exchange.
Abstract:
Systems, methods and computer products for implementing shadow versioning to improve data dependence analysis for instruction scheduling. Exemplary embodiments include a method to identify loops within the code to be compiled, for each loop a dependence initializing a matrix, for each loop shadow identifying symbols that are accessed by the loop, examining dependencies, storing, comparing and classifying the dependence vectors, generating new shadow symbols, replacing the old shadow symbols with the new shadow symbols, generating alias relationships between the newly created shadow symbols, scheduling instructions and compiling the code.
Abstract:
A mounting apparatus for mounting a data storage device that has a protrusion protruding from a sidewall thereof includes a mounting board, and a bracket. The mounting board includes a depressed portion for holding the data storage device. The depressed portion includes a first side wall. The bracket includes a leg member with an end pivotably mounted to the first side wall of the depressed portion of the mounting board. A first receiving slot for receiving the protrusion of the data storage device is defined in a bottom of the leg member. A drive portion is formed at a side of the receiving slot away from the end of the leg member, for cooperating with a corresponding protrusion of the data storage device when installing the data storage device.
Abstract:
An on-line fault detection and avoidance method is provided for industrial control systems that include multiple interacting process controllers. The method addresses the problem that not all faults can be determined and removed at the time of system design and testing. When a fault translates into a time-out condition in one or more controllers, symptoms are identified, persistence is measured, other involved controllers are identified, the fault condition is identified and control laws are reconfigured to avoid the fault condition in the future.