ACM Home Page
Please provide us with feedback. Feedback
Comparing Program Phase Detection Techniques
Full text PdfPdf (238 KB)
Source International Symposium on Microarchitecture archive
Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture table of contents
Page: 217  
Year of Publication: 2003
ISBN:0-7695-2043-X
Authors
Ashutosh S. Dhodapkar  Dept. of Electrical and Computer Engineering, University of Wisconsin - Madison
James E. Smith  Dept. of Electrical and Computer Engineering, University of Wisconsin - Madison
Sponsor
SIGMICRO: ACM Special Interest Group on Microarchitectural Research and Processing
Publisher
IEEE Computer Society  Washington, DC, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 60,   Citation Count: 32
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  

ABSTRACT

Detecting program phase changes accurately is an importantaspect of dynamically adaptable systems. Threedynamic program phase detection techniques are compared- using instruction working sets, basic block vectors(BBV), and conditional branch counts. Because programphases are difficult to define, we compare the techniquesusing a variety of metrics.BBV techniques perform better than the other techniquesproviding higher sensitivity and more stablephases. However, the instruction working set techniqueyields 30% longer phases than the BBV method, althoughthere is less stability within phases. On average, the methodsagree on phase changes 85% of the time. Of the 15%of time they disagree, the BBV method is more efficient atdetecting performance changes. The conditional branchcounter technique provides good sensitivity, but is lesseffective at detecting major phase changes. Nevertheless,the branch counter technique correlates 83% of the timewith the BBV based technique. As an auxiliary result, weshow that techniques based on procedure granularities donot perform as well as those based on instruction or basicblock granularities. This is mainly due to their inability todetect changes within procedures.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
4
5
6
7
8
9
 
10
[10] J. E. Smith, and A. S. Dhodapkar, "Dynamic microarchitecture adaptation via co-designed virtual machines," in 2002 Intl. Solid State Circuits Conference, Digest of Technical Papers, pp. 198-199, Feb. 2002.
11
12
13
14
 
15
[15] http://java.sun.com
 
16
[16] http://www.microsoft.com/net
 
17
[17] Timothy Sherwood, and Brad Calder, "Time varying behavior of programs," UC San Diego Technical Report UCSD- CS99-630, Aug. 1999.
 
18
[18] J. Henning, "SPEC CPU2000 memory footprint," online at http://www.spec.org/cpu2000/analysis/memory
19
 
20
21
 
22
[22] M. J. Hind, V. T. Rajan, and P. F. Sweeney, "Phase shift detection: a problem classification," IBM Research Report RC-22887, Aug. 2003.
23
 
24
[24] D. Burger and T. Austin, "The SimpleScalar tool set version 2.0," University of Wisconsin-Madison Computer Sciences Department Technical Report #1342, June 1997.
 
25
 
26
[26] M. S. Pepe, "The statistical evaluation of medical tests for classification and prediction," Oxford University Press, 2003.

CITED BY  32
 
 
 
 
 
 
 
 
 
 

Collaborative Colleagues:
Ashutosh S. Dhodapkar: colleagues
James E. Smith: colleagues

Peer to Peer - Readers of this Article have also read: