DCC: A Replacement Strategy for DBT System Based on Working Sets

Article Preview

Abstract:

Limited memory resource has always been deemed as the major bottleneck of the program performance, not excepting for dynamic binary translation (DBT) [1] system. However, traditional methods seldom enable this issue mentioned to be solved better due to a fix cache size routinely assigned for codes without considering the program behavior on the fly. Though some prediction methods implemented via LRU [2] histograms can achieve better performance in Operating System, unlike pages in memory, blocks in DBT have unfixed sizes each other, making the prediction imprecise. In this paper, we present a new replace policy named DCC (Dynamic Code Cache) based on working set [3] for bounded code cache, which would dynamically change the size of the code cache and clear the cache according to the information of working set detected. It would sacrifice a small part of the performance to save the space, especially when many great or complicated applications are running on the same physical machine, and the performance might be better under this condition. For Evaluating, we test this strategy on a DBT system named Crossbit [4].We get around 30% space saved up with about 12% running time sacrificed.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

114-118

Citation:

Online since:

December 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Ebcioglu, K., Altman, E., Gschwind, M., Sathaye, S., Dynamic binary translation and optimization, IEEE Transactions on Computers 50(2001) 529 -548.

DOI: 10.1109/12.931892

Google Scholar

[2] W. A. Wong, J. -L. Baer. Modified LRU policies for improving second-level cache behavior, In Proceedings of the 6th International Symposium on High Performance Computer Architecture. (2000) 49-60.

DOI: 10.1109/hpca.2000.824338

Google Scholar

[3] Peter J. Denning, The working set model for program behavior, Communications of the ACM. 11(1968) 323-333.

DOI: 10.1145/363095.363141

Google Scholar

[4] B Yuncheng, L Alei, G Haibing, Design and implementation of crossBit: dynamic binary translation infrastructure, Computer Science (2007).

Google Scholar

[5] Sanjeev Banerjia, Vasanth Bala, Evelyn Duesterwald, U.S. Patent 6,237,065 B1(2001).

Google Scholar

[6] Asit Dan , Don Towsley, An approximate analysis of the LRU and FIFO buffer replacement schemes, ACM SIGMETRICS Performance Evaluation Review, 18 (1990) 143-152.

DOI: 10.1145/98460.98525

Google Scholar