Relevant bibliographies by topics / Execution Time estimation

Academic literature on the topic 'Execution Time estimation'

Author: Grafiati
Published: 10 March 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Execution Time estimation.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Execution Time estimation"

1

Chirkin, Artem M., Adam S. Z. Belloum, Sergey V. Kovalchuk, Marc X. Makkes, Mikhail A. Melnik, Alexander A. Visheratin, and Denis A. Nasonov. "Execution time estimation for workflow scheduling." Future Generation Computer Systems 75 (October 2017): 376–87. http://dx.doi.org/10.1016/j.future.2017.01.011.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Chirkin, Artem M., and Sergey V. Kovalchuk. "Towards Better Workflow Execution Time Estimation." IERI Procedia 10 (2014): 216–23. http://dx.doi.org/10.1016/j.ieri.2014.09.080.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ramanauskaite, Simona, Asta Slotkiene, Kornelija Tunaityte, Ivan Suzdalev, Andrius Stankevicius, and Saulius Valentinavicius. "Reducing WCET Overestimations in Multi-Thread Loops with Critical Section Usage." Energies 14, no. 6 (March 21, 2021): 1747. http://dx.doi.org/10.3390/en14061747.

Full text
Abstract:
Worst-case execution time (WCET) is an important metric in real-time systems that helps in energy usage modeling and predefined execution time requirement evaluation. While basic timing analysis relies on execution path identification and its length evaluation, multi-thread code with critical section usage brings additional complications and requires analysis of resource-waiting time estimation. In this paper, we solve a problem of worst-case execution time overestimation reduction in situations when multiple threads are executing loops with the same critical section usage in each iteration. The experiment showed the worst-case execution time does not take into account the proportion between computational and critical sections; therefore, we proposed a new worst-case execution time calculation model to reduce the overestimation. The proposed model results prove to reduce the overestimation on average by half in comparison to the theoretical model. Therefore, this leads to more accurate execution time and energy consumption estimation.
APA, Harvard, Vancouver, ISO, and other styles
4

Kong, Liang Liang, Lin Xiang Shi, and Lin Chen. "An Overview of Worst-Case Execution Time Estimation for Embedded Programs." Applied Mechanics and Materials 651-653 (September 2014): 624–29. http://dx.doi.org/10.4028/www.scientific.net/amm.651-653.624.

Full text
Abstract:
Most embedded systems are real-time systems, so real-time is an important performance metric for embedded systems. The worst-case execution time (WCET) estimation for embedded programs could satisfy the requirement of hard real-time evaluation, so it is widely used in embedded systems evaluation. Based on sufficient survey on the progress of WCET estimation around the world, it proposes a new classification of WCET estimation. After introducing the principle of WCET estimation, it mainly demonstrates various types of technologies to estimate WCET and classifies them into two main streams, namely, static and dynamic WCET estimations. Finally, it shows the development of WCET analysis tools.
APA, Harvard, Vancouver, ISO, and other styles
5

Rashid, Muhammad, Syed Abdul Baqi Shah, Muhammad Arif, and Muhammad Kashif. "Determination of Worst-Case Data Using an Adaptive Surrogate Model for Real-Time System." Journal of Circuits, Systems and Computers 29, no. 01 (March 15, 2019): 2050005. http://dx.doi.org/10.1142/s021812662050005x.

Full text
Abstract:
The estimation of worst-case execution time (WCET) is a critical activity in the analysis of real-time systems. Evolutionary algorithms are frequently employed for the determination of worst-case data, used in the estimation of WCET. However, in order to employ an evolutionary algorithm, several executions of the application program are required, either on the target hardware or using its simulator. Multiple executions of the application program consume a huge amount of time. In order to reduce the huge execution time, this paper proposes the use of an adaptive surrogate model. The initial training of surrogate model is performed with a cycle-accurate simulator. The initially trained model is then used to assist the evolutionary algorithm by predicting the execution time of an application program. However, contrary to the direct training approach, the surrogate model in this paper is updated (adapted) during the evolution process. The adaptive training of a surrogate model increases its prediction accuracy and reduces the overall time. The validity of proposed methodology is illustrated with multiple sorting algorithms, extensively used in real-time systems.
APA, Harvard, Vancouver, ISO, and other styles
6

Kozyrev, V. P. "Estimation of the execution time in real-time systems." Programming and Computer Software 42, no. 1 (January 2016): 41–48. http://dx.doi.org/10.1134/s0361768816010059.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Антонюк, В. А., and Н. Г. Михеев. "A parallel program model for execution time estimation." Numerical Methods and Programming (Vychislitel'nye Metody i Programmirovanie), no. 1 (January 31, 2022): 13–28. http://dx.doi.org/10.26089/nummet.v23r102.

Full text
Abstract:
Рассматриваются программы, выполняемые на видеокартах общего назначения и представленные в виде “ядер”, не содержащих циклов с неопределенной продолжительностью. Такие ядра могут быть реализованы, например, с помощью технологий CUDA или OpenCL. Для оценки времени работы подобных программ предложены модели их работы: от совсем “наивной” до более реалистичных. Все они формулируются как матричные выражения в max-plus-алгебре. Programs for general-purpose graphics processing units represented as kernels without indefinite loops are considered in this paper. Such kernels can be implemented by CUDA or OpenCL technologies, for example. For execution time estimation, various models of program execution are introduced: from very “naive” to more reliable. All models are presented in the form of matrix expressions in max-plus algebra.
APA, Harvard, Vancouver, ISO, and other styles
8

Ammar, RA, J. Wang, and HA Sholl. "Graphic modelling technique for software execution time estimation." Information and Software Technology 33, no. 2 (March 1991): 151–56. http://dx.doi.org/10.1016/0950-5849(91)90060-o.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

PURUSHOTHAM, B. V., A. BASU, P. S. KUMAR, and L. M. PATNAIK. "PERFORMANCE ESTIMATION OF LU FACTORISATION ON MESSAGE PASSING MULTIPROCESSORS." Parallel Processing Letters 02, no. 01 (March 1992): 51–60. http://dx.doi.org/10.1142/s0129626492000179.

Full text
Abstract:
The paper proposes an analytical model for estimating the performance of Pipelined Ring algorithm for LU factorisation on any distributed memory message passing multiprocessor. Expressions for parallel execution time and speedup are derived from the computation-communication characteristics of the algorithm. Earlier methods on performance estimation of LU factorisation have been based on determining the number of floating point operations in the best and worst cases. The methodology proposed in this paper follows a different approach and estimates the performance of LU factorisation from a measurement of the execution time of the algorithm on a single processor and from a knowledge of the number of bytes communicated in different steps of the algorithm. The expression for parallel execution time of LU factorisation derived from the analytical model has been validated with experimental values obtained 011 a sixty-four transputer based multiprocessor. Results indicate that the methodology proposed in this paper can be used for estimating the execution time of Pipelined Ring algorithm for LU factorisation on any distributed memory message passing multiprocessor with high accuracy.
APA, Harvard, Vancouver, ISO, and other styles
10

Blondell, Lucy, Mark Z. Kos, John Blangero, and Harald H. H. Göring. "Genz and Mendell-Elston Estimation of the High-Dimensional Multivariate Normal Distribution." Algorithms 14, no. 10 (October 14, 2021): 296. http://dx.doi.org/10.3390/a14100296.

Full text
Abstract:
Statistical analysis of multinomial data in complex datasets often requires estimation of the multivariate normal (mvn) distribution for models in which the dimensionality can easily reach 10–1000 and higher. Few algorithms for estimating the mvn distribution can offer robust and efficient performance over such a range of dimensions. We report a simulation-based comparison of two algorithms for the mvn that are widely used in statistical genetic applications. The venerable Mendell-Elston approximation is fast but execution time increases rapidly with the number of dimensions, estimates are generally biased, and an error bound is lacking. The correlation between variables significantly affects absolute error but not overall execution time. The Monte Carlo-based approach described by Genz returns unbiased and error-bounded estimates, but execution time is more sensitive to the correlation between variables. For ultra-high-dimensional problems, however, the Genz algorithm exhibits better scale characteristics and greater time-weighted efficiency of estimation.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Execution Time estimation"

1

Oliveira, Maroneze André. "Certified Compilation and Worst-Case Execution Time Estimation." Phd thesis, Université Rennes 1, 2014. http://tel.archives-ouvertes.fr/tel-01064869.

Full text
Abstract:
Safety-critical systems - such as electronic flight control systems and nuclear reactor controls - must satisfy strict safety requirements. We are interested here in the application of formal methods - built upon solid mathematical bases - to verify the behavior of safety-critical systems. More specifically, we formally specify our algorithms and then prove them correct using the Coq proof assistant - a program capable of mechanically checking the correctness of our proofs, providing a very high degree of confidence. In this thesis, we apply formal methods to obtain safe Worst-Case Execution Time (WCET) estimations for C programs. The WCET is an important property related to the safety of critical systems, but its estimation requires sophisticated techniques. To guarantee the absence of errors during WCET estimation, we have formally verified a WCET estimation technique based on the combination of two main methods: a loop bound estimation and the WCET estimation via the Implicit Path Enumeration Technique (IPET). The loop bound estimation itself is decomposed in three steps: a program slicing, a value analysis based on abstract interpretation, and a loop bound calculation stage. Each stage has a chapter dedicated to its formal verification. The entire development has been integrated into the formally verified C compiler CompCert. We prove that the final estimation is correct and we evaluate its performances on a set of reference benchmarks. The contributions of this thesis include (a) the formalization of the techniques used to estimate the WCET, (b) the estimation tool itself (obtained from the formalization), and (c) the experimental evaluation. We conclude that our formally verified development obtains interesting results in terms of precision, but it requires special precautions to ensure the proof effort remains manageable. The parallel development of specifications and proofs is essential to this end. Future works include the formalization of hardware cost models, as well as the development of more sophisticated analyses to improve the precision of the estimated WCET.
APA, Harvard, Vancouver, ISO, and other styles
2

Maroneze, André Oliveira. "Certified Compilation and Worst-Case Execution Time Estimation." Thesis, Rennes 1, 2014. http://www.theses.fr/2014REN1S030/document.

Full text
Abstract:
Les systèmes informatiques critiques - tels que les commandes de vol électroniques et le contrôle des centrales nucléaires - doivent répondre à des exigences strictes en termes de sûreté de fonctionnement. Nous nous intéressons ici à l'application de méthodes formelles - ancrées sur de solides bases mathématiques - pour la vérification du comportement des logiciels critiques. Plus particulièrement, nous spécifions formellement nos algorithmes et nous les prouvons corrects, à l'aide de l'assistant à la preuve Coq - un logiciel qui vérifie mécaniquement la correction des preuves effectuées et qui apporte un degré de confiance très élevé. Nous appliquons ici des méthodes formelles à l'estimation du Temps d'Exécution au Pire Cas (plus connu par son abréviation en anglais, WCET) de programmes C. Le WCET est une propriété importante pour la sûreté de fonctionnement des systèmes critiques, mais son estimation exige des analyses sophistiquées. Pour garantir l'absence d'erreurs lors de ces analyses, nous avons formellement vérifié une méthode d'estimation du WCET fondée sur la combinaison de deux techniques principales: une estimation de bornes de boucles et une estimation du WCET via la méthode IPET (Implicit Path Enumeration Technique). L'estimation de bornes de boucles est elle-même décomposée en trois étapes : un découpage de programmes, une analyse de valeurs opérant par interprétation abstraite, et une méthode de calcul de bornes. Chacune de ces étapes est formellement vérifiée dans un chapitre qui lui est dédiée. Le développement a été intégré au compilateur C formellement vérifié CompCert. Nous prouvons que le résultat de l'estimation est correct et nous évaluons ses performances dans des ensembles de benchmarks de référence dans le domaine. Les contributions de cette thèse incluent la formalisation des techniques utilisées pour estimer le WCET, l'outil d'estimation lui-même (obtenu à partir de la formalisation), et l'évaluation expérimentale des résultats. Nous concluons que le développement fondé sur les méthodes formelles permet d'obtenir des résultats intéressants en termes de précision, mais il exige des précautions particulières pour s'assurer que l'effort de preuve reste maîtrisable. Le développement en parallèle des spécifications et des preuves est essentiel à cette fin. Les travaux futurs incluent la formalisation de modèles de coût matériel, ainsi que le développement d'analyses plus sophistiquées pour augmenter la précision du WCET estimé
Safety-critical systems - such as electronic flight control systems and nuclear reactor controls - must satisfy strict safety requirements. We are interested here in the application of formal methods - built upon solid mathematical bases - to verify the behavior of safety-critical systems. More specifically, we formally specify our algorithms and then prove them correct using the Coq proof assistant - a program capable of mechanically checking the correctness of our proofs, providing a very high degree of confidence. In this thesis, we apply formal methods to obtain safe Worst-Case Execution Time (WCET) estimations for C programs. The WCET is an important property related to the safety of critical systems, but its estimation requires sophisticated techniques. To guarantee the absence of errors during WCET estimation, we have formally verified a WCET estimation technique based on the combination of two main methods: a loop bound estimation and the WCET estimation via the Implicit Path Enumeration Technique (IPET). The loop bound estimation itself is decomposed in three steps: a program slicing, a value analysis based on abstract interpretation, and a loop bound calculation stage. Each stage has a chapter dedicated to its formal verification. The entire development has been integrated into the formally verified C compiler CompCert. We prove that the final estimation is correct and we evaluate its performances on a set of reference benchmarks. The contributions of this thesis include (a) the formalization of the techniques used to estimate the WCET, (b) the estimation tool itself (obtained from the formalization), and (c) the experimental evaluation. We conclude that our formally verified development obtains interesting results in terms of precision, but it requires special precautions to ensure the proof effort remains manageable. The parallel development of specifications and proofs is essential to this end. Future works include the formalization of hardware cost models, as well as the development of more sophisticated analyses to improve the precision of the estimated WCET
APA, Harvard, Vancouver, ISO, and other styles
3

Petters, Stefan M. E. "Worst case execution time estimation for advanced processor architectures." [S.l. : s.n.], 2002. http://deposit.ddb.de/cgi-bin/dokserv?idn=965404110.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Edgar, Stewart Frederick. "Estimation of worst-case execution time using statistical analysis." Thesis, University of York, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.434164.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Rau, de Almeida Callou Gustavo. "Energy consumption and execution time estimation of embedded system applications." Universidade Federal de Pernambuco, 2009. https://repositorio.ufpe.br/handle/123456789/1877.

Full text
Abstract:
Made available in DSpace on 2014-06-12T15:52:55Z (GMT). No. of bitstreams: 1 license.txt: 1748 bytes, checksum: 8a4605be74aa9ea9d79846c1fba20a33 (MD5) Previous issue date: 2009
Nos últimos anos, a redução do consumo de energia das aplicações dos sistemas embarcados tem recebido uma grande atenção da comunidade científica, visto que, como o tempo de resposta e o baixo consumo de energia são requisitos conflitantes, esses estudos tornam-se altamente necessários. Nesse contexto, é proposta uma metodologia aplicada nas fases iniciais de projeto para dar suporte às decisões relativas ao consumo de energia e ao desempenho das aplicações desses dispositivos embarcados. Al´em disso, esse trabalho propõe modelos temporizados de eventos discretos que são avaliados através de uma metodologia de simulção estocástica com o objetivo de representar diferentes cenários dos sistemas com facilidade. Dessa forma, para cada cenário ´e preciso decidir o n´umero máximo de simulações e o tamanho de cada rodada da simulação, onde ambos os fatores podem impactar no desempenho para se obter tais estimativas. Essa metodologia considera também, um modelo intermediário que representa a descrição do comportamento do sistema e, é através desse modelo que cenários são analisados. Esse modelo intermediário ´e baseado em redes de Petri coloridas temporizadas que permitem não somente a anáise do software, mas também fornece suporte a um conjunto de métodos bem estabelecidos para verificações de propriedades. É nesse contexto que o software, ALUPAS, responsável por estimar o consumo de energia e o tempo de execução dos sistemas embarcados é apresentado. Por fim, um caso de estudo real, assim como tamb´em, exemplos customizados são apresentados com a finalidade de mostrar a aplicabilidade desse trabalho, onde usuários não especializados não precisam interagir diretamente com o formalismo de redes de Petri.
APA, Harvard, Vancouver, ISO, and other styles
6

Alshamlan, Mohammad. "A Regression Approach to Execution Time Estimation for Programs Running on Multicore Systems." FIU Digital Commons, 2014. http://digitalcommons.fiu.edu/etd/1240.

Full text
Abstract:
Execution time estimation plays an important role in computer system design. It is particularly critical in real-time system design, where to meet a deadline can be as important as to ensure the logical correctness of a program. To accurately estimate the execution time of a program can be extremely challenging, since the execution time of a program varies with inputs, the underlying computer architectures, and run-time dynamics, among other factors. The problem becomes even more challenging as computing systems moving from single core to multi-core platforms, with more hardware resources shared by multiple processing cores. The goal of this research is to investigate the relationship between the execution time of a program and the underlying architecture features (e.g. cache size, associativity, memory latency), as well as its run-time characteristics (e.g. cache miss ratios), and based on which, to estimate its execution time on a multi-core platform based on a regression approach. We developed our test platform based on GEM5, an open-source multi-core cycle-accurate simulation tool set. Our experimental results show clearly the strong relationship of the program execution time to architecture features and run-time characteristics. Moreover, we developed different execution time estimation algorithms using the regression approach for different programs with different software characteristics to improve the estimation accuracy.
APA, Harvard, Vancouver, ISO, and other styles
7

Kumar, Tushar. "Characterizing and controlling program behavior using execution-time variance." Diss., Georgia Institute of Technology, 2016. http://hdl.handle.net/1853/55000.

Full text
Abstract:
Immersive applications, such as computer gaming, computer vision and video codecs, are an important emerging class of applications with QoS requirements that are difficult to characterize and control using traditional methods. This thesis proposes new techniques reliant on execution-time variance to both characterize and control program behavior. The proposed techniques are intended to be broadly applicable to a wide variety of immersive applications and are intended to be easy for programmers to apply without needing to gain specialized expertise. First, we create new QoS controllers that programmers can easily apply to their applications to achieve desired application-specific QoS objectives on any platform or application data-set, provided the programmers verify that their applications satisfy some simple domain requirements specific to immersive applications. The controllers adjust programmer-identified knobs every application frame to effect desired values for programmer-identified QoS metrics. The control techniques are novel in that they do not require the user to provide any kind of application behavior models, and are effective for immersive applications that defy the traditional requirements for feedback controller construction. Second, we create new profiling techniques that provide visibility into the behavior of a large complex application, inferring behavior relationships across application components based on the execution-time variance observed at all levels of granularity of the application functionality. Additionally for immersive applications, some of the most important QoS requirements relate to managing the execution-time variance of key application components, for example, the frame-rate. The profiling techniques not only identify and summarize behavior directly relevant to the QoS aspects related to timing, but also indirectly reveal non-timing related properties of behavior, such as the identification of components that are sensitive to data, or those whose behavior changes based on the call-context.
APA, Harvard, Vancouver, ISO, and other styles
8

Ameerjan, Sharvathul Hasan. "Predicting and Estimating Execution Time of Manual Test Cases - A Case Study in Railway Domain." Thesis, Mälardalens högskola, Akademin för innovation, design och teknik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-35929.

Full text
Abstract:
Testing plays a vital role in the software development life cycle by verifying and validating the software's quality. Since software testing is considered as an expensive activity and due to thelimitations of budget and resources, it is necessary to know the execution time of the test cases for an efficient planning of test-related activities such as test scheduling, prioritizing test cases and monitoring the test progress. In this thesis, an approach is proposed to predict and estimate the execution time of manual test cases written in English natural language. The method uses test specifications and historical data that are available from previously executed test cases. Our approach works by obtaining timing information from each and every step of previously executed test cases. The collected data is used to estimate the execution time for non-executed test cases by mapping them using text from their test specifications. Using natural language processing, texts are extracted from the test specification document and mapped with the obtained timing information. After estimating the time from this mapping, a linear regression analysis is used to predict the execution time of non-executed test cases. A case study has been conducted in Bombardier Transportation (BT) where the proposed method is implemented and the results are validated. The obtained results show that the predicted execution time of studied test cases are close to their actual execution time.
APA, Harvard, Vancouver, ISO, and other styles
9

Dunlop, Alistair Neil. "Estimating the execution time of Fortran programs on distributed memory, parallel computers." Thesis, University of Southampton, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.242759.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Treadwell, Steven B. (Steven Brett). "Estimating task execution delay in a real-time system via static source code analysis." Thesis, Massachusetts Institute of Technology, 1993. http://hdl.handle.net/1721.1/46427.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Execution Time estimation"

1

Laver, Michael, and Ernest Sergenti. Systematically Interrogating Agent-Based Models. Princeton University Press, 2017. http://dx.doi.org/10.23943/princeton/9780691139036.003.0004.

Full text
Abstract:
This chapter develops the methods for designing, executing, and analyzing large suites of computer simulations that generate stable and replicable results. It starts with a discussion of the different methods of experimental design, such as grid sweeping and Monte Carlo parameterization. Next, it demonstrates how to calculate mean estimates of output variables of interest. It does so by first discussing stochastic processes, Markov Chain representations, and model burn-in. It focuses on three stochastic process representations: nonergodic deterministic processes that converge on a single state; nondeterministic stochastic processes for which a time average provides a representative estimate of the output variables; and nondeterministic stochastic processes for which a time average does not provide a representative estimate of the output variables. The estimation strategy employed depends on which stochastic process the simulation follows. Lastly, the chapter presents a set of diagnostic checks used to establish an appropriate sample size for the estimation of the means.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Execution Time estimation"

1

Maiza, Claire, Pascal Raymond, and Christine Rochange. "Estimation of Execution Time and Delays." In Real-Time Systems Scheduling 1, 193–229. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2014. http://dx.doi.org/10.1002/9781118984413.ch5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Roychoudhury, Abhik, Tulika Mitra, and Hemendra Singh Negi. "Analyzing Loop Paths for Execution Time Estimation." In Distributed Computing and Internet Technology, 458–69. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11604655_53.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Denoyelle, Nicolas, Swann Perarnau, Kamil Iskra, and Balazs Gerofi. "Rapid Execution Time Estimation for Heterogeneous Memory Systems Through Differential Tracing." In Lecture Notes in Computer Science, 256–74. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-07312-0_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Mera, Edison, Pedro López-García, Germán Puebla, Manuel Carro, and Manuel Hermenegildo. "Using Combined Static Analysis and Profiling for Logic Program Execution Time Estimation." In Logic Programming, 431–32. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11799573_36.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Yang, Chao-Tung, Po-Chi Shih, Cheng-Fang Lin, Ching-Hsien Hsu, and Kuan-Ching Li. "A Chronological History-Based Execution Time Estimation Model for Embarrassingly Parallel Applications on Grids." In Parallel and Distributed Processing and Applications, 425–30. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11576235_45.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Drozdowski, Maciej. "Estimating Execution Time of Distributed Applications." In Parallel Processing and Applied Mathematics, 137–44. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-48086-2_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Zhou, Wanlei, and Brian Molinari. "A model of execution time estimating for RPC-oriented programs." In Advances in Computing and Information — ICCI '90, 376–84. Berlin, Heidelberg: Springer Berlin Heidelberg, 1990. http://dx.doi.org/10.1007/3-540-53504-7_95.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Mera, Edison, Pedro López-García, Germán Puebla, Manuel Carro, and Manuel V. Hermenegildo. "Combining Static Analysis and Profiling for Estimating Execution Times." In Practical Aspects of Declarative Languages, 140–54. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/978-3-540-69611-7_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Reghenzani, Federico. "Beyond the Traditional Analyses and Resource Management in Real-Time Systems." In Special Topics in Information Technology, 67–77. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-85918-3_6.

Full text
Abstract:
AbstractThe difficulties in estimating the Worst-Case Execution Time (WCET) of applications make the use of modern computing architectures limited in real-time systems. Critical embedded systems require the tasks of hard real-time applications to meet their deadlines, and formal proofs on the validity of this condition are usually required by certification authorities. In the last decade, researchers proposed the use of probabilistic measurement-based methods to estimate the WCET instead of traditional static methods. In this chapter, we summarize recent theoretical and quantitative results on the use of probabilistic approaches to estimate the WCET presented in the PhD thesis of the author, including possible exploitation scenarios, open challenges, and future directions.
APA, Harvard, Vancouver, ISO, and other styles
10

Nakanishi, Tsuneo, Kazuki Joe, Constantine D. Polychronopoulos, Keijiro Araki, and Akira Fukuda. "Estimating minimum execution time of perfect loop nests with loop-carried dependences." In Languages and Compilers for Parallel Computing, 597–99. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/bfb0017281.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Execution Time estimation"

1

Rechberger, Andreas, and Eugen Brenner. "Generalized Execution Time Estimation." In 2018 IEEE 13th International Symposium on Industrial Embedded Systems (SIES). IEEE, 2018. http://dx.doi.org/10.1109/sies.2018.8442107.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

de Carvalho Costa, Rogério Luís, and Pedro Furtado. "Express execution lines and execution time estimation." In the 18th International Database Engineering & Applications Symposium. New York, New York, USA: ACM Press, 2014. http://dx.doi.org/10.1145/2628194.2628219.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Chirkin, Artem M., A. S. Z. Belloum, Sergey V. Kovalchuk, and Marc X. Makkes. "Execution Time Estimation for Workflow Scheduling." In 2014 9th Workshop on Workflows in Support of Large-Scale Science (WORKS). IEEE, 2014. http://dx.doi.org/10.1109/works.2014.11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Susca, Mircea, Vlad Mihaly, Dora Morar, and Petru Dobra. "Worst-Case Execution Time Estimation for Numerical Controllers." In 2022 IEEE International Conference on Automation, Quality and Testing, Robotics (AQTR). IEEE, 2022. http://dx.doi.org/10.1109/aqtr55203.2022.9802027.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Brandolese, C., W. Fornaciari, F. Salice, and D. Sciuto. "Source-level execution time estimation of C programs." In the ninth international symposium. New York, New York, USA: ACM Press, 2001. http://dx.doi.org/10.1145/371636.371694.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Zolda, Michael, Sven Bunte, and Raimund Kirner. "Context-Sensitive Measurement-Based Worst-Case Execution Time Estimation." In 2011 IEEE 17th International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA). IEEE, 2011. http://dx.doi.org/10.1109/rtcsa.2011.73.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Mera, E., P. Lopez, M. Carro, and M. Hermenegildo. "Towards execution time estimation in abstract machine-based languages." In the 10th international ACM SIGPLAN symposium. New York, New York, USA: ACM Press, 2008. http://dx.doi.org/10.1145/1389449.1389471.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kong, L. L., L. Chen, and L. X. Shi. "An overview of task execution time estimation for soft real-time systems." In 3rd International Conference in Mechanical, Information and Industrial Engineering. Southampton, UK: WIT Press, 2015. http://dx.doi.org/10.2495/icmiie140841.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Iverson, M. A., F. Ozguner, and G. J. Follen. "Run-time statistical estimation of task execution times for heterogeneous distributed computing." In Proceedings of 5th IEEE International Symposium on High Performance Distributed Computing. IEEE, 1996. http://dx.doi.org/10.1109/hpdc.1996.546196.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Beltrame, G., C. Brandolese, W. Fornaciari, F. Salice, D. Sciuto, and V. Trianni. "Dynamic modeling of inter-instruction effects for execution time estimation." In the 14th international symposium. New York, New York, USA: ACM Press, 2001. http://dx.doi.org/10.1145/500001.500033.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Execution Time estimation"

1

Tsidylo, Ivan M., Serhiy O. Semerikov, Tetiana I. Gargula, Hanna V. Solonetska, Yaroslav P. Zamora, and Andrey V. Pikilnyak. Simulation of intellectual system for evaluation of multilevel test tasks on the basis of fuzzy logic. CEUR Workshop Proceedings, June 2021. http://dx.doi.org/10.31812/123456789/4370.

Full text
Abstract:
The article describes the stages of modeling an intelligent system for evaluating multilevel test tasks based on fuzzy logic in the MATLAB application package, namely the Fuzzy Logic Toolbox. The analysis of existing approaches to fuzzy assessment of test methods, their advantages and disadvantages is given. The considered methods for assessing students are presented in the general case by two methods: using fuzzy sets and corresponding membership functions; fuzzy estimation method and generalized fuzzy estimation method. In the present work, the Sugeno production model is used as the closest to the natural language. This closeness allows for closer interaction with a subject area expert and build well-understood, easily interpreted inference systems. The structure of a fuzzy system, functions and mechanisms of model building are described. The system is presented in the form of a block diagram of fuzzy logical nodes and consists of four input variables, corresponding to the levels of knowledge assimilation and one initial one. The surface of the response of a fuzzy system reflects the dependence of the final grade on the level of difficulty of the task and the degree of correctness of the task. The structure and functions of the fuzzy system are indicated. The modeled in this way intelligent system for assessing multilevel test tasks based on fuzzy logic makes it possible to take into account the fuzzy characteristics of the test: the level of difficulty of the task, which can be assessed as “easy”, “average", “above average”, “difficult”; the degree of correctness of the task, which can be assessed as “correct”, “partially correct”, “rather correct”, “incorrect”; time allotted for the execution of a test task or test, which can be assessed as “short”, “medium”, “long”, “very long”; the percentage of correctly completed tasks, which can be assessed as “small”, “medium”, “large”, “very large”; the final mark for the test, which can be assessed as “poor”, “satisfactory”, “good”, “excellent”, which are included in the assessment. This approach ensures the maximum consideration of answers to questions of all levels of complexity by formulating a base of inference rules and selection of weighting coefficients when deriving the final estimate. The robustness of the system is achieved by using Gaussian membership functions. The testing of the controller on the test sample brings the functional suitability of the developed model.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Execution Time estimation' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography