Abstract: Techniques for managing discussion sharing on a mobile platform, comprising a power application. The power application may include, among other components, a power monitoring component to monitor at least one component and/or at least one application of a mobile device to determine device profile information, and a power management component to provide the determined device profile information of a mobile device to a server device and receive predicted information representative of forecasted power utilization of the mobile device and/or context sensitive recommendation information representative of one or more context sensitive recommendations for the mobile device.

Abstract: Techniques for managing discussion sharing on a mobile platform, comprising a power application. The power application may include, among other components, a power monitoring component to monitor at least one component and/or at least one application of a mobile device to determine device profile information, and a power management component to provide the determined device profile information of a mobile device to a server device and receive predicted information representative of forecasted power utilization of the mobile device and/or context sensitive recommendation information representative of one or more context sensitive recommendations for the mobile device.

Abstract: Techniques for managing discussion sharing on a mobile platform, comprising a power application. The power application may include, among other components, a power monitoring component to monitor at least one component and/or at least one application of a mobile device to determine device profile information, and a power management component to provide the determined device profile information of a mobile device to a server device and receive predicted information representative of forecasted power utilization of the mobile device and/or context sensitive recommendation information representative of one or more context sensitive recommendations for the mobile device.

Abstract: GPU fragment programs can be used to render images in a computer system. These fragment programs are generated from render trees, which specify one or more filters or functions to be applied to an input image to render an output image. It is not uncommon for successive frames to require application of substantially the same filters. Therefore, rather than regenerate and recompile new fragment programs for successive corresponding render trees, the render trees are substantially uniquely identified and cached. Thus, when a render tree is received, it can be identified, and this identifier (such as a hash) can be used to determine whether a corresponding fragment program has already been generated, compiled and cached. If so, the corresponding cached fragment program is retrieved and executed. If not, a fragment program for the newly received render tree is generated and cached.

Abstract: A technique for optimizing the rendering of such complex render-graphs caches intermediate buffers of nodes that are expected to be re-used after they've been rendered. The render-graph is examined to determine the number of re-uses of each node's output buffer, and the buffer is cached in memory until all the re-uses of the buffer have occurred. Once all the re-uses of the buffer have occurred, the buffer is removed from the cache. This technique guarantees that for a given render-graph, no nodes will be re-rendered, resulting in improved render performance.

Abstract: GPU fragment programs can be used to render images in a computer system. These fragment programs are generated from render trees, which specify one or more filters or functions to be applied to an input image to render an output image. It is not uncommon for successive frames to require application of substantially the same filters. Therefore, rather than regenerate and recompile new fragment programs for successive corresponding render trees, the render trees are substantially uniquely identified and cached. Thus, when a render tree is received, it can be identified, and this identifier (such as a hash) can be used to determine whether a corresponding fragment program has already been generated, compiled and cached. If so, the corresponding cached fragment program is retrieved and executed. If not, a fragment program for the newly received render tree is generated and cached.

Abstract: A technique for optimizing the rendering of such complex render-graphs caches intermediate buffers of nodes that are expected to be re-used after they've been rendered. The render-graph is examined to determine the number of re-uses of each node's output buffer, and the buffer is cached in memory until all the re-uses of the buffer have occurred. Once all the re-uses of the buffer have occurred, the buffer is removed from the cache. This technique guarantees that for a given render-graph, no nodes will be re-rendered, resulting in improved render performance.