Quantifying the Common Computational Problems in Contemporary Applications

Quantifying the common computational problems in contemporary applications

To quantify the potential opportunities for algorithmic choice, this work presents a quantitative characterization of the constituent computational problems (CPs) in contemporary applications. The feasibility of identifying well- defined CPs, occupying a significant portion of execution time, is stu…

IEEE Xplore

Abstract:

To quantify the potential opportunities for algorithmic choice, this work presents a quantitative characterization of the constituent computational problems (CPs) in contemporary applications. The feasibility of identifying well- defined CPs, occupying a significant portion of execution time, is studied. This is augmented by insight into the properties permitting separation of problem definitions from algorithms for their solution. It is conjectured that, since a large fraction (55 %) of the analyzed body of existing software was identified as CPs, algorithmic choice may be a viable approach.

Cite As:

R. Jongerius, P. Stanley-Marbell and H. Corporaal, "Quantifying the common computational problems in contemporary applications," 2011 IEEE International Symposium on Workload Characterization (IISWC), 2011, pp. 74-74, doi: 10.1109/IISWC.2011.6114199

Bibtex:

@INPROCEEDINGS{6114199,  
author={Jongerius, Rik and Stanley-Marbell, Phillip and Corporaal, Henk},  booktitle={2011 IEEE International Symposium on Workload Characterization (IISWC)},   
title={Quantifying the common computational problems in contemporary applications},   
year={2011}, 
pages={74-74},  
doi={10.1109/IISWC.2011.6114199}
}