Abstract:
A method for obtaining capabilities of a Policy and Charging Enforcement Function (PCEF) includes these steps: a Policy Control and Charging Rules Function (PCRF) obtains capability information of the PCEF; and the PCRF performs processing according to the capability information. A PCRF is also disclosed. With the present disclosure, the PCEF reports its capabilities in advance so that the PCRF makes policy decisions for a service or subscribes to appropriate application events from the PCEF when it knows the capabilities of the PCEF. This avoids possible subscription errors and decision failures arising when the PCRF is unable to know the capabilities of the PCEF.
Abstract:
A method and system for generating efficient versioned codes for single instruction multiple data units whose memory systems have alignment constraints. The system creates multiple versions of codes based on relative alignments of the data streams involved in the computation. The system also analyzes characteristics of relative alignments (e.g. compile-time or runtime) to determine whether code versioning is beneficial based on a cost model.
Abstract:
A method, a system, and a network element for service processing after data of a network element is invalid or a network element fails is provided. When the service network element receives the service request message from the network and is initiated to a called end and the user data is invalid, the service network element returns a data invalid message of the called end to the network. When a network element containing registration data of a user is abnormal and the registration data of the user is invalid, by using the present invention, the service unavailable time is shortened, and user services can be recovered rapidly.
Abstract:
A display device includes a frame defining an opening, a shell, and a display panel installed between the frame and the shell. The display panel is viewable via the opening of the frame. A latch is formed on the frame. A fixing portion is formed on the shell and slidably engaged with the latch of the frame for slidably fixing the shell to the frame. A plurality of fasteners extends through the frame to engage with the shell to thereby fasten the frame and the shell together.
Abstract:
A computer implemented method, apparatus, and computer program product for compiling source code. The source code is scanned to identify a candidate region. A procedure control descriptor is corresponding to the candidate region is generated. The procedure control descriptor identifies, for the candidate region, a condition which, if true at runtime means that the candidate region can be specialized. Responsive to a determination during compile time that satisfaction of at least one condition will be known only at runtime, the procedure control descriptor is used to specialize the candidate region at compile time to create a first version of the candidate region for execution in a case where the condition is true and a second version of the candidate region for execution in a case where the condition is false. Also responsive to the determination, code is further generated to correctly select one of the first region and the second region at runtime.
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 computer implemented method, system and computer program product for automatically generating SIMD code, particularly in the presence of multi-threading and other false sharing conditions, and in machines having a segmented/virtual page memory protection system. The method begins by analyzing data to be accessed by a targeted loop including at least one statement, where each statement has at least one memory reference, to determine if memory accesses are safe. If memory accesses are safe, the targeted loop is simdized. If not safe, it is determined if a scheme can be applied in which safety need not be guaranteed. If such a scheme can be applied, the scheme is applied and the targeted loop is simdized according to the scheme. If such a scheme cannot be applied, it is determined if padding is appropriate. If padding is appropriate, the data is padded and the targeted loop is simdized. If padding is not appropriate, non-simdized code is generated based on the targeted loop for handling boundary conditions, the targeted loop is simdized, and the simdized targeted loop is combined with the non-simdized code.