| Patent application number | Description | Published |
|---|
| 20110059774 | Wireless Communication Device for Providing a Visual Representation of a Widget - There is disclosed a wireless communication device comprising a display providing a visual representation of a widget. For one embodiment, a wireless transceiver receives a textual content and a tag, a processor determines whether the wireless transceiver has received a graphical content associated with the textual content and the tag. The display provides the textual content in a first window and the graphical content adjacent to the first window in response to determining that the graphical content has been received. The display provides the textual content in a larger, second window in response to determining that the graphical content has not been received. For another embodiment, the wireless transceiver receives a textual content, a graphical content, and a content identifier corresponding to a content header. The display provides a window for each of the textual content, the graphical content, and the content header corresponding to the content identifier, such that the graphical content and content header are positioned at opposites sides of the textual content. | 03-10-2011 |
| 20110061019 | Portable Electronic Device for Providing a Visual Representation of a Widget - There is disclosed a portable electronic device comprising a display providing a visual representation of a widget. For one embodiment, the visual representation comprises a first window including a textual content and a second window including a graphical content. The first and second windows are situated within a periphery of the visual representation such that the first window overlaps part of the second window and a portion of the graphical content of the second window is obscured by the first window. For other embodiments, the visual representation comprises first window including a peripheral boundary surrounding a textual content and a second window including a textual heading or graphical content, and a graphical icon overlaying a part of the graphical content. A portion of the peripheral border of the first window includes an outwardly protruding section directed towards the graphical icon of the second window. | 03-10-2011 |
| Patent application number | Description | Published |
|---|
| 20080243965 | COOPERATIVE DLL UNLOAD - Loading and unloading a plurality of libraries on a computing device having a loader lock and internal and external counts for each library in the plurality of libraries is disclosed. The libraries assume an initialize state, followed by an initialized state, a pending unload state, and an unload state according to when the internal and external counts are incremented and decremented. When in the pending unload state, the functions of a library that include functions that require acquiring the loader lock exit, the internal count is decremented by one, and the loader lock is released. Prior to entering the pending unload state, a library may be placed into a reloadable state. A library in the reloadable state may be reloaded upon request until a timer times out. When the timer times out, the library in the reloadable state transitions into the pending unload state. | 10-02-2008 |
| 20080244550 | DYNAMIC DLL CYCLE RESOLUTION - Deterministically resolving cycles in a library tree is disclosed. Resolving cycles supports certain processes such as safe library initialization. Cycles in the library tree are identified; at least one soft link in each identified cycle is identified; and the at least one soft link in each identified cycle is broken. If a cycle has no soft links, notification is provided indicating that the cycle cannot be broken. Identifying at least one soft link in each identified cycle comprises, for each link in the cycle, determining the dependent and supporting libraries; and determining if one or more functions in the supporting library are required for initializing the dependent library. | 10-02-2008 |
| 20080244551 | PARALLEL DLL TREE INITIALIZATION - A parallel processing method and apparatus for initializing libraries is disclosed. Libraries for an application are identified, an initialization order for the libraries is determined, and the libraries are initialized in asynchronous stages. The initialization order is determined by forming a library tree of the libraries' references and determining a load order for the references according to the levels of the references in the library tree. The asynchronous stages comprise a loading stage that includes a load queue, a snapping stage that includes a snap queue, and an initializing stage that includes an initialize queue. | 10-02-2008 |
| 20080288750 | Small barrier with local spinning - A barrier with local spinning. The barrier is described as a barrier object having a bit vector embedded as a pointer. If the vector bit is zero, the object functions as a counter; if the vector bit is one, the object operates as a pointer to a stack. The object includes the total number of threads required to rendezvous at the barrier to trigger release of the threads. The object points to a stack block list that describes each thread that has arrived at the barrier. Arriving at the barrier involves reading the top stack block, pushing onto the list a stack block for the thread that just arrived, decrementing the thread count, and spinning on corresponding local memory locations or timing out and blocking. When the last thread arrives at the barrier, the barrier is reset and all threads at the barrier are awakened for the start of the next process. | 11-20-2008 |
| 20100017581 | LOW OVERHEAD ATOMIC MEMORY OPERATIONS - Embodiments that provide low-overhead restricted memory transactions are disclosed. In accordance with one embodiment, the method includes providing one or more references to processor-specific data that corresponds to a first processor. The method further includes detecting an interrupt to the first processor when the interrupt indicates modification of the one or more references to the processor-specific data during the execution of one or more instructions. The method also includes taking remedial action on the one or more instructions when the interrupt is detected. | 01-21-2010 |
| 20110047549 | Manipulating a spin bit within the wait primitive - A method of avoiding unnecessary context switching in a multithreaded environment. A thread of execution of a process waiting on a lock protecting access to a shared resource may wait for the lock to be released by executing in a loop, or “spin”. The waiting thread may continuously check, in a user mode of an operating system, an indicator of whether the lock has been released. After a certain time period, the thread may stop spinning and enter a kernel mode of the operating system. Subsequently, before going to sleep which entails costly context switching, the thread may perform an additional check of the indicator to determine whether the lock has been released. If this is the case, the thread returns to user mode and the unnecessary context switching is avoided. | 02-24-2011 |
| 20110214128 | ONE-TIME INITIALIZATION - Aspects of the present invention are directed at providing safe and efficient ways for a program to perform a one-time initialization of a data item in a multi-threaded environment. In accordance with one embodiment, a method is provided that allows a program to perform a synchronized initialization of a data item that may be accessed by multiple threads. More specifically, the method includes receiving a request to initialize the data item from a current thread. In response to receiving the request, the method determines whether the current thread is the first thread to attempt to initialize the data item. If the current thread is the first thread to attempt to initialize the data item, the method enforces mutual exclusion and blocks other attempts to initialize the data item made by concurrent threads. Then, the current thread is allowed to execute program code provided by the program to initialize the data item. | 09-01-2011 |
| 20110219379 | ONE-TIME INITIALIZATION - Aspects of the present invention are directed at providing safe and efficient ways for a program to perform a one-time initialization of a data item in a multi-threaded environment. In accordance with one embodiment, a method is provided that allows a program to perform a synchronized initialization of a data item that may be accessed by multiple threads. More specifically, the method includes receiving a request to initialize the data item from a current thread. In response to receiving the request, the method determines whether the current thread is the first thread to attempt to initialize the data item. If the current thread is the first thread to attempt to initialize the data item, the method enforces mutual exclusion and blocks other attempts to initialize the data item made by concurrent threads. Then, the current thread is allowed to execute program code provided by the program to initialize the data item. | 09-08-2011 |
