Skip to main content
SpringerLink
Log in

Static Analysis of CPU Execution Time Using Implict Path Enumeration Techniques

  • Conference paper
Computational Intelligence and Information Technology (CIIT 2011)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 250))

Abstract

Static Analysis of CPU execution time using implicit path enumeration is an approach where translator predicts the execution time of a program. Basically translator is a System Software which converts computer languages to machine understandable formats. Generally these translators will not estimate the CPU execution time of a given program, because execution time usually depends on execution environment like user inputs, system status, and system architecture and so on. This paper provides approach of to predict the CPU execution time of a given program during translation process.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Healy., C., Whalley, D.: Automatic Detection and Exploitation of Branch Constraints for Timing Analysis. IEEE Transactions on Software Engineering, 763–781 (August 2000)

    Google Scholar 

  2. Engblom, J., Ermedahl, A.: Modeling Complex flows for worst-case execution time analysis. In: Proceedings of 21st IEEE Real Time System Symposium, USA (2000)

    Google Scholar 

  3. Allen, F.E.: Control flow Analysis. In: Proceeding of a Symposium on Compiler Optimization, SIGPLAN Notices, pp.1–19 (July 1970)

    Google Scholar 

  4. Blieberger, J.: Discrete loops and worst case performance, 193–212 (1994)

    Google Scholar 

  5. Worst case Execution time Analyzers, http://www.ieuhsint.cr.in/ait

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Amruta Institute of Engineering & Management Sciences, Bengaluru, 562109, India

    T. K. Manjunath & Chidaravalli Sharmila

Authors
  1. T. K. Manjunath
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chidaravalli Sharmila
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. The IDES, Ouderkerk aan de Amstel, Amsterdam, 1191 GT, Netherlands

    Vinu V Das

  2. College of Engineering, Trivandrum, Kerala, India

    Nessy Thankachan

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Manjunath, T.K., Sharmila, C. (2011). Static Analysis of CPU Execution Time Using Implict Path Enumeration Techniques. In: Das, V.V., Thankachan, N. (eds) Computational Intelligence and Information Technology. CIIT 2011. Communications in Computer and Information Science, vol 250. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25734-6_80

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25734-6_80

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25733-9

  • Online ISBN: 978-3-642-25734-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation