Qualifying collection of performance monitoring events by types of interrupt when interrupt occurs

Information

  • Patent Grant
  • 8615619
  • Patent Number
    8,615,619
  • Date Filed
    Tuesday, January 11, 2011
    13 years ago
  • Date Issued
    Tuesday, December 24, 2013
    10 years ago
Abstract
A method, apparatus, and computer instructions for qualifying events by types of interrupt when interrupt occurs in the processor of a data processing system. A programmable performance monitoring unit (PMU) is used to program hardware counters that collect events associated with a type of interrupt, including nested interrupts. The performance monitoring unit may also count events that occur while servicing interrupt requests based upon the state of interrupt processing. Events that are known to the performance monitoring unit such as instruction retired, TLB misses, may be counted at the same time using a number of performance monitoring counters in the performance monitoring unit.
Description
BACKGROUND

1. Field


The present invention relates generally to an improved data processing system and, in particular, to a method and system for monitoring performance of the processor in a data processing system when an interrupt occurs. Still more particularly, the present invention relates to a method, apparatus, and computer instructions for qualifying collection of performance monitoring events by types of interrupt when interrupt occurs.


2. Description of the Related Art


A typical data processing system utilizes processors to execute a set of instructions in order to perform a certain task, such as reading a specific character from the main memory. However, as the number of tasks required to be executed by the processor increases, the efficiency of the processor's access patterns to memory and the characteristics of such access become important factors for engineers who want to optimize the system.


Currently, the prior art contains mechanisms that can count occurrences of software-selectable events, such as cache misses, instructions executed, I/O data transfer requests, and the time a given process may take to execute within a data processing system. One such mechanism is a performance monitor. A performance monitor performs monitoring on selected characteristics to assist analysis of a system by determining a machine's state at a particular time. This analysis provides information of how the processor is used when instructions are executed and its interaction with the main memory when data are stored. In addition, the performance monitor may provide the amount of time that has passed between events in a processing system. The performance monitor provides counts of events that may be used by engineers to analyze system performance. This analysis may cause application code changes such as possible relocation of branch instructions and memory accesses to further optimize the performance of a system. Moreover, data may be gathered by the performance monitor on how the processor accesses the data processing system's level 1 and level 2 cache, and main memory in order to identify performance bottlenecks that are specific to a hardware or software environment.


The performance monitor described above does not provide the ability to further qualify the events that occur for a particular type of interrupt. An interrupt occurs, for example, when a device, such as a mouse or keyboard, raises an interrupt signal to notify the processor that an event has occurred. When the processor accepts an interrupt request, the processor completes its current instruction and passes the control to an interrupt handler. The interrupt handler executes an interrupt service routine that is associated with the interrupt. An interrupt may also be caused by a specific machine language operation code, for example Motorola 68000's TRAP, a product from Motorola. In this case, an unexpected software condition such as divide by zero causes the processor to store the current state, store identifying information about the particular interrupt and pass control to an interrupt handler that handles this unexpected software condition.


It would be advantageous to have an improved method, apparatus, and computer instructions for qualifying counting of events that occur while servicing interrupt requests based on the type of interrupt that has occurred.


SUMMARY

The present invention provides a method, apparatus and computer instructions for monitoring performance of a data processing system by qualifying events by type of interrupt when an interrupt occurs in the processor of the data processing system. The performance monitoring unit of the present invention is programmed to count events that are qualified based on the type of interrupt that has occurred. When the performance monitoring unit detects a particular type of the interrupt, the performance monitoring unit collects events that occur for that interrupt type. The resulting event information is later presented to the user for performance analysis.





BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

The novel features believed characteristic of the invention are set forth in the appended claims. The invention itself, however, as well as a preferred mode of use, further objectives and advantages thereof, will best be understood by reference to the following detailed description of an illustrative embodiment when read in conjunction with the accompanying drawings, wherein:



FIG. 1 is an exemplary block diagram of a data processing system in which the present invention may be implemented;



FIG. 2 is an exemplary block diagram of a processor system for processing information according to a preferred embodiment of the present invention;



FIG. 3 is an exemplary diagram illustrating components for counting events by interrupt type when interrupt occurs in accordance with a preferred embodiment of the present invention;



FIG. 4 is an exemplary diagram illustrating components of the performance monitoring unit and interrupt unit in accordance with a preferred embodiment of the present invention; and



FIG. 5 is a flowchart outlining an exemplary process of qualify counting of events based on type of interrupt when interrupt occurs is depicted in accordance with a preferred embodiment of the present invention.





DETAILED DESCRIPTION

A preferred embodiment of the present invention monitors performance of data processing system while executing a program on the data processing system. In one embodiment, a performance monitoring unit is programmed to count events (such as cache misses, clock cycles, or other events that occur during the execution and processing of an interrupt) and to qualify those counted events by the type of interrupt during which they occur, and (in some embodiments) the state of the interrupt during which they occur. The information gathered in the innovative system and method can be presented to software or to a user for analysis.


In a preferred embodiment, the present invention is implemented in a computer system. For example, the computer system can be a client or a server in a client-server environment of a network. With reference now to FIG. 1, an exemplary block diagram of a data processing system is shown in which the present invention may be implemented. Client 100 is an example of a computer, in which code or instructions implementing the processes of the present invention may be located. Client 100 employs a peripheral component interconnect (PCI) local bus architecture. Although the depicted example employs a PCI bus, other bus architectures such as Accelerated Graphics Port (AGP) and Industry Standard Architecture (ISA) may be used. Processor 102 and main memory 104 are connected to PCI local bus 106 through PCI bridge 108. PCI bridge 108 also may include an integrated memory controller and cache memory for processor 102. Additional connections to PCI local bus 106 may be made through direct component interconnection or through add-in boards. In the depicted example, local area network (LAN) adapter 110, small computer system interface SCSI host bus adapter 112, and expansion bus interface 114 are connected to PCI local bus 106 by direct component connection. In contrast, audio adapter 116, graphics adapter 118, and audio/video adapter 119 are connected to PCI local bus 106 by add-in boards inserted into expansion slots. Expansion bus interface 114 provides a connection for a keyboard and mouse adapter 120, modem 122, and additional memory 124. SCSI host bus adapter 112 provides a connection for hard disk drive 126, tape drive 128, and CD-ROM drive 130. Typical PCI local bus implementations will support three or four PCI expansion slots or add-in connectors.


An operating system runs on processor 102 and is used to coordinate and provide control of various components within data processing system 100 in FIG. 1. The operating system may be a commercially available operating system such as Windows XP, which is available from Microsoft Corporation. An object oriented programming system such as Java may run in conjunction with the operating system and provides calls to the operating system from Java programs or applications executing on client 100. “Java” is a trademark of Sun Microsystems, Inc. Instructions for the operating system, the object-oriented programming system, and applications or programs are located on storage devices, such as hard disk drive 126, and may be loaded into main memory 104 for execution by processor 102.


Those of ordinary skill in the art will appreciate that the hardware in FIG. 1 may vary depending on the implementation. Other internal hardware or peripheral devices, such as flash read-only memory (ROM), equivalent nonvolatile memory, or optical disk drives and the like, may be used in addition to or in place of the hardware depicted in FIG. 1. Also, the processes of the present invention may be applied to a multiprocessor data processing system.


For example, client 100, if optionally configured as a network computer, may not include SCSI host bus adapter 112, hard disk drive 126, tape drive 128, and CD-ROM 130. In that case, the computer, to be properly called a client computer, includes some type of network communication interface, such as LAN adapter 110, modem 122, or the like. As another example, client 100 may be a stand-alone system configured to be bootable without relying on some type of network communication interface, whether or not client 100 comprises some type of network communication interface. As a further example, client 100 may be a personal digital assistant (PDA), which is configured with ROM and/or flash ROM to provide non-volatile memory for storing operating system files and/or user-generated data. The depicted example in FIG. 1 and above-described examples are not meant to imply architectural limitations.


The processes of the present invention are performed by processor 102 using computer implemented instructions, which may be located in a memory such as, for example, main memory 104, memory 124, or in one or more peripheral devices 126-130.


Turning next to FIG. 2, an exemplary block diagram of a processor system for processing information is depicted in accordance with a preferred embodiment of the present invention. Processor 210 may be implemented as processor 102 in FIG. 1.


In a preferred embodiment, processor 210 is a single integrated circuit superscalar microprocessor. Accordingly, as discussed further herein below, processor 210 includes various units, registers, buffers, memories, and other sections, all of which are formed by integrated circuitry. Also, in the preferred embodiment, processor 210 operates according to reduced instruction set computer (“RISC”) techniques. As shown in FIG. 2, system bus 211 is connected to a bus interface unit (“BIU”) 212 of processor 210. BIU 212 controls the transfer of information between processor 210 and system bus 211.


BIU 212 is connected to an instruction cache 214 and to data cache 216 of processor 210. Instruction cache 214 outputs instructions to sequencer unit 218. In response to such instructions from instruction cache 214, sequencer unit 218 selectively outputs instructions to other execution circuitry of processor 210.


In addition to sequencer unit 218, in the preferred embodiment, the execution circuitry of processor 210 includes multiple execution units, namely a branch unit 220, a fixed-point unit A (“FXUA”) 222, a fixed-point unit B (“FXUB”) 224, a complex fixed-point unit (“CFXU”) 226, a load/store unit (“LSU”) 228, and a floating-point unit (“FPU”) 230. FXUA 222, FXUB 224, CFXU 226, and LSU 228 input their source operand information from general-purpose architectural registers (“GPRs”) 232 and fixed-point rename buffers 234. Moreover, FXUA 222 and FXUB 224 input a “carry bit” from a carry bit (“CA”) register 239. FXUA 222, FXUB 224, CFXU 226, and LSU 228 output results (destination operand information) of their operations for storage at selected entries in fixed-point rename buffers 234. Also, CFXU 226 inputs and outputs source operand information and destination operand information to and from special-purpose register processing unit (“SPR unit”) 237.


FPU 230 inputs its source operand information from floating-point architectural registers (“FPRs”) 236 and floating-point rename buffers 238. FPU 230 outputs results (destination operand information) of its operation for storage at selected entries in floating-point rename buffers 238.


In response to a Load instruction, LSU 228 inputs information from data cache 216 and copies such information to selected ones of rename buffers 234 and 238. If such information is not stored in data cache 216, then data cache 216 inputs (through BIU 212 and system bus 211) such information from a system memory 260 connected to system bus 211. Moreover, data cache 216 is able to output (through BIU 212 and system bus 211) information from data cache 216 to system memory 260 connected to system bus 211. In response to a Store instruction, LSU 228 inputs information from a selected one of GPRs 232 and FPRs 236 and copies such information to data cache 216.


Sequencer unit 218 inputs and outputs information to and from GPRs 232 and FPRs 236. From sequencer unit 218, branch unit 220 inputs instructions and signals indicating a present state of processor 210. In response to such instructions and signals, branch unit 220 outputs (to sequencer unit 218) signals indicating suitable memory addresses storing a sequence of instructions for execution by processor 210. In response to such signals from branch unit 220, sequencer unit 218 inputs the indicated sequence of instructions from instruction cache 214. If one or more of the sequence of instructions is not stored in instruction cache 214, then instruction cache 214 inputs (through BIU 212 and system bus 211) such instructions from system memory 260 connected to system bus 211.


In response to the instructions input from instruction cache 214, sequencer unit 218 selectively dispatches the instructions to selected ones of execution units 220, 222, 224, 226, 228, and 230. Each execution unit executes one or more instructions of a particular class of instructions. For example, FXUA 222 and FXUB 224 execute a first class of fixed-point mathematical operations on source operands, such as addition, subtraction, ANDing, ORing and XORing. CFXU 226 executes a second class of fixed-point operations on source operands, such as fixed-point multiplication and division. FPU 230 executes floating-point operations on source operands, such as floating-point multiplication and division.


As information is stored at a selected one of rename buffers 234, such information is associated with a storage location (e.g. one of GPRs 232 or carry bit (CA) register 242) as specified by the instruction for which the selected rename buffer is allocated. Information stored at a selected one of rename buffers 234 is copied to its associated one of GPRs 232 (or CA register 242) in response to signals from sequencer unit 218. Sequencer unit 218 directs such copying of information stored at a selected one of rename buffers 234 in response to “completing” the instruction that generated the information. Such copying is called “writeback.”


As information is stored at a selected one of rename buffers 238, such information is associated with one of FPRs 236. Information stored at a selected one of rename buffers 238 is copied to its associated one of FPRs 236 in response to signals from sequencer unit 218. Sequencer unit 218 directs such copying of information stored at a selected one of rename buffers 238 in response to “completing” the instruction that generated the information.


Processor 210 achieves high performance by processing multiple instructions simultaneously at various ones of execution units 220, 222, 224, 226, 228, and 230. Accordingly, each instruction is processed as a sequence of stages, each being executable in parallel with stages of other instructions. Such a technique is called “pipelining.” In a significant aspect of the illustrative embodiment, an instruction is normally processed as six stages, namely fetch, decode, dispatch, execute, completion, and writeback.


In the fetch stage, sequencer unit 218 selectively inputs (from instruction cache 214) one or more instructions from one or more memory addresses storing the sequence of instructions discussed further hereinabove in connection with branch unit 220, and sequencer unit 218.


In the decode stage, sequencer unit 218 decodes up to four fetched instructions.


In the dispatch stage, sequencer unit 218 selectively dispatches up to four decoded instructions to selected (in response to the decoding in the decode stage) ones of execution units 220, 222, 224, 226, 228, and 230 after reserving rename buffer entries for the dispatched instructions' results (destination operand information). In the dispatch stage, operand information is supplied to the selected execution units for dispatched instructions. Processor 210 dispatches instructions in order of their programmed sequence.


In the execute stage, execution units execute their dispatched instructions and output results (destination operand information) of their operations for storage at selected entries in rename buffers 234 and rename buffers 238 as discussed further hereinabove. In this manner, processor 210 is able to execute instructions out-of-order relative to their programmed sequence.


In the completion stage, sequencer unit 218 indicates an instruction is “complete.” Processor 210 “completes” instructions in order of their programmed sequence.


In the writeback stage, sequencer 218 directs the copying of information from rename buffers 234 and 238 to GPRs 232 and FPRs 236, respectively. Sequencer unit 218 directs such copying of information stored at a selected rename buffer. Likewise, in the writeback stage of a particular instruction, processor 210 updates its architectural states in response to the particular instruction. Processor 210 processes the respective “writeback” stages of instructions in order of their programmed sequence. Processor 210 advantageously merges an instruction's completion stage and writeback stage in specified situations.


In the illustrative embodiment, each instruction requires one machine cycle to complete each of the stages of instruction processing. Nevertheless, some instructions (e.g., complex fixed-point instructions executed by CFXU 226) may require more than one cycle. Accordingly, a variable delay may occur between a particular instruction's execution and completion stages in response to the variation in time required for completion of preceding instructions.


Completion buffer 248 is provided within sequencer 218 to track the completion of the multiple instructions which are being executed within the execution units. Upon an indication that an instruction or a group of instructions have been completed successfully, in an application specified sequential order, completion buffer 248 may be utilized to initiate the transfer of the results of those completed instructions to the associated general-purpose registers.


In addition, processor 210 also includes performance monitor unit 240, which is connected to instruction cache 214 as well as other units in processor 210. Operation of processor 210 can be monitored utilizing performance monitor unit 240, which in this illustrative embodiment is a software-accessible mechanism capable of providing detailed information descriptive of the utilization of instruction execution resources and storage control. Although not illustrated in FIG. 2, performance monitor unit 240 is coupled to each functional unit of processor 210 to permit the monitoring of all aspects of the operation of processor 210, including, for example, reconstructing the relationship between events, identifying false triggering, identifying performance bottlenecks, monitoring pipeline stalls, monitoring idle processor cycles, determining dispatch efficiency, determining branch efficiency, determining the performance penalty of misaligned data accesses, identifying the frequency of execution of serialization instructions, identifying inhibited interrupts, and determining performance efficiency. The events of interest also may include, for example, time for instruction decode, execution of instructions, branch events, cache misses, and cache hits.


Performance monitor unit 240 includes an implementation-dependent number (e.g., 2-8) of counters 241-242, labeled PMC1 and PMC2, which are utilized to count occurrences of selected events. Performance monitor unit 240 further includes at least one monitor mode control register (MMCR). In this example, two control registers, MMCRs 243 and 244 are present that specify the function of counters 241-242. Counters 241-242 and MMCRs 243-244 are preferably implemented as SPRs that are accessible for read or write via MFSPR (move from SPR) and MTSPR (move to SPR) instructions executable by CFXU 226. However, in one alternative embodiment, counters 241-242 and MMCRs 243-244 may be implemented simply as addresses in I/O space. In another alternative embodiment, the control registers and counters may be accessed indirectly via an index register. This embodiment is implemented in the IA-64 architecture in processors from Intel Corporation.


Additionally, processor 210 also includes interrupt unit 250, which is connected to instruction cache 214. Additionally, although not shown in FIG. 2, interrupt unit 250 is connected to other functional units within processor 210. Interrupt unit 250 may receive signals from other functional units and initiate an action, such as starting an error handling or trap process. In these examples, interrupt unit 250 is employed to generate interrupts and exceptions that may occur during execution of a program. In addition, for each performance monitoring counter such as PMC1 241, there is a corresponding interrupt unit control register (IUCR), such as IUCR2 252 that is accessible by the interrupt unit 250. In this example, IUCR1 252 corresponds to PMC1 241. IUCR2 252 corresponds to PMC2 242. IUCR1 252 and IUCR2 254 identify which interrupt generates a signal, so that PMC1 241 and PMC2 242 may count events associated with that interrupt.


The present invention provides a method, apparatus, and computer instructions for monitoring performance of a data processing system such as client 100 in FIG. 1 by qualifying events by type of interrupt when an interrupt occurs in the processor of the data processing system. The processor of the data processing system may be implemented as processor 210 in FIG. 2.


In a preferred embodiment, the present invention provides a performance monitoring unit (PMU), such as performance monitoring unit 240 in FIG. 2, that is programmable using counter control registers (CCR) such as MMCR 243 and MMCR 244 to count events that occur during execution of an interrupt. The counted events may be qualified by type of interrupt during which they occur. These events are currently known to the performance monitoring units, for example, instructions retired, TLB misses, level 2 cache misses, or clock cycles etc. In a preferred embodiment, the innovative performance monitor unit allows users to qualify events or conditions by interrupt type, preferably using hardware counters and registers of the performance monitoring unit. When an interrupt is signaled, the interrupt signal is used to identify whether the counting mechanism of the present invention is programmed to count events during that type of interrupt.


The counter control registers (CCR) in the performance monitoring unit may be extended to include an interrupt unit (IU) trace field, a interrupt unit (IU) state field, and a interrupt unit (IU) state mask field. The IU trace field allows user to control counting by enabling or disabling tracing. The IU state field represents the current state of interrupt processing, for example, interrupt on, interrupt taken, interrupt acknowledged and interrupt off. The IU state mask field indicates the state of interrupt processing during which tracing is to occur. These fields are used by the performance monitoring unit to count events that occur during the various states of the interrupt, and to parse the counting by state. The resulting data may be read by the user or a trace application, for example, from the performance monitoring unit for performance analysis at a later time in order to better optimize the system.


In addition, the performance monitoring unit may count multiple events at the same time by using multiple performance monitoring counters. The mechanism of the present invention allows the performance monitoring unit to program each counter to count a particular event. For example, counter 1 may be programmed to count cache misses for interrupt vector 1, counter 2 may be programmed to count cycles for interrupt vector 2 etc. Preferred embodiments of the present invention do not limit the qualifications for the counters. The counters may be programmed to count multiple events based on the hardware available to the user.


Furthermore, the performance monitoring unit supports counting of events for nested interrupts. Nested interrupts occur when an interrupt occurs while another interrupt is active. The performance monitoring unit of the present invention enables the performance monitoring counters to limit counting only to the on or off states of interrupt processing. This mechanism may be useful to engineers for investigating the efficiency of interrupt processing itself.


Turning next to FIG. 3, an exemplary diagram illustrating components for counting events by interrupt type when an interrupt occurs is depicted in accordance with a preferred embodiment of the present invention. As depicted in FIG. 3, in a preferred embodiment, the central processing unit (CPU) 302 may be implemented as processor 210 in FIG. 2. When an interrupt occurs, the central processing unit (CPU) 302 sends a signal to interrupt unit 304 to request interrupt unit 304 generate an interrupt signal for a particular interrupt type.


Interrupt unit 304 may include a number of interrupt unit control registers (IUCRs) that are accessible to interrupt unit 304 based upon the number of performance monitoring counters in the performance monitoring unit 306. There is a one to one relationship between the IUCR and the performance monitoring counters. In this example, there are two IUCRs, IUCR1 308 that corresponds to performance monitoring counter PMC1 312 and IUCR2 310 that corresponds to performance monitoring counter PMC2 314. IUCR such as IUCR1 308 includes a type field that indicates which interrupt type is to generate a performance monitoring counter signal. The type field in the IUCR is later examined by interrupt unit 304 to see if it is an interrupt type of interest, i.e., whether events are to be counted during execution of the interrupt. If the interrupt type signal is an interrupt type of interest, interrupt unit 304 sends a Tracing On/Off signal to the performance monitoring unit 306 in order to enable or disable counting.


Also shown in FIG. 3, Performance monitoring unit 306 includes an implementation-dependent number of hardware counters such as hardware counters 312 and 314, also referred to herein as performance monitoring counters. PMC1 312 and PMC2 314 count events that occur during a particular state of interrupt processing. Performance monitoring unit 306 also includes a number of counter control registers (CCRs) such as CCR1 316 and CCR2 318, which may be implemented as MCCR1 233 and MCCR2 234 in FIG. 2. When CCR1 316 and CCR2 318 receive signals from interrupt unit 204 to enable or disable tracing events of an interrupt type and state changes during interrupt processing, CCR1 316 and CCR2 318 controls counting of the performance monitoring counters PMC1 312 and PMC2 314 by storing the current state of the interrupt and the state of the interrupt to trace, so that when tracing is enabled, performance monitoring counters PMC1 312 and PMC2 314 may count events of a particular interrupt state. The resulting trace data is then stored and may be collected at a later time from performance monitoring counters 312 and 314.


With reference to FIG. 4, an exemplary diagram illustrating components of the performance monitoring unit and interrupt unit is depicted in accordance with a preferred embodiment of the present invention. As depicted in FIG. 4, in a preferred embodiment, the performance monitoring unit may include a number of counter control registers (CCRs), which may be implemented as memory mode register (MMCR) such as MMCR1 233 and MMCR2 234 in FIG. 2. The counter control registers control functions of the performance monitoring counters. The counter control register 402 may include 3 fields: an interrupt unit (IU) trace field 404, an interrupt unit (IU) state field 406, and an interrupt unit (IU) state mask field 408. In this example, the IU trace field 402 is a one bit field, represented by bit 0; the IU state field 406 is a 2 bit field, represented by bit 1 and 2; and the IU state mask field 408 is a 3 bit field, represented by bit 3 to bit 5.


Also shown in FIG. 4, trace 410 is an example of the IU trace field 404. When the bit is 0, tracing by the performance monitoring counter is off or disabled. When bit is 1, tracing by the performance monitoring counter is on or enabled. Trace 410 is set by a Tracing On/Off signal that is raised by the interrupt unit once the interrupt unit examines the interrupt unit control register (IUCR) to determine whether interrupt type is of interest. For example, incoming interrupt signals can be compared to a stored set of interrupts that are designated for the counting process.


Next, an example IU state field 406 is represented by State 416. State 416 is read only by the performance monitoring unit and is used to store the current state of the interrupt. When the interrupt state is interrupt on 418, the bits in state 410 are set to 01. When the interrupt state is interrupt taken 420, the bits in state 410 are set to 10. When the interrupt state is interrupt acknowledged 422, the bits in state 410 are set to 11. When the interrupt state is interrupt off 424, the bits in state 410 are set to 00.


The last field in the counter control register is the IU state mask field 408. State mask 426 represents an example of IU state mask field 408. The IU state mask field 426 indicates during which state of the interrupt to count events. When the state during which to count is interrupt ON 428, state mask bits 426 are set to 001. When the state during which to count is interrupt taken 430, State mask 426 bits are set to 010. When the state during which to count is interrupt acknowledged, State mask bits 426 are set to 100.


Lastly, an interrupt unit control register (IUCR) 440 is shown in FIG. 4. IUCR may be accessible by the interrupt unit. IUCR 440 includes a type field 442 that has a size of a byte (8 bits). The type field 442 represents which interrupt type is to generate a Tracing On/Off signal to the performance monitoring unit.


Preferred embodiments of the present invention can be used to count events based on the type of interrupt during which they occur. Interrupt types are noted in an IUCR field, which indicates the types of interrupt during which monitoring of events is to occur. When an interrupt occurs, the interrupt type is compared to entries in the IUCR, and if the occurring interrupt matches an entry in the IUCR, events that occur during that interrupt are to be counted. A signal is sent to the PMU to turn on tracing, which causes the PMU to set the CCR to the state of the interrupt which is then occurring. As the interrupt goes through its states, the PMU continues to indicate what state the interrupt is in, so that events counted during the interrupt can be parsed by the interrupt state during which they occurred.


Turning to FIG. 5, a flowchart outlining an exemplary process of qualify counting of events based on type of interrupt when interrupt occurs is depicted in accordance with a preferred embodiment of the present invention. As depicted in FIG. 5, the process begins when supporting software (such as performance monitoring software) interfaces with the hardware to initiate interrupt monitoring (step 502). The performance monitoring counter is then set by supporting software to monitor some event (step 504), such as cache misses or clock cycles, for example. The supporting software also sets the interrupt unit control register (IUCR) type field to indicate which interrupt type is to be monitored (step 506), i.e., during which interrupt types events will be counted. Next, the supporting software sets the interrupt unit (IU) trace field of the counter control register (CCR) that corresponds to a performance monitoring counter used to count events (step 508). Step 508 enables tracing of events.


At some time after the IU trace field is set in step 508, application code is executed for an application that is to be monitored for performance (step 510). When an interrupt occurs during code execution (step 512), the interrupt unit examines the IUCR type field (step 514). A determination is made as to whether the interrupt is the same type as the IUCR type, which is an interrupt type of interest (step 516). If the interrupt type is not the same as the IUCR type, the process returns to step 512 to wait for the next interrupt to occur. If the interrupt type is the same as the IUCR type, the interrupt unit raises a Tracing On/Off signal and sends the signal to the performance monitoring unit (step 518) in order to start tracing events for the interrupt. Once the signal is received, the performance monitoring unit sets the counter control register's state field to interrupt on by setting the bits to 01 (step 520).


Next, the interrupt state changes to interrupt taken, the interrupt unit in turn raises a state change signal and sends the signal to the performance monitoring unit (step 522). Consequently, the performance monitoring unit sets the counter control register's state field to interrupt taken by setting the bits to 10 (step 524). Another interrupt state change causes the interrupt unit to raise a state change signal and sends the signal to the performance monitoring unit (step 526). Similarly, the performance monitoring unit sets the counter control register's state field to interrupt acknowledged by setting the bits to 11 (step 528). When the interrupt handler finishes executing the interrupt service routine, it signals the interrupt unit an IRET (interrupt return) (step 530). The interrupt unit raises a Tracing On/Off signal and sends the signal to the performance monitoring unit in order to stop tracing events for the interrupt (step 532). (Note that embodiments of the present invention can trace across one or a plurality of states of the interrupt, as described avoce.) Finally, the performance monitoring unit receives the signal and sets the counter control register state field to interrupt off by setting the bits to 00 (step 534). Thus, the process terminates thereafter.


Thus, the present invention provides a performance monitoring unit that allows the user to qualify events that occur by type of interrupt using one or more hardware counters. Hardware counters collect events that occur while servicing interrupt requests in order for a user to monitor performance of the system when a particular type of interrupt is being processed. Using a number of hardware counters of the present invention, a user may qualify different events for different interrupt type.


The performance monitoring unit also allows the user to qualify events that occur based upon the state of interrupt processing, so that a user may further collect events that occur during a particular interrupt state. Furthermore, the performance monitoring unit provides support for user to qualify events that occur when a nested interrupt occurs by using a counter that is associated with the nested interrupt. Moreover, the performance monitor unit may also count conditions such as clock cycles for a particular interrupt type at a particular interrupt state.


It is important to note that while the present invention has been described in the context of a fully functioning data processing system, those of ordinary skill in the art will appreciate that the processes of the present invention are capable of being distributed in the form of a computer readable medium of instructions and a variety of forms and that the present invention applies equally regardless of the particular type of signal bearing media actually used to carry out the distribution. Examples of computer readable media include recordable-type media, such as a floppy disk, a hard disk drive, a RAM, CD-ROMs, DVD-ROMs, and transmission-type media, such as digital and analog communications links, wired or wireless communications links using transmission forms, such as, for example, radio frequency and light wave transmissions. The computer readable media may take the form of coded formats that are decoded for actual use in a particular data processing system.


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.

Claims
  • 1. A data processing system for qualifying events when an interrupt occurs, comprising: an interrupt unit including an interrupt unit control register for indicating an interrupt type selected to be monitored;the interrupt unit, responsive to an interrupt occurring during code execution, configured to determine whether the interrupt is of the interrupt type selected to be monitored as indicated by the interrupt unit control register;a performance monitoring unit including a counter control register for indicating a set of interrupt states selected to be monitored; andone or more hardware counters located within the performance monitoring unit; wherein the one or more hardware counters count events that occur during processing of the interrupt responsive to the interrupt unit determining that the interrupt is of the interrupt type selected to be monitored as indicated by the interrupt unit control register,wherein the one or more hardware counters count events that occur during the set of interrupt states selected to be monitored by the counter control registers.
  • 2. The system of claim 1, wherein the set of interrupt states at least include interrupt on, interrupt taken, and interrupt acknowledged.
  • 3. The system of claim 1, wherein the one or more hardware counters count multiple types of events that occur during the processing of the interrupt.
  • 4. The system of claim 1, wherein the one or more hardware counters count events that occur during processing of the interrupt based on the interrupt type of the interrupt.
  • 5. The system of claim 1, wherein the events include clock cycles and cache misses.
  • 6. The system of claim 1, wherein the interrupt is a first interrupt, and further comprising a second interrupt that interrupts the first interrupt, wherein the one or more hardware counters separately count the events that occur during the processing of the first interrupt and events that occur during processing of the second interrupt.
  • 7. A computer program product for qualifying events when an interrupt occurs, the computer program product comprising: instructions stored in a non-transitory computer readable medium in a coded format for execution by a processor of a data processing system when decoded, the instructions further comprising:first instructions, stored in the non-transitory computer readable medium that, when executed by the processor of the data processing system, cause the processor to receive a signal for invoking an interrupt, wherein the interrupt includes a plurality of interrupt states, wherein the plurality of interrupt states include interrupt on, interrupt taken and interrupt acknowledged;second instructions, stored in the non-transitory computer readable medium that, when executed by the processor, cause the processor responsive to an interrupt occurring during code execution to determine whether the interrupt is of the interrupt type selected to be monitored;third instructions, stored in the non-transitory computer readable medium that, when executed by the processor, to cause the processor to indicate in a counter control register of a performance monitoring unit a selected set of interrupt states to be monitored, wherein the set of interrupt states at least include interrupt on, interrupt taken, and interrupt acknowledged; andfourth instructions, stored in the non-transitory computer readable medium that, when executed by the processor, cause the processor to count at least one event for a selected plurality of interrupt states during processing of the interrupt.
  • 8. The computer program product of claim 7, wherein the at least one event includes clock cycles and cache misses.
  • 9. The computer program product of claim 7, wherein the second instructions comprise instructions for directing the processor to count multiple types of events for the selected plurality of interrupt states during the processing of the interrupt.
  • 10. The computer program product of claim 7, wherein the counting is performed by one or more hardware counters during the processing of the interrupt.
  • 11. The computer program product of claim 7, wherein the at least one event is counted based on an interrupt type of the interrupt during which the at least one event occurs.
  • 12. The computer program product of claim 7, wherein the interrupt is a first interrupt, and further comprising a second interrupt that interrupts the first interrupt, and wherein hardware counters separately count the at least one event that occurs during the processing of the first interrupt and at least one event that occurs during processing of the second interrupt.
  • 13. A computer implemented method for qualifying events when an interrupt occurs comprising instructions stored in a non-transitory computer readable medium wherein a processor of a data processing system executes the instructions to cause the processor of the data processing system to: indicate in an interrupt unit control register on the processor of the data processing system a selected interrupt type to be monitored;determine on the processor of the data processing system, responsive to an interrupt occurring during code execution, whether the interrupt is of the interrupt type selected to be monitored;indicate in a counter control register of a performance monitoring unit of the data processing system a selected set of interrupt states to be monitored, wherein the set of interrupt states at least include interrupt on, interrupt taken, and interrupt acknowledged; andresponsive to determining that the interrupt is of the interrupt type selected to be monitored, count, by one or more hardware counters located within the performance monitoring unit, events occurring during processing of the interrupt, wherein the one or more hardware counters count events that occur during the set of interrupt states selected to be monitored by the counter control register.
CROSS REFERENCE TO RELATED APPLICATIONS

The present invention is a divisional of U.S. Ser. No. 10/757,186, filed on Jan. 14, 2004, status allowed. The present invention is related to the following applications entitled “Method and Apparatus for Counting Instruction Execution and Data Accesses”, Ser. No. 10/675,777, filed on Sep. 30, 2003; “Method and Apparatus for Selectively Counting Instructions and Data Accesses”, Ser. No. 10/674,604, filed on Sep. 30, 2003; “Method and Apparatus for Generating Interrupts Upon Execution of Marked Instructions and Upon Access to Marked Memory Locations”, Ser. No. 10/675,831, filed on Sep. 30, 2003; “Method and Apparatus for Counting Data Accesses and Instruction Executions that Exceed a Threshold”, Ser. No. 10/675,778, filed on Sep. 30, 2003; “Method and Apparatus for Counting Execution of Specific Instructions and Accesses to Specific Data Locations”, Ser. No. 10/675,776, filed on Sep. 30, 2003; “Method and Apparatus for Debug Support for Individual Instructions and Memory Locations”, Ser. No. 10/675,751, filed on Sep. 30, 2003; “Method and Apparatus to Autonomically Select Instructions for Selective Counting”, Ser. No. 10/675,721, filed on Sep. 30, 2003; “Method and Apparatus to Autonomically Count Instruction Execution for Applications”, Ser. No. 10/674,642, filed on Sep. 30, 2003; “Method and Apparatus to Autonomically Take an Exception on Specified Instructions”, Ser. No. 10/674,606, filed on Sep. 30, 2003; “Method and Apparatus to Autonomically Profile Applications”, Ser. No. 10/675,783, filed on Sep. 30, 2003; “Method and Apparatus for Counting Instruction and Memory Location Ranges”, Ser. No. 10/675,872, filed on Sep. 30, 2003; “Method and Apparatus for Counting Interrupts by Type”, Ser. No. 10/757,198, filed on Jan. 14, 2004, and “Method and Apparatus for Providing Pre and Post Handlers for Recording Events”, Ser. No. 10/757,192, filed on Jan. 14, 2004. All of the above related applications are assigned to the same assignee, and incorporated herein by reference.

US Referenced Citations (444)
Number Name Date Kind
2112794 Stickney Mar 1938 A
3707725 Dellheim Dec 1972 A
4034353 Denny et al. Jul 1977 A
4145735 Soga Mar 1979 A
4291371 Holtey Sep 1981 A
4316245 Luu et al. Feb 1982 A
4374409 Bienvenu et al. Feb 1983 A
4395757 Bienvenu et al. Jul 1983 A
4558413 Schmidt et al. Dec 1985 A
4590555 Bourrez May 1986 A
4598364 Gum et al. Jul 1986 A
4682283 Robb Jul 1987 A
4794472 Doyama Dec 1988 A
4821178 Levin et al. Apr 1989 A
4825359 Ohkami et al. Apr 1989 A
4912623 Rantala et al. Mar 1990 A
4928222 Vriezen et al. May 1990 A
5032982 Dalrymple et al. Jul 1991 A
5051944 Fetterolf et al. Sep 1991 A
5103394 Blasciak Apr 1992 A
5113507 Jaeckel May 1992 A
5142634 Fite et al. Aug 1992 A
5142635 Saini Aug 1992 A
5150349 Takai et al. Sep 1992 A
5151981 Westcott et al. Sep 1992 A
5206584 Nishimori Apr 1993 A
5212794 Pettis et al. May 1993 A
5256775 Froehler Oct 1993 A
5257358 Cohen Oct 1993 A
5276833 Auvinen et al. Jan 1994 A
5287481 Lin Feb 1994 A
5339426 Aoshima Aug 1994 A
5339435 Lubkin et al. Aug 1994 A
5355487 Keller et al. Oct 1994 A
5394529 Brown, III et al. Feb 1995 A
5404500 Legvold et al. Apr 1995 A
5438670 Baror et al. Aug 1995 A
5450349 Brown et al. Sep 1995 A
5463775 DeWitt et al. Oct 1995 A
5479633 Wells et al. Dec 1995 A
5537541 Wibecan Jul 1996 A
5537572 Michelsen et al. Jul 1996 A
5544342 Dean Aug 1996 A
5548762 Creedon et al. Aug 1996 A
5555432 Hinton et al. Sep 1996 A
5557548 Gover et al. Sep 1996 A
5564015 Bunnell Oct 1996 A
5574872 Rotem et al. Nov 1996 A
5581482 Wiedenman et al. Dec 1996 A
5581778 Chin et al. Dec 1996 A
5581981 Fulkerson et al. Dec 1996 A
5590352 Zuraski et al. Dec 1996 A
5594864 Trauben Jan 1997 A
5603004 Kurpanek et al. Feb 1997 A
5628018 Matsuzaki et al. May 1997 A
5644692 Eick Jul 1997 A
5652858 Okada et al. Jul 1997 A
5657253 Dreyer et al. Aug 1997 A
5659679 Alpert et al. Aug 1997 A
5666507 Flora Sep 1997 A
5671920 Acquaviva et al. Sep 1997 A
5675802 Allen et al. Oct 1997 A
5684030 Elokdah et al. Nov 1997 A
5689712 Heisch Nov 1997 A
5691920 Levine et al. Nov 1997 A
5694540 Humelsine et al. Dec 1997 A
5708803 Ishimi et al. Jan 1998 A
5710881 Gupta et al. Jan 1998 A
5727167 Dwyer, III et al. Mar 1998 A
5740413 Alpert et al. Apr 1998 A
5745770 Thangadurai et al. Apr 1998 A
5748878 Rees et al. May 1998 A
5751942 Christensen et al. May 1998 A
5752062 Gover et al. May 1998 A
5754839 Pardo et al. May 1998 A
5758061 Plum May 1998 A
5758168 Mealey et al. May 1998 A
5758187 Young May 1998 A
5761103 Oakland et al. Jun 1998 A
5768500 Agrawal et al. Jun 1998 A
5772322 Burns et al. Jun 1998 A
5774724 Heisch Jun 1998 A
5775825 Hong et al. Jul 1998 A
5787280 Joseph et al. Jul 1998 A
5787286 Hooker Jul 1998 A
5794028 Tran Aug 1998 A
5794052 Harding Aug 1998 A
5796939 Berc et al. Aug 1998 A
5797019 Levine et al. Aug 1998 A
5802378 Arndt et al. Sep 1998 A
5802678 Puente Sep 1998 A
5805879 Hervin et al. Sep 1998 A
5815707 Krause et al. Sep 1998 A
5822578 Frank et al. Oct 1998 A
5822763 Baylor et al. Oct 1998 A
5822790 Mehrotra Oct 1998 A
5835702 Levine et al. Nov 1998 A
5839050 Baehr et al. Nov 1998 A
5855578 Guglielmi et al. Jan 1999 A
5857097 Henzinger et al. Jan 1999 A
5862381 Advani et al. Jan 1999 A
5872913 Berry et al. Feb 1999 A
5875294 Roth et al. Feb 1999 A
5875334 Chow et al. Feb 1999 A
5887159 Burrows Mar 1999 A
5889947 Starke Mar 1999 A
5896538 Blandy et al. Apr 1999 A
5909573 Sheaffer Jun 1999 A
5913925 Kahle et al. Jun 1999 A
5920689 Berry et al. Jul 1999 A
5920721 Hunter et al. Jul 1999 A
5923863 Adler et al. Jul 1999 A
5926640 Mason et al. Jul 1999 A
5928334 Mandyam et al. Jul 1999 A
5930508 Faraboschi et al. Jul 1999 A
5937437 Roth et al. Aug 1999 A
5938760 Levine et al. Aug 1999 A
5938778 John, Jr. et al. Aug 1999 A
5940618 Blandy et al. Aug 1999 A
5949971 Levine et al. Sep 1999 A
5950003 Kaneshiro et al. Sep 1999 A
5950009 Bortnikov et al. Sep 1999 A
5966537 Ravichandran Oct 1999 A
5966538 Granston et al. Oct 1999 A
5966539 Srivastava Oct 1999 A
5970439 Levine et al. Oct 1999 A
5973417 Goetz et al. Oct 1999 A
5973542 Okayasu et al. Oct 1999 A
5978907 Tran et al. Nov 1999 A
5987250 Subrahmanyam Nov 1999 A
5987598 Levine et al. Nov 1999 A
5991708 Levine et al. Nov 1999 A
5991908 Baxter et al. Nov 1999 A
5996069 Yasoshima et al. Nov 1999 A
6006033 Heisch Dec 1999 A
6009514 Henzinger et al. Dec 1999 A
6026235 Shaughnessy Feb 2000 A
6063134 Peters et al. May 2000 A
6067644 Levine et al. May 2000 A
6070009 Dean et al. May 2000 A
6073109 Flores et al. Jun 2000 A
6073215 Snyder Jun 2000 A
6094709 Baylor et al. Jul 2000 A
6098169 Ranganathan Aug 2000 A
6101524 Choi et al. Aug 2000 A
6105051 Borkenhagen et al. Aug 2000 A
6105129 Meier et al. Aug 2000 A
6112317 Berc et al. Aug 2000 A
6118448 McMillan et al. Sep 2000 A
6119075 Dean et al. Sep 2000 A
6134676 VanHuben et al. Oct 2000 A
6145077 Sidwell et al. Nov 2000 A
6145123 Torrey et al. Nov 2000 A
6147318 Marhic Nov 2000 A
6148321 Hammond Nov 2000 A
6149318 Chase et al. Nov 2000 A
6161187 Mason et al. Dec 2000 A
6163840 Chrysos et al. Dec 2000 A
6182210 Akkary et al. Jan 2001 B1
6185652 Shek et al. Feb 2001 B1
6185671 Pentovski et al. Feb 2001 B1
6189072 Levine et al. Feb 2001 B1
6189141 Benitez et al. Feb 2001 B1
6189142 Johnston et al. Feb 2001 B1
6192513 Subrahmanyam Feb 2001 B1
6195765 Kislanko et al. Feb 2001 B1
6199204 Donohue Mar 2001 B1
6202199 Wygodny et al. Mar 2001 B1
6202207 Donohue Mar 2001 B1
6206235 Green Mar 2001 B1
6206584 Hastings Mar 2001 B1
6212675 Johnston et al. Apr 2001 B1
6223338 Smolders Apr 2001 B1
6233679 Holmberg May 2001 B1
6237019 Ault et al. May 2001 B1
6237141 Holzle et al. May 2001 B1
6240510 Yeh et al. May 2001 B1
6243804 Cheng Jun 2001 B1
6247113 Jaggar Jun 2001 B1
6253338 Smolders Jun 2001 B1
6256771 O'Neil et al. Jul 2001 B1
6256775 Flynn Jul 2001 B1
6275893 Bonola Aug 2001 B1
6278064 Hinkley et al. Aug 2001 B1
6285974 Mandyam et al. Sep 2001 B1
6286132 Tanaka et al. Sep 2001 B1
6286584 Frields Sep 2001 B1
6298521 Butterfield Oct 2001 B1
6311327 O'Brien et al. Oct 2001 B1
6324689 Lowney et al. Nov 2001 B1
6330662 Patel et al. Dec 2001 B1
6339818 Olszewski et al. Jan 2002 B1
6349406 Levine et al. Feb 2002 B1
6351844 Bala Feb 2002 B1
6353877 Duncan et al. Mar 2002 B1
6374364 McElroy et al. Apr 2002 B1
6378064 Edwards et al. Apr 2002 B1
6381679 Matsubara et al. Apr 2002 B1
6404500 Schneider et al. Jun 2002 B1
6406135 Watanabe et al. Jun 2002 B1
6408386 Hammond et al. Jun 2002 B1
6425118 Molloy et al. Jul 2002 B1
6430741 Mattson, Jr. et al. Aug 2002 B1
6430938 Royal et al. Aug 2002 B1
6438743 Boehm et al. Aug 2002 B1
6442585 Dean et al. Aug 2002 B1
6446019 Kynett et al. Sep 2002 B1
6446029 Davidson et al. Sep 2002 B1
6453468 D'Souza Sep 2002 B1
6457170 Boehm et al. Sep 2002 B1
6459998 Hoffman Oct 2002 B1
6460135 Suganuma Oct 2002 B1
6460693 Harrold Oct 2002 B1
6477703 Smith et al. Nov 2002 B1
6480938 Vondran, Jr. Nov 2002 B2
6480966 Rawson, III Nov 2002 B1
6484315 Ziese Nov 2002 B1
6501995 Kinney et al. Dec 2002 B1
6505292 Witt Jan 2003 B1
6513045 Casey et al. Jan 2003 B1
6519310 Chapple Feb 2003 B2
6526571 Aizikowitz et al. Feb 2003 B1
6530042 Davidson et al. Mar 2003 B1
6539458 Holmberg Mar 2003 B2
6542985 Johnson et al. Apr 2003 B1
6549930 Chrysos et al. Apr 2003 B1
6549959 Yates et al. Apr 2003 B1
6549998 Pekarich et al. Apr 2003 B1
6550002 Davidson et al. Apr 2003 B1
6559959 Miura et al. May 2003 B2
6560693 Puzak et al. May 2003 B1
6562858 Oxenkrug May 2003 B2
6569679 Barber et al. May 2003 B1
6574727 Davidson et al. Jun 2003 B1
6594820 Ungar Jul 2003 B1
6598153 Flachs et al. Jul 2003 B1
6601233 Underwood Jul 2003 B1
6631514 Le Oct 2003 B1
6636950 Mithal et al. Oct 2003 B1
6647301 Sederlund et al. Nov 2003 B1
6654781 Browning Nov 2003 B1
6658416 Hussain et al. Dec 2003 B1
6658651 O'Brien et al. Dec 2003 B2
6662295 Yamaura Dec 2003 B2
6665776 Jouppi et al. Dec 2003 B2
6678755 Peterson et al. Jan 2004 B1
6681387 Hwu et al. Jan 2004 B1
6681388 Sato et al. Jan 2004 B1
6687794 Malik Feb 2004 B2
6687807 Damron Feb 2004 B1
6687811 Yamada Feb 2004 B1
6708296 Gover et al. Mar 2004 B1
6721875 McCormick et al. Apr 2004 B1
6725457 Priem et al. Apr 2004 B1
6725458 Shimotani et al. Apr 2004 B2
6732354 Ebeling et al. May 2004 B2
6735666 Koning May 2004 B1
6735757 Kroening et al. May 2004 B1
6742179 Megiddo et al. May 2004 B2
6757771 Christie Jun 2004 B2
6758168 Koskinen et al. Jul 2004 B2
6772322 Merchant et al. Aug 2004 B1
6772412 Baba et al. Aug 2004 B2
6774724 Krvavac Aug 2004 B2
6775728 Zimmer et al. Aug 2004 B2
6775825 Grumann et al. Aug 2004 B1
6782454 Damron Aug 2004 B1
6785844 Wong et al. Aug 2004 B2
6801961 Chu et al. Oct 2004 B2
6820155 Ito Nov 2004 B1
6832296 Hooker Dec 2004 B2
6840829 Matsuda et al. Jan 2005 B2
6842850 Ganapathy et al. Jan 2005 B2
6848029 Coldewey Jan 2005 B2
6848030 Tokar et al. Jan 2005 B2
6857083 Floyd et al. Feb 2005 B2
6865663 Barry Mar 2005 B2
6865666 Yoshida et al. Mar 2005 B2
6871298 Cavanaugh et al. Mar 2005 B1
6918106 Burridge et al. Jul 2005 B1
6918606 Petrishe Jul 2005 B2
6925424 Jones et al. Aug 2005 B2
6928521 Burton et al. Aug 2005 B1
6928582 Adl-Tabatabai et al. Aug 2005 B2
6930508 Kim et al. Aug 2005 B2
6944720 Sperber et al. Sep 2005 B2
6944722 Cantrill Sep 2005 B2
6944734 Anzai et al. Sep 2005 B2
6948032 Kadambi et al. Sep 2005 B2
6948059 Sprecher et al. Sep 2005 B1
6951018 Long et al. Sep 2005 B2
6961681 Choquier et al. Nov 2005 B1
6961925 Callahan, II et al. Nov 2005 B2
6966057 Lueh Nov 2005 B2
6970999 Kurihara et al. Nov 2005 B2
6971091 Arnold et al. Nov 2005 B1
6972417 Suganuma et al. Dec 2005 B2
6972541 Matsushiro et al. Dec 2005 B2
6973417 Maxwell et al. Dec 2005 B1
6973542 Schmuck et al. Dec 2005 B1
6981128 Fluhr et al. Dec 2005 B2
6988186 Eickemeyer et al. Jan 2006 B2
7020808 Sato et al. Mar 2006 B2
7024668 Shiomi et al. Apr 2006 B2
7035996 Woodall et al. Apr 2006 B2
7065634 Lewis et al. Jun 2006 B2
7069541 Dougherty et al. Jun 2006 B2
7089535 Bates et al. Aug 2006 B2
7093081 DeWitt, Jr. et al. Aug 2006 B2
7093154 Bartfai et al. Aug 2006 B2
7093236 Swaine et al. Aug 2006 B2
7114036 DeWitt, Jr. et al. Sep 2006 B2
7114150 Dimpsey et al. Sep 2006 B2
7131115 Hundt et al. Oct 2006 B2
7155575 Krishnaiyer et al. Dec 2006 B2
7162594 Bungo Jan 2007 B2
7168067 Betker et al. Jan 2007 B2
7181723 Luk et al. Feb 2007 B2
7194732 Fisher et al. Mar 2007 B2
7197586 DeWitt, Jr. et al. Mar 2007 B2
7207043 Blythe et al. Apr 2007 B2
7210126 Ghobrial et al. Apr 2007 B2
7225309 DeWitt, Jr. et al. May 2007 B2
7237242 Blythe et al. Jun 2007 B2
7257657 DeWitt, Jr. et al. Aug 2007 B2
7290254 Comp et al. Oct 2007 B2
7293164 DeWitt, Jr. et al. Nov 2007 B2
7296130 Dimpsey et al. Nov 2007 B2
7296259 Betker et al. Nov 2007 B2
7299319 Dimpsey et al. Nov 2007 B2
7313655 Hsu Dec 2007 B2
7373637 DeWitt, Jr. et al. May 2008 B2
7392370 DeWitt, Jr. et al. Jun 2008 B2
7395527 DeWitt, Jr. et al. Jul 2008 B2
7415699 Gouriou et al. Aug 2008 B2
7415705 DeWitt, Jr. et al. Aug 2008 B2
7421681 DeWitt, Jr. et al. Sep 2008 B2
7421684 Dimpsey et al. Sep 2008 B2
7448025 Kalafatis et al. Nov 2008 B2
7458078 DeWitt, Jr. et al. Nov 2008 B2
7469407 Burky et al. Dec 2008 B2
7480899 Dimpsey et al. Jan 2009 B2
7487301 Mutz et al. Feb 2009 B2
7496908 DeWitt, Jr. et al. Feb 2009 B2
7496909 Kuch et al. Feb 2009 B2
7526616 Dimpsey et al. Apr 2009 B2
7526757 Levine et al. Apr 2009 B2
7574587 DeWitt, Jr. et al. Aug 2009 B2
7577951 Partamian et al. Aug 2009 B2
7581218 Johnson Aug 2009 B2
7594219 Ramachandran et al. Sep 2009 B2
7620777 Dimpsey et al. Nov 2009 B2
7779394 Homing et al. Aug 2010 B2
7783886 Walmsley Aug 2010 B2
7895382 DeWitt, Jr. et al. Feb 2011 B2
7895473 Alexander, III et al. Feb 2011 B2
7902986 Takei Mar 2011 B2
7926041 Dimpsey et al. Apr 2011 B2
7937685 Weil et al. May 2011 B2
7937691 Dewitt, Jr. et al. May 2011 B2
7987453 Dewitt, Jr. et al. Jul 2011 B2
8042102 Dewitt, Jr. et al. Oct 2011 B2
8070009 Mckenzie et al. Dec 2011 B2
8135915 Dimpsey et al. Mar 2012 B2
8141099 Dewitt, Jr. et al. Mar 2012 B2
8171457 Dimpsey et al. May 2012 B2
8191049 Levine et al. May 2012 B2
8255880 Dewitt, Jr. et al. Aug 2012 B2
20010014905 Onodera Aug 2001 A1
20010032305 Barry Oct 2001 A1
20020019976 Patel et al. Feb 2002 A1
20020073406 Gove Jun 2002 A1
20020124161 Moyer et al. Sep 2002 A1
20020124237 Sprunt et al. Sep 2002 A1
20020129309 Floyd et al. Sep 2002 A1
20020147965 Swaine et al. Oct 2002 A1
20020157086 Lewis et al. Oct 2002 A1
20020199179 Lavery et al. Dec 2002 A1
20030005422 Kosche et al. Jan 2003 A1
20030014741 Megiddo et al. Jan 2003 A1
20030040955 Anaya et al. Feb 2003 A1
20030041096 Johnson Feb 2003 A1
20030061471 Matsuo Mar 2003 A1
20030066055 Spivey Apr 2003 A1
20030101367 Bartfai et al. May 2003 A1
20030115580 Aria et al. Jun 2003 A1
20030126590 Burrows et al. Jul 2003 A1
20030131343 French et al. Jul 2003 A1
20030135719 DeWitt, Jr. et al. Jul 2003 A1
20030135720 DeWitt et al. Jul 2003 A1
20030154463 Betker et al. Aug 2003 A1
20030191900 Hooker Oct 2003 A1
20030225917 Partamian et al. Dec 2003 A1
20040003381 Suzuki et al. Jan 2004 A1
20040006546 Wedlake et al. Jan 2004 A1
20040030870 Buser Feb 2004 A1
20040049712 Betker et al. Mar 2004 A1
20040128651 Lau Jul 2004 A1
20040153612 Mutz et al. Aug 2004 A1
20040194076 Comp et al. Sep 2004 A1
20040205302 Cantrill Oct 2004 A1
20040268316 Fisher et al. Dec 2004 A1
20050071515 DeWitt, Jr. et al. Mar 2005 A1
20050071516 Levine et al. Mar 2005 A1
20050071608 DeWitt, Jr. et al. Mar 2005 A1
20050071609 Levine et al. Mar 2005 A1
20050071610 Levine et al. Mar 2005 A1
20050071611 DeWitt, Jr. et al. Mar 2005 A1
20050071612 DeWitt, Jr. et al. Mar 2005 A1
20050071816 Levine et al. Mar 2005 A1
20050071817 DeWitt, Jr. et al. Mar 2005 A1
20050071821 Levine et al. Mar 2005 A1
20050071822 DeWitt, Jr. et al. Mar 2005 A1
20050081019 DeWitt, Jr. et al. Apr 2005 A1
20050081107 DeWitt, Jr. et al. Apr 2005 A1
20050091456 Huck Apr 2005 A1
20050102493 DeWitt, Jr. et al. May 2005 A1
20050108483 Bungo May 2005 A1
20050154811 DeWitt, Jr. et al. Jul 2005 A1
20050154812 DeWitt, Jr. et al. Jul 2005 A1
20050154813 DeWitt, Jr. et al. Jul 2005 A1
20050154838 DeWitt, Jr. et al. Jul 2005 A1
20050154839 DeWitt, Jr. et al. Jul 2005 A1
20050154867 DeWitt, Jr. et al. Jul 2005 A1
20050155018 DeWitt, Jr. et al. Jul 2005 A1
20050155019 Levine et al. Jul 2005 A1
20050155020 DeWitt, Jr. et al. Jul 2005 A1
20050155021 DeWitt, Jr. et al. Jul 2005 A1
20050155022 DeWitt, Jr. et al. Jul 2005 A1
20050155025 DeWitt, Jr. et al. Jul 2005 A1
20050155026 DeWitt, Jr. et al. Jul 2005 A1
20050155030 DeWitt, Jr. et al. Jul 2005 A1
20050177822 Kuch et al. Aug 2005 A1
20050210275 Homing et al. Sep 2005 A1
20050210450 Dimpsey et al. Sep 2005 A1
20050257092 Alexander et al. Nov 2005 A1
20060090063 Theis Apr 2006 A1
20080088609 Chou et al. Apr 2008 A1
20080141005 Dewitt, Jr. et al. Jun 2008 A1
20080235495 DeWitt et al. Sep 2008 A1
20090287729 Chen et al. Nov 2009 A1
20090300587 Zheng et al. Dec 2009 A1
20110105970 Gainer, Jr. May 2011 A1
20120151465 Dewitt, Jr. et al. Jun 2012 A1
Foreign Referenced Citations (7)
Number Date Country
1164475 Dec 2001 EP
10083284 Mar 1998 JP
10260820 Sep 1998 JP
2000029731 Dec 1999 JP
2000347863 Dec 2000 JP
406239 Sep 2000 TW
457432 Oct 2001 TW
Non-Patent Literature Citations (159)
Entry
Ramirez et al., “The Effect of Code Reordering on Branch Prediction”, Proceedings of the International Conference on Parallel Architectures and Compilation Techniques, Oct. 2000, pp. 189-198.
Yang et al., “Improving Performance by Branch Reordering”, Proceedings of the ACM SIGPLAN 1998 Conference onProgramming Language Design and Implementation, Montreal Canada, 1008, pp. 130-141.
Conte et al., “Accurate and Practical Profile-Driven Compilation Using the Profile Buffer”, Proceedings of the 29th Annual ACM/IEEE International Symposium on Microarchitecture, Paris, France, 1996, pp. 36-45.
Conte et al., “Using Branch Handling Hardware to Support Profile-Driven Optimization”, Proceedings of the 27th Annual International Symposium on Microarchitecture, San Jose CA, 1994, pp. 12-21.
Fisher, “Trace Scheduling: A Technique for Global Microcode Compaction”, IEEE Transactions on Computers, vol. C30, No. 7, Jul. 1981, pp. 478-490.
Chang et al., “Using Profile Information to Assist Classic Code Optimizations”, Software Pract. Exper. Dec. 21, 1991, pp. 1301-1321.
Schmidt et al., “Profile-Directed Restructuring of Operating System Code”, IBM Systems Journal, 1998, vol. 37, No. 2, pp. 270-297.
Aho et al., “Compilers: Principles, Techniques, and Tools”, Addison-Wesley, 1988, pp. 488-497.
Intel, “Intel IA-64 Architecture Software Developer's Manual”, Revision 1.1, vol. 4, No. 245320.002, Jul. 2001.
“CPU Cache”, Wikipedia, pp. 1-14 retrieved Nov. 1, 2006 http://en.wikip;edia.org/wiki/CPU—cache.
Ammons et al., “Exploiting Hardware Performance Counters with Flow and Context Sensitive Profiling”, 1997, ACM, pp. 85-96.
“Method for the dynamic prediction of nonsequential memory accesses”, Sep. 25, 2002, pp. 1-4, ip.com IPCOM000009888D.
“Cache Miss Director—A Means of Prefetching Cache Missed Lines”, Aug. 1, 1982, IBM Technical Disclosure Bulletin, vol. 25, Issue 3A, pp. 1286.
Kikuchi, “Parallelization Assist System”, Joho Shori, vol. 34, No. 9, Sep. 1993, pp. 1158-1169.
Cohen et al., “Hardware-Assisted Characterization of NAS Benchmarks”, Cluster Computing, vol. 4, No. 3, Jul. 2001, pp. 189-196.
Talla et al., “Evaluating Signal Processing and Multimedia Applications on SIMD, VLIW and Super Scalar Architectures”, International Conference on Computer Design, Austin, Sep. 17-20, 2000, pp. 163-172.
Iwasawa et al., “Parallelization Method of Fortran DO Loops by Parallelizing Assist System”, Transactions of Information Processings Society of Japan, vol. 36, No. 8, Aug. 1995, pp. 1995-2006.
Talla et al., “Execution Characteristics of Multimedia Applications on a Pentium II Processor”, IEEE International Performance, Computing, and Communications Conference, 19th, Phoenix, Feb. 20-22, 2000, pp. 516-524.
IBM Research Disclosure Bulletin 444188, “Enable Debuggers as an Object Performance Measurement Tool for Software Development Cost Reduction”, Apr. 2001, pp. 686-688.
Jeong et al., “Cost Sensitive Cache Replacement Algorithms”, Jun. 2002, Second Workshop on Cashing, Coherence and Consistency, NY, pp. 1-14.
Wikipedia “JavaServer Pages” downloaded Jan. 24, 2006 http://en.wikipedia.org/wiki/JavaServer—Pages.
“Hardware Cycle Based memory Residency”, IBM, May 22, 2003, ip.com, IPCOM000012728D, pp. 1-2.
Hyde, “The Art of Assembly Language”, 2001, Linux Edition, pp. 247-248, retrieved Mar. 1, 2005 from http://webster.cs.ucr.edu/AoA/Linux/PDFs/0—PDFIndexLinux.html.
Tanenbaum, “Structured Computer Organization”, 1984, Prentice-Hall, Inc., 2nd Edition, pp. 10-12.
Torrellas et al., “False Sharing and Spatial Locality in Multiprocessor Caches”, Jun. 1994, IEEE Transactions on Computers, vol. 43, No. 6, pp. 651-663.
Rothman et al., “Analysis of Shared Memory Misses and Reference Patterns”, 2000, IEEE, pp. 187-198.
Short, “Embedded Microprocessor Systems Design: An Introduction Using the Intel 80C188EB” Prentice-Hall, Inc.: 1998, p. 761.
Mano, “Computer System Architecture”, Prentice-Hall, Inc., 2nd Ed., 1982, pp. 434-443.
Inoue, “Digital mobile communication system designed for nationwide police activities—WIDE system”, IEEEXplore, Oct. 1996, pp. 1-2.
Merten et al., “A Hardware Driven Profiling Scheme for Identifying Program Hot Spots to Support Runtime Optimization”, IEEE, 1999, pp. 136-147.
Taiwan Search Report for application 094100082 dated Apr. 19, 2010.
Jya, “Software Design of a UNIX-like Kernel”, Jul. 2003, pp. 1-4 http://etd.lib.nsysu.edu.tw/ETD-search-c/view—etd?URN+etd-09151030113427.
USPTO Office Action dated Aug. 24, 2007 regarding U.S. Appl. No. 10/757,171, 30 pages.
USPTO Notice of Allowance dated Jan. 14, 2008 regarding U.S. Appl. No. 10/757,171, 7 pages.
USPTO Final Office Action dated Mar. 12, 2007 regarding U.S. Appl. No. 10/757,186, 28 pages.
USPTO Final Office Action dated Nov. 29, 2007 regarding U.S. Appl. No. 10/757,186, 30 pages.
USPTO Notice of Allowance dated Oct. 20, 2010 regarding U.S. Appl. No. 10/757,186, 8 pages.
USPTO Office Action dated Aug. 1, 2007 regarding U.S. Appl. No. 10/757,186, 34 pages.
USPTO Office Action dated Nov. 28, 2005 regarding U.S. Appl. No. 10/757,186, 17 pages.
USPTO Final Office Action dated Jun. 16, 2006 regarding U.S. Appl. No. 10/757,192, 11 pages.
USPTO Notice of Allowance dated Nov. 3, 2006 regarding U.S. Appl. No. 10/757,192, 15 pages.
USPTO Office Action dated Dec. 8, 2005 regarding U.S. Appl. No. 10/757,192, 12 pages.
USPTO Final Office Action dated Jan. 30, 2008 regarding U.S. Appl. No. 10/757,197, 11 pages.
USPTO Final Office Action dated Mar. 2, 2007 regarding U.S. Appl. No. 10/757,197, 19 pages.
USPTO Notice of Allowance dated Oct. 15, 2008 regarding U.S. Appl. No. 10/757,197, 6 pages.
USPTO Office Action dated Aug. 17, 2007 regarding U.S. Appl. No. 10/757,197, 17 pages.
USPTO Office Action dated Sep. 13, 2006 regarding U.S. Appl. No. 10/757,197, 22 pages.
USPTO Office Action dated Mar. 14, 2006 regarding U.S. Appl. No. 10/757,198, 7 pages.
USPTO Office Action dated Dec. 2, 2005 regarding U.S. Appl. No. 10/757,198, 13 pages.
USPTO Notice of Allowance dated Jul. 28, 2006 regarding U.S. Appl. No. 10/757,227, 11 pages.
USPTO Supplemental Notice of Allowance dated Aug. 10, 2006 regarding U.S. Appl. No. 10/757,227, 4 pages.
USPTO Office Action dated Feb. 28, 2006 regarding U.S. Appl. No. 10/757,227, 13 pages.
USPTO Final Office Action dated May 8, 2006 regarding U.S. Appl. No. 10/687,248, 23 pages.
USPTO Office Action dated Jan. 6, 2006 regarding U.S. Appl. No. 10/687,248, 24 pages.
USPTO Final Office Action dated Jul. 5, 2007 regarding U.S. Appl. No. 10/757,250, 11 pages.
USPTO Notice of Allowance dated Nov. 20, 2007 regarding U.S. Appl. No. 10/757,250, 6 pages.
USPTO Office Action dated Oct. 6, 2006 regarding U.S. Appl. No. 10/757,250, 10 pages.
USPTO Notice of Allowance dated Dec. 27, 2011 regarding U.S. Appl. No. 12/185,254, 10 pages.
USPTO Notice of Allowance dated Jul. 1, 2009 regarding U.S. Appl. No. 12/431,389, 31 pages.
USPTO Notice of Allowance dated Apr. 30, 2008 regarding U.S. Appl. No. 10/757,250, 6 pages.
USPTO Office Action dated Feb. 26, 2007 regarding U.S. Appl. No. 10/682,437, 18 pages.
USPTO Office Action dated Jun. 15, 2011 regarding U.S. Appl. No. 12/122,558, 18 pages.
USPTO Notice of Allowance dated Nov. 22, 2011 regarding U.S. Appl. No. 12/122,558, 13 pages.
USPTO Final Office Action dated Oct. 24, 2006 regarding U.S. Appl. No. 10/806,576, 25 pages.
USPTO Office Action dated May 4, 2006 regarding U.S. Appl. No. 10/806,576, 16 pages.
USPTO Final Office Action dated May 9, 2006 regarding U.S. Appl. No. 10/674,604, 21 pages.
USPTO Office Action dated Jan. 17, 2006 regarding U.S. Appl. No. 10/674,604, 22 pages.
USPTO Final Office Action dated Jun. 23, 2006 regarding U.S. Appl. No. 10/674,606, 17 pages.
USPTO Office Action dated Jan. 12, 2006 regarding U.S. Appl. No. 10/674,606, 12 pages.
USPTO Final Office Action dated Dec. 20, 2006 regarding U.S. Appl. No. 10/806,633, 21 pages.
USPTO Notice of Allowance dated Apr. 20, 2007 regarding U.S. Appl. No. 10/806,633, 4 pages.
USPTO Supplemental Notice of Allowance dated Oct. 5, 2007 regarding U.S. Appl. No. 10/806,633, 7 pages.
USPTO Office Action dated May 15, 2006 regarding U.S. Appl. No. 10/806,633, 19 pages.
USPTO Final Office Action dated Aug. 23, 2007 regarding U.S. Appl. No. 10/674,642, 15 pages.
USPTO Office Action dated Feb. 27, 2007 regarding U.S. Appl. No. 10/674,642, 16 pages.
USPTO Office Action dated Mar. 27, 2008 regarding U.S. Appl. No. 10/674,642, 16 pages.
USPTO Office Action dated Aug. 24, 2006 regarding U.S. Appl. No. 10/674,642, 24 pages.
USPTO Notice of Allowance dated Mar. 18, 2011 regarding U.S. Appl. No. 10/803,663, 10 pages.
USPTO Office Action dated May 2, 2008 regarding U.S. Appl. No. 10/803,663, 23 pages.
USPTO Office Action dated May 4, 2007 regarding U.S. Appl. No. 10/803,663, 36 pages.
USPTO Office Action dated Oct. 18, 2007 regarding U.S. Appl. No. 10/803,663, 24 pages.
USPTO Final Office Action dated Apr. 29, 2008 regarding U.S. Appl. No. 10/808,716, 10 pages.
USPTO Final Office Action dated Jul. 24, 2007 regarding U.S. Appl. No. 10/808,716, 19 pages.
USPTO Final Office Action dated Nov. 16, 2007 regarding U.S. Appl. No. 10/808,716, 10 pages.
USPTO Notice of Allowance dated Sep. 12, 2008 regarding U.S. Appl. No. 10/808,716, 19 pages.
USPTO Office Action dated Feb. 8, 2007 regarding U.S. Appl. No. 10/808,716, 37 pages.
USPTO Final Office Action dated Sep. 25, 2007 regarding U.S. Appl. No. 10/675,721, 16 pages.
USPTO Final Office Action dated Oct. 3, 2008 regarding U.S. Appl. No. 10/675,721, 8 pages.
USPTO Office Action dated Feb. 26, 2007 regarding U.S. Appl. No. 10/675,721, 40 pages.
USPTO Office Action dated Apr. 9, 2008 regarding U.S. Appl. No. 10/675,721, 8 pages.
USPTO Final Office Action dated May 31, 2006 regarding U.S. Appl. No. 10/675,751, 15 pages.
USPTO Office Action dated Jan. 30, 2006 regarding U.S. Appl. No. 10/675,751, 17 pages.
USPTO Final Office Action dated Jun. 15, 2010 regarding U.S. Appl. No. 10/675,776, 9 pages.
USPTO Final Office Action dated Jun. 17, 2008 regarding U.S. Appl. No. 10/675,776, 17 pages.
USPTO Final Office Action dated Jun. 30, 2009 regarding U.S. Appl. No. 10/675,776, 22 pages.
USPTO Notice of Allowance dated Dec. 29, 2010 regarding U.S. Appl. No. 10/675,776, 10 pages.
USPTO Office Action dated Jan. 21, 2010 regarding U.S. Appl. No. 10/675,776, 13 pages.
USPTO Office Action dated Dec. 18, 2008 regarding U.S. Appl. No. 10/675,776, 22 pages.
USPTO Office Action dated Dec. 21, 2007 regarding U.S. Appl. No. 10/675,776, 17 pages.
USPTO Office Action dated Oct. 2, 2006 regarding U.S. Appl. No. 10/675,777, 25 pages.
USPTO Final Office Action dated May 31, 2006 regarding U.S. Appl. No. 10/675,778, 19 pages.
USPTO Office Action dated Feb. 3, 2006 regarding U.S. Appl. No. 10/675,778, 19 pages.
USPTO Final Office Action dated Oct. 26, 2007 regarding U.S. Appl. No. 10/675,783, 14 pages.
USPTO Final Office Action dated Oct. 30, 2008 regarding U.S. Appl. No. 10/675,783, 22 pages.
USPTO Office Action dated Apr. 17, 2008 regarding U.S. Appl. No. 10/675,783, 16 pages.
USPTO Office Action dated May 14, 2007 regarding U.S. Appl. No. 10/675,783, 42 pages.
USPTO Final Office Action dated Jun. 2, 2006 regarding U.S. Appl. No. 10/675,831, 18 pages.
USPTO Office Action dated Jan. 27, 2006 regarding U.S. Appl. No. 10/675,831, 17 pages.
USPTO Final Office Action dated Feb. 11, 2008 regarding U.S. Appl. No. 10/806,866, 17 pages.
USPTO Final Office Action dated Mar. 29, 2007 regarding U.S. Appl. No. 10/806,866, 22 pages.
USPTO Office Action dated Oct. 5, 2006 regarding U.S. Appl. No. 10/806,866, 32 pages.
USPTO Office Action dated Jun. 25, 2008 regarding U.S. Appl. No. 10/806,866, 6 pages.
USPTO Office Action dated Aug. 24, 2007 regarding U.S. Appl. No. 10/806,866, 23 pages.
USPTO Notice of Allowance dated Dec. 16, 2008 regarding U.S. Appl. No. 10/806,866, 8 pages.
USPTO Examiner's Answer to Appeal Brief dated Oct. 31, 2008 regarding U.S. Appl. No. 10/806,871, 21 pages.
USPTO Final Office Action dated Mar. 22, 2007 regarding U.S. Appl. No. 10/806,871, 23 pages.
USPTO Final Office Action dated Apr. 9, 2008 regarding U.S. Appl. No. 10/806,871, 20 pages.
USPTO Office Action dated Aug. 24, 2007 regarding U.S. Appl. No. 10/806,871, 26 pages.
USPTO Office Action dated Sep. 19, 2006 regarding U.S. Appl. No. 10/806,871, 35 pages.
USPTO Notice of Allowance dated Sep. 7, 2011 regarding U.S. Appl. No. 10/806,871, 9 pages.
USPTO Final Office Action dated Nov. 3, 2006 regarding U.S. Appl. No. 10/675,872, 19 pages.
USPTO Notice of Allowance dated Jan. 2, 2008 regarding U.S. Appl. No. 10/675,872, 6 pages.
USPTO Supplemental Notice of Allowance dated Mar. 19, 2008 regarding U.S. Appl. No. 10/675,872, 6 pages.
USPTO Office Action dated Jun. 5, 2006 regarding U.S. Appl. No. 10/675,872, 16 pages.
USPTO Office Action dated Jul. 13, 2007 regarding U.S. Appl. No. 10/675,872, 22 pages.
USPTO Final Office Action dated Oct. 4, 2007 regarding U.S. Appl. No. 10/806,917, 18 pages.
USPTO Notice of Allowance dated May 1, 2008 regarding U.S. Appl. No. 10/806,917, 9 pages.
USPTO Office Action dated Apr. 20, 2007 regarding U.S. Appl. No. 10/806,917, 45 pages.
USPTO notice of allowance dated Oct. 2, 2012 regarding U.S. Appl. No. 10/682,385, 30 Pages.
Briggs et al., “Synchronization, Coherence, and Event Ordering in Multiprocessors,” Computer, vol. 21, Issue 2, Feb. 1988, pp. 9-21.
Cai, “Architectural and Multiprocessor Design Verification of the PowerPC 604 Data Cache,” Conference Proceedings of the 1995 IEEE Fourteenth Annual International Phoenix Conference on Computers and Communications, Mar. 1995, pp. 383-388.
Carey et al., “The Architecture of the EXODUS Extensible DBMS”, 1986 IEEE, ACM Digital Library, pp. 52-65.
Schulz, “EDG Testbed Experience,” Oct. 2002, pp. 1-27, accessed Aug. 27, 2012 http://conferences.fnal.gov/Iccws/papers2/tue/edgtestbmarkusfinal.pdf.
Grunwald et al., “Whole-Program Optimization for Time and Space Efficient Threads”, ASPLOS-VII Proceedings—Seventh International Conference on Architectural Support for Programming Languages and Operating Systems, Oct. 1996, 10 pages.
Rothman et al., “Anaylsis of Shared Memory Misses and Reference Patterns,” Proceedings of the 2000 International Conference on Computer Design, Feb. 2000, pp. 187-198.
Kistler et al., “Continuous Program Optimization: A Case Study,” ACM Transactions on Programming Languages and Systems, vol. 25, No. 4, Jul. 2003, pp. 500-548.
USPTO Final Office Action dated Aug. 15, 2007 regarding U.S. Appl. No. 10/682,437, 15 pages.
Santhanam et al., “Software Verification Tools Assessment Study”, Department of Transportation: Federal Aviation Administration Technical Report, Report No. DOT/FAA/AR-06/54, Jun. 2007, 139 pages.
TW search report dated Jun. 30, 2010 regarding Taiwan application 094107739A, filed Mar. 14, 2005, 2 Pages.
Shye et al., “Code Coverage Testing Using Hardware Performance Monitoring Support”, Proceedings of the Sixth International Symposium on Automated Analysis-Driven Debugging, Sep. 2005, 5 pages.
Soffa et al., “Exploiting Hardware Advances for Software Testing and Debugging (NIER Track)”, Proceedings of the 33rd International Conference on Software Engineering, May 2011, 4 pages.
Stolicny et al., “Alpha 21164 Manufacturing Test Development and Coverage Analysis,” IEEE Design & Test of Computers, vol. 15, Issue 3, Jul./Sep. 1988, pp. 98-104.
“Interrupt,” Wikipedia definition, article undated,last modified Aug. 8, 2012, 7 pages, accessed Aug. 27, 2012 http://en.wikipedia.org/wiki/Interrupt.
USPTO supplemental notice of allowance dated May 8, 2008 regarding U.S. Appl. No. 10/675,777, 4 Pages.
USPTO supplemental notice of allowance dated Jan. 9, 2008 regarding U.S. Appl. No. 10/675,777, 2 Pages.
USPTO non-final office action dated Sep. 2, 2011 regarding U.S. Appl. No. 12/185,254, 21 Pages.
USPTO non-final office action dated Apr. 13, 2012 regarding U.S. Appl. No. 12/021,425, 30 Pages.
USPTO final office action dated Mar. 21, 2007 regarding U.S. Appl. No. 10/675,777, 20 Pages.
USPTO notice of allowance dated Sep. 25, 2007 regarding U.S. Appl. No. 10/675,777, 16 Pages.
USPTO non-final office action dated Oct. 2, 2006 regarding U.S. Appl. No. 10/675,777, 25 Pages.
USPTO notice of allowance dated May 1, 2008 regarding U.S. Appl. No. 10/806,917, 11 Pages.
Armand et al., “Multi-threaded Processes in Chorus/MIX,” Proceedings of EEUG Spring 1990 Conference, Apr. 1990, pp. 1-16.
Saltz et al., “Run-Time Scheduling and Execution of Loops on Message Passing Machines,” Journal of Parallel and Distributed Computing, vol. 8, Issue 4, April 990, pp. 303-312.
“Tool to Facilitate Testing of Software to Insur Compatibility,” IBM Technical Disclosure Bulletin, vol. 30, Issue 11, Apr. 1988, pp. 162-165.
Tran et al., “Student Paper: A hardware-Assisted Tool for Fast, Full Code Coverage Analysis,” 19th International Symposium on Software Reliability Engineering, Nov. 2008, pp. 321-322.
Zhou, “Using Coverage Information to Guide Test Case Selection in Adaptive Random Testing,” 2010 IEEE 34th Annual Computer Software and Applications Conference Workshops, Jul. 2010, pp. 208-213.
USPTO notice of allowance dated Sep. 4, 2012 regarding U.S. Appl. No. 12/021,425, 5 Pages.
USPTO non-final office action dated Jun. 17, 2013 regarding U.S. Appl. No. 12/021,425, 46 Pages.
Non-final office action dated Sep. 20, 2013 regarding U.S. Appl. No. 13/347,876, 89 pages.
Related Publications (1)
Number Date Country
20110106994 A1 May 2011 US
Divisions (1)
Number Date Country
Parent 10757186 Jan 2004 US
Child 13004153 US