Managing Threads in a Wake-and-Go Engine

Abstract

A wake-and-go mechanism is provided for a data processing system. The wake-and-go mechanism detects a thread running on a first processing unit within a plurality of processing units that is waiting for an event that modifies a data value associated with a target address. The wake-and-go mechanism creates a wake-and-go instance for the thread by populating a wake-and-go storage array with the target address. The operating system places the thread in a sleep state. Responsive to detecting the event that modifies the data value associated with the target address, the wake-and-go mechanism assigns the wake-and-go instance to a second processing unit within the plurality of processing units. The operating system on the second processing unit places the thread in a non-sleep state.

Claims

1 . A method, in a data processing system, for performing a wake-and-go operation, the method comprising: detecting a thread running on a first processing unit within a plurality of processing units that is waiting for an event that modifies a data value associated with a target address; creating a wake-and-go instance for the thread by populating a wake-and-go storage array with the target address; placing the thread in a sleep state; responsive to detecting the event that modifies the data value associated with the target address, assigning the wake-and-go instance to a second processing unit within the plurality of processing units; and placing the thread in a non-sleep state on the second processing unit. 2 . The method of claim 1 , wherein assigning the wake-and-go instance to the second processing unit comprises: determining that the second processing unit has a lowest processor utilization within the plurality of processing units. 3 . The method of claim 1 , wherein assigning the wake-and-go instance to the second processing unit comprises: determining that the second processing unit has a lowest priority thread running within the plurality of processing units. 4 . The method of claim 3 , wherein placing the thread in a non-sleep state on the second processing unit comprises placing the lowest priority thread in a sleep state on the second processing unit. 5 . The method of claim 1 , wherein the wake-and-go storage array is a first wake-and-go storage array associated with the first processing unit and wherein assigning the wake-and-go instance to the second processing unit comprises transferring the wake-and-go instance from the first wake-and-go storage array to a second wake-and-go storage array associated with the second processing unit. 6 . The method of claim 1 , wherein the wake-and-go storage array is a central repository wake-and-go storage array. 7 . The method of claim 1 , wherein the wake-and-go storage array is a content addressable memory and an address on a bus is used to address the content addressable memory. 8 . The method of claim 7 , wherein responsive to detecting the event that modifies the data value associated with the target address, the content addressable memory returns a storage address at which the target address is stored in the content addressable memory. 9 . The method of claim 1 , wherein the first processing element and the second processing element are processing cores in a multiple core processor. 10 . The method of claim 1 , wherein the event is an asynchronous event caused by a device outside a processor running the thread. 11 . The method of claim 1 , wherein the method is performed by a wake-and-go mechanism. 12 . The method of claim 11 , wherein the wake-and-go mechanism is one of a hardware component within a processor, a hardware component associated with the wake-and-go storage array, or a hardware component associated with a system bus. 13 . A data processing system, comprising: a wake-and-go mechanism; and a wake-and-go storage array, wherein the wake-and-go mechanism is configured to: detect a thread running on a first processing unit within a plurality of processing units that is waiting for an event that modifies a data value associated with a target address; create a wake-and-go instance for the thread by populating a wake-and-go storage array with the target address; place the thread in a sleep state; responsive to detecting the event that modifies the data value associated with the target address, assign the wake-and-go instance to a second processing unit within the plurality of processing units; and place the thread in a non-sleep state on the second processing unit. 14 . The data processing system of claim 13 , wherein assigning the wake-and-go instance to the second processing unit comprises: determining that the second processing unit has a lowest processor utilization within the plurality of processing units. 15 . The data processing system of claim 13 , wherein assigning the wake-and-go instance to the second processing unit comprises: determining that the second processing unit has a lowest priority thread running within the plurality of processing units. 16 . The data processing system of claim 15 , wherein placing the thread in a non-sleep state on the second processing unit comprises placing the lowest priority thread in a sleep state on the second processing unit. 17 . The data processing system of claim 13 , wherein the wake-and-go storage array is a first wake-and-go storage array associated with the first processing unit and wherein assigning the wake-and-go instance to the second processing unit comprises transferring the wake-and-go instance from the first wake-and-go storage array to a second wake-and-go storage array associated with the second processing unit. 18 . The data processing system of claim 13 , wherein the wake-and-go storage array is a central repository wake-and-go storage array. 19 . A computer program product comprising a computer recordable medium having a computer readable program recorded thereon, wherein the computer readable program, when executed on a computing device, causes the computing device to: detect a thread running on a first processing unit within a plurality of processing units that is waiting for an event that modifies a data value associated with a target address; create a wake-and-go instance for the thread by populating a wake-and-go storage array with the target address; place the thread in a sleep state; responsive to detecting the event that modifies the data value associated with the target address, assign the wake-and-go instance to a second processing unit within the plurality of processing units; and place the thread in a non-sleep state on the second processing unit. 20 . The computer program product of claim 19 , wherein wake-and-go storage array is a central repository wake-and-go storage array.
[0001] This invention was made with United States Government support under Agreement No. HR0011-07-9-0002 awarded by DARPA. The Government has certain rights in the invention. BACKGROUND [0002] The present application relates generally to an improved data processing system and method. More specifically, the present application is directed to a mechanism to wake a sleeping thread based on an asynchronous event. [0003] Multithreading is multitasking within a single program. Multithreading allows multiple streams of execution to take place concurrently within the same program, each stream processing a different transaction or message. In order for a multithreaded program to achieve true performance gains, it must be run in a multitasking or multiprocessing environment, which allows multiple operations to take place. [0004] Certain types of applications lend themselves to multithreading. For example, in an order processing system, each order can be entered independently of the other orders. In an image editing program, a calculation-intensive filter can be performed on one image, while the user works on another. Multithreading is also used to create synchronized audio and video applications. [0005] In addition, a symmetric multiprocessing (SMP) operating system uses multithreading to allow multiple CPUs to be controlled at the same time. An SMP computing system is a multiprocessing architecture in which multiple central processing units (CPUs) share the same memory. SMP speeds up whatever processes can be overlapped. For example, in a desktop computer, SMP may speed up the running of multiple applications simultaneously. If an application is multithreaded, which allows for concurrent operations within the application itself, then SMP may improve the performance of that single application. [0006] If a process, or thread, is waiting for an event, then the process goes to sleep. A process is said to be “sleeping,” if the process is in an inactive state. The thread remains in memory, but is not queued for processing until an event occurs. Typically, this event is detected when there is a change to a value at a particular address or when there is an interrupt. [0007] As an example of the latter, a processor may be executing a first thread, which goes to sleep. The processor may then begin executing a second thread. When an interrupt occurs, indicating that an event for which the first thread was waiting, the processor may then stop running the second thread and “wake” the first thread. However, in order to receive the interrupt, the processor must perform interrupt event handling, which is highly software intensive. An interrupt handler has multiple levels, typically including a first level interrupt handler (FLIH) and a second level interrupt handler (SLIH); therefore, interrupt handling may be time-consuming. [0008] In the former case, the processor may simply allow the first thread to periodically poll a memory location to determine whether a particular event occurs. The first thread performs a get instruction and a compare instruction (GET&CMP) to determine whether a value at a given address is changed to an expected value. When one considers that a computing system may be running thousands of threads, many of which are waiting for an event at any given time, there are many wasted processor cycles spent polling memory locations when an expected event has not occurred. SUMMARY [0009] In one illustrative embodiment, a method is provided in a data processing system for performing a wake-and-go operation. The method comprises detecting a thread running on a first processing unit within a plurality of processing units that is waiting for an event that modifies a data value associated with a target address, creating a wake-and-go instance for the thread by populating a wake-and-go storage array with the target address, placing the thread in a sleep state, and responsive to detecting the event that modifies the data value associated with the target address, assigning the wake-and-go instance to a second processing unit within the plurality of processing units. The method further comprises placing the thread in a non-sleep state on the second processing unit. [0010] In another illustrative embodiment, a data processing system comprises a wake-and-go mechanism and a wake-and-go storage array. The wake-and-go mechanism is configured to detect a thread running on a first processing unit within a plurality of processing units that is waiting for an event that modifies a data value associated with a target address, create a wake-and-go instance for the thread by populating a wake-and-go storage array with the target address, place the thread in a sleep state, and responsive to detecting the event that modifies the data value associated with the target address, assign the wake-and-go instance to a second processing unit within the plurality of processing units. The wake-and-go mechanism is further configured to place the thread in a non-sleep state on the second processing unit. [0011] In another illustrative embodiment, a computer program product comprises a computer recordable medium having a computer readable program recorded thereon. The computer readable program, when executed on a computing device, causes the computing device to detect a thread running on a first processing unit within a plurality of processing units that is waiting for an event that modifies a data value associated with a target address, create a wake-and-go instance for the thread by populating a wake-and-go storage array with the target address, place the thread in a sleep state, and responsive to detecting the event that modifies the data value associated with the target address, assign the wake-and-go instance to a second processing unit within the plurality of processing units. The computer readable program further causes the computing device to place the thread in a non-sleep state on the second processing unit. [0012] These and other features and advantages of the present invention will be described in, or will become apparent to those of ordinary skill in the art in view of, the following detailed description of the exemplary embodiments of the present invention. BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS [0013] The invention, as well as a preferred mode of use and further objectives and advantages thereof, will best be understood by reference to the following detailed description of illustrative embodiments when read in conjunction with the accompanying drawings, wherein: [0014] FIG. 1 is a block diagram of an exemplary data processing system in which aspects of the illustrative embodiments may be implemented; [0015] FIG. 2 is a block diagram of a wake-and-go mechanism in a data processing system in accordance with an illustrative embodiment; [0016] FIG. 3 is a block diagram of a wake-and-go mechanism with a hardware private array in accordance with an illustrative embodiment; [0017] FIGS. 4A and 4B are block diagrams illustrating operation of a wake-and-go mechanism with specialized processor instructions in accordance with an illustrative embodiment; [0018] FIGS. 5A and 5B are block diagrams illustrating operation of a wake-and-go mechanism with a specialized operating system call in accordance with an illustrative embodiment; [0019] FIG. 6 is a block diagram illustrating operation of a wake-and-go mechanism with a background sleeper thread in accordance with an illustrative embodiment; [0020] FIGS. 7A and 7B are flowcharts illustrating operation of a wake-and-go mechanism in accordance with the illustrative embodiments; [0021] FIGS. 8A and 8B are flowcharts illustrating operation of a wake-and-go mechanism with prioritization of threads in accordance with the illustrative embodiments; [0022] FIGS. 9A and 9B are flowcharts illustrating operation of a wake-and-go mechanism with dynamic allocation in a hardware private array in accordance with the illustrative embodiments; [0023] FIG. 10 is a block diagram of a hardware wake-and-go mechanism in a data processing system in accordance with an illustrative embodiment; [0024] FIGS. 11A and 11B illustrate a series of instructions that are a programming idiom for wake-and-go in accordance with an illustrative embodiment; [0025] FIGS. 12A and 12B are block diagrams illustrating operation of a hardware wake-and-go mechanism in accordance with an illustrative embodiment; [0026] FIGS. 13A and 13B are flowcharts illustrating operation of a hardware wake-and-go mechanism in accordance with the illustrative embodiments; [0027] FIGS. 14A and 14B are block diagrams illustrating operation of a wake-and-go engine with look-ahead in accordance with an illustrative embodiment; [0028] FIG. 15 is a flowchart illustrating a look-ahead polling operation of a wake-and-go look-ahead engine in accordance with an illustrative embodiment; [0029] FIG. 16 is a block diagram illustrating operation of a wake-and-go mechanism with speculative execution in accordance with an illustrative embodiment; [0030] FIG. 17 is a flowchart illustrating operation of a look-ahead wake-and-go mechanism with speculative execution in accordance with an illustrative embodiment; [0031] FIGS. 18A and 18B are flowcharts illustrating operation of a wake-and-go mechanism with speculative execution during execution of a thread in accordance with an illustrative embodiment; [0032] FIG. 19 is a block diagram illustrating data monitoring in a multiple processor system in accordance with an illustrative embodiment; [0033] FIG. 20 is a block diagram illustrating operation of a wake-and-go mechanism in accordance with an illustrative embodiment; [0034] FIGS. 21A and 21B are block diagrams illustrating parallel lock spinning using a wake-and-go mechanism in accordance with an illustrative embodiment; [0035] FIGS. 22A and 22B are flowcharts illustrating parallel lock spinning using a wake-and-go mechanism in accordance with the illustrative embodiments; [0036] FIG. 23 is a block diagram illustrating a wake-and-go engine with a central repository wake-and-go array in a multiple processor system in accordance with an illustrative embodiment; [0037] FIG. 24 illustrates a central repository wake-and-go-array in accordance with an illustrative embodiment; [0038] FIG. 25 is a block diagram illustrating a programming idiom accelerator in accordance with an illustrative embodiment; [0039] FIG. 26 is a series of instructions that are a programming idiom with programming language exposure in accordance with an illustrative embodiment; [0040] FIG. 27 is a block diagram illustrating a compiler that exposes programming idioms in accordance with an illustrative embodiment; and [0041] FIG. 28 is a flowchart illustrating operation of a compiler exposing programming idioms in accordance with an illustrative embodiment; [0042] FIG. 29 is a block diagram that illustrates a data processing system with thread abstraction in accordance with an illustrative embodiment; [0043] FIG. 30 is a block diagram that illustrates a data processing system with thread abstraction in a central wake-and-go array in accordance with an illustrative embodiment; [0044] FIG. 31 is a block diagram that illustrates a data processing system with thread abstraction in a wake-and-go engine in accordance with an illustrative embodiment; and [0045] FIGS. 32A and 32B are flowcharts illustrating operation of a wake-and-go mechanism with thread abstraction in accordance with the illustrative embodiments. DETAILED DESCRIPTION [0046] With reference now to the figures and in particular with reference to FIG. 1 , an exemplary diagram of data processing environments is provided in which illustrative embodiments of the present invention may be implemented. It should be appreciated that FIG. 1 is only exemplary and is not intended to assert or imply any limitation with regard to the environments in which aspects or embodiments of the present invention may be implemented. Many modifications to the depicted environments may be made without departing from the spirit and scope of the present invention. [0047] FIG. 1 is a block diagram of an exemplary data processing system in which aspects of the illustrative embodiments may be implemented. As shown, data processing system 100 includes processor cards 111 a - 111 n . Each of processor cards 111 a - 111 n includes a processor and a cache memory. For example, processor card 111 a contains processor 112 a and cache memory 113 a , and processor card 111 n contains processor 112 n and cache memory 113 n. [0048] Processor cards 111 a - 111 n connect to symmetric multiprocessing (SMP) bus 115 . SMP bus 115 supports a system planar 120 that contains processor cards 111 a - 111 n and memory cards 123 . The system planar also contains data switch 121 and memory controller/cache 122 . Memory controller/cache 122 supports memory cards 123 that includes local memory 116 having multiple dual in-line memory modules (DIMMs). [0049] Data switch 121 connects to bus bridge 117 and bus bridge 118 located within a native I/O (NIO) planar 124 . As shown, bus bridge 118 connects to peripheral components interconnect (PCI) bridges 125 and 126 via system bus 119 . PCI bridge 125 connects to a variety of I/O devices via PCI bus 128 . As shown, hard disk 136 may be connected to PCI bus 128 via small computer system interface (SCSI) host adapter 130 . A graphics adapter 131 may be directly or indirectly connected to PCI bus 128 . PCI bridge 126 provides connections for external data streams through network adapter 134 and adapter card slots 135 a- 135 n via PCI bus 127 . [0050] An industry standard architecture (ISA) bus 129 connects to PCI bus 128 via ISA bridge 132 . ISA bridge 132 provides interconnection capabilities through NIO controller 133 having serial connections Serial 1 and Serial 2. A floppy drive connection 137 , keyboard connection 138 , and mouse connection 139 are provided by NIO controller 133 to allow data processing system 100 to accept data input from a user via a corresponding input device. In addition, non-volatile RAM (NVRAM) 140 provides a non-volatile memory for preserving certain types of data from system disruptions or system failures, such as power supply problems. A system firmware 141 also connects to ISA bus 129 for implementing the initial Basic Input/Output System (BIOS) functions. A service processor 144 connects to ISA bus 129 to provide functionality for system diagnostics or system servicing. [0051] The operating system (OS) resides on hard disk 136 , which may also provide storage for additional application software for execution by data processing system. NVRAM 140 stores system variables and error information for field replaceable unit (FRU) isolation. During system startup, the bootstrap program loads the operating system and initiates execution of the operating system. To load the operating system, the bootstrap program first locates an operating system kernel type from hard disk 136 , loads the OS into memory, and jumps to an initial address provided by the operating system kernel. Typically, the operating system loads into random-access memory (RAM) within the data processing system. Once loaded and initialized, the operating system controls the execution of programs and may provide services such as resource allocation, scheduling, input/output control, and data management. [0052] The present invention may be executed in a variety of data processing systems utilizing a number of different hardware configurations and software such as bootstrap programs and operating systems. The data processing system 100 may be, for example, a stand-alone system or part of a network such as a local-area network (LAN) or a wide-area network (WAN). [0053] FIG. 1 is an example of a symmetric multiprocessing (SMP) data processing system in which processors communicate via a SMP bus 115 . FIG. 1 is only exemplary and is not intended to assert or imply any limitation with regard to the environments in which aspects or embodiments of the present invention may be implemented. The depicted environments may be implemented in other data processing environments without departing from the spirit and scope of the present invention. [0054] FIG. 2 is a block diagram of a wake-and-go mechanism in a data processing system in accordance with an illustrative embodiment. Threads 202 , 204 , 206 run on one or more processors (not shown). Threads 202 , 204 , 206 make calls to operating system 210 and application programming interface (API) 212 to communicate with each other, memory 232 via bus 220 , or other devices within the data processing system. [0055] In accordance with the illustrative embodiment, a wake-and-go mechanism for a microprocessor includes wake-and-go array 222 attached to the SMP fabric. The SMP fabric is a communication medium through which processors communicate. The SMP fabric may comprise a single SMP bus or a system of busses, for example. In the depicted example, the SMP fabric comprises bus 220 . A thread, such as thread 202 , for example, may include instructions that indicate that the thread is waiting for an event. The event may be an asynchronous event, which is an event that happens independently in time with respect to execution of the thread in the data processing system. For example, an asynchronous event may be a temperature value reaching a particular threshold, a stock price falling below a given threshold, or the like. Alternatively, the event may be related in some way to execution of the thread. For example, the event may be obtaining a lock for exclusive access to a database record or the like. [0056] Typically, the instructions may comprise a series of get-and-compare sequences; however, in accordance with the illustrative embodiment, the instructions include instructions, calls to operating system 210 or API 212 , or calls to a background sleeper thread, such as thread 204 , for example, to update wake-and-go array 222 . These instructions store a target address in wake-and-go array 222 , where the event the thread is waiting for is associated with the target address. After updating wake-and-go array 222 with the target address, thread 202 may go to sleep. [0057] When thread 202 goes to sleep, operating system 210 or other software or hardware saves the state of thread 202 in thread state storage 234 , which may be allocated from memory 232 or may be a hardware private array within the processor (not shown) or pervasive logic (not shown). When a thread is put to sleep, i.e., removed from the run queue of a processor, the operating system must store sufficient information on its operating state such that when the thread is again scheduled to run on the processor, the thread can resume operation from an identical position. This state information is sometime referred to as the thread's “context.” The state information may include, for example, address space, stack space, virtual address space, program counter, instruction register, program status word, and the like. [0058] If a transaction appears on bus 220 that modifies a value at an address in wake-and-go array 222 , then operating system 210 may wake thread 202 . Operating system 210 wakes thread 202 by recovering the state of thread 202 from thread state storage 234 . Thread 202 may then determine whether the transaction corresponds to the event for which the thread was waiting by performing a get-and-compare operation, for instance. If the transaction is the event for which the thread was waiting, then thread 202 will perform work. However, if the transaction is not the event, then thread 202 will go back to sleep. Thus, thread 202 only performs a get-and-compare operation if there is a transaction that modifies the target address. [0059] Alternatively, operating system 210 or a background sleeper thread, such as thread 204 , may determine whether the transaction is the event for which the thread was waiting. Before being put to sleep, thread 202 may update a data structure in the operating system or background sleeper thread with a value for which it is waiting. [0060] In one exemplary embodiment, wake-and-go array 222 may be a content addressable memory (CAM). A CAM is a special type of computer memory often used in very high speed searching applications. A CAM is also known as associative memory, associative storage, or associative array, although the last term is more often used for a programming data structure. Unlike a random access memory (RAM) in which the user supplies a memory address and the RAM returns the data value stored at that address, a CAM is designed such that the user supplies a data value and the CAM searches its entire memory to see if that data value is stored within the CAM. If the data value is found, the CAM returns a list of one or more storage addresses where the data value was found. In some architectures, a CAM may return the data value or other associated pieces of data. Thus, a CAM may be considered the hardware embodiment of what in software terms would be called an associative array. [0061] Thus, in the exemplary embodiment, wake-and-go array 222 may comprise a CAM and associated logic that will be triggered if a transaction appears on bus 220 that modifies an address stored in the CAM. A transaction that modifies a value at a target address may be referred to as a “kill”; thus, wake-and-go array 222 may be said to be “snooping kills.” In this exemplary embodiment, the data values stored in the CAM are the target addresses at which threads are waiting for something to be written. The address at which a data value, a given target address, is stored is referred to herein as the storage address. Each storage address may refer to a thread that is asleep and waiting for an event. Wake-and-go array 222 may store multiple instances of the same target address, each instance being associated with a different thread waiting for an event at that target address. Thus, when wake-and-go array 222 snoops a kill at a given target address, wake-and-go array 222 may return one or more storage addresses that are associated with one or more sleeping threads. [0062] In one exemplary embodiment, software may save the state of thread 202 , for example. The state of a thread may be about 1000 bytes, for example. Thread 202 is then put to sleep. When wake-and-go array 222 snoops a kill at a given target address, logic associated with wake-and-go array 222 may generate an exception. The processor that was running thread 202 sees the exception and performs a trap. A trap is a type of synchronous interrupt typically caused by an exception condition, in this case a kill at a target address in wake-and-go array 222 . The trap may result in a switch to kernel mode, wherein the operating system 210 performs some action before returning control to the originating process. In this case, the trap results in other software, such as operating system 210 , for example, to reload thread 202 from thread state storage 234 and to continue processing of the active threads on the processor. [0063] FIG. 3 is a block diagram of a wake-and-go mechanism with a hardware private array in accordance with an illustrative embodiment. Threads 302 , 304 , 306 run on processor 300 . Threads 302 , 304 , 306 make calls to operating system 310 and application programming interface (API) 312 to communicate with each other, memory 332 via bus 320 , or other devices within the data processing system. While the data processing system in FIG. 3 shows one processor, more processors may be present depending upon the implementation where each processor has a separate wake-and-go array or one wake-and-go array stores target addresses for threads for multiple processors. [0064] In an illustrative embodiment, when a thread, such as thread 302 , first starts executing, a wake-and-go mechanism automatically allocates space for thread state in hardware private array 308 and space for a target address and other information, if any, in wake-and-go array 322 . Allocating space may comprise reserving an address range in a memory, such as a static random access memory, that is hidden in hardware, such as processor 300 , for example. Alternatively, if hardware private array 308 comprises a reserved portion of system memory, such as memory 332 , then the wake-and-go mechanism may request a sufficient portion of memory, such as 1000 bytes, for example, to store thread state for that thread. [0065] Thus hardware private array 308 may be a memory the size of which matches the size of thread state information for all running threads. When a thread ends execution and is no longer in the run queue of processor 300 , the wake-and-go mechanism de-allocates the space for the thread state information for that thread. [0066] In accordance with the illustrative embodiment, a wake-and-go mechanism for a microprocessor includes wake-and-go array 322 attached to the SMP fabric. The SMP fabric is a communication medium through which processors communicate. The SMP fabric may comprise a single SMP bus or a system of busses, for example. In the depicted example, the SMP fabric comprises bus 320 . A thread, such as thread 302 , for example, may include instructions that indicate that the thread is waiting for an event. The event may be an asynchronous event, which is an event that happens independently in time with respect to execution of the thread in the data processing system. For example, an asynchronous event may be a temperature value reaching a particular threshold, a stock price falling below a given threshold, or the like. Alternatively, the event may be related in some way to execution of the thread. For example, the event may be obtaining a lock for exclusive access to a database record or the like. [0067] Typically, the instructions may comprise a series of get-and-compare sequences; however, in accordance with the illustrative embodiment, the instructions include instructions, calls to operating system 310 or API 312 , or calls to a background sleeper thread, such as thread 304 , for example, to update wake-and-go array 322 . These instructions store a target address in wake-and-go array 322 , where the event the thread is waiting for is associated with the target address. After updating wake-and-go array 322 with the target address, thread 302 may go to sleep. [0068] When thread 302 goes to sleep, operating system 310 or other software or hardware within processor 300 saves the state of thread 302 in hardware private array 308 within processor 300 . In an alternative embodiment, hardware private array may be embodied within pervasive logic associated with bus 320 or wake-and-go array 322 . When a thread is put to sleep, i.e., removed from the run queue of processor 300 , operating system 310 must store sufficient information on its operating state such that when the thread is again scheduled to run on processor 300 , the thread can resume operation from an identical position. This state information is sometime referred to as the thread's “context.” The state information may include, for example, address space, stack space, virtual address space, program counter, instruction register, program status word, and the like, which may comprise about 1000 bytes, for example. [0069] If a transaction appears on bus 320 that modifies a value at an address in wake-and-go array 322 , then operating system 310 may wake thread 302 . Operating system 310 wakes thread 302 by recovering the state of thread 302 from hardware private array 308 . Thread 302 may then determine whether the transaction corresponds to the event for which the thread was waiting by performing a get-and-compare operation, for instance. If the transaction is the event for which the thread was waiting, then thread 302 will perform work. However, if the transaction is not the event, then thread 302 will go back to sleep. Thus, thread 302 only performs a get-and-compare operation if there is a transaction that modifies the target address. [0070] Hardware private array 308 is a thread state storage that is embedded within processor 300 or within logic associated with bus 320 or wake-and-go array 322 . Hardware private array 308 may be a memory structure, such as a static random access memory (SRAM), which is dedicated to storing thread state for sleeping threads that have a target address in wake-and-go array 322 . In an alternative embodiment, hardware private array 308 may be a hidden area of memory 332 . Hardware private array 308 is private because it cannot be addressed by the operating system or work threads. [0071] Hardware private array 308 and/or wake-and-go array 322 may have a limited storage area. Therefore, each thread may have an associated priority. The wake-and-go mechanism described herein may store the priority of sleeping threads with the thread state in hardware private array 308 . Alternatively, the wake-and-go mechanism may store the priority with the target address in wake-and-go array 322 . [0072] When a thread, such as thread 302 , for example, goes to sleep, the wake-and-go mechanism may determine whether there is sufficient room to store the thread state of thread 302 in hardware private array 308 . If there is sufficient space, then the wake-and-go mechanism simply stores the thread state in hardware private array 308 . [0073] If there is insufficient space in hardware private array 308 , then if the hardware private array is a portion of system memory 332 , then the wake-and-go mechanism may ask for more of system memory 332 to be allocated to the hardware private array 308 . [0074] If there is insufficient space in hardware private array 308 , then the wake-and-go mechanism may compare the priority of thread 302 to the priorities of the threads already stored in hardware private array 308 and wake-and-go array 322 . If thread 302 has a lower priority than all of the threads already stored in hardware private array 208 and wake-and-go array 322 , then thread 302 may default to a flee model, such as polling or interrupt as in the prior art. If thread 302 has a higher priority than at least one thread already stored in hardware private array 308 and wake-and-go array 322 , then the wake-and-go mechanism may “punt” a lowest priority thread, meaning the thread is removed from hardware private array 308 and wake-and-go array 322 and converted to a flee model. [0075] In an alternative embodiment, priority may be determined by other factors. For example, priority may be time driven. That is, the wake-and-go mechanism may simply punt the stalest thread in hardware private array 308 and wake-and-go array 322 . [0076] Alternatively, operating system 310 or a background sleeper thread, such as thread 304 , may determine whether the transaction is the event for which the thread was waiting. Before being put to sleep, thread 302 may update a data structure in the operating system or background sleeper thread with a value for which it is waiting. [0077] In one exemplary embodiment, wake-and-go array 322 may be a content addressable memory (CAM). A CAM is a special type of computer memory often used in very high speed searching applications. A CAM is also known as associative memory, associative storage, or associative array, although the last term is more often used for a programming data structure. Unlike a random access memory (RAM) in which the user supplies a memory address and the RAM returns the data value stored at that address, a CAM is designed such that the user supplies a data value and the CAM searches its entire memory to see if that data value is stored within the CAM. If the data value is found, the CAM returns a list of one or more storage addresses where the data value was found. In some architectures, a CAM may return the data value or other associated pieces of data. Thus, a CAM may be considered the hardware embodiment of what in software terms would be called an associative array. [0078] Thus, in the exemplary embodiment, wake-and-go array 322 may comprise a CAM and associated logic that will be triggered if a transaction appears on bus 320 that modifies an address stored in the CAM. A transaction that modifies a value at a target address may be referred to as a “kill”; thus, wake-and-go array 322 may be said to be “snooping kills.” In this exemplary embodiment, the data values stored in the CAM are the target addresses at which threads are waiting for something to be written. The address at which a data value, a given target address, is stored is referred to herein as the storage address. Each storage address may refer to a thread that is asleep and waiting for an event. Wake-and-go array 322 may store multiple instances of the same target address, each instance being associated with a different thread waiting for an event at that target address. Thus, when wake-and-go array 322 snoops a kill at a given target address, wake-and-go array 322 may return one or more storage addresses that are associated with one or more sleeping threads. [0079] FIGS. 4A and 4B are block diagrams illustrating operation of a wake-and-go mechanism with specialized processor instructions in accordance with an illustrative embodiment. With particular reference to FIG. 4A , thread 410 runs in a processor (not shown) and performs some work. Thread 410 executes a specialized processor instruction to update wake-and-go array 422 , storing a target address A 2 in array 422 . Then, thread 410 goes to sleep with thread state being stored in thread state storage 412 . [0080] When a transaction appears on SMP fabric 420 with an address that matches the target address A 2 , array 422 returns the storage address that is associated with thread 410 . The operating system (not shown) or some other hardware or software then wakes thread 410 by retrieving the thread state information from thread state storage 412 and placing the thread in the run queue for the processor. Thread 410 may then perform a compare-and-branch operation to determine whether the value written to the target address represents the event for which thread 410 is waiting. In the depicted example, the value written to the target address does not represent the event for which thread 410 is waiting; therefore, thread 410 goes back to sleep. [0081] In one exemplary embodiment, software may save the state of thread 410 , for example. Thread 410 is then put to sleep. When wake-and-go array 422 snoops a kill at target address A 2 , logic associated with wake-and-go array 422 may generate an exception. The processor sees the exception and performs a trap, which results in a switch to kernel mode, wherein the operating system may perform some action before returning control to the originating process. In this case, the trap results in other software to reload thread 410 from thread state storage 412 and to continue processing of the active threads on the processor. [0082] In one exemplary embodiment, thread state storage 412 is a hardware private array. Thread state storage 412 is a memory that is embedded within the processor or within logic associated with bus 420 or wake-and-go array 422 . Thread state storage 412 may comprise memory cells that are dedicated to storing thread state for sleeping threads that have a target address in wake-and-go array 422 . In an alternative embodiment, thread state storage 412 may be a hidden area of memory 332 , for example. Thread state storage 412 may private in that it cannot be addressed by the operating system or work threads. [0083] Turning to FIG. 4B , thread 410 runs in a processor (not shown) and performs some work. Thread 410 executes a specialized processor instruction to update wake-and-go array 422 , storing a target address A 2 in array 422 . Then, thread 410 goes to sleep with thread state being stored in thread state storage 412 . [0084] When a transaction appears on SMP fabric 420 with an address that matches the target address A 2 , array 422 returns the storage address that is associated with thread 410 . The operating system (not shown) or some other hardware or software then wakes thread 410 by retrieving the thread state information from thread state storage 412 and placing the thread in the run queue for the processor. Thread 410 may then perform a compare-and-branch operation to determine whether the value written to the target address represents the event for which thread 410 is waiting. In the depicted example, the value written to the target address does represent the event for which thread 410 is waiting; therefore, thread 410 updates the array to remove the target address from array 422 , and performs more work. [0085] FIGS. 5A and 5B are block diagrams illustrating operation of a wake-and-go mechanism with a specialized operating system call in accordance with an illustrative embodiment. With particular reference to FIG. 5A , thread 510 runs in a processor (not shown) and performs some work. Thread 510 makes a call to operating system 530 to update wake-and-go array 522 . The call to operating system 530 may be an operating system call or a call to an application programming interface (not shown) provided by operating system 530 . Operating system 530 then stores a target address A 2 in array 522 . Then, thread 510 goes to sleep with thread state being stored in thread state storage 512 . [0086] When a transaction appears on SMP fabric 520 with an address that matches the target address A 2 , array 522 returns the storage address that is associated with thread 510 . Operating system 530 or some other hardware or software then wakes thread 510 by retrieving the thread state information from thread state storage 512 and placing the thread in the run queue for the processor. Thread 510 may then perform a compare-and-branch operation to determine whether the value written to the target address represents the event for which thread 510 is waiting. In the depicted example, the value written to the target address does not represent the event for which thread 510 is waiting; therefore, thread 510 goes back to sleep. [0087] In one exemplary embodiment, software may save the state of thread 510 , for example. Thread 510 is then put to sleep. When wake-and-go array 522 snoops a kill at target address A 2 , logic associated with wake-and-go array 522 may generate an exception. The processor sees the exception and performs a trap, which results in a switch to kernel mode, wherein operating system 530 may perform some action before returning control to the originating process. In this case, the trap results in the operating system 530 to reload thread 510 from thread state storage 512 and to continue processing of the active threads on the processor. [0088] In one exemplary embodiment, thread state storage 512 is a hardware private array. Thread state storage 512 is a memory that is embedded within the processor or within logic associated with bus 520 or wake-and-go array 522 . Thread state storage 512 may comprise memory cells that are dedicated to storing thread state for sleeping threads that have a target address in wake-and-go array 522 . In an alternative embodiment, thread state storage 512 may be a hidden area of memory 332 , for example. Thread state storage 512 may private in that it cannot be addressed by the operating system or work threads. [0089] Turning to FIG. 5B , thread 510 runs in a processor (not shown) and performs some work. Thread 510 makes a call to operating system 530 to update wake-and-go array 522 . The call to operating system 530 may be an operating system call or a call to an application programming interface (not shown) provided by operating system 530 . Operating system 530 then stores a target address A 2 in array 522 . Then, thread 510 goes to sleep with thread state being stored in thread state storage 512 . [0090] When a transaction appears on SMP fabric 520 with an address that matches the target address A 2 , array 522 returns the storage address that is associated with thread 510 . Operating system 530 or some other hardware or software then wakes thread 510 by retrieving the thread state information from thread state storage 512 and placing the thread in the run queue for the processor. Thread 510 may then perform a compare-and-branch operation to determine whether the value written to the target address represents the event for which thread 510 is waiting. In the depicted example, the value written to the target address does represent the event for which thread 510 is waiting; therefore, thread 510 updates the array to remove the target address from array 522 , and performs more work. [0091] FIG. 6 is a block diagram illustrating operation of a wake-and-go mechanism with a background sleeper thread in accordance with an illustrative embodiment. Thread 610 runs in a processor (not shown) and performs some work. Thread 610 makes a call to background sleeper thread 640 to update wake-and-go array 622 . The call to background sleeper thread 640 may be a remote procedure call, for example, or a call to an application programming interface (not shown) provided by background sleeper thread 640 . Background sleeper thread 640 then stores a target address A 2 in array 622 . Thread 610 may also store other information in association with background sleeper thread 640 , such as a value for which thread 610 is waiting to be written to target address A 2 . Then, thread 610 goes to sleep with thread state being stored in thread state storage 612 . [0092] When a transaction appears on SMP fabric 620 with an address that matches the target address A 2 , array 622 returns the storage address that is associated with thread 610 . Operating system 630 or some other hardware or software then wakes thread 610 by retrieving the thread state information from thread state storage 612 and placing the thread in the run queue for the processor. Background sleeper thread 640 may then perform a compare-and-branch operation to determine whether the value written to the target address represents the event for which thread 610 is waiting. If the value written to the target address does represent the event for which thread 610 is waiting, then background sleeper thread 640 does nothing. However, if the value written to the target address does represent the event for which thread 610 is waiting, then background sleeper thread 640 wakes thread 640 . Thereafter, thread 610 updates the array 622 to remove the target address from array 622 and performs more work. [0093] In one exemplary embodiment, software may save the state of thread 610 , for example. Thread 610 is then put to sleep. When wake-and-go array 622 snoops a kill at target address A 2 , logic associated with wake-and-go array 622 may generate an exception. The processor sees the exception and performs a trap, which results in a switch to kernel mode, wherein the operating system may perform some action before returning control to the originating process. In this case, the trap results in other software, such as background sleeper thread 640 to reload thread 610 from thread state storage 612 and to continue processing of the active threads on the processor. [0094] In one exemplary embodiment, thread state storage 612 is a hardware private array. Thread state storage 612 is a memory that is embedded within the processor or within logic associated with bus 620 or wake-and-go array 622 . Thread state storage 612 may comprise memory cells that are dedicated to storing thread state for sleeping threads that have a target address in wake-and-go array 622 . In an alternative embodiment, thread state storage 612 may be a hidden area of memory 332 , for example. Thread state storage 612 may private in that it cannot be addressed by the operating system or work threads. [0095] As will be appreciated by one skilled in the art, the present invention may be embodied as a system, method, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that may all generally be referred to herein as a “circuit,” “module” or “system.” Furthermore, the present invention may take the form of a computer program product embodied in any tangible medium of expression having computer usable program code embodied in the medium. [0096] Any combination of one or more computer usable or computer readable medium(s) may be utilized. The computer-usable or computer-readable medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, device, or propagation medium. More specific examples (a non-exhaustive list) of the computer-readable medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CDROM), an optical storage device, a transmission media such as those supporting the Internet or an intranet, or a magnetic storage device. Note that the computer-usable or computer-readable medium could even be paper or another suitable medium upon which the program is printed, as the program can be electronically captured, via, for instance, optical scanning of the paper or other medium, then compiled, interpreted, or otherwise processed in a suitable manner, if necessary, and then stored in a computer memory. In the context of this document, a computer-usable or computer-readable medium may be any medium that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device. The computer-usable medium may include a propagated data signal with the computer-usable program code embodied therewith, either in baseband or as part of a carrier wave. The computer usable program code may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, radio frequency (RF), etc. [0097] Computer program code for carrying out operations of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java™, Smalltalk™, C++ or the like and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider). In addition, the program code may be embodied on a computer readable storage medium on the server or the remote computer and downloaded over a network to a computer readable storage medium of the remote computer or the users' computer for storage and/or execution. Moreover, any of the computing systems or data processing systems may store the program code in a computer readable storage medium after having downloaded the program code over a network from a remote computing system or data processing system. [0098] The illustrative embodiments are described below with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to the illustrative embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. [0099] These computer program instructions may also be stored in a computer-readable medium that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable medium produce an article of manufacture including instruction means which implement the function/act specified in the flowchart and/or block diagram block or blocks. [0100] The computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. [0101] The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions. [0102] FIGS. 7A and 7B are flowcharts illustrating operation of a wake-and-go mechanism in accordance with the illustrative embodiments. With reference now to FIG. 7A , operation begins when a thread first initializes or when a thread wakes after sleeping. The operating system starts a thread (block 702 ) by initializing the thread and placing the thread in the run queue for a processor. The thread then performs work (block 704 ). The operating system determines whether the thread has completed (block 706 ). If the thread completes, then operation ends. [0103] If the end of the thread is not reached in block 706 , the processor determines whether the next instruction updates the wake-and-go array (block 708 ). An instruction to update the wake-and-go array may be a specialized processor instruction, an operating system call, a call to a background sleeper thread, or a call to an application programming interface. If the next instruction does not update the wake-and-go array, operation returns to block 704 to perform more work. [0104] If the next instruction does update the wake-and-go array in block 708 , the processor updates the array with a target address associated with an event for which the thread is waiting (block 710 ). The update to the wake-and-go array may be made by the thread through a specialized processor instruction, the operating system, or a background sleeper thread. Next, the operating system then determines whether to put the thread to sleep (block 712 ). The operating system may keep the thread active in the processor if the processor is underutilized, for instance; however, the operating system may put the thread to sleep if there are other threads waiting to be run on the processor. If the operating system determines that the thread is to remain active, operation returns to block 704 to perform more work, in which case the thread may simply wait for the event. [0105] In one exemplary embodiment, if the operating system determines that the thread is to be put to sleep in block 712 , then the operating system or some other software or hardware saves the state of the thread (block 714 ) and puts the thread to sleep (block 716 ). Thereafter, operation proceeds to FIG. 7B where the wake-and-go mechanism monitors for an event. In one exemplary embodiment, software may save the state of the thread in thread state storage. The thread is then put to sleep. [0106] In an alternative embodiment, if the operating system determines that the thread is to be put to sleep in block 712 , then the operating system or some other software or hardware saves the state of the thread (block 714 ) in the hardware private array and puts the thread to sleep (block 716 ). Thereafter, operation proceeds to FIG. 7B where the wake-and-go mechanism monitors for an event. [0107] With reference now to FIG. 7B , the wake-and-go mechanism, which may include a wake-and-go array, such as a content addressable memory, and associated logic, snoops for a kill from the symmetric multiprocessing (SMP) fabric (block 718 ). A kill occurs when a transaction appears on the SMP fabric that modifies the target address associated with the event for which a thread is waiting. The wake-and-go mechanism then performs a compare (block 720 ) and determines whether the value being written to the target address represents the event for which the thread is waiting (block 722 ). If the kill corresponds to the event for which the thread is waiting, then the operating system updates the array (block 724 ) to remove the target address from the wake-and-go array. Thereafter, operation returns to block 702 in FIG. 7A where the operating system restarts the thread. [0108] In one exemplary embodiment, when the wake-and-go mechanism snoops a kill at a target address, the wake-and-go mechanism may generate an exception. The processor sees the exception and performs a trap, which results in a switch to kernel mode, wherein the operating system may perform some action before returning control to the originating process. In this case, the trap results in other software to reload the thread from the thread state storage and to continue processing of the active threads on the processor in block 702 . [0109] In one exemplary embodiment, when the wake-and-go mechanism snoops a kill at a target address, software or hardware reloads the thread from the hardware private array and the processor continues processing the active threads on the processor in block 702 . [0110] If the kill does not correspond to the event for which the thread is waiting in block 722 , then operation returns to block 718 to snoop a kill from the SMP fabric. In FIG. 7B , the wake-and-go mechanism may be a combination of logic associated with the wake-and-go array, such as a CAM, and software within the operating system, software within a background sleeper thread, or other hardware. [0111] In an alternative embodiment, the wake-and-go mechanism may be a combination of logic associated with the wake-and-go array and software within the thread itself. In such an embodiment, the thread will wake every time there is a kill to the target address. The thread itself may then perform a compare operation to determine whether to perform more work or to go back to sleep. If the thread decides to go back to sleep, it may again save the state of the thread. The over head for waking the thread every time there is a kill to the target address will likely be much less than polling or event handlers. [0112] Prioritization of Threads [0113] FIGS. 8A and 8B are flowcharts illustrating operation of a wake-and-go mechanism with prioritization of threads in accordance with the illustrative embodiments. Operation begins when a thread first initializes or when a thread wakes after sleeping. The operating system starts a thread (block 802 ) by initializing the thread and placing the thread in the run queue for a processor. The thread then performs work (block 804 ). The operating system determines whether the thread has completed (block 806 ). If the thread completes, then operation ends. [0114] If the end of the thread is not reached in block 806 , the processor determines whether the next instruction updates the wake-and-go array (block 808 ). An instruction to update the wake-and-go array may be a specialized processor instruction, an operating system call, a call to a background sleeper thread, or a call to an application programming interface. If the next instruction does not update the wake-and-go array, operation returns to block 804 to perform more work. [0115] If the next instruction does update the wake-and-go array in block 808 , the wake-and-go mechanism determines whether there is sufficient space for the thread state in the hardware private array (block 810 ). If there is sufficient space available, the wake-and-go mechanism allocates space for the thread state in the hardware private array (block 812 ). This allocation may simply comprise reserving the requisite space for the thread space, which may be about 1000 bytes, for example. If the hardware private array is reserved portion of system memory, then allocating space may comprise requesting more system memory to be reserved for the hardware private array. Then, the wake-and-go mechanism saves the state of the thread in the hardware private array (block 814 ), updates the wake-and-go array with the target address and other information, if any (block 816 ), and puts the thread to sleep (block 818 ). Thereafter, operation proceeds to FIG. 8B where the wake-and-go mechanism monitors for an event. [0116] If there is insufficient space for the thread state available in the hardware private array in block 810 , then the wake-and-go mechanism determines whether there is at least one lower priority thread in the hardware private array or wake-and-go array (block 820 ). As described above, each thread may have an associated priority parameter that is stored in the hardware private array or wake-and-go array. Alternatively, priority may be determined by other factors, such as staleness. If there is at least one lower priority thread in the hardware private array, the wake-and-go mechanism removes the lower priority thread from the hardware private array and wake-and-go array (block 822 ) and converts the lower priority thread to a flee model (block 824 ). Thereafter, operation proceeds to block 814 to save the state of the new thread, update the wake-and-go array, and put the thread to sleep. [0117] If there is not a lower priority thread in the hardware private array in block 820 , the wake-and-go mechanism converts the new thread to a flee model (block 826 ). Thereafter, operation proceeds to block 818 to put the thread to sleep. [0118] With reference now to FIG. 8B , the wake-and-go mechanism, which may include a wake-and-go array, such as a content addressable memory, and associated logic, snoops for a kill from the symmetric multiprocessing (SMP) fabric (block 826 ). A kill occurs when a transaction appears on the SMP fabric that modifies the target address associated with the event for which a thread is waiting. The wake-and-go mechanism then performs a compare (block 828 ) and determines whether the value being written to the target address represents the event for which the thread is waiting (block 830 ). If the kill corresponds to the event for which the thread is waiting, then the operating system updates the wake-and-go array (block 832 ) to remove the target address from the wake-and-go array. Then, the wake-and-go mechanism reloads the thread from the hardware private array (block 834 ). Thereafter, operation returns to block 802 in FIG. 8A where the operating system restarts the thread. [0119] In one exemplary embodiment, when the wake-and-go mechanism snoops a kill at a target address, software or hardware reloads the thread from the hardware private array and the processor continues processing the active threads on the processor in block 802 . [0120] If the kill does not correspond to the event for which the thread is waiting in block 830 , then operation returns to block 826 to snoop a kill from the SMP fabric. In FIG. 8B , the wake-and-go mechanism may be a combination of logic associated with the wake-and-go array, such as a CAM, and software within the operating system, software within a background sleeper thread, or other hardware. [0121] Dynamic Allocation in Hardware Private Array [0122] FIGS. 9A and 9B are flowcharts illustrating operation of a wake-and-go mechanism with dynamic allocation in a hardware private array in accordance with the illustrative embodiments. Operation begins when a thread first initializes or when a thread wakes after sleeping. The wake-and-go mechanism allocates space for thread state information in the hardware private array (block 902 ). The operating system starts a thread (block 904 ) by initializing the thread and placing the thread in the run queue for a processor. The wake-and-go mechanism may also allocate space in the wake-and-go array. The thread then performs work (block 906 ). The operating system determines whether the thread has completed (block 908 ). If the thread completes, then the wake-and-go mechanism de-allocates the space corresponding to the thread state information for the thread (block 910 ), and operation ends. [0123] If the end of the thread is not reached in block 908 , the processor determines whether the next instruction updates the wake-and-go array (block 912 ). An instruction to update the wake-and-go array may be a specialized processor instruction, an operating system call, a call to a background sleeper thread, or a call to an application programming interface. If the next instruction does not update the wake-and-go array, operation returns to block 906 to perform more work. [0124] If the next instruction does update the wake-and-go array in block 912 , the wake-and-go mechanism updates the wake-and-go array with a target address associated with an event for which the thread is waiting (block 914 ). The update to the wake-and-go array may be made by the thread through a specialized processor instruction, the operating system, or a background sleeper thread. Next, the operating system then determines whether to put the thread to sleep (block 916 ). The operating system may keep the thread active in the processor if the processor is underutilized, for instance; however, the operating system may put the thread to sleep if there are other threads waiting to be run on the processor. If the operating system determines that the thread is to remain active, operation returns to block 906 to perform more work, in which case the thread may simply wait for the event. [0125] If the operating system determines that the thread is to be put to sleep in block 916 , then the operating system or some other software or hardware saves the state of the thread (block 918 ) in the hardware private array and puts the thread to sleep (block 920 ). Thereafter, operation proceeds to FIG. 9B where the wake-and-go mechanism monitors for an event. [0126] With reference now to FIG. 9B , the wake-and-go mechanism, which may include a wake-and-go array, such as a content addressable memory, and associated logic, snoops for a kill from the symmetric multiprocessing (SMP) fabric (block 922 ). A kill occurs when a transaction appears on the SMP fabric that modifies the target address associated with the event for which a thread is waiting. The wake-and-go mechanism then performs a compare (block 924 ) and determines whether the value being written to the target address represents the event for which the thread is waiting (block 926 ). If the kill corresponds to the event for which the thread is waiting, then the operating system updates the wake-and-go array (block 928 ) to remove the target address from the wake-and-go array. The wake-and-go mechanism then reloads the thread state from the hardware private array (block 930 ). Thereafter, operation returns to block 904 in FIG. 9A where the operating system restarts the thread. [0127] If the kill does not correspond to the event for which the thread is waiting in block 922 , then operation returns to block 922 to snoop a kill from the SMP fabric. In FIG. 9B , the wake-and-go mechanism may be a combination of logic associated with the wake-and-go array, such as a CAM, and software within the operating system, software within a background sleeper thread, or other hardware. [0128] Hardware Wake-and-Go Mechanism [0129] FIG. 10 is a block diagram of a hardware wake-and-go mechanism in a data processing system in accordance with an illustrative embodiment. Threads 1002 , 1004 , 1006 run on processor 1000 . Threads 1002 , 1004 , 1006 make calls to operating system 1010 to communicate with each other, memory 1032 via bus 1020 , or other devices within the data processing system. While the data processing system in FIG. 10 shows one processor, more processors may be present depending upon the implementation where each processor has a separate wake-and-go array or one wake-and-go array stores target addresses for threads for multiple processors. [0130] Wake-and-go mechanism 1008 is a hardware implementation within processor 1000 . In an alternative embodiment, hardware wake-and-go mechanism 1008 may be logic associated with wake-and-go array 1022 attached to bus 1020 or a separate, dedicated wake-and-go engine as described in further detail below. [0131] In accordance with the illustrative embodiment, hardware wake-and-go mechanism 1008 is provided within processor 1000 and wake-and-go array 1022 is attached to the SMP fabric. The SMP fabric is a communication medium through which processors communicate. The SMP fabric may comprise a single SMP bus or a system of busses, for example. In the depicted example, the SMP fabric comprises bus 1020 . A thread, such as thread 1002 , for example, may include instructions that indicate that the thread is waiting for an event. The event may be an asynchronous event, which is an event that happens independently in time with respect to execution of the thread in the data processing system. For example, an asynchronous event may be a temperature value reaching a particular threshold, a stock price falling below a given threshold, or the like. Alternatively, the event may be related in some way to execution of the thread. For example, the event may be obtaining a lock for exclusive access to a database record or the like. [0132] Processor 1000 may pre-fetch instructions from storage (not shown) to memory 1032 . These instructions may comprise a get-and-compare sequence, for example. Wake-and-go mechanism 1008 within processor 1000 may examine the instruction stream as it is being pre-fetched and recognize the get-and-compare sequence as a programming idiom that indicates that thread 1002 is waiting for data at a particular target address. A programming idiom is a sequence of programming instructions that occurs often and is recognizable as a sequence of instructions. In this example, an instruction sequence that includes load (LD), compare (CMP), and branch (BC) commands represents a programming idiom that indicates that the thread is waiting for data to be written to a particular target address. In this case, wake-and-go mechanism 1008 recognizes such a programming idiom and may store the target address in wake-and-go array 1022 , where the event the thread is waiting for is associated with the target address. After updating wake-and-go array 1022 with the target address, wake-and-go mechanism 1008 may put thread 1002 to sleep. [0133] Wake-and-go mechanism 1008 also may save the state of thread 1002 in thread state storage 1034 , which may be allocated from memory 1032 or may be a hardware private array within the processor (not shown) or pervasive logic (not shown). When a thread is put to sleep, i.e., removed from the run queue of a processor, the operating system must store sufficient information on its operating state such that when the thread is again scheduled to run on the processor, the thread can resume operation from an identical position. This state information is sometime referred to as the thread's “context.” The state information may include, for example, address space, stack space, virtual address space, program counter, instruction register, program status word, and the like. [0134] If a transaction appears on bus 1020 that modifies a value at an address in wake-and-go array 1022 , then wake-and-go mechanism 1008 may wake thread 1002 . Wake-and-go mechanism 1008 may wake thread 1002 by recovering the state of thread 1002 from thread state storage 1034 . Thread 1002 may then determine whether the transaction corresponds to the event for which the thread was waiting by performing a get-and-compare operation, for instance. If the transaction is the event for which the thread was waiting, then thread 1002 will perform work. However, if the transaction is not the event, then thread 1002 will go back to sleep. Thus, thread 1002 only performs a get-and-compare operation if there is a transaction that modifies the target address. [0135] Alternatively, operating system 1010 or a background sleeper thread, such as thread 1004 , may determine whether the transaction is the event for which the thread was waiting. Before being put to sleep, thread 1002 may update a data structure in the operating system or background sleeper thread with a value for which it is waiting. [0136] In one exemplary embodiment, wake-and-go array 1022 may be a content addressable memory (CAM). A CAM is a special type of computer memory often used in very high speed searching applications. A CAM is also known as associative memory, associative storage, or associative array, although the last term is more often used for a programming data structure. Unlike a random access memory (RAM) in which the user supplies a memory address and the RAM returns the data value stored at that address, a CAM is designed such that the user supplies a data value and the CAM searches its entire memory to see if that data value is stored within the CAM. If the data value is found, the CAM returns a list of one or more storage addresses where the data value was found. In some architectures, a CAM may return the data value or other associated pieces of data. Thus, a CAM may be considered the hardware embodiment of what in software terms would be called an associative array. [0137] Thus, in an exemplary embodiment, wake-and-go array 1022 may comprise a CAM and associated logic that will be triggered if a transaction appears on bus 1020 that modifies an address stored in the CAM. A transaction that modifies a value at a target address may be referred to as a “kill”; thus, wake-and-go array 1022 may be said to be “snooping kills.” In this exemplary embodiment, the data values stored in the CAM are the target addresses at which threads are waiting for something to be written. The address at which a data value, a given target address, is stored is referred to herein as the storage address. Each storage address may refer to a thread that is asleep and waiting for an event. Wake-and-go array 1022 may store multiple instances of the same target address, each instance being associated with a different thread waiting for an event at that target address. Thus, when wake-and-go array 1022 snoops a kill at a given target address, wake-and-go array 1022 may return one or more storage addresses that are associated with one or more sleeping threads. [0138] FIGS. 11A and 11B illustrate a series of instructions that are a programming idiom for wake-and-go in accordance with an illustrative embodiment. With reference to FIG. 11A , the instruction sequence includes load (LD), compare (CMP), and branch (BC) commands that represent a programming idiom that indicate that the thread is waiting for data to be written to a particular target address. The load command (LD) loads a data value to general purpose register GPR D from the address in general purpose register GPR A. The compare command (CMP) then compares the value loaded into general purpose register GPR D with a value already stored in general purpose register GPR E. If the compare command results in a match, then the branch command (BC) branches to instruction address IA. [0139] The wake-and-go mechanism may recognize the poll operation idiom. When the wake-and-go mechanism recognizes such a programming idiom, the wake-and-go mechanism may store the target address from GPR A in the wake-and-go array, where the event the thread is waiting for is associated with the target address. After updating the wake-and-go array with the target address, the wake-and-go mechanism may put the thread to sleep. [0140] With reference now to FIG. 11B , thread 1110 may have a plurality of programming idioms. The wake-and-go mechanism may look ahead within thread 1110 and load wake-and-go array 1122 with the target address and other information, if any. Therefore, when thread 1110 reaches each programming idiom while executing, the wake-and-go array 1122 will already be loaded with the target address, and thread 1110 may simply go to sleep until wake-and-go array snoops the target address on the SMP fabric. [0141] The wake-and-go mechanism may perform a look-ahead polling operation for each programming idiom. In the depicted example, idioms A, B, C, and D fail. In those cases, the wake-and-go mechanism may update wake-and-go array 1122 . In this example, idiom E passes; therefore, there is no need to update wake-and-go array 1122 , because there is no need to put the thread to sleep when idiom E executes. [0142] In one exemplary embodiment, the wake-and-go mechanism may update wake-and-go array 1122 only if all of the look-ahead polling operations fail. If at least one look-ahead polling operation passes, then the wake-and-go mechanism may consider each idiom as it occurs during execution. [0143] FIGS. 12A and 12B are block diagrams illustrating operation of a hardware wake-and-go mechanism in accordance with an illustrative embodiment. With particular reference to FIG. 12A , thread 1210 runs in a processor (not shown) and performs some work. Thread 1210 executes a series of instructions that are a programming idiom for wake-and-go. The wake-and-go mechanism may recognize the poll operation idiom. When the wake-and-go mechanism recognizes such a programming idiom, the wake-and-go mechanism may store the target address A 2 in wake-and-go array 1222 , where the event the thread is waiting for is associated with the target address, and stores thread state information for thread 1210 in thread state storage 1212 . After updating wake-and-go array 1222 with the target address A 2 , the wake-and-go mechanism may put the thread 1210 to sleep. [0144] When a transaction appears on SMP fabric 1220 with an address that matches the target address A 2 , array 1222 returns the storage address that is associated with thread 1210 . The wake-and-go mechanism then wakes thread 1210 by retrieving the thread state information from thread state storage 1212 and placing the thread in the run queue for the processor. Thread 1210 may then perform a compare-and-branch operation to determine whether the value written to the target address represents the event for which thread 1210 is waiting. In the depicted example, the value written to the target address does not represent the event for which thread 1210 is waiting; therefore, thread 1210 goes back to sleep. [0145] Turning to FIG. 12B , thread 1210 runs in a processor (not shown) and performs some work. Thread 1210 executes a series of instructions that are a programming idiom for wake-and-go. The wake-and-go mechanism may recognize the poll operation idiom. When the wake-and-go mechanism recognizes such a programming idiom, the wake-and-go mechanism may store the target address A 2 in wake-and-go array 1222 , where the event the thread is waiting for is associated with the target address, and stores thread state information for thread 1210 in thread state storage 1212 . After updating wake-and-go array 1222 with the target address A 2 , the wake-and-go mechanism may put the thread 1210 to sleep. [0146] When a transaction appears on SMP fabric 1220 with an address that matches the target address A 2 , array 1222 returns the storage address that is associated with thread 1210 . The wake-and-go mechanism then wakes thread 1210 by retrieving the thread state information from thread state storage 1212 and placing the thread in the run queue for the processor. Thread 1210 may then perform a compare-and-branch operation to determine whether the value written to the target address represents the event for which thread 1210 is waiting. In the depicted example, the value written to the target address does represent the event for which thread 1210 is waiting; therefore, thread 1210 updates the array to remove the target address from array 1222 , and performs more work. [0147] FIGS. 13A and 13B are flowcharts illustrating operation of a hardware wake-and-go mechanism in accordance with the illustrative embodiments. Operation begins when a thread first initializes or when a thread wakes after sleeping. The operating system starts a thread (block 1302 ) by initializing the thread and placing the thread in the run queue for a processor. The thread then performs work (block 1304 ). [0148] The operating system determines whether the thread has completed (block 1306 ). If the thread completes, then operation ends. [0149] If the end of the thread is not reached in block 1306 , the processor determines whether the next instructions comprise a wake-and-go idiom, such as a polling operation, for example (block 1308 ). A wake-and-go idiom may comprise a series of instructions, such as a load, compare, and branch sequence, for example. If the next instructions doe not comprise a wake-and-go idiom, the wake-and-go mechanism returns to block 1304 to perform more work. [0150] If the next instructions do comprise a wake-and-go idiom in block 1308 , the wake-and-go mechanism determines whether to put the thread to sleep (block 1310 ). The wake-and-go mechanism may keep the thread active in the processor if the processor is underutilized, for instance; however, the wake-and-go mechanism may put the thread to sleep if there are other threads waiting to be run on the processor. If the wake-and-go mechanism determines that the thread is to remain active, operation returns to block 1304 to perform more work, in which case the thread may simply wait for the event. [0151] If the wake-and-go mechanism determines that the thread is to be put to sleep in block 1310 , then the wake-and-go mechanism updates the array with a target address associated with an event for which the thread is waiting (block 1312 ). The update to the wake-and-go array may be made by the thread through a specialized processor instruction, the operating system, or a background sleeper thread. Next, the wake-and-go mechanism then saves the state of the thread (block 1314 ) and puts the thread to sleep (block 1316 ). Thereafter, operation proceeds to FIG. 13B where the wake-and-go mechanism monitors for an event. [0152] With reference now to FIG. 13B , the wake-and-go mechanism, which may include a wake-and-go array, such as a content addressable memory, and associated logic, snoops for a kill from the symmetric multiprocessing (SMP) fabric (block 1318 ). A kill occurs when a transaction appears on the SMP fabric that modifies the target address associated with the event for which a thread is waiting. The wake-and-go mechanism, the operating system, the thread, or other software then performs a compare (block 1320 ) and determines whether the value being written to the target address represents the event for which the thread is waiting (block 1322 ). If the kill corresponds to the event for which the thread is waiting, then the wake-and-go mechanism updates the array (block 1324 ) to remove the target address from the wake-and-go array. Thereafter, operation returns to block 1302 in FIG. 13A where the operating system restarts the thread. [0153] If the kill does not correspond to the event for which the thread is waiting in block 1322 , then operation returns to block 1318 to snoop a kill from the SMP fabric. In FIG. 13B , the wake-and-go mechanism may be a combination of hardware within the processor, logic associated with the wake-and-go array, which may be a CAM as described above, and software within the operating system, software within a background sleeper thread. In other embodiments, the wake-and-go mechanism may be other software or hardware, such as a dedicated wake-and-go engine, as described in further detail below. [0154] Look-Ahead Polling [0155] FIGS. 14A and 14B are block diagrams illustrating operation of a wake-and-go engine with look-ahead in accordance with an illustrative embodiment. With particular reference to FIG. 14A , thread 1410 runs in a processor (not shown) and performs some work. Thread 1410 executes a series of instructions that are a programming idiom for wake-and-go. The wake-and-go mechanism may recognize the poll operation idiom. When the wake-and-go mechanism recognizes such a programming idiom, the wake-and-go mechanism may store the target address A 2 in wake-and-go array 1422 , where the event the thread is waiting for is associated with the target address, and stores thread state information for thread 1410 in thread state storage 1412 . After updating wake-and-go array 1422 with the target address A 2 , the wake-and-go mechanism may put the thread 1410 to sleep. [0156] When a transaction appears on SMP fabric 1420 with an address that matches the target address A 2 , array 1422 returns the storage address that is associated with thread 1410 . The wake-and-go mechanism then wakes thread 1410 by retrieving the thread state information from thread state storage 1412 and placing the thread in the run queue for the processor. Thread 1410 may then perform a compare-and-branch operation to determine whether the value written to the target address represents the event for which thread 1410 is waiting. In the depicted example, the value written to the target address does not represent the event for which thread 1410 is waiting; therefore, thread 1410 goes back to sleep. [0157] Turning to FIG. 14B , thread 1410 runs in a processor (not shown) and performs some work. Thread 1410 executes a series of instructions that are a programming idiom for wake-and-go. The wake-and-go mechanism may recognize the poll operation idiom. When the wake-and-go mechanism recognizes such a programming idiom, the wake-and-go mechanism may store the target address A 2 in wake-and-go array 1422 , where the event the thread is waiting for is associated with the target address, and stores thread state information for thread 1410 in thread state storage 1412 . After updating wake-and-go array 1422 with the target address A 2 , the wake-and-go mechanism may put the thread 1410 to sleep. [0158] When a transaction appears on SMP fabric 1420 with an address that matches the target address A 2 , array 1422 returns the storage address that is associated with thread 1410 . The wake-and-go mechanism then wakes thread 1410 by retrieving the thread state information from thread state storage 1412 and placing the thread in the run queue for the processor. Thread 1410 may then perform a compare-and-branch operation to determine whether the value written to the target address represents the event for which thread 1410 is waiting. In the depicted example, the value written to the target address does represent the event for which thread 1410 is waiting; therefore, thread 1410 updates the array to remove the target address from array 1422 , and performs more work. [0159] FIG. 15 is a flowchart illustrating a look-ahead polling operation of a wake-and-go look-ahead engine in accordance with an illustrative embodiment. Operation begins, and the wake-and-go look-ahead engine examines the thread for programming idioms (block 1502 ). Then, the wake-and-go look-ahead engine determines whether it has reached the end of the thread (block 1504 ). If the wake-and-go look-ahead engine has reached the end of the thread, operation ends. [0160] If the wake-and-go look-ahead engine has not reached the end of the thread in block 1504 , the wake-and-go look-ahead engine determines whether the thread comprises at least one wake-and-go programming idiom that indicates that the thread is waiting for a data value to be written to a particular target address (block 1506 ). If the thread does not comprise a wake-and-go programming idiom, operation ends. [0161] If the thread does comprise at least one wake-and-go programming idiom in block 1506 , then the wake-and-go look-ahead engine performs load and compare operations for the at least one wake-and-go programming idiom (block 1508 ). Thereafter, the wake-and-go look-ahead engine determines whether all of the load and compare operations fail (block 1510 ). If all of the look-ahead polling operations fail, then the wake-and-go look-ahead engine updates the wake-and-go array for the at least one programming idiom (block 1512 ), and operation ends. If at least one look-ahead polling operation succeeds, then operation ends without updating the wake-and-go array. In an alternative embodiment, the look-ahead engine may set up the wake-and-go array without performing look-ahead polling. [0162] Speculative Execution [0163] FIG. 16 is a block diagram illustrating operation of a wake-and-go mechanism with speculative execution in accordance with an illustrative embodiment. Thread 1610 runs in a processor (not shown) and performs some work. Thread 1610 also includes a series of instructions that are a programming idiom for wake-and-go (idiom A), along with idioms B, C, D, and E from FIG. 11B . [0164] Look-ahead wake-and-go engine 1620 analyzes the instructions in thread 410 ahead of execution. Look-ahead wake-and-go engine 1620 may recognize the poll operation idioms and perform look-ahead polling operations for each idiom. If the look-ahead polling operation fails, the look-ahead wake-and-go engine 1620 populates wake-and-go array 1622 with the target address. In the depicted example from FIG. 11B , idioms A-D fail; therefore, look-ahead wake-and-go engine 1620 populates wake-and-go array 1622 with addresses A 1 -A 4 , which are the target addresses for idioms A-D. [0165] If a look-ahead polling operation succeeds, look-ahead wake-and-go engine 1620 may record an instruction address for the corresponding idiom so that the wake-and-go mechanism may have thread 1610 perform speculative execution at a time when thread 1610 is waiting for an event. During execution, when the wake-and-go mechanism recognizes a programming idiom, the wake-and-go mechanism may store the thread state in thread state storage 1612 . Instead of putting thread 1610 to sleep, the wake-and-go mechanism may perform speculative execution. [0166] When a transaction appears on SMP fabric 1620 with an address that matches the target address A 1 , array 1622 returns the storage address that is associated with thread 1610 to the wake-and-go mechanism. The wake-and-go mechanism then returns thread 1610 to the state at which idiom A was encountered by retrieving the thread state information from thread state storage 1612 . Thread 1610 may then continue work from the point of idiom A. [0167] FIG. 17 is a flowchart illustrating operation of a look-ahead wake-and-go mechanism with speculative execution in accordance with an illustrative embodiment. Operation begins, and the wake-and-go look-ahead engine examines the thread for programming idioms (block 1702 ). Then, the wake-and-go look-ahead engine determines whether it has reached the end of the thread (block 1704 ). If the wake-and-go look-ahead engine has reached the end of the thread, operation ends. [0168] If the wake-and-go look-ahead engine has not reached the end of the thread in block 1704 , the wake-and-go look-ahead engine determines whether next sequence of instructions comprises a wake-and-go programming idiom that indicates that the thread is waiting for a data value to be written to a particular target address (block 1706 ). If the next sequence of instructions does not comprise a wake-and-go programming idiom, operation returns to block 502 to examine the next sequence of instructions in the thread. A wake-and-go programming idiom may comprise a polling idiom, as described with reference to FIG. 11A . [0169] If the next sequence of instructions does comprise a wake-and-go programming idiom in block 1706 , then the wake-and-go look-ahead engine performs load and compare operations for the wake-and-go programming idiom (block 1708 ). Thereafter, the wake-and-go look-ahead engine determines whether the load and compare operation passes (block 1710 ). If the look-ahead polling operation fails, then the wake-and-go look-ahead engine updates the wake-and-go array for the programming idiom (block 1712 ), and operation returns to block 1702 to examine the next sequence of instructions in the thread. If the look-ahead polling operation passes, then the look-ahead wake-and-go engine records an instruction address for the successful programming idiom to be used for speculative execution later (block 1714 ). Thereafter, operation ends. [0170] FIGS. 18A and 18B are flowcharts illustrating operation of a wake-and-go mechanism with speculative execution during execution of a thread in accordance with an illustrative embodiment. With reference now to FIG. 18A , operation begins when a thread first initializes or when a thread wakes after sleeping. The operating system starts a thread (block 1802 ) by initializing the thread and placing the thread in the run queue for a processor. The thread then performs work (block 1804 ). The operating system determines whether the thread has completed (block 1806 ). If the thread completes, then operation ends. [0171] If the end of the thread is not reached in block 1806 , the processor determines whether the next instructions comprise a wake-and-go idiom, such as a polling operation, for example (block 1808 ). A wake-and-go idiom may comprise a series of instructions, such as a load, compare, and branch sequence, for example. If the next instructions do not comprise a wake-and-go idiom, the wake-and-go mechanism returns to block 1804 to perform more work. [0172] If the next instructions do comprise a wake-and-go idiom in block 1808 , the wake-and-go mechanism saves the state of the thread (block 1810 ). Then, the wake-and-go mechanism determines whether to perform speculative execution (block 1812 ). The wake-and-go mechanism may make this determination by determining whether the look-ahead wake-and-go engine previously performed a successful look-ahead polling operation and recorded an instruction address. [0173] If the wake-and-go mechanism determines that the processor cannot perform speculative execution, the wake-and-go mechanism puts the thread to sleep. Thereafter, operation proceeds to FIG. 18B where the wake-and-go mechanism monitors for an event. [0174] If the wake-and-go mechanism determines that the processor can perform speculative execution from a successful polling idiom, the wake-and-go mechanism begins performing speculative execution from the successfully polled idiom (block 616 ). Thereafter, operation proceeds to FIG. 18B where the wake-and-go mechanism monitors for an event. [0175] With reference now to FIG. 18B , the wake-and-go mechanism, which may include a wake-and-go array, such as a content addressable memory, and associated logic, snoops for a kill from the symmetric multiprocessing (SMP) fabric (block 1818 ). A kill occurs when a transaction appears on the SMP fabric that modifies the target address associated with the event for which a thread is waiting. The wake-and-go mechanism, the operating system, the thread, or other software then performs a compare (block 1820 ) and determines whether the value being written to the target address represents the event for which the thread is waiting (block 1822 ). If the kill corresponds to the event for which the thread is waiting, then the wake-and-go mechanism updates the array (block 1824 ) to remove the target address from the wake-and-go array. Thereafter, operation returns to block 1804 in FIG. 18A where the processor performs more work. [0176] If the kill does not correspond to the event for which the thread is waiting in block 1822 , then operation returns to block 1818 to snoop a kill from the SMP fabric. In FIG. 18B , the wake-and-go mechanism may be a combination of hardware within the processor, logic associated with the wake-and-go array, such as a CAM, and software within the operating system, software within a background sleeper thread, or other hardware. [0177] Data Monitoring [0178] Returning to FIG. 10 , the instructions may comprise a get-and-compare sequence, for example. Wake-and-go mechanism 1008 within processor 1000 may recognize the get-and-compare sequence as a programming idiom that indicates that thread 1002 is waiting for data at a particular target address. When wake-and-go mechanism 1008 recognizes such a programming idiom, wake-and-go mechanism 1008 may store the target address, the data thread 1002 is waiting for, and a comparison type in wake-and-go array 1022 , where the event the thread is waiting for is associated with the target address. After updating wake-and-go array 1022 with the target address, wake-and-go mechanism 1008 may put thread 1002 to sleep. [0179] The get-and-compare sequence may load a data value from a target address, perform a compare operation based on an expected data value, and branch if the compare operation matches. Thus, the get-and-compare sequence had three basic elements: an address, an expected data value, and a comparison type. The comparison type may be, for example, equal to (=), less than (<), greater than (>), less than or equal to (<), or greater than or equal to (>). Thus, wake-and-go mechanism 1008 may store the address, data value, and comparison value in wake-and-go array 1022 . [0180] Thread 1002 may alternatively include specialized processor instructions, operating system calls, or application programming interface (API) calls that instruct wake-and-go mechanism 1008 to populate wake-and-go array 1022 with a given address, data value, and comparison type. [0181] Wake-and-go mechanism 1008 also may save the state of thread 1002 in thread state storage 1034 , which may be allocated from memory 1032 or may be a hardware private array within the processor (not shown) or pervasive logic (not shown). When a thread is put to sleep, i.e., removed from the run queue of a processor, the operating system must store sufficient information on its operating state such that when the thread is again scheduled to run on the processor, the thread can resume operation from an identical position. This state information is sometime referred to as the thread's “context.” The state information may include, for example, address space, stack space, virtual address space, program counter, instruction register, program status word, and the like. [0182] If a transaction appears on bus 1020 that modifies a value at an address where the value satisfies the comparison type in wake-and-go array 1022 , then wake-and-go mechanism 1008 may wake thread 1002 . Wake-and-go array 1022 may have associated logic that recognizes the target address on bus 1020 and performs the comparison based on the value being written, the expected value stored in wake-and-go array 1022 , and the comparison type stored in wake-and-go array 1022 . Wake-and-go mechanism 1008 may wake thread 1002 by recovering the state of thread 1002 from thread state storage 1034 . Thus, thread 1002 only wakes if there is a transaction that modifies the target address with a value that satisfies the comparison type and expected value. [0183] Thus, in an exemplary embodiment, wake-and-go array 1022 may comprise a CAM and associated logic that will be triggered if a transaction appears on bus 1020 that modifies an address stored in the CAM. A transaction that modifies a value at a target address may be referred to as a “kill”; thus, wake-and-go array 1022 may be said to be “snooping kills.” In this exemplary embodiment, the data values stored in the CAM are the target addresses at which threads are waiting for something to be written, an expected value, and a comparison type. The address at which a data value, a given target address, is stored is referred to herein as the storage address. [0184] Each storage address may refer to a thread that is asleep and waiting for an event. Wake-and-go array 1022 may store multiple instances of the same target address, each instance being associated with a different thread waiting for an event at that target address. The expected values and comparison types may be different. Thus, when wake-and-go array 1022 snoops a kill at a given target address, wake-and-go array 1022 may return one or more storage addresses that are associated with one or more sleeping threads. When wake-and-go array 1022 snoops a kill at the given target address, wake-and-go array 1022 may also return the expected value and comparison type to associated logic that performs the comparison. If the comparison matches, then the associated logic may return a storage address to wake-and-go mechanism 1008 to wake the corresponding thread. [0185] FIG. 19 is a block diagram illustrating data monitoring in a multiple processor system in accordance with an illustrative embodiment. Processors 1902 - 1908 connect to bus 1920 . Each one of processors 1902 - 1908 may have a wake-and-go mechanism, such as wake-and-go mechanism 1008 in FIG. 10 , and a wake-and-go array, such as wake-and-go array 1022 in FIG. 10 . A device (not shown) may modify a data value at a target address through input/output channel controller (HOC) 1912 , which transmits the transaction on bus 1920 to memory controller 1914 . [0186] The wake-and-go array of each processor 1902 - 1908 snoops bus 1920 . If a transaction appears on bus 1920 that modifies a value at an address where the value satisfies the comparison type in a wake-and-go array, then the wake-and-go mechanism may wake a thread. Each wake-and-go array may have associated logic that recognizes the target address on bus 1920 and performs the comparison based on the value being written, the expected value stored in the wake-and-go array, and the comparison type stored in the wake-and-go array. Thus, the wake-and-go mechanism may only wake a thread if there is a transaction on bus 1920 that modifies the target address with a value that satisfies the comparison type and expected value. [0187] FIG. 20 is a block diagram illustrating operation of a wake-and-go mechanism in accordance with an illustrative embodiment. Thread 2010 runs in a processor (not shown) and performs some work. Thread 2010 executes a series of instructions that are a programming idiom for wake-and-go, a specialized processor instruction, an operating system call, or an application programming interface (API) call. The wake-and-go mechanism may recognize the idiom, specialized processor instruction, operating system call, or API call, hereinafter referred to as a “wake-and-go operation.” When the wake-and-go mechanism recognizes such a wake-and-go operation, the wake-and-go mechanism may store the target address A 2 , expected data value D 2 , and comparison type T 2 in wake-and-go array 2022 , and stores thread state information for thread 2010 in thread state storage 2012 . After updating wake-and-go array 2022 with the target address A 2 , expected data value D 2 , and comparison type T 2 , the wake-and-go mechanism may put thread 2010 to sleep. [0188] When a transaction appears on SMP fabric 2020 with an address that matches the target address A 2 , logic associated with wake-and-go array 2022 may perform a comparison based on the value being written, the expected value D 2 and the comparison type T 2 . If the comparison is a match, then the logic associated with wake-and-go array 2022 returns the storage address that is associated with thread 2010 . The wake-and-go mechanism then wakes thread 2010 by retrieving the thread state information from thread state storage 2012 and placing the thread in the run queue for the processor. [0189] Parallel Lock Spinning [0190] Returning to FIG. 10 , the instructions may comprise a get-and-compare sequence, for example. In an illustrative embodiment, the instructions may comprise a sequence of instructions that indicate that thread 1002 is spinning on a lock. A lock is a synchronization mechanism for enforcing limits on access to resources in an environment where there are multiple threads of execution. Generally, when a thread attempts to write to a resource, the thread may request a lock on the resource to obtain exclusive access. If another thread already has the lock, the thread may “spin” on the lock, which means repeatedly polling the lock location until the lock is free. The instructions for spinning on the lock represent an example of a programming idiom. [0191] Wake-and-go mechanism 1008 within processor 1000 may recognize the spinning on lock idiom that indicates that thread 1002 is spinning on a lock. When wake-and-go mechanism 1008 recognizes such a programming idiom, wake-and-go mechanism 1008 may store the target address in wake-and-go array 1022 with a flag to indicate that thread 1002 is spinning on a lock. After updating wake-and-go array 1022 with the target address and setting the lock flag, wake-and-go mechanism 1008 may put thread 1002 to sleep. Thus, wake-and-go mechanism 1008 allows several threads to be spinning on a lock at the same time without using valuable processor resources. [0192] If a transaction appears on bus 1020 that modifies a value at an address in wake-and-go array 1022 , then wake-and-go mechanism 1008 may wake thread 1002 . Wake-and-go mechanism 1008 may wake thread 1002 by recovering the state of thread 1002 from thread state storage 1034 . Thread 1002 may then determine whether the transaction corresponds to the event for which the thread was waiting by performing a get-and-compare operation, for instance. If the lock bit is set in wake-and-go array 1022 , then it is highly likely that the transaction is freeing the lock, in which case, wake-and-go mechanism may automatically wake thread 1002 . [0193] FIGS. 21A and 21B are block diagrams illustrating parallel lock spinning using a wake-and-go mechanism in accordance with an illustrative embodiment. With particular reference to FIG. 21A , thread 2110 runs in a processor (not shown) and performs some work. Thread 2110 executes a series of instructions that are a programming idiom for spin on lock. The wake-and-go mechanism may recognize the spin on lock operation idiom. When the wake-and-go mechanism recognizes such a programming idiom, the wake-and-go mechanism may store the target address A l in wake-and-go array 2122 , set the lock bit 2124 , and store thread state information for thread 2110 in thread state storage 2112 . After updating wake-and-go array 2122 with the target address A 1 , the wake-and-go mechanism may put the thread 2110 to sleep. [0194] The processor may then run thread 2130 , which performs some work. The wake-and-go mechanism may recognize a spin on lock operation idiom, responsive to which the wake-and-go mechanism stores the target address A 2 in wake-and-go array 2122 , set the lock bit 2124 , and store thread state information for thread 2130 in thread state storage 2112 . After updating wake-and-go array 2122 with the target address A 2 , the wake-and-go mechanism may put the thread 2130 to sleep. [0195] Turning to FIG. 21B , thread 2140 runs in the processor and performs some work. When a transaction appears on SMP fabric 2120 with an address that matches the target address A 1 , wake-and-go array 2122 returns the storage address that is associated with thread 2110 . The wake-and-go mechanism then wakes thread 2110 by retrieving the thread state information from thread state storage 2112 and placing the thread in the run queue for the processor, because it is highly likely that the transaction is freeing the lock. Thread 2110 may update array 2122 to remove the target address. In the depicted example, thread 2110 and thread 2140 run concurrently in the processor. Thus, thread 2110 and thread 2130 , and any number of other threads, may be spinning on a lock at the same time. When a lock is freed, the processor may wake the thread, such as thread 2110 in the depicted example, and the remaining threads may continue “spinning” on the lock without consuming any processor resources. [0196] FIGS. 22A and 22B are flowcharts illustrating parallel lock spinning using a wake-and-go mechanism in accordance with the illustrative embodiments. Operation begins when a thread first initializes or when a thread wakes after sleeping. The operating system starts a thread (block 2202 ) by initializing the thread and placing the thread in the run queue for a processor. The thread then performs work (block 2204 ). The operating system determines whether the thread has completed (block 2206 ). If the thread completes, then operation ends. [0197] If the end of the thread is not reached in block 2206 , the processor determines whether the next instructions comprise a spin on lock idiom (block 2208 ). A spin on lock idiom may comprise a series of instructions, such as a load, compare, and branch sequence, for example. If the next instructions do not comprise a spin on lock idiom, the wake-and-go mechanism returns to block 2204 to perform more work. [0198] If the next instructions do comprise a spin on lock idiom in block 2208 , the wake-and-go mechanism updates the array with a target address associated with an event for which the thread is waiting (block 2210 ) and sets the lock bit in the wake-and-go array (block 2212 ). The update to the wake-and-go array may be made by the thread through a specialized processor instruction, the operating system, or a background sleeper thread. Next, the wake-and-go mechanism saves the state of the thread (block 2214 ) and puts the thread to sleep (block 2216 ). Thereafter, operation proceeds to FIG. 22B where the wake-and-go mechanism monitors for an event. [0199] With reference now to FIG. 22B , the wake-and-go mechanism, which may include a wake-and-go array, such as a content addressable memory (CAM), and associated logic, snoops for a kill from the symmetric multiprocessing (SMP) fabric (block 2218 ). A kill occurs when a transaction appears on the SMP fabric that modifies the target address associated with the event for which a thread is waiting. The wake-and-go mechanism determines whether the value being written to the target address represents the event for which the thread is waiting (block 2220 ). If the lock bit is set, then it is highly likely that the event is merely freeing the lock. If the kill corresponds to the event for which the thread is waiting, then the wake-and-go mechanism updates the array (block 2222 ) to remove the target address from the wake-and-go array and reloads the thread state for the thread that was spinning on the lock (block 2224 ). Thereafter, operation returns to block 2202 in FIG. 22A where the operating system restarts the thread. [0200] If the kill does not correspond to the event for which the thread is waiting in block 2220 , then operation returns to block 2218 to snoop a kill from the SMP fabric. In FIG. 22B , the wake-and-go mechanism may be a combination of hardware within the processor, logic associated with the wake-and-go array, such as a CAM, and software within the operating system, software within a background sleeper thread, or other hardware. [0201] Central Repository for Wake-and-Go Engine [0202] As stated above with reference to FIG. 10 , while the data processing system in FIG. 10 shows one processor, more processors may be present depending upon the implementation where each processor has a separate wake-and-go array or one wake-and-go array stores target addresses for threads for multiple processors. In one illustrative embodiment, one wake-and-go engine stores entries in a central repository wake-and-go array for all threads and multiple processors. [0203] FIG. 23 is a block diagram illustrating a wake-and-go engine with a central repository wake-and-go array in a multiple processor system in accordance with an illustrative embodiment. Processors 2302 - 2308 connect to bus 2320 . A device (not shown) may modify a data value at a target address through input/output channel controller (HOC) 2312 , which transmits the transaction on bus 2320 to memory controller 2314 . Wake-and-go engine 2350 performs look-ahead to identify wake-and-go programming idioms in the instruction streams of threads running on processors 2302 - 2308 . If wake-and-go engine 2350 recognizes a wake-and-go programming idiom, wake-and-go engine 2350 records an entry in central repository wake-and-go array 2352 . [0204] Wake-and-go engine 2350 snoops bus 2320 . If a transaction appears on bus 2320 that modifies a value at an address where the value satisfies the comparison type in a wake-and-go array, then the wake-and-go engine 2350 may wake a thread. Wake-and-go engine 2350 may have associated logic that recognizes the target address on bus 2320 and performs the comparison based on the value being written, the expected value stored in the wake-and-go array, and the comparison type stored in central repository wake-and-go array 2352 . Thus, wake-and-go engine 2350 may only wake a thread if there is a transaction on bus 2320 that modifies the target address with a value that satisfies the comparison type and expected value. [0205] FIG. 24 illustrates a central repository wake-and-go-array in accordance with an illustrative embodiment. Each entry in central repository wake-and-go array 2400 may include thread identification (ID) 2402 , central processing unit (CPU) ID 2404 , the target address 2406 , the expected data 2408 , a comparison type 2410 , a lock bit 2412 , a priority 2414 , and a thread state pointer 2416 , which is the address at which the thread state information is stored. [0206] The wake-and-go engine 2350 may use the thread ID 2402 to identify the thread and the CPU ID 2404 to identify the processor. Wake-and-go engine 2350 may then place the thread in the run queue for the processor identified by CPU ID 2404 . Wake-and-go engine 2350 may also use thread state pointer 2416 to load thread state information, which is used to wake the thread to the proper state. [0207] Programming Idiom Accelerator [0208] In a sense, a wake-and-go mechanism, such as look-ahead wake-and-go engine 2350 , is a programming idiom accelerator. A programming idiom is a sequence of programming instructions that occurs often and is recognizable as a sequence of instructions. In the examples described above, an instruction sequence that includes load (LD), compare (CMP), and branch (BC) commands represents a programming idiom that indicates that the thread is waiting for data to be written to a particular target address. Wake-and-go engine 2350 recognizes this idiom as a wake-and-go idiom and accelerates the wake-and-go process accordingly, as described above. Other examples of programming idioms may include spinning on a lock or traversing a linked list. [0209] FIG. 25 is a block diagram illustrating a programming idiom accelerator in accordance with an illustrative embodiment. Processors 2502 - 2508 connect to bus 2520 . A processor, such as processor 2502 for example, may fetch instructions from memory via memory controller 2514 . As processor 2502 fetches instructions, programming idiom accelerator 2550 may look ahead to determine whether a programming idiom is coming up in the instruction stream. If programming idiom accelerator 2550 recognizes a programming idiom, programming idiom accelerator 2550 performs an action to accelerate execution of the programming idiom. In the case of a wake-and-go programming idiom, programming idiom accelerator 2550 may record an entry in a wake-and-go array, for example. [0210] As another example, if programming idiom accelerator 2550 accelerates lock spinning programming idioms, programming idiom accelerator 2550 may obtain the lock for the processor, if the lock is available, thus making the lock spinning programming sequence of instructions unnecessary. Programming idiom accelerator 2550 may accelerate any known or common sequence of instructions or future sequences of instructions. Although not shown in FIG. 25 , a data processing system may include multiple programming idiom accelerators that accelerate various programming idioms. Alternatively, programming idiom accelerator 2550 may recognize and accelerator multiple known programming idioms. In one exemplary embodiment, each processor 2502 - 2508 may have programming idiom accelerators within the processor itself. [0211] As stated above with respect to the wake-and-go engine, programming idiom accelerator 2550 may be a hardware device within the data processing system. In an alternative embodiment, programming idiom accelerator 2550 may be a hardware component within each processor 2502 - 2508 . In another embodiment, programming idiom accelerator 2550 may be software within an operating system running on one or more of processors 2502 - 2508 . Thus, in various implementations or embodiments, programming idiom accelerator 2550 may be software, such as a background sleeper thread or part of an operating system, hardware, or a combination of hardware and software. [0212] In one embodiment, the programming language may include hint instructions that may notify programming accelerator 2550 that a programming idiom is coming. FIG. 26 is a series of instructions that are a programming idiom with programming language exposure in accordance with an illustrative embodiment. In the example depicted in FIG. 26 , the instruction stream includes programming idiom 2602 , which in this case is an instruction sequence that includes load (LD), compare (CMP), and branch (BC) commands that indicate that the thread is waiting for data to be written to a particular target address. [0213] Idiom begin hint 2604 exposes the programming idiom to the programming idiom accelerator. Thus, the programming idiom accelerator need not perform pattern matching or other forms of analysis to recognize a sequence of instructions. Rather, the programmer may insert idiom hint instructions, such as idiom begin hint 2604 , to expose the idiom 2602 to the programming idiom accelerator. Similarly, idiom end hint 2606 may mark the end of the programming idiom; however, idiom end hint 2606 may be unnecessary if the programming idiom accelerator is capable of identifying the sequence of instructions as a recognized programming idiom. [0214] In an alternative embodiment, a compiler may recognize programming idioms and expose the programming idioms to the programming idiom accelerator. FIG. 27 is a block diagram illustrating a compiler that exposes programming idioms in accordance with an illustrative embodiment. Compiler 2710 receives high level program code 2702 and compiles the high level instructions into machine instructions to be executed by a processor. Compiler 2710 may be software running on a data processing system, such as data processing system 100 in FIG. 1 , for example. [0215] Compiler 2710 includes programming idiom exposing module 2712 , which parses high level program code 2702 and identifies sequences of instructions that are recognized programming idioms. Compiler 2710 then compiles the high level program code 2702 into machine instructions and inserts hint instructions to expose the programming idioms. The resulting compiled code is machine code with programming idioms exposed 2714 . As machine code 2714 is fetched for execution by a processor, one or more programming idiom accelerators may see a programming idiom coming up and perform an action to accelerate execution. [0216] FIG. 28 is a flowchart illustrating operation of a compiler exposing programming idioms in accordance with an illustrative embodiment. Operation begins and the compiler receives high level program code to compile into machine code (block 2802 ). The compiler considers a sequence of code (block 2804 ) and determines whether the sequence of code includes a recognized programming idiom (block 2806 ). [0217] If the sequence of code includes a recognized programming idiom, the compiler inserts one or more instructions to expose the programming idiom to the programming idiom accelerator (block 2808 ). The compiler compiles the sequence of code (block 2810 ). If the sequence of code does not include a recognized programming idiom in block 2806 , the compiler proceeds to block 2810 to compile the sequence of code. [0218] After compiling the sequence of code in block 2810 , the compiler determines if the end of the high level program code is reached (block 2812 ). If the end of the program code is not reached, operation returns to block 2804 to consider the next sequence of high level program instructions. If the end of the program code is reached in block 2812 , then operation ends. [0219] The compiler may recognize one or more programming idioms from a set of predetermined programming idioms. The set of predetermined programming idioms may correspond to a set of programming idiom accelerators that are known to be supported in the target machine. For example, if the target data processing system has a wake-and-go engine and a linked list acceleration engine, then the compiler may provide hints for these two programming idioms. The hint instructions may be such that they are ignored by a processor or data processing system that does not support programming idiom accelerators. [0220] Managing Threads [0221] Each sleeping thread having an entry in the wake-and-go array may be referred to as a wake-and-go instance. In one illustrative embodiment, a wake-and-go instance can be abstracted away from the processor and may be moved to another processor. For instance, rather than returning the thread to the same processor, thus stopping the other work the processor is performing, the wake-and-go mechanism may start the thread in another processor. [0222] FIG. 29 is a block diagram that illustrates a data processing system with thread abstraction in accordance with an illustrative embodiment. Processor/core 2902 and processor/core 2904 connect to bus 2920 . Processor/core 2902 and processor/core 2904 may be individual processors connected to a symmetric multi-processing (SMP) bus, for example. Alternatively, processor/core 2902 and processor/core 2904 may be cores that are part of a multiple core processor or system-on-a-chip. That is, processor/core 2902 , processor/core 2904 , and bus 2920 may be embodied on the same integrated circuit (IC) chip. Furthermore, while the example depicted in FIG. 29 shows two processors or cores, the data processing system, multiple core processor, or system-on-a-chip may include more processors or cores depending upon the implementation. [0223] Processor/core 2902 has wake-and-go mechanism 2912 , and processor/core 2904 has wake-and-go mechanism 2914 . Wake-and-go mechanism 2912 and wake-and-go mechanism 2914 may comprise logic associated with a wake-and-go array, functionality within the operating system, or a background sleeper thread. Wake-and-go mechanism 2912 and wake-and-go mechanism 2914 include a wake-and-go array for storing information associated for each thread waiting for an event associated with a target address. Thus, when a thread running on processor/core 2902 , for example, encounters a series of instructions that indicate that the thread is waiting for an event associated with a target address, processor/core 2902 puts the thread to sleep by storing the thread state in a thread state storage (not shown) and creates a wake-and-go instance in wake-and-go mechanism 2912 . [0224] Processor/core 2902 and processor/core 2904 also communicate priority information regarding active and sleeping threads, including wake-and-go instances, and processor/core utilization. When wake-and-go mechanism 2912 detects an even associated with a target address for which a wake-and-go instance, such as wake-and-go instance 2916 in FIG. 29 , is waiting, wake-and-go mechanism 2912 attempts to wake the thread by retrieving the thread state and starting the thread. In accordance with the illustrative embodiment, wake-and-go mechanism 2912 may assign the wake-and-go instance to processor/core 2902 or processor/core 2904 based on utilization and/or priorities of threads running on processor/core 2902 and processor/core 2904 . [0225] In one example embodiment, processor/core 2904 has lower utilization, and thus more processing resources, than processor/core 2902 . Therefore, wake-and-go mechanism 2912 assigns the thread to processor/core 2904 and sends wake-and-go instance 2916 to processor/core 2904 to restart the thread. [0226] In another example, wake-and-go mechanism 2912 may determine which processor/core has the lowest priority thread running and assign wake-and-go instance 2916 to the processor/core with the lowest priority thread. In the example depicted in FIG. 29 , wake-and-go mechanism 2912 determines that processor/core 2904 has the lowest priority thread running and sends wake-and-go instance 2916 to wake-and-go mechanism 2914 . Processor/core 2904 then puts the lowest priority thread to sleep and starts the thread associated with wake-and-go instance 2916 . [0227] In another example, wake-and-go mechanism 2912 may have many more wake-and-go instances than wake-and-go mechanism 2914 . In fact, the wake-and-go array in wake-and-go mechanism 2912 , which may be a content addressable memory (CAM), may be full to capacity and may not have space for another wake-and-go instance, while wake-and-go mechanism 2914 may be relatively empty. In this instance, wake-and-go mechanism 2912 may send wake-and-go instance 2916 to perform load balancing based on the number of wake-and-go instances in each wake-and-go array and processor/core utilization. [0228] FIG. 30 is a block diagram that illustrates a data processing system with thread abstraction in a central wake-and-go array in accordance with an illustrative embodiment. Processor/core 3002 and processor/core 3004 connect to bus 3020 . Processor/core 3002 and processor/core 3004 may be individual processors connected to a symmetric multi-processing (SMP) bus, for example. Alternatively, processor/core 3002 and processor/core 3004 may be cores that are part of a multiple core processor or system-on-a-chip. That is, processor/core 3002 , processor/core 3004 , and bus 3020 may be embodied on the same integrated circuit (IC) chip. Furthermore, while the example depicted in FIG. 30 shows two processors or cores, the data processing system, multiple core processor, or system-on-a-chip may include more processors or cores depending upon the implementation. [0229] Processor/core 3002 has wake-and-go mechanism 3012 , and processor/core 3004 has wake-and-go mechanism 3014 . Wake-and-go mechanism 3012 and wake-and-go mechanism 3014 may comprise functionality within the operating system, or a background sleeper thread. Wake-and-go mechanism 3012 and wake-and-go mechanism 3014 store wake-and-go instances in central wake-and-go array 3022 . Thus, when a thread running on processor/core 3002 , for example, encounters a series of instructions that indicate that the thread is waiting for an event associated with a target address, processor/core 3002 puts the thread to sleep by storing the thread state in a thread state storage (not shown), and wake-and-go mechanism 3012 creates a wake-and-go instance in central wake-and-go array 3022 . Similarly, when a thread running on processor/ core 3004 encounters a series of instructions that indicate that the thread is waiting for an event associated with a target address, wake-and-go mechanism 3014 creates a wake-and-go instance in central wake-and-go array 3022 . [0230] Processor/core 3002 and processor/core 3004 also communicate priority information regarding active and sleeping threads, including wake-and-go instances, and processor/core utilization. When central wake-and-go array 3022 detects an even associated with a target address for which a wake-and-go instance, such as wake-and-go instance 3016 in FIG. 30 , is waiting, central wake-and-go array 3012 attempts to wake the thread by retrieving the thread state and starting the thread. In accordance with the illustrative embodiment, central wake-and-go array 3012 may assign the wake-and-go instance to processor/core 3002 or processor/core 3004 based on utilization and/or priorities of threads running on processor/core 3002 and processor/core 3004 . [0231] In one example embodiment, processor/core 3004 has lower utilization, and thus more processing resources, than processor/core 3002 . Therefore, central wake-and-go array 3012 assigns the thread to processor/core 3004 and sends wake-and-go instance 3016 to wake-and-go mechanism 3014 to restart the thread. [0232] In another example, central wake-and-go array 3022 may determine which processor/core has the lowest priority thread running and assign wake-and-go instance 3016 to the processor/core with the lowest priority thread. In the example depicted in FIG. 30 , central wake-and-go array 3012 determines that processor/core 3004 has the lowest priority thread running and sends wake-and-go instance 3016 to wake-and-go mechanism 3014 . Processor/core 3004 then puts the lowest priority thread to sleep and starts the thread associated with wake-and-go instance 3016 . [0233] In the example depicted in FIG. 30 , because wake-and-go instances are abstracted from the processor/core and stored in central wake-and-go array 3022 , a restarted thread resulting from a wake-and-go instance, such as wake-and-go instance 3016 , may be assigned to any processor/core. As shown in FIG. 24 , above, an entry for a wake-and-go instance in central wake-and-go array 3022 includes a thread ID, target address, data the thread is waiting to be written to the target address, compare type, lock bit, priority, and thread state pointer. In the example depicted in FIG. 30 , the CPU ID, which identifies the processor/core, is not necessary, as the thread is abstracted from the processor or core. There is an inherent load balancing in this example embodiment, because when a thread is restarted from central wake-and-go array 3022 , the thread may be assigned to a processor/core based on utilization and/or thread priority. [0234] FIG. 31 is a block diagram that illustrates a data processing system with thread abstraction in a wake-and-go engine in accordance with an illustrative embodiment. Processor/core 3102 and processor/core 3104 connect to bus 3120 . Processor/core 3102 and processor/core 3104 may be individual processors connected to a symmetric multi-processing (SMP) bus, for example. Alternatively, processor/core 3102 and processor/core 3104 may be cores that are part of a multiple core processor or system-on-a-chip. That is, processor/core 3102 , processor/core 3104 , and bus 3120 may be embodied on the same integrated circuit (IC) chip. Furthermore, while the example depicted in FIG. 31 shows two processors or cores, the data processing system, multiple core processor, or system-on-a-chip may include more processors or cores depending upon the implementation. [0235] Wake-and-go engine 3124 is associated with bus 3120 . When wake-and-go engine 3124 detects that a thread running on processor/core 3102 , for example, encounters a series of instructions that indicate that the thread is waiting for an event associated with a target address, processor/core 3102 puts the thread to sleep by storing the thread state in a thread state storage (not shown), and wake-and-go engine 3124 creates a wake-and-go instance in central wake-and-go array 3122 . [0236] Processor/core 3102 and processor/core 3104 also communicate priority information regarding active and sleeping threads, including wake-and-go instances, and processor/core utilization to wake-and-go engine 3124 . When wake-and-go engine 3124 detects an even associated with a target address for which a wake-and-go instance, such as wake-and-go instance 3116 in FIG. 31 , is waiting, wake-and-go engine 3124 attempts to wake the thread. In accordance with the illustrative embodiment, wake-and-go engine 3124 may assign the wake-and-go instance to processor/core 3102 or processor/core 3104 based on utilization and/or priorities of threads running on processor/core 3102 and processor/ core 3104 . [0237] FIGS. 32A and 32B are flowcharts illustrating operation of a wake-and-go mechanism with thread abstraction in accordance with the illustrative embodiments. With reference now to FIG. 32A , operation begins when a thread first initializes or when a thread wakes after sleeping. The operating system starts a thread (block 3202 ) by initializing the thread and placing the thread in the run queue for a processor. The thread then performs work (block 3204 ). The operating system determines whether the thread has completed (block 3206 ). If the thread completes, then operation ends. [0238] If the end of the thread is not reached in block 3206 , the processor determines whether to update the wake-and-go array (block 3208 ). The thread may include an instruction to update the wake-and-go array that may be a specialized processor instruction, an operating system call, a call to a background sleeper thread, or a call to an application programming interface. Alternatively, the wake-and-go mechanism may perform a look-ahead operation to identify wake-and-go programming idioms within the instruction stream of the thread. In response to a determination not to update the wake-and-go array, operation returns to block 3204 to perform more work. [0239] In response to a determination to update the wake-and-go array in block 3208 , the processor updates the array with a target address associated with an event for which the thread is waiting (block 3210 ). The update to the wake-and-go array may be made by the thread through a specialized processor instruction, the operating system, or a background sleeper thread. Next, the operating system then determines whether to put the thread to sleep (block 3212 ). The operating system may keep the thread active in the processor if the processor is underutilized, for instance; however, the operating system may put the thread to sleep if there are other threads waiting to be run on the processor. If the operating system determines that the thread is to remain active, operation returns to block 3204 to perform more work, in which case the thread may simply wait for the event. [0240] In one exemplary embodiment, if the operating system determines that the thread is to be put to sleep in block 3212 , then the operating system or some other software or hardware saves the state of the thread (block 3214 ) and puts the thread to sleep (block 3216 ). Thereafter, operation proceeds to FIG. 32B where the wake-and-go mechanism monitors for an event. In one exemplary embodiment, software may save the state of the thread in thread state storage. The thread is then put to sleep. [0241] In an alternative embodiment, if the operating system determines that the thread is to be put to sleep in block 3212 , then the operating system or some other software or hardware saves the state of the thread (block 3214 ) in the hardware private array and puts the thread to sleep (block 3216 ). Thereafter, operation proceeds to FIG. 32B where the wake-and-go mechanism monitors for an event. [0242] With reference now to FIG. 32B , the wake-and-go mechanism, which may include a wake-and-go array, such as a content addressable memory, and associated logic, snoops for a kill from the bus (block 3218 ). A kill occurs when a transaction appears on the bus that modifies the target address associated with the event for which a thread is waiting. The wake-and-go mechanism then performs a compare (block 3220 ) and determines whether the value being written to the target address represents the event for which the thread is waiting (block 3222 ). If the kill does not correspond to the event for which the thread is waiting, then operation returns to block 3218 to snoop a kill from the SMP fabric. [0243] If the event does correspond to the event for which the thread is waiting, then the wake-and-go mechanism determines whether processor resources are available (block 3224 ). Processor resources are available if a processor or core is underutilized. If processor resources are available, the wake-and-go mechanism finds the processor or core with the lowest utilization (block 3226 ) and assigns the thread to the processor or core with the lowest utilization (block 3228 ). Thereafter, wake-and-go mechanism updates the wake-and-go array (block 3230 ), and operation returns to block 3202 in FIG. 32A where the operating system restarts the thread on that processor or core. [0244] If the wake-and-go mechanism determines that processor resources are not available in block 3224 , the wake-and-go mechanism finds the processor or core with the lowest priority thread (block 3232 ) and assigns the thread to the processor or core with the lowest priority thread (block 3234 ). Then, that processor or core saves the state of the lowest priority thread (block 3236 ) and puts the lowest priority thread to sleep (block 3238 ). Thereafter, the wake-and-go mechanism updates the wake-and-go array (block 3230 ), and operation returns to block 3202 in FIG. 32A where the operating system restarts the thread. [0245] In one exemplary embodiment, when the wake-and-go mechanism snoops a kill at a target address, the wake-and-go mechanism may generate an exception. The processor sees the exception and performs a trap, which results in a switch to kernel mode, wherein the operating system may perform some action before returning control to the originating process. In this case, the trap results in other software to reload the thread from the thread state storage and to continue processing of the active threads on the processor in block 3202 . [0246] In one exemplary embodiment, when the wake-and-go mechanism snoops a kill at a target address, software or hardware reloads the thread from the hardware private array and the processor continues processing the active threads on the processor in block 3202 . [0247] In FIG. 32B , the wake-and-go mechanism may be a combination of logic associated with the wake-and-go array, such as a CAM, and software within the operating system, software within a background sleeper thread, a dedicated wake-and-go engine associated with the bus, or other hardware. [0248] In an alternative embodiment, the wake-and-go mechanism may be a combination of logic associated with the wake-and-go array and software within the thread itself. In such an embodiment, the thread will wake every time there is a kill to the target address. The thread itself may then perform a compare operation to determine whether to perform more work or to go back to sleep. If the thread decides to go back to sleep, it may again save the state of the thread. The over head for waking the thread every time there is a kill to the target address will likely be much less than polling or event handlers. [0249] Thus, the illustrative embodiments solve the disadvantages of the prior art by providing a wake-and-go mechanism for a microprocessor. When a thread is waiting for an event, rather than performing a series of get-and-compare sequences, the thread updates a wake-and-go array with a target address associated with the event. The target address may point to a memory location at which the thread is waiting for a value to be written. The thread may update the wake-and-go array using a processor instruction within the program, a call to the operating system, or a call to a background sleeper thread, for example. The thread then goes to sleep until the event occurs. [0250] The wake-and-go array may be a content addressable memory (CAM). When a transaction appears on the symmetric multiprocessing (SMP) fabric that modifies the value at a target address in the CAM, which is referred to as a “kill,” the CAM returns a list of storage addresses at which the target address is stored. The operating system or a background sleeper thread associates these storage addresses with the threads waiting for an even at the target addresses, and may wake the one or more threads waiting for the event. [0251] It should be appreciated that the illustrative embodiments may take the form of a specialized hardware embodiment, a software embodiment that is executed on a computer system having general processing hardware, or an embodiment containing both specialized hardware and software elements that are executed on a computer system having general processing hardware. In one exemplary embodiment, the mechanisms of the illustrative embodiments are implemented in a software product, which may include but is not limited to firmware, resident software, microcode, etc. [0252] Furthermore, the illustrative embodiments may take the form of a computer program product accessible from a computer-usable or computer-readable medium providing program code for use by or in connection with a computer or any instruction execution system. For the purposes of this description, a computer-usable or computer-readable medium can be any apparatus that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device. [0253] The medium may be an electronic, magnetic, optical, electromagnetic, or semiconductor system, apparatus, or device. Examples of a computer-readable medium include a semiconductor or solid state memory, magnetic tape, a removable computer diskette, a random access memory (RAM), a read-only memory (ROM), a rigid magnetic disk, and an optical disk. Current examples of optical disks include compact disk-read-only memory (CD-ROM), compact disk-read/write (CD-R/W) and DVD. [0254] The program code of the computer program product may comprise instructions that are stored in a computer readable storage medium in a client or server data processing system. In a client data processing system embodiment, the instructions may have been downloaded over a network from one or more remote data processing systems, such as a server data processing system, a client data processing system, or a plurality of client data processing systems using a peer-to-peer communication methodology. In a server data processing system embodiment, the instructions may be configured for download, or actually downloaded, over a network to a remote data processing system, e.g., a client data processing system, for use in a computer readable storage medium with the remote data processing system. [0255] A data processing system suitable for storing and/or executing program code will include at least one processor coupled directly or indirectly to memory elements through a system bus. The memory elements can include local memory employed during actual execution of the program code, bulk storage, and cache memories which provide temporary storage of at least some program code in order to reduce the number of times code must be retrieved from bulk storage during execution. [0256] Input/output or I/O devices (including but not limited to keyboards, displays, pointing devices, etc.) can be coupled to the system either directly or through intervening I/O controllers. Network adapters may also be coupled to the system to enable the data processing system to become coupled to other data processing systems or remote printers or storage devices through intervening private or public networks. Modems, cable modems and Ethernet cards are just a few of the currently available types of network adapters. [0257] The description of the present invention has been presented for purposes of illustration and description, and is not intended to be exhaustive or limited to the invention in the form disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art. The embodiment was chosen and described in order to best explain the principles of the invention, the practical application, and to enable others of ordinary skill in the art to understand the invention for various embodiments with various modifications as are suited to the particular use contemplated.

Description

Topics

Download Full PDF Version (Non-Commercial Use)

Patent Citations (100)

    Publication numberPublication dateAssigneeTitle
    US-6044220-AMarch 28, 2000Motorola, Inc.Method and apparatus for operating a data processor to execute software written using a foreign instruction set
    US-4733352-AMarch 22, 1988Hitachi, Ltd.Lock control for a shared storage in a data processing system
    US-6874144-B1March 29, 2005International Business Machines CorporationSystem, method, and program for implementing priority inheritance in an operating system
    US-6411982-B1December 31, 1969
    US-6704843-B1March 09, 2004International Business Machines CorporationEnhanced multiprocessor response bus protocol enabling intra-cache line reference exchange
    US-6343344-B1January 29, 2002International Business Machines CorporationSystem bus directory snooping mechanism for read/castout (RCO) address transaction
    US-6223208-B1April 24, 2001International Business Machines CorporationMoving data in and out of processor units using idle register/storage functional units
    US-2006093044-A1May 04, 2006Brad Grantham, David Shreiner, Alan CommikeScalable method and system for streaming high-resolution media
    US-2007061805-A1March 15, 2007Brenner Larry BMethod and apparatus for improving thread posting efficiency in a multiprocessor data processing system
    US-2007050603-A1March 01, 2007Martin Vorbach, Jurgen Becker, Markus Weinhardt, Volker Baumgarte, Frank MayData processing method and device
    US-2005081185-A1April 14, 2005International Business Machines CorporationTransforming locks in software loops
    US-6704844-B2March 09, 2004International Business Machines CorporationDynamic hardware and software performance optimizations for super-coherent SMP systems
    US-7185338-B2February 27, 2007Sun Microsystems, Inc.Processor with speculative multithreading and hardware to support multithreading software
    US-5890200-AMarch 30, 1999Intel CorporationMethod and apparatus for maintaining cache coherency in a computer system with a highly pipelined bus and multiple conflicting snoop requests
    US-2004068607-A1April 08, 2004Narad Charles E.Locking memory locations
    US-2007006231-A1January 04, 2007Hong Wang, John Shen, Ed Grochowski, Held James P, Bryant Bigbee, Kaushik Shivnandan D, Gautham Chinya, Xiang Zou, Per Hammarlund, Xinmin Tian, Anil Aggarwal, Rodgers Scott D, Prashant Sethi, Patel Baiju V, Hankins Richard AMechanism for instruction set based thread execution on a plurality of instruction sequencers
    US-7039794-B2May 02, 2006Intel CorporationMethod and apparatus for processing an event occurrence for a least one thread within a multithreaded processor
    US-5083266-AJanuary 21, 1992Kabushiki Kaisha ToshibaMicrocomputer which enters sleep mode for a predetermined period of time on response to an activity of an input/output device
    US-2007106983-A1May 10, 2007Transitive LimitedArchitecture for generating intermediate representations for program code conversion
    US-2008034146-A1February 07, 2008Via Technologies, Inc.Systems and Methods for Transactions Between Processor and Memory
    US-7210146-B2April 24, 2007Microsoft CorporationSleep queue management
    US-4918653-AApril 17, 1990International Business Machines CorporationTrusted path mechanism for an operating system
    US-7203932-B1April 10, 2007Transmeta CorporationMethod and system for using idiom recognition during a software translation process
    US-5598560-AJanuary 28, 1997Digital Equipment CorporationTracking condition codes in translation code for different machine architectures
    US-6859834-B1February 22, 2005Sun Microsystems, Inc.System and method for enabling application server request failover
    US-7363474-B2April 22, 2008Intel CorporationMethod and apparatus for suspending execution of a thread until a specified memory access occurs
    US-2005055594-A1March 10, 2005Doering Andreas C., Silvio DragoneMethod and device for synchronizing a processor and a coprocessor
    US-6735769-B1May 11, 2004International Business Machines CorporationApparatus and method for initial load balancing in a multiple run queue system
    US-2003061258-A1March 27, 2003Dion Rodgers, Darrell Boggs, Amit Merchant, Rajesh Kota, Rachel Hsu, Keshavan TiruvallurMethod and apparatus for processing an event occurrence for at least one thread within a multithreaded processor
    US-2006117316-A1June 01, 2006Cismas Sorin C, Ilie Garbacea, Monsen Kristan JHardware multithreading systems and methods
    US-5392433-AFebruary 21, 1995International Business Machines CorporationMethod and apparatus for intraprocess locking of a shared resource in a computer system
    US-8127080-B2February 28, 2012International Business Machines CorporationWake-and-go mechanism with system address bus transaction master
    US-7904685-B1March 08, 2011Cray Inc.Synchronization techniques in a multithreaded environment
    US-7350024-B2March 25, 2008Intel CorporationAutomatic generation of software-controlled caching and ordered synchronization
    US-2010107166-A1April 29, 2010Advanced Micro Devices, Inc.Scheduler for processor cores and methods thereof
    US-6675191-B1January 06, 2004Nec CorporationMethod of starting execution of threads simultaneously at a plurality of processors and device therefor
    US-5202988-AApril 13, 1993Supercomputer Systems Limited PartnershipSystem for communicating among processors having different speeds
    US-6910211-B1June 21, 2005International Business Machines CorporationSystem and method for queue-less enforcement of queue-like behavior on multiple threads accessing a scarce source
    US-6886064-B2April 26, 2005International Business Machines CorporationComputer system serialization control method involving unlocking global lock of one partition, after completion of machine check analysis regardless of state of other partition locks
    US-2006037020-A1February 16, 2006International Business Machines CorporationScheduling threads in a multiprocessor computer
    US-225870-AMarch 23, 1880Goodrich e
    US-5483641-AJanuary 09, 1996Dell Usa, L.P.System for scheduling readahead operations if new request is within a proximity of N last read requests wherein N is dependent on independent activities
    US-2008126764-A1May 29, 2008Youfeng Wu, Cheng Wang, Ho-Seop KimUsing transactional memory for precise exception handling in aggressive dynamic binary optimizations
    US-2004002974-A1January 01, 2004Intel CorporationThread based lock manager
    US-6353875-B1March 05, 2002International Business Machines CorporationUpgrading of snooper cache state mechanism for system bus with read/castout (RCO) address transactions
    US-6411982-B2June 25, 2002Hewlett-Packard CompanyThread based governor for time scheduled process execution
    US-6247025-B1June 12, 2001International Business Machines CorporationLocking and unlocking mechanism for controlling concurrent access to objects
    US-2005108711-A1May 19, 2005Infineon Technologies North America CorporationMachine instruction for enhanced control of multiple virtual processor systems
    US-2008034190-A1February 07, 2008Dion Rodgers, Marr Deborah T, Hill David L, Shiv Kaushik, Crossland James B, Koufaty David AMethod and apparatus for suspending execution of a thread until a specified memory access occurs
    US-2006090168-A1April 27, 2006Takeshi Ogasawara, Akira Koseki, Hideaki Komatsu, Kiyokuni Kawachiya, Tamiya OnoderaMethod and system for speeding up mutual exclusion
    US-2005033945-A1February 10, 2005Gerard Chauvel, Serge Lasserre, D'inverno Dominique, Maija Kuusela, Gilbert Cabillic, Jean-Philippe Lesot, Michel Banatre, Jean-Paul Routeau, Salam Majoul, Frederic ParainDynamically changing the semantic of an instruction
    US-2006048149-A1March 02, 2006Microsoft CorporationConditional variables without spinlocks
    US-2006130062-A1June 15, 2006International Business Machines CorporationScheduling threads in a multi-threaded computer
    US-2004010667-A1January 15, 2004International Business Machines CorporationApparatus and method for load balancing of fixed priority threads in a multiple run queue environment
    US-2003046518-A1March 06, 2003Karp Alan H., Rajiv GuptaLook-ahead load pre-fetch in a processor
    US-2005080962-A1April 14, 2005Penkovski Vladimir M., Hsieh Hsien-Cheng E.Hardware management of JAVA threads
    US-6889344-B2May 03, 2005International Business Machines CorporationSystem and method for exposing hidden events on system buses
    US-2007083730-A1April 12, 2007Martin Vorbach, Markus Weinhardt, Juergen BeckerData processing device and method
    US-7188262-B2March 06, 2007Freescale Semiconductor, Inc.Bus arbitration in low power system
    US-6681345-B1January 20, 2004International Business Machines CorporationField protection against thread loss in a multithreaded computer processor
    US-127202-AMay 28, 1872Improvement in breech-loading ordnance
    US-2009125913-A1May 14, 2009International Business Machines CorporationContext switch data prefetching in multithreaded computer
    US-2007043915-A1February 22, 2007Sun Microsystems, Inc.Conditional multistore synchronization mechanisms
    US-6195676-B1February 27, 2001Silicon Graphics, Inc.Method and apparatus for user side scheduling in a multiprocessor operating system program that implements distributive scheduling of processes
    US-5524223-AJune 04, 1996Motorola, Inc.Instruction accelerator for processing loop instructions with address generator using multiple stored increment values
    US-2006048160-A1March 02, 2006International Business Machines CorporationMethod, apparatus, and computer program product for providing a self-tunable parameter used for dynamically yielding an idle processor
    US-6904535-B2June 07, 2005Fujitsu LimitedInformation processing device selecting normal and exclusive operational modes according to wake up instructions from a communication interface section or an input/output device
    US-7162666-B2January 09, 2007Emc CorporationMulti-processor system having a watchdog for interrupting the multiple processors and deferring preemption until release of spinlocks
    US-2009037927-A1February 05, 2009Vasudevan Sangili, Sharpe Edward J, Harshadrai ParekhApparatus and method for direct switching of software threads
    US-2004093602-A1May 13, 2004Huston Larry B., Narad Charles E.Method and apparatus for serialized mutual exclusion
    US-7171649-B1January 30, 2007Sun Microsystems, Inc.Optimizing safe downcasting in an object-oriented programming language
    US-7028299-B1April 11, 2006Intel CorporationTask-based multiprocessing system
    US-2007073693-A1March 29, 2007Microsoft CorporationTransaction and task scheduler
    US-2004015969-A1January 22, 2004Chang Stephen S.Controlling snoop activities using task table in multiprocessor system
    US-2004073905-A1April 15, 2004Emer Joel S., Stamm Rebecca L., Edwards Bruce E., Reilly Matthew H., Zilles Craig B., Tryggve Fossum, Joerg Christopher F., Hicks James E.Method and apparatus to quiesce a portion of a simultaneous multithreaded central processing unit
    US-2005132378-A1June 16, 2005Horvitz Eric J., Oliver Nuria M.Systems and methods for guiding allocation of computational resources in automated perceptual systems
    US-2006069738-A1March 30, 2006Jan HoogerbruggeMulti-processor computer system
    US-2006136915-A1June 22, 2006Sun Microsystems, Inc.Method and apparatus for scheduling multiple threads for execution in a shared microprocessor pipeline
    US-6697899-B1February 24, 2004Nec CorporationBus control device allowing resources to be occupied for exclusive access
    US-2008104223-A1May 01, 2008D Amora Bruce D, Moulic James R, Nanda Ashwini KPlug-in accelerator
    US-2003060898-A1March 27, 2003International Business Machines CorporationFlow lookahead in an ordered semaphore management subsystem
    US-2007124545-A1May 31, 2007Anton Blanchard, Benjamin Herrenschmidt, Russell Paul FAutomatic yielding on lock contention for multi-threaded processors
    US-2005138629-A1June 23, 2005Samra Nicholas G.Sleep state mechanism for virtual multithreading
    US-2006005197-A1January 05, 2006Bratin Saha, Merten Matthew C, Per HammarlundCompare and exchange operation using sleep-wakeup mechanism
    US-2007067774-A1March 22, 2007Alexey Kukanov, Arch RobisonFair scalable reader-writer mutual exclusion
    US-RE38388-EJanuary 13, 2004Intel CorporationMethod and apparatus for performing deferred transactions
    US-2007094431-A1April 26, 2007Fachan Neal TSystems and methods for managing concurrent access requests to a shared resource
    US-2005081204-A1April 14, 2005International Business Machines CorporationMethod and system for dynamically bounded spinning threads on a contested mutex
    US-2003051064-A1March 13, 2003International Business Machines CorporationMethod and system for regulating communication traffic using a limiter thread
    US-7533242-B1May 12, 2009Sun Microsystems, Inc.Prefetch hardware efficiency via prefetch hint instructions
    US-2005060705-A1March 17, 2005Intel CorporationOptimizing critical section microblocks by controlling thread execution
    US-2005022173-A1January 27, 2005Codito Technologies Private LimitedMethod and system for allocation of special purpose computing resources in a multiprocessor system
    US-2004025160-A1February 05, 2004David Dice, Bishop Paula J.System and method for maintaining data synchronization
    US-2006053423-A1March 09, 2006Microsoft CorporationProviding predictable scheduling of programs using repeating precomputed schedules on discretely scheduled and/or multiprocessor operating systems
    US-2005125802-A1June 09, 2005Wang Perry H., Hong Wang, Shen John P., Seshadri Ashok N., Mah Anthony N., Greene William R., Chandran Ravi K., Piyush Desai, Liao Steve S.User-programmable low-overhead multithreading
    US-7647443-B1January 12, 2010American Megatrends, Inc.Implementing I/O locks in storage systems with reduced memory and performance costs
    US-7328293-B2February 05, 2008Intel CorporationQueued locks using monitor-memory wait
    US-2005081200-A1April 14, 2005Rutten Martijn Johan, Van Eijndhoven Josephus Theodorus Johannes, Pol Evert-Jan DanielData processing system having multiple processors, a task scheduler for a data processing system having multiple processors and a corresponding method for task scheduling
    US-2008016374-A1January 17, 2008International Business Machines CorporationSystems and Methods for Asymmetrical Performance Multi-Processors
    US-6892286-B2May 10, 2005Sun Microsystems, Inc.Shared memory multiprocessor memory model verification system and method

NO-Patent Citations (0)

    Title

Cited By (34)

    Publication numberPublication dateAssigneeTitle
    US-2010268915-A1October 21, 2010International Business Machines CorporationRemote Update Programming Idiom Accelerator with Allocated Processor Resources
    US-2010287341-A1November 11, 2010Arimilli Ravi K, Sharma Satya P, Swanberg Randal CWake-and-Go Mechanism with System Address Bus Transaction Master
    US-2010293341-A1November 18, 2010Arimilli Ravi K, Sharma Satya P, Swanberg Randal CWake-and-Go Mechanism with Exclusive System Bus Response
    US-2011173420-A1July 14, 2011International Business Machines CorporationProcessor resume unit
    US-2011173422-A1July 14, 2011International Business Machines CorporationPause processor hardware thread until pin
    US-2011173593-A1July 14, 2011Arimilli Ravi K, Sharma Satya P, Swanberg Randal CCompiler Providing Idiom to Idiom Accelerator
    US-2013191832-A1July 25, 2013International Business Machines CorporationManagement of threads within a computing environment
    US-2013191844-A1July 25, 2013International Business Machines CorporationManagement of threads within a computing environment
    US-2015103894-A1April 16, 2015Nvidia CorporationSystems and methods to limit lag between a client and a server for remote computing
    US-8015379-B2September 06, 2011International Business Machines CorporationWake-and-go mechanism with exclusive system bus response
    US-8082315-B2December 20, 2011International Business Machines CorporationProgramming idiom accelerator for remote update
    US-8127080-B2February 28, 2012International Business Machines CorporationWake-and-go mechanism with system address bus transaction master
    US-8145723-B2March 27, 2012International Business Machines CorporationComplex remote update programming idiom accelerator
    US-8145849-B2March 27, 2012International Business Machines CorporationWake-and-go mechanism with system bus response
    US-8171476-B2May 01, 2012International Business Machines CorporationWake-and-go mechanism with prioritization of threads
    US-8225120-B2July 17, 2012International Business Machines CorporationWake-and-go mechanism with data exclusivity
    US-8250396-B2August 21, 2012International Business Machines CorporationHardware wake-and-go mechanism for a data processing system
    US-8312458-B2November 13, 2012International Business Machines CorporationCentral repository for wake-and-go mechanism
    US-8316218-B2November 20, 2012International Business Machines CorporationLook-ahead wake-and-go engine with speculative execution
    US-8341635-B2December 25, 2012International Business Machines CorporationHardware wake-and-go mechanism with look-ahead polling
    US-8386822-B2February 26, 2013International Business Machines CorporationWake-and-go mechanism with data monitoring
    US-8447960-B2May 21, 2013International Business Machines CorporationPausing and activating thread state upon pin assertion by external logic monitoring polling loop exit time condition
    US-8452947-B2May 28, 2013International Business Machines CorporationHardware wake-and-go mechanism and content addressable memory with instruction pre-fetch look-ahead to detect programming idioms
    US-8516484-B2August 20, 2013International Business Machines CorporationWake-and-go mechanism for a data processing system
    US-8612977-B2December 17, 2013International Business Machines CorporationWake-and-go mechanism with software save of thread state
    US-8640141-B2January 28, 2014International Business Machines CorporationWake-and-go mechanism with hardware private array
    US-8640142-B2January 28, 2014International Business Machines CorporationWake-and-go mechanism with dynamic allocation in hardware private array
    US-8725992-B2May 13, 2014International Business Machines CorporationProgramming language exposing idiom calls to a programming idiom accelerator
    US-8732683-B2May 20, 2014International Business Machines CorporationCompiler providing idiom to idiom accelerator
    US-8788795-B2July 22, 2014International Business Machines CorporationProgramming idiom accelerator to examine pre-fetched instruction streams for multiple processors
    US-8880853-B2November 04, 2014International Business Machines CorporationCAM-based wake-and-go snooping engine for waking a thread put to sleep for spinning on a target address lock
    US-8886919-B2November 11, 2014International Business Machines CorporationRemote update programming idiom accelerator with allocated processor resources
    US-8930950-B2January 06, 2015International Business Machines CorporationManagement of migrating threads within a computing environment to transform multiple threading mode processors to single thread mode processors
    US-8935698-B2January 13, 2015International Business Machines CorporationManagement of migrating threads within a computing environment to transform multiple threading mode processors to single thread mode processors