All-window data liveness

Authors:
Pengcheng Li;Chen Ding
Affiliations:
University of Rochester, Rochester, NY;University of Rochester, Rochester, NY
Venue:
Proceedings of the ACM SIGPLAN Workshop on Memory Systems Performance and Correctness
Year:
2013

Citing 5
Cited 0

Generalized working sets for segment reference strings

Communications of the ACM
Generating object lifetime traces with Merlin

ACM Transactions on Programming Languages and Systems (TOPLAS)
The DaCapo benchmarks: java benchmarking development and analysis

Proceedings of the 21st annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications
Design space exploration of memory model for heterogeneous computing

Proceedings of the 2012 ACM SIGPLAN Workshop on Memory Systems Performance and Correctness
Elephant tracks: portable production of complete and precise gc traces

Proceedings of the 2013 international symposium on memory management

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a new metric called all-window liveness, which is the average amount of live data in all time windows of a given length. The paper gives a linear-time algorithm to compute the average liveness for all window lengths and discusses potential uses of the new metric.