By Topic

Algorithm classification using Worst-Case Execution Time

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Mehrotra, M. ; Dept. of Comput. Sci. & Eng., Jaypee Inst. of Inf. Technol. Univ., Noida, India ; Goel, A. ; Agarwal, N. ; Hima Bindu, M.
more authors

Problems in computer science require some time to produce an output. Some can be executed in few seconds or minutes. Others require hours, days or even centuries to produce an output. In this paper, we propose a technique to classify a problem in any of the above two categories without executing the input source code for a large test case. First, a control flow graph is generated from the Intermediate code of the input source code. Then, this CFG is reduced and a set of linear equations is framed. The solution of these linear equations along with execution count of the loops is used to determine worst case execution time. This WCET is compared with a threshold to classify the problem as either having a definite or indefinite execution time. The main advantage of this approach is that control flow analysis is automatic and user annotations in terms of markers and scope are not required in the input code.

Published in:

Computer Science and Information Technology, 2009. ICCSIT 2009. 2nd IEEE International Conference on

Date of Conference:

8-11 Aug. 2009