Abstract: A first thread receives a start movement command and a parametric curve from a second thread in response to the second thread receiving an input to move an element that is rendered in an interface. The parametric curve defines parameters for movement of an element. The first thread calculates a positioning of the element on the interface using the parametric curve. Then, the first thread positions the element in the interface based on the positioning and continues to calculate the positioning and position the element in the interface using the parametric curve until a stop movement command is received from the second thread.

Abstract: A first thread sends a rendering request for a scalable video graphics operation using a scalable video graphics object to a second thread. The second thread processes the scalable video graphics operation to render the scalable video graphics object using a first set of parameters that is stored in a data structure. The first thread performs a computation that calculates a second set of parameters for the scalable video graphics operation and stores the second set of parameters in the data structure. The first thread sends a signal to the second thread indicating that the first set of parameters have changed to the second set of parameters to allow the second thread to synchronize and use the second set of parameters to process the scalable video graphics operation.

Abstract: A first thread sends a rendering request for a scalable video graphics operation using a scalable video graphics object to a second thread. The second thread processes the scalable video graphics operation to render the scalable video graphics object using a first set of parameters that is stored in a data structure. The first thread performs a computation that calculates a second set of parameters for the scalable video graphics operation and stores the second set of parameters in the data structure. The first thread sends a signal to the second thread indicating that the first set of parameters have changed to the second set of parameters to allow the second thread to synchronize and use the second set of parameters to process the scalable video graphics operation.

Abstract: A first thread receives a start movement command and a parametric curve from a second thread in response to the second thread receiving an input to move an element that is rendered in an interface. The parametric curve defines parameters for movement of an element. The first thread calculates a positioning of the element on the interface using the parametric curve. Then, the first thread positions the element in the interface based on the positioning and continues to calculate the positioning and position the element in the interface using the parametric curve until a stop movement command is received from the second thread.

Abstract: Techniques for synchronization points for state information are described. In at least some embodiments, synchronization points are employed to propagate state information among different processing threads. A synchronization point, for example, can be employed to propagate state information among different independently-executing threads. Accordingly, in at least some embodiments, synchronization points serve as inter-thread communications among different independently-executing threads.

Abstract: In one or more embodiments, a framework is provided in which image decoding can be delayed based on heuristics, and later initiated based on a use type associated with the image or the likelihood that the image is going to be used. For example, a use history and priority system can enable images that are currently being rendered and/or are likely to get rendered to be decoded before images that have a history of being downloaded but never used. Accordingly, by decoupling image download from image decoding, CPU resources and memory can be more efficiently utilized.

Abstract: In one or more embodiments, a framework is provided in which image decoding can be delayed based on heuristics, and later initiated based on a use type associated with the image or the likelihood that the image is going to be used. For example, a use history and priority system can enable images that are currently being rendered and/or are likely to get rendered to be decoded before images that have a history of being downloaded but never used. Accordingly, by decoupling image download from image decoding, CPU resources and memory can be more efficiently utilized.

Abstract: Techniques for synchronization points for state information are described. In at least some embodiments, synchronization points are employed to propagate state information among different processing threads. A synchronization point, for example, can be employed to propagate state information among different independently-executing threads. Accordingly, in at least some embodiments, synchronization points serve as inter-thread communications among different independently-executing threads.

Abstract: In one or more embodiments, a framework is provided in which image decoding can be delayed based on heuristics, and later initiated based on a use type associated with the image or the likelihood that the image is going to be used. For example, a use history and priority system can enable images that are currently being rendered and/or are likely to get rendered to be decoded before images that have a history of being downloaded but never used. Accordingly, by decoupling image download from image decoding, CPU resources and memory can be more efficiently utilized.

Abstract: In one or more embodiments, a framework is provided in which image decoding can be delayed based on heuristics, and later initiated based on a use type associated with the image or the likelihood that the image is going to be used. For example, a use history and priority system can enable images that are currently being rendered and/or are likely to get rendered to be decoded before images that have a history of being downloaded but never used. Accordingly, by decoupling image download from image decoding, CPU resources and memory can be more efficiently utilized.

Abstract: Techniques for surface caching are described in which a cache for surfaces is provided to enable existing surfaces to be reused. Surfaces in the cache can be assigned to one of multiple surface lists used to service requests for surfaces. The multiple lists can include at least a main list and an auxiliary list configured to group existing surfaces according to corresponding surface constraints. When a surface is requested, the multiple lists can be searched to find an existing surface based on constraints including, for example, the type of surface and size requirements for the requested surface. If an existing surface is discovered, the existing surface can be returned to service the request. If a suitable surface is not found in the multiple lists, a new surface is created for the request and the new surface can be added to a corresponding one of the multiple surface lists.

Abstract: In one or more embodiments, a framework is provided in which image decoding can be delayed based on heuristics, and later initiated based on a use type associated with the image or the likelihood that the image is going to be used. For example, a use history and priority system can enable images that are currently being rendered and/or are likely to get rendered to be decoded before images that have a history of being downloaded but never used. Accordingly, by decoupling image download from image decoding, CPU resources and memory can be more efficiently utilized.

Abstract: Techniques for surface caching are described in which a cache for surfaces is provided to enable existing surfaces to be reused. Surfaces in the cache can be assigned to one of multiple surface lists used to service requests for surfaces. The multiple lists can include at least a main list and an auxiliary list configured to group existing surfaces according to corresponding surface constraints. When a surface is requested, the multiple lists can be searched to find an existing surface based on constraints including, for example, the type of surface and size requirements for the requested surface. If an existing surface is discovered, the existing surface can be returned to service the request. If a suitable surface is not found in the multiple lists, a new surface is created for the request and the new surface can be added to a corresponding one of the multiple surface lists.

Abstract: In one or more embodiments, a framework is provided in which image decoding can be delayed based on heuristics, and later initiated based on a use type associated with the image or the likelihood that the image is going to be used. For example, a use history and priority system can enable images that are currently being rendered and/or are likely to get rendered to be decoded before images that have a history of being downloaded but never used. Accordingly, by decoupling image download from image decoding, CPU resources and memory can be more efficiently utilized.