Gloy, N. Code Placement using Temporal Profile Information. PhD thesis, Harvard University, 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Microarchitectural and Compile-Time Optimizations for.. - Kalamatianos (2000) (1 citation) (Correct)
....algorithm, and initiates further modifications in the main memory placement step in order to keep the working set of the application within reasonable limits. 3. 1 Related Work To the best of our knowledge, code placement for a memory hierarchy of multiple levels has only recently been considered [99, 103]. The work in [103] is an extension of the algorithm presented in [55] Code is placed in a multiple level cache hierarchy in a conflict free manner. The main idea is to extend a cache conscious placement algorithm used for a single cache to multiple caches. The authors in [99] use profile ....
....further modifications in the main memory placement step in order to keep the working set of the application within reasonable limits. 3. 1 Related Work To the best of our knowledge, code placement for a memory hierarchy of multiple levels has only recently been considered [99, 103] The work in [103] is an extension of the algorithm presented in [55] Code is placed in a multiple level cache hierarchy in a conflict free manner. The main idea is to extend a cache conscious placement algorithm used for a single cache to multiple caches. The authors in [99] use profile information, build a graph ....
[Article contains additional citation context not shown here]
N. Gloy. Code Placement using Temporal Profile Information. PhD thesis, Harvard University, 1998.
Accurate Simulation and Evaluation of Code Reordering - Kalamatianos, Kaeli (2000) (Correct)
.... 7] TRG in [6, 1] and CMG in [11] Although the CG exploits interaction between procedures that directly call each other, the TRG and the CMG exploit temporal interaction between procedures that lie even further apart in the call chain, or even between procedures that lie in different call chains [5]. To capture this interaction, constructing a TRG or a CMG is more computationally intensive than a CG. After building these graphs, a pruning step is applied on the graph edges. The idea is to remove those edges containing minimal information. Every procedure that has at least one edge after ....
....cache line coloring [7] Recently, we have extended this approach to multiple levels of caches. Basically, the coloring step of two popular procedures has to place procedures into multiple cache address spaces with the goal of minimizing the conflicts between the two procedures on all cache levels [5]. Reordering for single or multiple cache levels is controlled by a parameter passed to the coloring routine. Placing procedures in the cache is equivalent to assigning a starting cache set to every procedure. Notice that unpopular or unactivated procedures are not mapped into the cache. The last ....
N. Gloy. Code Placement using Temporal Profile Information. PhD thesis, Harvard University, 1998.
A First Look at the Interplay of Code Reordering and - Configurable Cach Es (Correct)
No context found.
Gloy, N. Code Placement using Temporal Profile Information. PhD thesis, Harvard University, 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC