US 6,442,585 B1Grant
Method for scheduling contexts based on statistics of memory system interactions in a computer system
Issue Date:2002-08-27
•32 Claims
•7 Drawing Sheets
Abstract
A method schedules execution contexts in a computer system based on memory interactions. The computer system includes a processor and a hierarchical memory arranged in a plurality of levels. Memory transactions are randomly sampled for a plurality of contexts. The contexts can be threads, processes, or hardware contexts. Resource interactions of the plurality of contexts is estimated, and particular contexts are chosen to be scheduled based on the estimated resource interactions.
Metadata
Assignee
- Compaq Computer Corporation
Inventors
- Jeffrey A. Dean
- Carl A. Waldspurger
Application Information
Application Number:US 08/980,105
Filing Date:1997-11-26
Priority Date:1997-11-26
Art Unit:7
Classifications
IPC:
G06F 900
Field of Search:
709100709102709104709107709108717127717131
Patent Drawings (7 sheets)
Description
Cross Reference to Related Applications
[0002] This application is related to the following U.S. patent applications: application Ser. No. 08/979,822 filed Nov. 26, 1997, entitled “APPARATUS FOR SPATIAL AND TEMPORAL SAMPLING IN A COMPUTER MEMORY SYSTEM”, now U.S. Pat. No. 6,202,127; application Ser. No. 08/980,168 filed Nov. 26, 1997, entitled “METHOD AND APPARATUS FOR SAMPLING MULTIPLE POTENTIALLY CONCURRENT INSTRUCTIONS IN A PROCESSOR PIPELINE”, now U.S. Pat. No. 6,613,840; application Ser. No. 08/979,033 filed Nov. 26, 1997, entitled “APPARATUS FOR SAMPLING INSTRUCTION EXECUTION INFORMATION IN A PROCESSOR PIPELINE”, now U.S. Pat. No. 6,195,748; application Ser. No. 08/979,034 filed Nov. 26, 1997, entitled “METHOD FOR GUIDING VIRTUAL-TO-PHYSICAL MAPPING POLICIES IN A COMPUTER OPERATING SYSTEM”, now U.S. Pat. No. 6,237,073; application Ser. No. 08/980,167 filed Nov. 26, 1997, entitled “METHOD FOR SCHEDULING THREADS IN A MULTITHREADED PROCESSOR”; application Ser. No. 08/979,398 filed Nov. 26, 1997 entitled “METHOD FOR ESTIMATING STATISTICS OF PROPERTIES OF MEMORY SYSTEM INTERACTIONS AMONG CONTEXTS IN A COMPUTER SYSTEM”, now U.S. Pat. No. 6,237,059; application Ser. No. 08/980,165 filed Nov. 26, 1997, entitled “METHOD FOR ESTIMATING STATISTICS OF PROPERTIES OF MEMORY SYSTEM TRANSACTIONS”, now U.S. Pat. No. 6,332,178; application Ser. No. 08/980,189 filed Nov. 26, 1997, entitled “METHOD FOR REPLICATING AND MIGRATING PAGES IN A MULTIPROCESSOR COMPUTER SYSTEM BASED ON MEMORY SYSTEM STATISTICS”, now abandoned; application Ser. No. 08/980,124 filed Nov. 26, 1997 entitled “METHOD AND APPARATUS FOR MONITORING A COMPUTER SYSTEM TO GUIDE OPTIMIZATION”; and application Ser. No. 08/977,438 filed Nov. 26, 1997 entitled “APPARATUS FOR DETERMINING THE INSTANTANEOUS AVERAGE NUMBER OF INSTRUCTIONS PROCESSED”, now U.S. Pat. No. 6,175,814. This application is also related to the following U.S. patents: U.S. Pat. No. 5,923,872 issued Jul. 13, 1999, entitled “APPARATUS FOR SAMPLING INSTRUCTION OPERAND OR RESULT VALUES IN A PROCESSOR PIPELINE”; and U.S. Pat. No. 5,809,450, issued Sep. 15, 1998, entitled “METHOD FOR ESTIMATTING STATISTICS OF PROPERTIES OF INSTRUCTIONS PROCESSED BY A PROCESSOR PIPELINE”.
Field of the Invention
[0003] The present invention relates generally to measuring the performance of computer systems, and more particularly to schedule execution contexts according to the measured performance.
Background of the Invention
[0004] The speed at which modern computer systems operate is often limited by the performance of their memory sub-systems, such as caches and other levels of a hierarchical memory subsystem containing SRAM, DRAM, disks and the like. Cache memories are intended to store data that share spatial and temporal localities. Other memories can store data in any number of organized manners, short term and long term.
[0005] In order to analyze and optimize the performance of memory transactions, better measuring tools are required. Currently, there are very few tools that can accurately measure and capture detailed information characterizing memory transactions.
[0006] Existing hardware event counters can detect discrete events related to specific memory transactions, such as cache references, or cache misses, but known event counters provide little detail that would allow one to exactly deduce the causes of performance debilitating events, and how such events could be avoided.
[0007] For example, currently it is extremely difficult to obtain information about the status of a cache block, such as clean or dirty, or shared or non-shared, while data are accessed. It is also very difficult to determine which memory addresses are actually resident in the cache, or which memory addresses are conflicting for a particular cache block, because existing systems do not provide an easy way to obtain the virtual and physical address of the data that are accessed.
[0008] Similarly, it is difficult to ascertain the source of a particular memory reference that caused a performance debilitating event. The source might be an instruction executed in the processor pipeline on behalf of a particular context (e.g., process, thread, hardware context, and/or address space number), it might be a memory request that is external to the processor pipeline, such as direct memory access (DMA) originating from various input/output devices, or it may be a cache-coherency message originating from other processors in a multiprocessor computer system. Sampling accesses to specific regions of memories, such as specific blocks in lines of a cache, physical addresses in a main memory, or page addresses in a virtual memory is even more difficult.
[0009] It may be possible, using simulation or instrumentation, to track memory addresses for processor initiated accesses, such as those due to load and store instructions. However, simulation and instrumentation techniques usually disturb the true operation of the system enough to give less than optimal measurements, particularly for large scale systems with real production workloads. Also, because instrumentation techniques modify or augment programs, they inherently alter memory and cache layouts, distorting the memory performance of the original system. For example, instruction cache conflicts may differ significantly between instrumented and uninstrumented versions of a program.
[0010] However, when the memory accesses are due to some event, such as a DMA transaction or a cache coherency transaction in a multi-processor, tracking accessed addresses can usually only be done by specialized hardware designed specifically for that part of the memory subsystem which is to be monitored.
[0011] In addition, in order to optimize operating system and application software, it would be useful to be able to obtain other types of information about memory transactions, such as the amount of memory that is used by different execution threads or processes, and the amount of time required to complete a particular memory transaction. Furthermore, it would be even more useful if the information could be used to optimize instruction scheduling and data allocation, perhaps even while the system is operating under a real workload.
Summary of the Invention
[0012] A method schedules execution contexts in a computer system based on memory interactions. The computer system includes a processor and a hierarchical memory arranged in a plurality of levels. Memory transactions are randomly sampled for a plurality of contexts.
[0013] The contexts can be threads, processes, or hardware contexts. Resource interactions of the plurality of contexts is estimated, and particular contexts are chosen to be scheduled based on the estimated resource interactions.
[0014] Chosen contexts can be contexts that have minimal resource conflicts, contexts that have maximal resource sharing, and contexts that underutilize allocated resources. Allocated resources can include cache memories.
Brief Description of the Drawings
[0015] FIG. 1 is a block diagram of a computer system with memory transaction sampling according to the invention;
[0016] FIG. 2 is a block diagram of sampling hardware for monitoring memory performance according to a preferred embodiment;
[0017] FIG. 3 is a block diagram of a sampling buffer to store sample. information;
[0018] FIG 4 is a flow diagram of a method for estimating sharing and conflict statistics about memory system interactions between computer system contexts;
[0019] FIG. 5 is a flow diagram of a method for estimating statistics of properties of memory system transactions;
[0020] FIG. 6 is a flow diagram of a method for using statistics about memory system behavior to make data replication and migration decisions; and
[0021] FIG. 7 is a flow diagram of a method for using statistics about memory system interactions to make context scheduling decisions.
Detailed Description of the Preferred Embodiment
[0022] System Overview
[0023] FIG. 1 shows a computer system 100 which can use the memory transaction sampling techniques as described herein. The system 100 includes one or more processors 110, memories 120, and input/output interfaces (I/O) 130 connected by bus lines 140.
[0024] Each processor 110 can be implemented on an integrated semiconductor chip including a processor pipeline 111, a data-cache (D-cache) 113, and an instruction cache (I-cache) 112, for example, the Digital Equipment Corporation Alpha 21264 processor. The pipeline 111 can include a plurality of serially arranged stages for processing instructions, such as a fetch unit, a map unit, an issue unit, one or more execution units, and a retire unit. The processor chip also includes hardware 119 described in greater detail below for sampling cache state information while accessing data stored at addresses in the various memories.
[0025] The memories 120 can be arranged hierarchically, including a board-level cache (B-cache) 121, volatile memories (DRAM) 122, and persistent memories (disk) 123. The I/O 130 can be used to input and output data to and from the system 100 using I/O devices such as memory channels to other processors, keyboards, monitors, and network controllers to other computer systems.
[0026] Memory Transaction
[0027] In general, a memory transaction is defined herein as any operation which causes data to move from one location to another, for example, loads and stores, direct memory access (DMA) operations, and coherency transactions in the case where multiple processors or execution threads access data concurrently.
[0028] Operation During operation of the system 100, instructions and data of software programs are stored in the memories 120. The instructions are generated conventionally using known compiler, linker, and loader techniques. The instructions are transferred into the pipeline 111 of one of the processors 110 via the I-cache 112, and the data via the D-cache 113. In the pipeline 111, the instructions are decoded for execution.
[0029] The instruction cache (I-cache) 112 is accessed by the pipeline to fetch instructions that are executed by the processor pipeline 111. Some of the instructions, for example load and store instructions, access data (R/W) stored in the memories via the D-cache 113. Other instructions, such as branch and jump instructions, control the execution flow of the programs. Data can also be transferred via direct memory access (DMA) and cache coherency operations. It is desired to collect detailed performance information while data in any of the memories are accessed.
[0030] Memory Transaction Sampling
[0031] FIG. 2 shows an arrangement for sampling memory transactions. A cache 200 includes a plurality of lines 202. The cache can be direct-mapped, or set-associative. Each line consists of one or more blocks 201. Lines in a direct mapped cache will contain only a single block, while lines in an N-way set-associative cache will each contain N blocks.
[0032] For example, in a four-way set-associative cache, one line will store data of four different memory addresses that have some number of low-order address bits in common. During an access, after the line has been referenced by the cache line index, each block has to be examined to determine if the line stores the required data. This is done with a tag 210.The exact details of how the blocks are examined depends on the implementation of the setassociative cache. Also, associated with each block are the data 220, and status information 230. Different physical hardware can be used for storing the tags, data, and status.
[0033] The arrangement shown in FIG. 2 also includes a translation-lookaside buffet (TLB) 240, a trigger function 250, a counter 265, a selection function 260, sampling buffers 300-302, and sampling software 280.
[0034] During operation of the system, transaction input 241 is presented to the translation-lookaside buffer (TLB) 240 on line 241. The transaction input can include a virtual address (VA), a context identifier such as an address space number (ASN), and in the case of a multi-threaded processor design, a hardware context identifier (HCI). The input also can include the type of access operation to be performed (R/W/DMA).
[0035] The TLB 240 translates the virtual address to a physical address. A portion of the address (the physical address for a physically-indexed cache, or the virtual address for a virtually-indexed cache) typically consisting of some number of low-order (e.g. 8-16) bits, is used to form an index into the cache 200 on line 242′. The index selects a particular cache line 202.
[0036] A lookup operation is then performed on each of the blocks 201 within the selected cache line 202 to determine if the appropriate data are resident in the blocks of the line. Depending on the access operation, data can respectively be read or written on lines 251 and 252.
[0037] If the appropriate data are not found at any of the blocks within the line, then other data are evicted from the cache to make room for the new data. If the evicted data are dirty, i.e., the version of the data stored in the cache is modified and the copies of the dirty data stored in surrounding levels of the memory hierarchy are not consistent, then the evicted data may need to be written back to appropriate addresses in the surrounding levels of the memory hierarchy to maintain consistency.
[0038] The goal is to sample memory system transactions in order to gain evidence about the behavior of the memory system and programs executing on the computer system. Each memory transaction is inspected as it enters the memory system to determine if this particular transaction should be selected for sampling. Two functions control which transactions to sample: the trigger function 250; and the selection function 260.
[0039] The trigger function 250 determines when the selection function 260 should be activated, while the selection function 260 determines which memory transactions should be sampled, once the trigger function has activated the selection function. In the most general case, each of these functions can operate as a function of any memory system or memory transaction state.
[0040] Selection Function
[0041] The selection function 260 is enabled via an enable line 266 that turns on the selection function when the counter 265 reaches a specified value. The maintenance of the value is described below. The selection function accepts as input information about the transaction on line 242″, as well as status information about the transaction on line 267. The job of the selection function is to decide if the transaction is of interest, and if so, to forward information about the transaction to the sampling buffer 300 via line 299.
[0042] In the general case, a monitor register (MON) 263 inside the selection function logic stores state used to match against memory system transactions. In the particular case of monitoring accesses to a specific cache block, the monitor register 263 can store the numbers of one or more blocks to be monitored. The monitor register contents (such as block numbers) can be loaded into the register by hardware or software via line 261. Addresses of other regions of memory can also be stored in the monitor register.
[0043] One way the selection function 260 can be implemented is by predefining a set of different selection functions, and employing a mode register 264 within the selection function. The mode register 264 can be loaded with a mode value via line 262 to control the particular predefined selection function to use during sampling. The various selection function modes might include functions that select transactions that:
[0044] reference a particular level in the memory hierarchy;
[0045] reference a particular region of memory within a particular level of the memory hierarchy. The particular region can include one or more cache blocks within one or more cache lines, one or more cache lines, or one or more contiguous regions of main memory addressed by either virtual or physical addresses;
[0046] have a particular type, e.g. read, write, or invalidate;
[0047] hit in a particular cache memory;
[0048] miss in a particular cache memory;
[0049] cause a particular cache protocol state transition e.g., dirty evictions;
[0050] originate from a particular source, e.g., an instruction executing in the processor pipeline, an- instruction execution from a particular context, process, thread, or address space, direct memory access from an input/output device, or cache coherency messages in a multiprocessor computer system.
[0051] Selection functions can additionally be composed using boolean combinations (AND, OR, and NOT) of these selection criteria. Alternatively, the selection function can be implemented with programmable logic controlled by software to provide additional flexibility.
[0052] After the selection function has identified a memory transaction to be sampled, the state information is captured and recorded in one of the sampling buffers 300-302. The state information is collected as the selected transaction is processed by the various levels of the memory hierarchy.
[0053] Several implementation techniques are possible. For example, a “selected transaction” field (such as a single bit) can be associated with each memory transaction. The field causes logic circuits in the memory system to record information at appropriate points during the processing of the selected transaction when the bit is set. An alternative implementation uses a comparator registers at appropriate points in the memory system hierarchy to compare identifying information from each memory transaction with the identifying information of a selected transaction, and if they match, record relevant state information.
[0054] Modes of Operation
[0055] Consider the implementation of the selection function using comparator registers to choose selected transactions at each level of the memory hierarchy. Restricting attention to a single level of the memory hierarchy consisting of a single cache memory, the selection function may specify a particular region of the cache to monitor, such as a set of cache blocks. If the index portion of the transaction information carried on line 242 is identical to one of the block indices stored in the monitor register in the selection function 260, then information about the state of the indexed cache block is captured and recorded in one of the sampling buffers as described in detail below.
[0056] Some state information can be captured before the transaction is processed by the memory system, and additional state information can be captured after the transaction completes. After a specified number of transactions have been recorded, for example, when any of the sampling buffers 300-302 are full, a read signal can be generated on line 271. The read signal 271 can be in the form of an interrupt, a software pollable value set in a register, or an exception condition.
[0057] In response to the read signal, the sampling software 280 can read the state information stored in the sampling buffer for further processing via line 272. It should be noted, that multiple buffers 300-302 can be used to collect multiple samples. Increasing the number of buffers can amortize the cost of sampling overhead, by transferring more than one sample per read signal.
[0058] Trigger Function
[0059] The loadable counter 265 is initialized with count-down values on line 268. The counter 265 is decremented using trigger events on line 254. Trigger events can be clock cycles on line 251 or transactions on line 252. Which trigger event to use can be selected on line 253.
[0060] Whether or not a trigger event on line 254 decrements the counter 265 is controlled by the trigger function 250. The trigger function can be any arbitrary function of the state of a memory transaction which can be determined via information arriving via lines 242′″and 267. The function 250 can be implemented with two internal loadable registers as described above for the selection function.
[0061] Some specific examples of useful trigger functions include those that match on:
[0062] any memory transaction;
[0063] memory transactions that reference a particular level of the memory hierarchy, e.g., a particular cache;
[0064] memory transactions that hit in a particular level of the memory hierarchy, e.g., a particular cache;
[0065] memory transactions that miss in a particular level of the memory hierarchy;
[0066] memory transactions that experience certain cache protocol state transitions, e.g., dirty evictions;
[0067] memory transactions that access a particular region of memory, e.g., range of addresses, a particular cache line, a particular cache block within a particular cache line, a particular region of the cache, etc.;
[0068] memory transactions from a particular source, e.g., from the processor pipeline, from a particular direct memory access (DMA) device, coherency traffic from another processor, etc.; and
[0069] memory transactions of a particular type, such as read transactions, write transactions, or invalidate transactions;
[0070] The use of the trigger function 250 enables the sampling hardware to skip a specified number of transactions before applying the selection function to the stream of memory references. In a sophisticated example, this would allow one to count three accesses to a particular block, and then to gather memory transaction samples for the next two misses to that block.
[0071] In another useful example, one can trigger selection after an access to a particular cache block by a particular context (such as a process or thread), and then gather samples for a specified number of subsequent transactions to the same block by different hardware, process, or thread contexts.
[0072] Therefore, there are two steps to sampling:
[0073] 1) determining a matching transaction, and then
[0074] 2) deciding to keep or discard sampling data related to the matching transaction so that sampling can take place both in spatial and temporal dimensions.
[0075] The countdown register 265 can be reset via line 268. For random sampling, the initial value written into the countdown register can be chosen randomly from an interval of numbers, and the random number can be computed either in software or via a hardware circuit capable of generating random numbers. It should be noted that the register 265 can also count upwards.
[0076] Sampling Buffer
[0077] FIG. 3 shows the details of how one of the buffers 300-302 is allocated. The buffer can be implemented as a set of software readable registers, or other types of memories. The buffer includes a status field 310, an address field 320, a context field 330, an access source field 340, an instruction field 350, a latency field 360, and fields 370 for other states.
[0078] The status field 310 can include block status information and cache state protocol information such as whether the block is dirty or clean (modified or not), shared (one or more execution threads can access the data), exclusive (non-shared), valid or invalid (the data are legitimate), and cache hit or miss status. It can also hold information such as the particular line index number and block number accessed by the transaction in a cache memory. If there are multiple levels in the memory hierarchy, then there can be multiple copies of field 310, each field storing status information about the transaction for a particular level of the memory hierarchy.
[0079] The address field 320 can store the virtual and/or physical addresses of the data accessed by the transaction being sampled.
[0080] One concern for hardware implementation may be the number of wires required to route the physical and virtual addresses to the buffer 300, for example, about 47 wires or so for the virtual address, plus 40 or so wires for the physical address. In computer systems which support software-managed TLBs, the number of wires can be reduced by simply storing the index of the TLB entry that performed the virtual-to-physical translation in the address field 320, along with the offset into the referenced page. Then, the software 280 can read the entry from the specified TLB entry to determine both the virtual and physical addresses.
[0081] Note this technique relies on two properties.
[0082] The first property requires that the TLB entry of interest has not been replaced between the time the information was recorded and the time the software reads the TLB entry. In cases where the TLB implements some approximation of a least-recently-used (LRU) replacement policy, as will be the general case, this will not be a problem, because the entry in question will have been used recently by virtue of having been involved in a recent cache access.
[0083] The second property requires that software can read the TLB entry. In cases where direct reading of the TLB is not possible, software can maintain a shadow copy of the contents of the TLB.
[0084] The context field 330 can store the address space number (ASN), the hardware context identifier (HCI) in case of a multi-threaded processor, a process identifier (PID), and/or a thread identifier (TID) of the source of the memory transaction when the source is an instruction execution in the processor pipeline. The field can also store the address space number (ASN) referenced by the memory transaction caused by the instruction.
[0085] The source field 340 can be used to store the source of the access, e.g., a load or store instruction, a DMA request, or cache coherency protocol operation, as well as additional information to identify the source.
[0086] If the source of the access was an instruction execution, then the program counter (PC) of the instruction that caused the access can be stored in the instruction field 350. The program counter field 350 can also be used to store information about other kinds of sources to save a register). For example, if the source is a coherency operation from another processor in a multiprocessor computer system, then the field 350 can be used to hold the processor number of the processor originating the request that caused the coherency operation. For DMA type of transactions, the identity if the I/O device that initiated the DMA can be stored.
[0087] The time interval (latency) between successive accesses and/or the interval from when the request was issued until the data arrives in the processor (or in the case of a write, the interval from when the data was sent to the memory until the data was committed into the memory) can be stored in the latency field 360. The interval can be measured in terms of processor clock cycles, or the interval can be measured in other units such as the number of transactions processed by the memory system. The interval can also be broken down into the time required to process the transaction at each level of the memory hierarchy.
[0088] Additional registers such as field 370 can be added to this structure to store additional memory system state that is captured at the time that the sampled memory transaction is processed. This state can include information about memory system transactions that have occurred since the last sample, such as counts of the total number of transactions, or of transactions meeting a particular set of criteria.
[0089] As shown in FIG. 2, sample events on line 290 which can be part of the sampled state can include hit/miss, valid/invalid, dirty, and the like. A select signal on line 291 can determine which particular event to sample.
[0090] Other state information can also include contents or number of valid entries in memory system structures such as write buffers, victim caches, translation lookaside buffers (TLBs), miss-address files (MAFs), and memory transaction queues.
[0091] Random Memory Transaction Sampling Techniques
[0092] In a preferred embodiment, transactions which access any level of the memory hierarchy are sampled using at least two modes of operation. In a first mode, accesses to specific regions (addresses) of memories are sampled. In a second mode, randomly selected memory transactions are sampled to estimate the performance of any part of the memory hierarchy.
[0093] In the first mode, the most interesting information can be collected by sampling at least two consecutive transactions to the same physical location, by way of example, a cache block. This will reveal cache state transitions.
[0094] In the second mode, randomly sampling a large number of transactions over time will allow a statistical analysis to estimate overall memory performance, without seriously impacting the throughput of the system. In other words, random sampling allows one to measure memory performance in actual operational systems.
[0095] Therefore, the apparatus and method disclosed herein can sample transactions to: specific cache blocks clean or dirty, specific regions of memories, all memory locations, all memory locations where cache blocks are dirty, to memory locations where the data are not in the cache.
[0096] Because cache state transitions are of particular interest, the arrangement shown in FIG. 2 is designed to store copies of state information for at least two consecutive accesses when the mode is cache sampling. The first copy captures information about the state of the cache block after the first access. The state after the second access is stored as the second copy. By comparing these two states, it is possible to determine what transitions must have occurred in the system's cache coherency protocol.
[0097] The notion of storing state information for successive transactions can be generalized to sequential accesses that match simple, software-specified criteria, such as successive misses, successive hits, successive invalidations, and so forth. These are different variations on the cache sampling mode set via line 262.
[0098] In the preferred embodiment, the state and address information is captured when a cache block is updated, so there is no need to read the cache directly. By capturing the information on its way into the cache 200, the hardware design is simpler because the need to run wires from each cache block to the sampler 270 is avoided. The design can also be simplified by limiting the sampling to a small number of blocks. When only a small number of blocks are concurrently sampling, extra hardware for each cache block is avoided.
[0099] By using software to load the monitor register 263, flexible control of a wide range of monitoring techniques to be implemented. For example, if no access activity is detected for a particular cache block within a specified period of time, then the software can abort the monitoring of that block by simply specifying another block to monitor. In another mode, the monitored cache block can be chosen randomly, in order to statistically sample the behavior of each block in the cache. Alternatively, software can sample the blocks in a round-robin order.
[0100] It is also possible to selectively monitor a cache block associated with a specified program variable or data structure. Here, software determines which cache block will store a particular variable, and selects that block as the one to monitor. This technique enables programmers to interactively debug memory system performance by identifying conflicts in executing programs that should be investigated. Similar techniques can be used by adaptive runtime software to avoid severe cache conflicts through dynamic data relocation.
[0101] It should be noted, that the transaction sampling as described herein can be employed for different levels in the memory hierarchy by duplicating the sampling hardware shown in FIG. 2. Note this technique relies on the two TLB properties described above.
[0102] The sampling techniques as described herein permit a fine-grained monitoring of memory transactions with low hardware overhead. This information can be used in many ways. For example, the collected information can help system designers to better understand the performance of the memory sub-systems, such as caches, DRAM, and the like. The performance data can be used to guide optimization.
[0103] Estimating Memory Interactions Among Contexts
[0104] The sampled information about memory system transactions can be used to compute a variety of statistics about memory system activity. This process 400 is shown in FIG. 4. The process involves repeatedly selecting a region of a memory to monitor, e.g., a specific cache block within a specific set-associative cache line within a specific cache memory, step 410, recording state information from multiple consecutive memory transactions that access this region step 420, and communicating this recorded state information to software step 430.
[0105] After a predetermined number of samples have been collected or a predetermined amount of time has elapsed, the sampling software can statistically analyze the recorded information to estimate a variety of properties about cache utilization and memory system interactions among contexts.
[0106] A typical way of using this approach is for the software to periodically choose a random cache block to monitor, and collect a sequence of samples for transactions that access this particular block. After a given period of time has elapsed, the software chooses a new random cache block to monitor, and the entire process 400 can be repeated. Over time, samples will accrue for all blocks in the cache.
[0107] This random sampling in the spatial dimension permits the estimation of statistics concerning sharing and conflicts in both space and time. Note that the random choice of the region to monitor can also be implemented by hardware logic. In general, it is also possible to monitor each region until a specified number of sample events 290 have occurred. The events 290 can be memory transactions to the region, or total memory system transactions, or elapsed time measured in processor clock cycles or other units.
[0108] For each transaction, it is possible to capture a variety of information, as described herein. For these analyses, the information of interest about each transaction includes its hit or miss status in the cache of interest, cache protocol state information about the block referenced by the transaction, the type of transaction (e.g., read, write, or invalidate), the virtual and physical addresses referenced by the transaction, the corresponding location within the cache (such as the block and/or line indices).
[0109] Additional recorded information identifies the context of the transaction, such as a cache coherency operation from another processor, a direct memory access from an input/output device, or an instruction execution from a particular process, thread, address space number, or hardware context.
[0110] The analysis of the samples includes first selecting a subset of the samples that are of interest step 440. In particular, a subset may be pairs of samples from consecutive accesses to a region, such as a specific cache block that also match additional functional criteria.
[0111] Because the selected transaction pair resulted from consecutive accesses to the same physical location in the cache, information recorded about the transactions can be used to estimate sharing or conflicts for this physical space in the cache. Also, statistics about frequencies of various state transitions in the cache protocol can be determined, because examining the protocol state on two consecutive transactions identifies the transition that must have taken place to go from the state in the first sample of the pair to the state in the second sample of the pair.
[0112] To estimate sharing, the analysis selects pairs where the second transaction in the pair was a cache hit in step 470. This indicates that there was sharing between the first and second transaction. By examining the context identifying information associated with both samples, it is possible to determine which contexts usefully shared this physical space during the sampled time interval. By aggregating this information over many such pairs of samples, one can statistically estimate metrics concerning both intra-context and inter-context sharing of physical locations.
[0113] One useful metric is determined by counting the number of pairs where the first pair in the sample matches one specific context, and where the second pair in the sample matches a second specific context, effectively yielding a matrix of counts that is indexed by the identifiers of the first and second contexts. Similarly, by analyzing pairs where the second sampled transaction experienced a cache miss in step 460, one can statistically estimate metrics concerning intra-context and inter-context conflict for physical locations.
[0114] An alternative use of this hardware is to choose a specific cache region to monitor. The chosen region corresponds to the space in the cache that stores a particular program variable or data structure. By collecting samples and filtering the samples to obtain samples pairs where at least one of the transactions involves the variable or data structure of interest, it is possible to estimate cache conflict rates and to identify other specific program variables or data structures that are the sources of the conflicts.
[0115] This estimation can be done dynamically to enable on-line program debugging or optimization of performance problems within a running program or system. This technique enables programmers to interactively debug memory system performance by identifying conflicts in executing programs that are investigated. Similar techniques can be used by adaptive runtime software to avoid severe cache conflicts through dynamic data relocation.
[0116] Estimating Statistics of Properties of Memory Transactions
[0117] The sampled information about memory system transactions can be used to compute a variety of statistics about memory system activity. This process 500 is illustrated in FIG. 5, and is accomplished using the hardware previously described by means of the following steps:
[0118] Step 1: Choose a selection function to identify memory transactions of interest 510.
[0119] Step 2: Record information about selected memory system transactions 520.
[0120] Step 3: Communicate the recorded state information to software 530.
[0121] Step 4: Select a subset of the transactions that are considered to be of interest 540.
[0122] Step 5: Analyze this subset to estimate various statistics or properties 550.
[0123] The recorded state information includes a wealth of information about each memory transaction, so many useful statistics can be computed.
[0124] Information in the samples can include:
[0125] addresses referenced by the memory transaction;
[0126] context identifying information, such as a process identifier, thread identifier, hardware context identifier, address space number, a direct memory access device identifier, or a processor identifier of cache coherency traffic;
[0127] status information for each level in the memory hierarchy referenced by the transaction, such as cache hit/miss, dirty/clean, and/or shared/exclusive status;
[0128] Analyze the Recorded State Information
[0129] Sampling individual memory system transactions makes it possible to compute a variety of statistical metrics about distributions of properties of memory system behavior. For example, it is possible to estimate distributions of latencies to service memory requests, or to estimate rates of cache hits at a particular level or region in the memory hierarchy. Filtering mechanisms can be used to identify subsets of the recorded transactions that are of interest, permitting the statistics to focus in on particular aspects of the memory system that are of interest, such as transactions to a particular region or level in the memory hierarchy, or a particular class of transactions such as reads, writes, or invalidates.
[0130] After a set of samples of interest has been identified, standard statistical techniques can be used to derive averages, standard deviations, histograms and other statistics about the samples of interest. Averages can be used to estimate rates of occurrence for particular events online 290 of FIG. 2, such as cache hits or misses, or evictions.
[0131] It is also possible to estimate the fraction of requests due to reads, writes, or invalidates. These rates can also be estimated with respect to a particular context, so as to estimate metrics such as cache hit rates per process, or average memory system latency experienced by a thread. It is also possible to estimate the fraction of a level of the memory hierarchy that is being consumed by a particular context.
[0132] Standard error estimation techniques can be used to obtain confidence intervals on the accuracy of the derived statistics. In particular, for statistics that involve a number of samples with a specific property, error bounds can be approximated using the reciprocal of the square root of the number of samples with that property. These error bounds can also be used to dynamically control the rate at which selected transactions are sampled, so as to tradeoff accuracy with sampling overhead.
[0133] When the recorded state information includes latency information, either in the form of the latency required to process the memory transaction, or in terms of the latency between two consecutive sampled memory transactions, the information can be used to compute latency-based statistics. Latency is typically measured in units of time, such as processor clock cycles, but may also be measured in other units, such as the number of memory transactions processed.
[0134] Instruction and Data Relocation
[0135] In a very general sense, processors execute instructions that operate on data. In many modern computer systems, the instructions and data are usually maintained as separate structures using different memory pages because the access patterns for instructions is quite different than that for data. Virtual to physical memory mapping for instructions and data is usually performed by the operating system. Alternatively, relocation of structures can be done manually, or by compilers, linkers, and loaders. Some systems can relocate structures dynamically as the instructions execute.
[0136] Using the hardware described herein, it is possible to give feedback to a variety of interesting pieces of software. For example, sampled memory transaction state information can be used to drive, for example, page remapping policies, or to avoid self-interference by providing feedback to compilers, linkers, or loaders.
[0137] For example, software can aggregate conflicting addresses at the page level to inform dynamic page-remapping algorithms implemented by operating systems. It is also possible to provide interesting profiling tools that identify potential performance problems to programmers and users.
[0138] For example, it is now possible to estimate how often data are dirty when the data are evicted, and how often DMA transfers or cache coherency protocol transactions occur, giving a sense of how effectively the memory system is being used.
[0139] Page Replication and Migration in a Multiprocessor Computer System
[0140] In non-uniform memory access (NUMA) multiprocessor systems, each processor has portions of the memory system that it can access more quickly (or with higher bandwidth) than can other pieces of the memory system. In order to improve performance, data (which can either be program data or instructions) that are frequently accessed by a processor can be moved to a region of the memory system that can be accessed more quickly by that processor.
[0141] This motion can be accomplished in two ways. The data can be replicated by making multiple copies of the data. Ideally, the data are judiciously “scattered” throughout the memory system. Alternatively, the data can be migrated by actually moving the data into a lower latency or higher bandwidth memory. The steps 600 involved are illustrated in FIG. 6 and include the following:
[0142] Step 1: Record information about selected memory system transactions 610.
[0143] Step 2: Identify frequently accessed regions of memory (e.g., pages) 620.
[0144] Step 3: Identify candidates for replication and migration 630.
[0145] Step 4: Replicate and/or migrate appropriate data to improve specific metrics 640.
[0146] The key to this process is embodied in Step 2 and Step 3. Information about which pieces of data, e.g., information about referenced virtual and physical addresses, that are being frequently accessed by which processor, and also which pieces of data incur substantial cache misses or are experiencing high latencies in their access can be used to guide replication and/or migration decisions.
[0147] Information about the type of accesses (e.g., reads, writes, and invalidates) can further guide the decision of whether to replicate or to migrate, or to leave the data in place. For example, data that are frequently written by multiple processors (e.g., write-shared pages) should probably not be replicated or migrated, while data that are frequently read but only infrequently written (e.g., read-shared pages) are good candidates for replication. Pages that are heavily accessed by only a single processor are good candidates for migration to a memory that is closer to the accessing processor. This information can be gathered by statistical sampling of memory system transaction information as described herein.
[0148] The information about memory system transactions can be aggregated dynamically and can be used in an on-line manner to dynamically control the replication and migration policies of the computer system. Typically, replication and migration are handled by the operating system, but they can also be handled by other software or hardware layers.
[0149] There are several potential performance metrics that replication or to migration policies can attempt to improve, including an increase in total system throughput, an increase in throughput for particular high-priority jobs, a decrease in traffic between processors and memories, a decrease in total memory latency, or an overall increase in system performance.
[0150] Context Scheduling
[0151] Because caches in a hierarchical memory. shared data originating from various hardware contexts, threads executing in different hardware contexts compete for lines in a cache. Therefore, it is desired to schedule threads so that resource conflicts are minimized.
[0152] Judicious scheduling is especially important for multithreaded processors where memory references from different hardware contexts are interleaved at a very fine-grained level, and the relevance is increased when these contexts share memory system resources, such as caches. However, it is also important for single-threaded processors when the caches are large enough relative to the number of memory transactions made by a thread during a scheduling quantum. Then there is some hope of retaining some useful cache contents when the next quantum is allocated to a particular context. All of these scheduling decisions can dynamically adapt to feedback gathered from statistical sampling of memory system transactions during online operation.
[0153] This can be done by sampling memory system transaction information as described herein. Operating system software can benefit from considering various aspects of memory reference patterns of threads or processes when making scheduling decisions. This process 700 is illustrated in FIG. 7.
[0154] Step 710 samples transactions for specified contexts. By capturing old and new context identifiers as part of a cache monitor, the operating system software can statistically estimate the degree to which different contexts are sharing and conflicting in the cache in 720. These estimates can be used by context schedulers in steps 731-733 to preferentially schedule contexts. The scheduling decisions 731-733, described below, can benefit from considering various metrics, including increasing the amount of sharing among contexts competing for memory resources or decreasing conflicts sharing among contexts competing for memory resources.
[0155] Co-scheduling.
[0156] For example, it makes sense to preferentially co-schedule a thread that has a large cache footprint concurrently with a thread that is making only modest use of the cache, because the memory system demands of such threads complement each other, thereby increasing sharing. Also, it makes sense to use, as much as possible, non-overlapping regions of the cache.
[0157] On the other hand, the operating system software should strive to minimize resource conflicts, for example, avoiding co-scheduling two threads with large cache footprints, where possible, because this will result in many more conflict misses as the threads evict each others useful data from the cache, thereby decreasing conflicts.
[0158] Share-based Scheduling
[0159] Share-base or proportional-share scheduling policies ideally want to give each context a specified correct share of each cache memory in the memory hierarchy. With the present sampling technique, it is possible to statistically estimate the portion of cache occupied by each context in step 720. This allows the scheduler to base its decisions on metrics such as giving each process a specified share of the memory system resources, effectively partitioning memory system resources among contexts in proportion to their needs.
[0160] Allocation-based Scheduling
[0161] Each context that can be scheduled has associated with it allocated resources, such as the amount of cache it can use. Contexts which use more than their allotted share can be slowed down or suspended. Similarly context that underutilize their allocated share can be favored. While some contexts are suspended, others can increase their share of the cache. The suspended contexts can be allowed to continue after their cache usage has decreased as a result of increased cache pressure from other active contexts. This can be distinguished from known approaches that generally do not allow information to be monitored at the cache line or block level, other than through simulation.
[0162] All of these scheduling decisions can dynamically adapt to feedback gathered from statistical sampling of memory system transactions during online operation.
[0163] The foregoing description has been directed to specific embodiments. It will be apparent to those skilled in the art that modifications may be made to the described embodiments, with the attainment of all or some of the advantages. Therefore, it is the object of the appended claims to cover all such variations and modifications as come within the spirit and scope of the invention.
Claims
We claim:
1. A method for scheduling contexts in a computer system including at least one processor and a hierarchical memory arranged in a plurality of levels, a plurality of memory transactions occurring within the hierarchical memory while the system operates under a real workload, the method comprising the steps of:
applying a selection function to the plurality of memory transactions as the transactions occur within the memory to determine whether to record state information for any memory transaction meeting the selection function, the state information including context of the memory transaction, the context being taken from one of a plurality of contexts for the plurality of memory transactions;
capturing and recording the state information for any transaction if any transaction meets the selection function;
estimating information relating to memory interactions among the transaction contexts by analyzing the recorded state information; and
scheduling contexts in the computer system based on the memory interaction information.
2. A method as recited in claim 1, wherein the step of estimating includes the steps of:
selecting a subset of the recorded sampled state information that is associated with at least one pair of consecutive accesses to a particular cache location of the memory hierarchy, each pair of accesses including a first access to the particular cache location by a first context, and a second access to the particular cache location by a second context, wherein the second access is a cache miss; and
statistically estimating metrics indicative of inter-context conflicts for the particular cache location based on the subset of recorded state information.
3. A method as recited in claim 2, wherein the step of scheduling includes scheduling the contexts in order to minimize inter-context conflicts.
4. A method as recited in claim 1, wherein the step of estimating includes the steps of:
selecting a subset of the recorded state information, the subset including state information associated with at least one pair of consecutive accesses to a particular cache location of the memory hierarchy during a time interval, each pair including a first and a second access to the particular cache location, wherein the second access is a cache hit;
determining contexts that usefully shared the particular cache location during the time interval; and
statistically estimating metrics indicative of inter-context sharing of the particular cache location.
5. A method as recited in claim 4, wherein the step of scheduling includes scheduling the contexts in order to maximize inter-context sharing.
6. A method as recited in claim 1, wherein the step of estimating includes the steps of:
selecting a subset of the recorded state information that is associated with at least one pair of consecutive accesses to a particular cache block of the memory hierarchy; and
estimating state transitions in the cache protocol for the particular cache block.
7. A method as recited in claim 1,
wherein the memory interaction information is dynamically estimated while processing the memory transactions; and
wherein the contexts are dynamically scheduled in response to the dynamically estimated memory interaction information.
8. A method as recited in claim 1, wherein the step of estimating includes the steps of:
selecting a subset of the recorded state information that is associated with at least one pair of consecutive accesses to a particular cache block of the memory hierarchy; and
estimating intra-context or inter-context sharing or conflicts for the particular cache block.
9. A method as recited in claim 1, wherein the selection function is configured to select a plurality of multiple consecutive memory transactions specifying access of a particular region of a particular one of the levels of the memory hierarchy.
10. A method as recited in claim 1,
wherein the selection function is configured to select a plurality of multiple consecutive memory transactions specifying access to a particular memory location of a particular one of the levels of the memory hierarchy; and
wherein the step of estimating includes statistically estimating metrics indicative of conflicts between at least two of the contexts for access to the particular memory location.
11. A method as recited in claim 1,
wherein the selection function is configured to select a plurality of multiple consecutive memory transactions specifying access to a particular cache region of the memory hierarchy; and
wherein the step of estimating includes statistically estimating metrics related to state transitions in the cache protocol.
12. A method as recited in claim 1,
wherein the selection function is configured to select a plurality of multiple consecutive memory transactions specifying access to a particular cache region of the memory hierarchy; and
wherein the step of estimating includes statistically estimating metrics indicative of cache conflict rates.
13. A method as recited in claim 1, wherein the step of scheduling includes scheduling the contexts so that the scheduled contexts have specified memory sharing.
14. A method as recited in claim 1, wherein the step of scheduling includes scheduling the contexts so that the contexts that underutilize their allocated memory are favored in the scheduling order.
15. A method of scheduling as recited in claim 1,
further comprising: prior to applying the selection function, applying a trigger function to the plurality of memory transactions to find any transactions that match the trigger function; and counting any memory transactions that match the trigger function; and
wherein the step of applying a selection function includes applying the selection function to any matching transactions, after a given number of matching transactions has occurred.
16. A method of scheduling as recited in claim 15,
wherein the selection function includes a register that stores a number indicating a region of memory; and
wherein memory transactions that occur within the indicated region of memory meet the selection function.
17. A method of scheduling as recited in claim 16, wherein the number indicating a region of memory is randomly modified to cause the regions of memory, within which transactions meeting the selection occur, to be randomized.
18. A method of scheduling as recited in claim 15, wherein the given number of matching transactions is a number chosen randomly from an interval of numbers.
19. A method for scheduling contexts in a computer system including at least one processor and a hierarchical memory arranged in a plurality of levels, a plurality of memory transactions occurring within the hierarchical memory while the system operates under a real workload, the method comprising the steps of:
applying a selection function to the plurality of memory transactions as the transactions occur within the memory to determine whether to record state information for any memory transaction meeting the selection function, the state information including context of the memory transaction, the context being taken from one of a plurality of contexts for the plurality of memory transactions;
capturing and recording the state information for any transaction if any transaction meets the selection function;
estimating information relating to memory reference patterns among the transaction contexts by analyzing the recorded information; and
determining a scheduling order for the plurality of contexts based on the estimated memory reference pattern information such that the scheduled contexts have compatible estimated memory reference patterns.
20. A method as recited in claim 19, wherein the step of determining includes determining a scheduling order for each of the plurality of contexts such that the scheduled contexts have minimal memory conflicts.
21. A method as recited in claim 19, wherein the step of determining includes determining a scheduling order for each of the plurality of contexts such that the scheduled contexts have specified memory sharing.
22. A method as recited in claim, 19, wherein the step of determining includes determining a scheduling order for each of the plurality of contexts such that the contexts that underutilize their allocated memory are favored in the scheduling order.
23. A method as recited in claim 19, wherein the memory reference pattern information includes cache memory reference pattern information.
24. A method as recited in claim 19, wherein the step of estimating includes the steps of:
selecting a subset of the recorded state information that is associated with at least one pair of consecutive accesses to a particular cache location of the memory hierarchy, each pair of accesses including a first access to the particular cache location by a first context and a second access to the particular cache location by a second context, wherein the second access is a cache miss; and
statistically estimating metrics indicative of inter-context conflicts for the particular cache location based on the subset of recorded state information.
25. A method as recited in claim 19,
wherein the memory reference pattern information is dynamically estimated while processing the memory transactions; and
wherein the contexts are dynamically scheduled in response to the dynamically estimated resource interactions.
26. A method as recited in claim 19, wherein particular ones of the plurality of contexts are scheduled for concurrent execution on the processor.
27. A method as recited in claim 19, wherein the step of estimating comprises the steps of:
selecting a subset of the recorded state information, the subset including state information associated with at least one pair of consecutive accesses to a particular cache location of the memory hierarchy during an interval time, each pair including a first access and a second access to the particular cache location, wherein the second access is a cache hit; and
determining contexts that usefully shared the particular cache location during the interval time; and
statistically estimating metrics indicative of inter-context sharing of the particular cache location.
28. A method as recited in claim 19, wherein the step of estimating includes the steps of:
selecting a subset of the recorded state information that is associated with at least one pair of consecutive accesses to a particular cache block of the memory hierarchy; and
estimating state transitions in the cache protocol for the particular cache block to determine the estimated memory reference pattern information.
29. A method as recited in claim 19, wherein the step of estimating includes the steps of:
selecting a subset of the recorded state information that is associated with at least one pair of consecutive accesses to a particular cache block of the memory hierarchy; and
statistically estimating information indicative of intra-context or inter-context sharing or conflicts for the particular cache block.
30. A method as recited in claim 19, wherein the selection function is configured to select a plurality of multiple consecutive memory transactions specifying access of a particular region of a particular one of the levels of the memory hierarchy.
31. A method as recited in claim 19,
wherein the selection function is configured to select a plurality of multiple consecutive memory transactions specifying access of a particular memory location of a particular one of the levels of the memory hierarchy; and
wherein the step of estimating includes statistically estimating metrics indicative of conflicts of access to the particular memory location between at least two of the contexts in order to determine the estimated memory reference pattern information.
32. A method as recited in claim 19,
wherein the selection function is configured to select a plurality of multiple consecutive memory transactions specifying access to a particular memory location of a particular one of the levels of the memory hierarchy; and
wherein the step of estimating includes statistically estimating metrics indicative of a sharing of the particular memory location by at least two of the contexts.
Patent Citations (77)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4084231(A) | 1978-04-01 | Capozzi et al. | Applicant |
| US4481583(A) | 1984-11-01 | Mueller | Applicant |
| US4583165(A) | 1986-04-01 | Rosenfeld | Applicant |
| US4590550(A) | 1986-05-01 | Eilert et al. | Applicant |
| US4800521(A) | 1989-01-01 | Carter et al. | Applicant |
| US4821178(A) | 1989-04-01 | Levin et al. | Applicant |
| US4845615(A) | 1989-07-01 | Blasciak | Applicant |
| US5103394(A) | 1992-04-01 | Blasciak | Examiner |
| US5151981(A) | 1992-09-01 | Westcott et al. | Applicant |
| US5268995(A) | 1993-12-01 | Diefendorff et al. | Applicant |
| US5269017(A) | 1993-12-01 | Hayden et al. | Applicant |
| US5287508(A) | 1994-02-01 | Hejna, Jr. et al. | Applicant |
| US5301299(A) | 1994-04-01 | Pawlowski et al. | Applicant |
| US5321836(A) | 1994-06-01 | Crawford et al. | Applicant |
| US5339425(A) | 1994-08-01 | Vanderah et al. | Applicant |
| US5379427(A) | 1995-01-01 | Hiroshima | Examiner |
| US5379432(A) | 1995-01-01 | Orton et al. | Applicant |
| US5388242(A) | 1995-02-01 | Jewett | Applicant |
| US5418973(A) | 1995-05-01 | Ellis et al. | Applicant |
| US5446876(A) | 1995-08-01 | Levine et al. | Applicant |
| US5450349(A) | 1995-09-01 | Brown, III et al. | Applicant |
| US5450586(A) | 1995-09-01 | Kuzara et al. | Applicant |
| US5450609(A) | 1995-09-01 | Schultz et al. | Applicant |
| US5452440(A) | 1995-09-01 | Salsburg | Applicant |
| US5463775(A) | 1995-10-01 | DeWitt et al. | Applicant |
| US5479629(A) | 1995-12-01 | Angjelo et al. | Applicant |
| US5479652(A) | 1995-12-01 | Dreyer et al. | Applicant |
| US5485574(A) | 1996-01-01 | Bolosky et al. | Applicant |
| US5493673(A) | 1996-02-01 | Rindos et al. | Applicant |
| US5500943(A) | 1996-03-01 | Ho et al. | Applicant |
| US5515538(A) | 1996-05-01 | Kleiman | Applicant |
| US5528753(A) | 1996-06-01 | Fortin | Applicant |
| US5530964(A) | 1996-06-01 | Alpert et al. | Applicant |
| US5537541(A) | 1996-07-01 | Wibecan | Applicant |
| US5546593(A) | 1996-08-01 | Kimura et al. | Applicant |
| US5560032(A) | 1996-09-01 | Nguyen et al. | Applicant |
| US5572672(A) | 1996-11-01 | Dewitt et al. | Applicant |
| US5581482(A) | 1996-12-01 | Weidenman et al. | Applicant |
| US5581745(A) | 1996-12-01 | Muraoka et al. | Applicant |
| US5594741(A) | 1997-01-01 | Kinzelman et al. | Applicant |
| US5594864(A) | 1997-01-01 | Trauben | Applicant |
| US5603004(A) | 1997-02-01 | Kurpanek et al. | Applicant |
| US5608892(A) | 1997-03-01 | Wakerly | Applicant |
| US5623627(A) | 1997-04-01 | Witt | Applicant |
| US5630157(A) | 1997-05-01 | Dwyer, III | Applicant |
| US5649136(A) | 1997-07-01 | Shen et al. | Applicant |
| US5651112(A) | 1997-07-01 | Matsuno et al. | Applicant |
| US5691920(A) | 1997-11-01 | Levine et al. | Applicant |
| US5748468(A) | 1998-05-01 | Notenboom et al. | Examiner |
| US5751945(A) | 1998-05-01 | Levine et al. | Applicant |
| US5752031(A) | 1998-05-01 | Cutler et al. | Examiner |
| US5765204(A) | 1998-06-01 | Bakke et al. | Applicant |
| US5768500(A) | 1998-06-01 | Agrawal et al. | Applicant |
| US5774718(A) | 1998-06-01 | Aoshima et al. | Examiner |
| US5799143(A) | 1998-08-01 | Butt et al. | Examiner |
| US5802378(A) | 1998-09-01 | Arndt et al. | Applicant |
| US5802386(A) | 1998-09-01 | Kahle et al. | Applicant |
| US5802593(A) | 1998-09-01 | Grimsrud | Applicant |
| US5809450(A) | 1998-09-01 | Chrysos et al. | Applicant |
| US5854934(A) | 1998-12-01 | Hsu et al. | Applicant |
| US5857097(A) | 1999-01-01 | Henzinger et al. | Applicant |
| US5860018(A) | 1999-01-01 | Panwar | Applicant |
| US5862371(A) | 1999-01-01 | Levine et al. | Applicant |
| US5878208(A) | 1999-03-01 | Levine et al. | Applicant |
| US5884080(A) | 1999-03-01 | Blandy et al. | Applicant |
| US5922070(A) | 1999-07-01 | Swoboda et al. | Applicant |
| US5923872(A) | 1999-07-01 | Chrysos et al. | Applicant |
| US5933626(A) | 1999-08-01 | Mahalingaiah et al. | Applicant |
| US5944841(A) | 1999-08-01 | Christie | Applicant |
| US5964867(A) | 1999-10-01 | Anderson et al. | Applicant |
| US5987598(A) | 1999-11-01 | Levine et al. | Applicant |
| US6000044(A) | 1999-12-01 | Chrysos et al. | Applicant |
| EP86380 | 1983-08-01 | Applicant | |
| EP458127 | 1991-11-01 | Applicant | |
| EP465765 | 1992-01-01 | Applicant | |
| EP689141 | 1995-12-01 | Applicant | |
| EP766177 | 1997-04-01 | Applicant |
Non-Patent Literature (30)
- Abraham et al., Predicting Load Latencies Using Cache Profiling, HPL-94-110, Nov. 1994, copyright Hewlett-Packard Co.Applicant
- Anderson et al., Continuous Profiling: Where Have All the Cycles Gone? To be published in The Proceedings of the 16th ACM Symposium on Operating Systems Principles, copyright 1997 by the Assoc. for Computing Machinery.Applicant
- Ball et al., Efficient Path Profiling, Published in Proceedings of MICRO-29, Dec. 2-4, 1996, in Paris, France, pp. 46-57. Copyright 1996 IEEE.Applicant
- Bershad et al., Avoiding Conflict Misses Dynamically in Large Direct-Mapped Caches, Proceedings of the 6th International Conference on Architectural Support for Programming Languages and Operating Systems, pp. 158-170, Oct. 4-7, 1994.Applicant
- Cohn et al., Hot Cold Optimization of Large Windows/NT Applications, Proceedings fo the 29th Annual International Symposium on Microarchitecture, pp. 80-89, Dec. 1996. Copyright 1996 IEEE.Applicant
- Conte et al., Using Branch Handling Hardware to Support Profile-Driven Optimization, Proceedings of the 1994 27th Annual International Symposium on Microarchitecture, Nov. 30-Dec. 2, 1994, San Jose, Calif.Applicant
- Conte et al., Accurate and Practical Profile-Driven Compilation Using the Profile Buffer, Proceedings of the 29th Annual International Symposium on Microarchitecture, pp. 36-45, Dec. 2-4, 1996.Applicant
- Fisher, J.A., Global Code Generation for Instruction-Level Parallelism: Trace Scheduling-2, Hewlett-Packard Technical Report No. HPL-93-43, Jun., 1993. To be published by Springer-Verlag, London, UK.Applicant
- Horowitz et al., Informing Memory Operations: Providing Memory Performance Feedback in Modern Processors, Proceedings of the 23rd Annual International Symposium on Computer Architecture, pp. 260-270, May 22-24, 1996.Applicant
- Hwu et al., The Superblock: An Effective Technique for VLIW and Superscalar Compilation, Center for Reliable and High-Performance Computing, Univ. of Illinois, Urbana-Champaign, Illinois, 61801.Applicant
- Romer et al., Dynamic Page Mapping Policies for Cache Conflict Resolution on Standard Hardware, Proceedings of the First Symposium for Operating Systems Design and Implementation, pp. 255-266, 1994.Applicant
- Romer et al., Reducing TLB and Memory Overhead Using Online Superpage Promotion, Proceedings of the 22nd Annual International Symposium on Computer Architecture, pp. 176-187, Jun. 1995.Applicant
- Tullsen et al., Exploiting Choice: Instruction Fetch and Issue on an Implementable Simultaneous Multithreading Processor, Proceedings of the 23rd Annual International Symposium on Computer Architecture, Philadelphia, PA, May, 1996.Applicant
- Tullsen et al., Simultaneous Multithreading: Maximizing On-Chip Parallelism, Proceedings of the 22nd Annual International Symposium on Computer Architecture, Santa Margherita Ligure, Italy, Jun. 1995.Applicant
- Verghese et al., Operating System Support for Improving Data Locality on CC-Numa Compute Servers, Proceedings of the 7th International Conference on Architectural Support for Programming Languages and Operating Systems, pp. 279-289, Octtober 1-5, 1996.Applicant
- Young et al., Improving the Accuracy of Static Branch Prediction Using Branch Correlation, Proceedings of the 6th International Conference on Architectural Support for Programming Languages and Operating Systems, pp. 232-241, Oct. 4-7, 1994.Applicant
- IBM Technical Disclosure Bulletin, “Instruction Set Execution Frequency Estimation by of Program Counter Sampling”, Mar. 1991, p. 203.Applicant
- IBM Technical Disclosure Bulletin, “Instruction Match Function for Processor Performance Monitoring”, Dec. 1996, vol. 39, No. 12, pp. 119-121.Applicant
- Kay, et al., “A Fair share Scheduler”, Communication of the ACM, Jan., 1998, vol. 31 No. 1, pp. 44-55.Applicant
- Custer, “Inside Windows NT”, Microsoft Press, Dec. 1993, p. 93.Applicant
- Hellerstein, “Achieving Service Rate Objectives With Decay Usage Scheduling”, IEEE Transactions on Software Engineering, Aug. 1993, vol. 19, No. 8, pp. 813-825.Applicant
- IBM Technical Disclosure Bulletin, “Automatic Program Reordering for Data References in Unified Cache” XP 000587443, Apr., 1996, vol. 39, No. 04, pp. 117-118.Applicant
- Roth, et al., “Performance Monitoring on the PowerPC™ 604 Microprocessor”, XP 000631915, Feb. 10, 1995.Applicant
- Ammons, et al., “Exploiting Hardware Performance Counters with Flow and Context Sensitive Profiling”, ACM, 1997, pp. 85-96.Applicant
- Siegle, et al., “Monitoring Program Behaviour on SUPRENUM”, ACM, 1992, pp. 332-341.Applicant
- IBM Technical Disclosure Bulletin, “Technique For Speculatively Sampling Performance Parameters”, Sep. 1994, vol. 37, No. 9, pp. 589-591.Applicant
- IBM Technical Disclosure Bulletin, “Processor Performance Monitoring With a Depiction of the Efficiency of the Cache Coherency Protocol of a Superscalar Microprocessor in an Symmetric Multiple Processor Environment”, Jan. 1997, vol. 40, No. 01, pp. 79-81.Applicant
- Martonosi, et al., “MemSpy: Analyzing Memory System Bottlenecks in Programs” XP-002123303, Jun. 1992, vol. 20, No. 1, pp. 1-12.Applicant
- Dean. J., et al., “ProfileMe: Hardware Support for Instruction-Level Profiling on Out-of-Order Processors” IEEE Electronic Library, 1997, pp. 292-302.Applicant
- unknown, Webopedia definitions, May 2001, internet, 4 pages: multitasking, multithreadings pipelining and superscalar.Applicant