Trace-Driven Memory Simulation: A Survey

Uhlig, Richard; Mudge, Trevor

doi:10.1007/3-540-46506-5_5

Cited by 78 publications

(92 citation statements)

References 50 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The methodology that we used is based on trace-driven simulation [19,31,36,47] and on the simulation of the three kernel activities that most affect performance: system calls, process scheduling, and virtual-to-physical address translation.…”

Section: Methodology and Workloadmentioning

confidence: 99%

Reducing coherence overhead and boosting performance of high-end SMP multiprocessors running a DSS workload

Foglia

Giorgi

Prete

2005

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

Section: Methodology and Workloadmentioning

confidence: 99%

Reducing coherence overhead and boosting performance of high-end SMP multiprocessors running a DSS workload

Foglia

Giorgi

Prete

2005

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

“…Computational approaches include cache simulation [26], in which the full trace is used to produce cache statistics such as hit rates, essentially summarizing the trace by a much smaller set of measurements. Along these same lines, traces can be manipulated in such a way as to reduce their size without affecting the results they produce in a cache simulator; such approaches give either exact [1,18] or approximate [8,15,23] results.…”

Section: Related Workmentioning

confidence: 99%

Topological analysis and visualization of cyclical behavior in memory reference traces

Choudhury

Wang

Rosen

et al. 2012

2012 IEEE Pacific Visualization Symposium

View full text Add to dashboard Cite

(a) (b) Figure 1: One circular parameterization of the memory behavior of bubble sort (box (a)) morphing into another (box (b)), highlighting both their similarities and differences, and giving two views of the recurrent nature of the program. ABSTRACTWe demonstrate the application of topological analysis techniques to the rather unexpected domain of software visualization. We collect a memory reference trace from a running program, recasting the linear flow of trace records as a high-dimensional point cloud in a metric space. We use topological persistence to automatically detect significant circular structures in the point cloud, which represent recurrent or cyclical runtime program behaviors. We visualize such recurrences using radial plots to display their time evolution, offering multi-scale visual insights, and detecting potential candidates for memory performance optimization. We then present several case studies to demonstrate some key insights obtained using our techniques.

show abstract

“…The methodology used in our analysis is based both on trace-driven simulation [24], [19], [35], and on the simulation of the three kernel activities that most affect performance: system calls, process scheduling, and virtual-to-physical address translation. We used the Trace Factory environment [8].…”

Section: Methodsmentioning

confidence: 99%

Evaluating optimizations for multiprocessors e-commerce server running TPC-W workload

Foglia

Giorgi

Prete

Proceedings of the 34th Annual Hawaii International Conference on System Sciences

View full text Add to dashboard Cite

show abstract

Trace-Driven Memory Simulation: A Survey

Cited by 78 publications

References 50 publications

Reducing coherence overhead and boosting performance of high-end SMP multiprocessors running a DSS workload

Reducing coherence overhead and boosting performance of high-end SMP multiprocessors running a DSS workload

Topological analysis and visualization of cyclical behavior in memory reference traces

Evaluating optimizations for multiprocessors e-commerce server running TPC-W workload

Contact Info

Product

Resources

About