Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article
Public Access

Call sequence prediction through probabilistic calling automata

Published: 15 October 2014 Publication History

Abstract

Predicting a sequence of upcoming function calls is important for optimizing programs written in modern managed languages (e.g., Java, Javascript, C#.) Existing function call predictions are mainly built on statistical patterns, suitable for predicting a single call but not a sequence of calls. This paper presents a new way to enable call sequence prediction, which exploits program structures through Probabilistic Calling Automata (PCA), a new program representation that captures both the inherent ensuing relations among function calls, and the probabilistic nature of execution paths. It shows that PCA-based prediction outperforms existing predictions, yielding substantial speedup when being applied to guide Just-In-Time compilation. By enabling accurate, efficient call sequence prediction for the first time, PCA-based predictors open up many new opportunities for dynamic program optimizations.

References

[1]
Jikes rvm. http://jikesrvm.org.
[2]
Rajeev Alur, Michael Benedikt, Kousha Etessami, Patrice Godefroid, Thomas Reps, and Mihalis Yannakakis. Analysis of recursive state machines. ACM Trans. Program. Lang. Syst., 27(4):786--818, July 2005.
[3]
G. Ammons, T. Ball, and J. R. Larus. Exploiting hardware performance counters with flow and context sensitive profiling. In PLDI, 1997.
[4]
M. Annavaram, J. M. Patel, and E. S. Davidson. Call graph prefetching for database applications. ACM Transactions on Computer Systems, 21(4), 2003.
[5]
M. Arnold, A. Welc, and V.T. Rajan. Improving virtual machine performance using a cross-run profile repository. In OOPSLA, pages 297--311, 2005.
[6]
D. F. Bacon and P. Sweeney. Fast static analysis of c++ virtual function calls. In OOPSLA, 1996.
[7]
S. M. Blackburn et al. The DaCapo benchmarks: Java benchmarking development and analysis. In OOPSLA, 2006.
[8]
M. Bond and K. S. McKinley. Probabilistic calling context. In OOPSLA, 2007.
[9]
M. D. Bond, K. E. Coons, and K. S. McKinley. Pacer: Proportional detection of data races. In PLDI, 2010.
[10]
Toms Brzdil, Javier Esparza, Stefan Kiefer, and Antonn Kucera. Analyzing probabilistic pushdown automata. Formal Methods in System Design, 43(2):124--163, 2013.
[11]
D. Callahan. The program summary graph and flow-sensitive interprocedural data flow analysis. In PLDI, 1988.
[12]
V. Chandola, A. Banerjee, and V. Kumar. Anomaly detection: A survey. ACM Comput. Surv., 41(3), 2009.
[13]
W. Chen, S. Bhansali, T. M. Chilimbi, X. Gao, and W. Chuang. Profile-guided proactive garbage collection for locality optimization. In Proceedings of PLDI, pages 332--340, 2006.
[14]
T. M. Chilimbi and M. Hirzel. Dynamic hot data stream prefetching for general-purpose programs. In PLDI, Berlin, Germany, June 2002.
[15]
Y. Ding, M. Zhou, Z. Zhao, S. Eisenstat, and X. Shen. Finding the limit: Examining the potential and complexity of compilation scheduling for jit-based runtime systems. In ASPLOS, pages 607--622, 2014.
[16]
A. Guha, K. Hazelwood, and M. L. Soffa. Balancing memory and performance through selective flushing of software code caches. In CASES, 2010.
[17]
T. Hastie, R. Tibshirani, and J. Friedman. The elements of statistical learning. Springer, 2001.
[18]
S. Hu and J. E. Smith. Reducing startup time in co-designed virtual machines. In ISCA, 2006.
[19]
Jikes rvm project and status. http://http://jikesrvm.org/Project+Status.
[20]
G. Jin, A. V. Thakur, B. Liblit, and S. Lu. Instrumentation and sampling strategies for cooperative concurrency bug isolation. In OOPSLA, 2010.
[21]
P. Laird and R. Saul. Discrete sequence prediction and its applications. Machine Learning, 15:43--68, 1994.
[22]
J. R. Larus. Whole program paths. In PLDI, Atlanta, Georgia, May 1999.
[23]
W. Lee, S. J. Stolfo, and P. K. Chan. Learning patterns from unix process execution traces for intrusion detection. In AAAI Workshop on AI Approaches to Fraud Detection and Risk Management, 1997.
[24]
B. Liblit, A. Aiken, A. X. Zheng, and M. I. Jordan. Bug isolation via remote program sampling. In PLDI, 2003.
[25]
B. Livshits and E. Kiciman. Doloto: code splitting for network-bound web 2.0 applications. In Symp. on the Foundations of Software Engineering, 2008.
[26]
Mehryar Mohri. Finite-state transducers in language and speech processing. Computational Linguistics, 23:269--311, 1997.
[27]
P. Nagpurkar, H. Cain, M. Serrano, J. Choi, and C. Krintz. Call-chain software instruction prefetching in j2ee server applications. In PACT, 2007.
[28]
C. J. Pickett, C. Verbrugge, and A. Kielstra. Adaptive software return value prediction. Technical Report, McGill University, 2009.
[29]
M. Burtscher and B. G. Zorn. Prediction outcome history-based confidence estimation for load value prediction. Journal of Instruction-Level Parallelism. 1999.
[30]
J. Porto, G. Araujo, E. Borin, and Y. Wu. Trace execution automata in dynamic binary translation. In Proceedings of 3rd Workshop on Architectural and Microarchitectural Support for Binary Translation, 2010.
[31]
D. Powers. Evaluation: From precision, recall and f-factor to roc, informedness, markedness and correlation. Journal of Machine Learning Technologies, pages 37--63, 2007.
[32]
A. Sarimbekov, A. Sewe, W. Binder, P. Moret, M. Schoeberl, and M. Mezini. Portable and accurate collection of calling-context- sensitive bytecode metrics for the java virtual machine. In PPPJ, 2011.
[33]
A. Wasylkowski, A. Zeller, and C. Lindig. Detecting object usage anomalies. In Symp. on the Foundations of Software Engineering, 2007.
[34]
R. William. Dynamic history predictive compression. Information Systems, 13(1):129--140, 1988.
[35]
W. M. Summer, Y. Zheng, D. Weeratunge, and X. Zhang. Precise calling context encoding. In ICSE, 2010.
[36]
Y. Wu and J. Larus. Static branch frequency and program profile analysis. In Proceedings of the International Symposium on Microarchitecture, 1994.

Index Terms

  1. Call sequence prediction through probabilistic calling automata

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM SIGPLAN Notices
    ACM SIGPLAN Notices  Volume 49, Issue 10
    OOPSLA '14
    October 2014
    907 pages
    ISSN:0362-1340
    EISSN:1558-1160
    DOI:10.1145/2714064
    • Editor:
    • Andy Gill
    Issue’s Table of Contents
    • cover image ACM Conferences
      OOPSLA '14: Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications
      October 2014
      946 pages
      ISBN:9781450325851
      DOI:10.1145/2660193
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 15 October 2014
    Published in SIGPLAN Volume 49, Issue 10

    Check for updates

    Author Tags

    1. call sequence prediction
    2. dynamic optimizations
    3. function call
    4. just-in-time compilation
    5. parallel compilation
    6. probabilistic calling automata

    Qualifiers

    • Research-article

    Funding Sources

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)97
    • Downloads (Last 6 weeks)28
    Reflects downloads up to 12 Nov 2024

    Other Metrics

    Citations

    View Options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Get Access

    Login options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media