Bibliographies thématiques / Execution Time estimation / Articles de revues

Articles de revues sur le sujet « Execution Time estimation »

Pour voir les autres types de publications sur ce sujet consultez le lien suivant : Execution Time estimation.
Auteur : Grafiati
Publié le 10 mars 2023

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Consultez les 50 meilleurs articles de revues pour votre recherche sur le sujet « Execution Time estimation ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Parcourez les articles de revues sur diverses disciplines et organisez correctement votre bibliographie.

1

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

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Chirkin, Artem M., et 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.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

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

Texte intégral
Résumé :
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.
Styles APA, Harvard, Vancouver, ISO, etc.
4

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

Texte intégral
Résumé :
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.
Styles APA, Harvard, Vancouver, ISO, etc.
5

Rashid, Muhammad, Syed Abdul Baqi Shah, Muhammad Arif et 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 (15 mars 2019) : 2050005. http://dx.doi.org/10.1142/s021812662050005x.

Texte intégral
Résumé :
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.
Styles APA, Harvard, Vancouver, ISO, etc.
6

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

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

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

Texte intégral
Résumé :
Рассматриваются программы, выполняемые на видеокартах общего назначения и представленные в виде “ядер”, не содержащих циклов с неопределенной продолжительностью. Такие ядра могут быть реализованы, например, с помощью технологий 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.
Styles APA, Harvard, Vancouver, ISO, etc.
8

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

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

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

Texte intégral
Résumé :
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.
Styles APA, Harvard, Vancouver, ISO, etc.
10

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

Texte intégral
Résumé :
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.
Styles APA, Harvard, Vancouver, ISO, etc.
11

Kagaris, Dimitri, Sourav Dutta et Stijn Eyerman. « Execution Time Estimation of Multithreaded Programs With Critical Sections ». IEEE Transactions on Parallel and Distributed Systems 33, no 10 (1 octobre 2022) : 2470–81. http://dx.doi.org/10.1109/tpds.2022.3143455.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
12

Balakin, A., et V. Kopp. « Estimation of execution time for multi-stage control operations ». Journal of Physics : Conference Series 1582 (juillet 2020) : 012008. http://dx.doi.org/10.1088/1742-6596/1582/1/012008.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
13

Altenbernd, Peter, Jan Gustafsson, Björn Lisper et Friedhelm Stappert. « Early execution time-estimation through automatically generated timing models ». Real-Time Systems 52, no 6 (5 février 2016) : 731–60. http://dx.doi.org/10.1007/s11241-016-9250-7.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
14

JEANNOT, EMMANUEL, KEITH SEYMOUR, ASYM YARKHAN et JACK J. DONGARRA. « IMPROVED RUNTIME AND TRANSFER TIME PREDICTION MECHANISMS IN A NETWORK ENABLED SERVERS MIDDLEWARE ». Parallel Processing Letters 17, no 01 (mars 2007) : 47–59. http://dx.doi.org/10.1142/s0129626407002867.

Texte intégral
Résumé :
In this paper we address the problem of accurately estimating the runtime and communication time of a client request in a Network Enabled Server (NES) middleware such as GridSolve. We use a template based model for the runtime estimation and a client-server communication test for the transfer time estimation. We implement these two mechanisms in GridSolve and test them on a real testbed. Experiments show that they allow for significant improvement in terms of client execution time on various scenarios.
Styles APA, Harvard, Vancouver, ISO, etc.
15

Gonopolskiy, Mark G., et Alevtina B. Glonina. « Research and Development of an Algorithm for the Response Time Estimation in Multiprocessor Systems Under the Interval Uncertainty of the Tasks Execution Times ». Modeling and Analysis of Information Systems 27, no 2 (24 juin 2020) : 218–33. http://dx.doi.org/10.18255/1818-1015-2020-2-218-233.

Texte intégral
Résumé :
The paper presents an algorithm for the worst case response time (WCRT) estimation for multiprocessor systems with fixed-priority preemptive schedulers and the interval uncertainty of tasks execution times. Each task has a unique priority within its processor, a period, an execution time interval [BCET, WCET] and can have data dependency on other tasks. If a decrease in the execution time of the task A can lead to an increase in the response time of the another task B, then task A is called an anomalous task for task B. According to the chosen approach, in order to estimate a task’s WCRT, two steps should be performed. The first one is to construct a set of anomalous tasks using the proposed algorithm for the given task. The paper provides the algorithm and the proof of its correctness. The second one is to find the WCRT estimation using a genetic algorithm. The proposed approach has been implemented software as a program in Python3. A set of experiments have been carried out in order to compare the proposed method in terms of precision and speed with two well-known WCRT estimating methods: the method that does not take into account interval uncertainty (assuming that the execution time of a given task is equal to WCET) and the brute force method. The results of the experiments have shown that, in contrast to the brute force method, the proposed method is applicable to the analysis of the real scale computing systems and also allows to achieve greater precision than the method that does not take into account interval uncertainty.
Styles APA, Harvard, Vancouver, ISO, etc.
16

Wess, Matthias, Matvey Ivanov, Christoph Unger, Anvesh Nookala, Alexander Wendt et Axel Jantsch. « ANNETTE : Accurate Neural Network Execution Time Estimation With Stacked Models ». IEEE Access 9 (2021) : 3545–56. http://dx.doi.org/10.1109/access.2020.3047259.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
17

Callou, Gustavo, Paulo Maciel, Eduardo Tavares, Ermeson Andrade, Bruno Nogueira, Carlos Araujo et Paulo Cunha. « Energy consumption and execution time estimation of embedded system applications ». Microprocessors and Microsystems 35, no 4 (juin 2011) : 426–40. http://dx.doi.org/10.1016/j.micpro.2010.08.006.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
18

Braun, Mitchell, Yujiao Cheng et Masayoshi Tomizuka. « Human-Aware Robot Task Planning with Robot Execution Time Estimation ». IFAC-PapersOnLine 55, no 41 (2022) : 181–86. http://dx.doi.org/10.1016/j.ifacol.2023.01.123.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
19

Gamino del Río, Iván, Agustín Martínez Hellín, Óscar R. Polo, Miguel Jiménez Arribas, Pablo Parra, Antonio da Silva, Jonatan Sánchez et Sebastián Sánchez. « A RISC-V Processor Design for Transparent Tracing ». Electronics 9, no 11 (7 novembre 2020) : 1873. http://dx.doi.org/10.3390/electronics9111873.

Texte intégral
Résumé :
Code instrumentation enables the observability of an embedded software system during its execution. A usage example of code instrumentation is the estimation of “worst-case execution time” using hybrid analysis. This analysis combines static code analysis with measurements of the execution time on the deployment platform. Static analysis of source code determines where to insert the tracing instructions, so that later, the execution time can be captured using a logic analyser. The main drawback of this technique is the overhead introduced by the execution of trace instructions. This paper proposes a modification of the architecture of a RISC pipelined processor that eliminates the execution time overhead introduced by the code instrumentation. In this way, it allows the tracing to be non-intrusive, since the sequence and execution times of the program under analysis are not modified by the introduction of traces. As a use case of the proposed solution, a processor, based on RISC-V architecture, was implemented using VHDL language. The processor, synthesized on a FPGA, was used to execute and evaluate a set of examples of instrumented code generated by a “worst-case execution time” estimation tool. The results validate that the proposed architecture executes the instrumented code without overhead.
Styles APA, Harvard, Vancouver, ISO, etc.
20

Nazari, Mohammad Ali, Andrea Caria et Mojtaba Soltanlou. « Time for action versus action in time : time estimation differs between motor preparation and execution ». Journal of Cognitive Psychology 29, no 2 (16 septembre 2016) : 129–36. http://dx.doi.org/10.1080/20445911.2016.1232724.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
21

Ivanovic, Veselin, Nevena Radovic, Marko Bozovic et Zdravko Uskokovic. « Enhancing performance of the space/spatial-frequency optimal filter based on the pipelining technique application ». Facta universitatis - series : Electronics and Energetics 26, no 2 (2013) : 87–98. http://dx.doi.org/10.2298/fuee1302087i.

Texte intégral
Résumé :
Possibility of the pipelining technique application in a highly nonstationary two-dimensional (2D) frequency-modulated (FM) signals estimation is considered in this paper. The considered design technique allows the implemented filter to overlape in execution unconditional steps performing in neighboring space/spatial-frequency (S/SF) instants and, consequently, to significantly improve execution time of the 2D nonstationary Wiener filter based on the 2D cross-terms-free Wigner distribution (2D CTFWD) real-time implementation and on the 2D CTFWD-related local frequency (LF) estimation in a noisy environment. In this way, the improvement in execution time corresponding to the one clock cycle (CLK) by a S/SF point is achieved, which means that the improvement by a S/SF point can reach 50% in most S/SF points. The design and its improvement in execution time are tested on the monocomponent and multicomponent highly nonstationary noisy signals.
Styles APA, Harvard, Vancouver, ISO, etc.
22

Pellegrinelli, Stefania, et Nicola Pedrocchi. « Estimation of robot execution time for close proximity human-robot collaboration ». Integrated Computer-Aided Engineering 25, no 1 (11 décembre 2017) : 81–96. http://dx.doi.org/10.3233/ica-170558.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
23

Radwal, Babita Rani, et Sanjay Kumar. « Dynamic Scheduling Algorithm With Task Execution Time Estimation Method In Cloud ». International Journal of Computer Sciences and Engineering 6, no 3 (30 mars 2018) : 375–79. http://dx.doi.org/10.26438/ijcse/v6i3.375379.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
24

Tahvili, Sahar, Wasif Afzal, Mehrdad Saadatmand, Markus Bohlin et Sharvathul Hasan Ameerjan. « ESPRET : A tool for execution time estimation of manual test cases ». Journal of Systems and Software 146 (décembre 2018) : 26–41. http://dx.doi.org/10.1016/j.jss.2018.09.003.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
25

Díaz, Álvaro, Javier González-Bayon et Pablo Sánchez. « Security Estimation in Wireless Sensor Network Simulator ». Journal of Circuits, Systems and Computers 25, no 07 (22 avril 2016) : 1650067. http://dx.doi.org/10.1142/s0218126616500675.

Texte intégral
Résumé :
Sensor nodes are low-power and low-cost devices with the requirement of a long autonomous lifetime. Therefore, the nodes have to use the available power carefully and avoid expensive computations or radio transmissions. In addition, as some wireless sensor networks (WSNs) process sensitive data, selecting a security protocol is vital. Cryptographic methods used in WSNs should fulfill the constraints of sensor nodes and should be evaluated for their security and power consumption. WSN engineers use several metrics to obtain estimations prior to network deployment. These metrics are usually related to power and execution time estimation. However, security is a feature that cannot be estimated and it is either “active” or “inactive”, with no possibility of introducing intermediate security levels. This lack of flexibility is a disadvantage in real deployments where different operation modes with different security and power specifications are often needed. This paper proposes including a new security estimation metric in a previously proposed framework for WSN simulation and embedded software (SW) performance analysis. This metric is called Security Estimation Metric (SEM) and it provides information about the security encryption used in WSN transmissions. Results show that the metric improves flexibility, granularity and execution time compared to other cryptographic tests.
Styles APA, Harvard, Vancouver, ISO, etc.
26

Liu, Qi, Weidong Cai, Dandan Jin, Jian Shen, Zhangjie Fu, Xiaodong Liu et Nigel Linge. « Estimation Accuracy on Execution Time of Run-Time Tasks in a Heterogeneous Distributed Environment ». Sensors 16, no 9 (30 août 2016) : 1386. http://dx.doi.org/10.3390/s16091386.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
27

Fusi, Matteo, Fabio Mazzocchetti, Albert Farres, Leonidas Kosmidis, Ramon Canal, Francisco J. Cazorla et Jaume Abella. « On the Use of Probabilistic Worst-Case Execution Time Estimation for Parallel Applications in High Performance Systems ». Mathematics 8, no 3 (1 mars 2020) : 314. http://dx.doi.org/10.3390/math8030314.

Texte intégral
Résumé :
Some high performance computing (HPC) applications exhibit increasing real-time requirements, which call for effective means to predict their high execution times distribution. This is a new challenge for HPC applications but a well-known problem for real-time embedded applications where solutions already exist, although they target low-performance systems running single-threaded applications. In this paper, we show how some performance validation and measurement-based practices for real-time execution time prediction can be leveraged in the context of HPC applications on high-performance platforms, thus enabling reliable means to obtain real-time guarantees for those applications. In particular, the proposed methodology uses coordinately techniques that randomly explore potential timing behavior of the application together with Extreme Value Theory (EVT) to predict rare (and high) execution times to, eventually, derive probabilistic Worst-Case Execution Time (pWCET) curves. We demonstrate the effectiveness of this approach for an acoustic wave inversion application used for geophysical exploration.
Styles APA, Harvard, Vancouver, ISO, etc.
28

Tavares, Anderson R., Gianlucca Lodron Zuin, Héctor Azpúrua et Luiz Chaimowicz. « Combining genetic algorithm and swarm intelligence for task allocation in a real time strategy game ». Journal on Interactive Systems 8, no 1 (14 septembre 2017) : 1. http://dx.doi.org/10.5753/jis.2017.671.

Texte intégral
Résumé :
Real time strategy games are complex scenarios where multiple agents must be coordinated in a dynamic, partially observable environment. In this work, we model coordination as a task allocation problem, in which specific tasks must be properly assigned to agents. We employ a task allocation algorithm based on swarm intelligence and adjust its parameters using a genetic algorithm. A fitness estimation method is employed to accelerate execution of the genetic algorithm. To evaluate this approach, we implement this coordination mechanism in the AI of a popular video game: StarCraft: BroodWar. Experiment results show that the genetic algorithm successfully adjusts task allocation parameters. Besides, we assess the trade-off between solution quality and execution time of the genetic algorithm with fitness estimation.
Styles APA, Harvard, Vancouver, ISO, etc.
29

Demidenko, V. M., et V. I. Benediktovich. « A vectorization of iterative computational processes and time acceleration estimates ». Informatics 19, no 1 (28 février 2022) : 72–87. http://dx.doi.org/10.37661/1816-0301-2022-19-1-72-87.

Texte intégral
Résumé :
O b j e c t i v e s. The problem of efficient organization of the execution of sequential computational processes in the vector mode is solved, taking into account the capabilities of modern high-performance vector-pipeline computers. The relevance of the problem under consideration is due to the fact that processes that occur during cyclic data processing and in iterative algorithms are the most difficult to parallelize. In solving the problem, three main objectives were set. Construction of a mathematical model that takes into account the main architectural and computational features of modern vector-conveyor computers. Calculation of the optimal total execution time of vector operations. Evaluation of the time gain compared to the sequential mode of data processing.M e t h o d s. To achieve the objectives and to prove the main and auxiliary statements, an original method was used, including establishing the validity of the inductive assumptions in the cases under consideration, as well as an illustrative method of scheduling theory using Gantt charts.R e s u l t s . A vector model for the implementation of sequential calculations is proposed, which takes into account the main features of vector-conveyor computers. The optimal total execution time of sequential calculations in the vector mode is determined, and a lower estimate of the time gain is obtained in comparison with the sequential mode of their execution.C o n c l u s i o n. It has been established that when processing scalar input data in the sequential mode by vector operations with a pipeline length k, acceleration is possible by at least a factor nN (nk+N) , where N is the size of the input, n is the number of vector and corresponding scalar operations. The estimation of the time acceleration in the vectorization of calculations is compared with the sequential mode of their execution.
Styles APA, Harvard, Vancouver, ISO, etc.
30

GAUTAMA, H., et A. J. C. VAN GEMUND. « SYMBOLIC PERFORMANCE ESTIMATION OF SPECULATIVE PARALLEL PROGRAMS ». Parallel Processing Letters 13, no 04 (décembre 2003) : 513–24. http://dx.doi.org/10.1142/s0129626403001471.

Texte intégral
Résumé :
Speculative parallelism refers to searching in parallel for a solution, such as finding a pattern in a data base, where finding the first solution terminates the whole parallel process. Different performance prediction methods are required as compared to traditional parallelism. In this paper we introduce an analytical approach to predict the execution time distribution of data-dependent parallel programs that feature N-ary and binary speculative parallel compositions. The method is based on the use of statistical moments which allows program execution time distribution to be approximated at O(1) solution complexity. Measurement results for synthetic distributions indicate an accuracy that lies in the percent range while for empirical distributions on internet search engines the prediction accuracy is acceptable, provided sufficient workload unimodality.
Styles APA, Harvard, Vancouver, ISO, etc.
31

Hinault, Thomas, Jean-Michel Badier, Sylvain Baillet et Patrick Lemaire. « The Sources of Sequential Modulations of Control Processes in Arithmetic Strategies : A Magnetoencephalography Study ». Journal of Cognitive Neuroscience 29, no 6 (juin 2017) : 1033–43. http://dx.doi.org/10.1162/jocn_a_01102.

Texte intégral
Résumé :
In a wide variety of cognitive domains, performance is determined by the selection and execution of cognitive strategies to solve problems. We used magnetoencephalography to identify the brain regions involved and specify the time course of dynamic modulations of executive control processes during strategy execution. Participants performed a computational estimation task in which they were instructed to execute a poorer or better strategy to estimate results of two-digit multiplication problems. When participants were asked to execute the poorer strategy, two distinct sets of brain activations were identified, depending on whether the poorer strategy (engaging the left inferior frontal junction) or the better strategy (engaging ACC) had been executed on the immediately preceding items. Our findings also revealed the time course of activations in regions involved in sequential modulations of cognitive control processes during arithmetic strategy execution. These findings point at processes of proactive preparation on items after poorer strategy items and dynamics of reactive adjustments after better strategy items.
Styles APA, Harvard, Vancouver, ISO, etc.
32

Camilleri, Liberato. « Bias of Standard Errors in Latent Class Model Applications Using Newton-Raphson and EM Algorithms ». Journal of Advanced Computational Intelligence and Intelligent Informatics 13, no 5 (20 septembre 2009) : 537–41. http://dx.doi.org/10.20965/jaciii.2009.p0537.

Texte intégral
Résumé :
The EM algorithm is a popular method for computing maximum likelihood estimates. It tends to be numerically stable, reduces execution time compared to other estimation procedures and is easy to implement in latent class models. However, the EM algorithm fails to provide a consistent estimator of the standard errors of maximum likelihood estimates in incomplete data applications. Correct standard errors can be obtained by numerical differentiation. The technique requires computation of a complete-data gradient vector and Hessian matrix, but not those associated with the incomplete data likelihood. Obtaining first and second derivatives numerically is computationally very intensive and execution time may become very expensive when fitting Latent class models using a Newton-type algorithm. When the execution time is too high one is motivated to use the EM algorithm solution to initialize the Newton Raphson algorithm. We also investigate the effect on the execution time when a final Newton-Raphson step follows the EM algorithm after convergence. In this paper we compare the standard errors provided by the EM and Newton-Raphson algorithms for two models and analyze how this bias is affected by the number of parameters in the model fit.
Styles APA, Harvard, Vancouver, ISO, etc.
33

Venkanna, Mood, Rameshwar Rao et P. Chandra Sekhar. « PSO based optimization of worst-case execution time for ASIP application ». International Journal of Engineering & ; Technology 7, no 3.3 (8 juin 2018) : 252. http://dx.doi.org/10.14419/ijet.v7i2.33.14162.

Texte intégral
Résumé :
Industrial requires hard real-time systems for safety and critical applications like automotive, Aeronautics, manufacturing control and train industries. Hard Real-Time Systems’ embedded controllers are with expectation of complete the tasks within a certain time bounds reliably including task scheduling. The estimation of upper bound limits corresponding to the execution times is often termed as the Worst-Case Execution Times (WCETs). It is an essential step in developing and validating the hard real-time systems. Particularly, the upper bounds need to satisfy these constraints related to the execution times. However, it is often not feasible many times to set upper bounds on execution times for programs. In present work, the problem of choosing reconfigurable Custom Instructions (CIs) is accomplished by optimizing the WCET corresponding to an application. This issue is designed using Particle Swarm Optimization (PSO) based program for a path analysis. The work emphasizes on the effectiveness of optimizing the WCET when applied to a reconfigurable processor. It evaluates a compound application of multimedia with a host of reconfigurable CIs corresponding to a number of hardware parameters.
Styles APA, Harvard, Vancouver, ISO, etc.
34

Valencia-Ponce , Martín Alejandro, Esteban Tlelo-Cuautle et Luis Gerardo de la Fraga. « Estimating the Highest Time-Step in Numerical Methods to Enhance the Optimization of Chaotic Oscillators ». Mathematics 9, no 16 (13 août 2021) : 1938. http://dx.doi.org/10.3390/math9161938.

Texte intégral
Résumé :
The execution time that takes to perform numerical simulation of a chaotic oscillator mainly depends on the time-step h. This paper shows that the optimization of chaotic oscillators can be enhanced by estimating the highest h in either one-step or multi-step methods. Four chaotic oscillators are used as a case study, and the optimization of their Kaplan-Yorke dimension (DKY) is performed by applying three metaheuristics, namely: particle swarm optimization (PSO), many optimizing liaison (MOL), and differential evolution (DE) algorithms. Three representative one-step and three multi-step methods are used to solve the four chaotic oscillators, for which the estimation of the highest h is obtained from their stability analysis. The optimization results show the effectiveness of using a high h value for the six numerical methods in reducing execution time while maximizing the positive Lyapunov exponent (LE+) and DKY of the chaotic oscillators by applying PSO, MOL, and DE algorithms.
Styles APA, Harvard, Vancouver, ISO, etc.
35

Abella, Jaume, Maria Padilla, Joan Del Castillo et Francisco J. Cazorla. « Measurement-Based Worst-Case Execution Time Estimation Using the Coefficient of Variation ». ACM Transactions on Design Automation of Electronic Systems 22, no 4 (22 juillet 2017) : 1–29. http://dx.doi.org/10.1145/3065924.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
36

KAMI�SKA, Agnieszka. « Statistical models for the estimation of execution time of coarsegrained OpenMP programs ». PRZEGL�D ELEKTROTECHNICZNY 1, no 2 (5 février 2015) : 24–28. http://dx.doi.org/10.15199/48.2015.02.06.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
37

Hola, Bozena, et Krzysztof Schabowicz. « Estimation of earthworks execution time cost by means of artificial neural networks ». Automation in Construction 19, no 5 (août 2010) : 570–79. http://dx.doi.org/10.1016/j.autcon.2010.02.004.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
38

Chen, Ying-Jun, Gwo-Jiun Horng, Sheng-Tzong Cheng et His-Chuan Wang. « Forming SPN-MapReduce Model for Estimation Job Execution Time in Cloud Computing ». Wireless Personal Communications 94, no 4 (3 octobre 2016) : 3465–93. http://dx.doi.org/10.1007/s11277-016-3786-7.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
39

Ivanović, Veselin N., et Srdjan Jovanovski. « Advanced superior execution time optimal time-frequency filter suitable for non-linear FM signals estimation ». Microprocessors and Microsystems 74 (avril 2020) : 103052. http://dx.doi.org/10.1016/j.micpro.2020.103052.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
40

Rastogi, Krati, et Divya Lohani. « Edge Computing-Based Internet of Things Framework for Indoor Occupancy Estimation ». International Journal of Ambient Computing and Intelligence 11, no 4 (octobre 2020) : 16–37. http://dx.doi.org/10.4018/ijaci.2020100102.

Texte intégral
Résumé :
Indoor occupancy estimation has become an important area of research in the recent past. Information about the number of people entering or leaving a building is useful in estimation of hourly sales, dynamic seat allocation, building climate control, etc. This work proposes a decentralized edge computing-based IoT framework in which the majority of the data analytics is performed on the edge, thus saving a lot of time and network bandwidth. For occupancy estimation, relative humidity and carbon dioxide concentration are used as inputs, and estimation models are developed using multiple linear regression, quantile regression, support vector regression, kernel ridge regression, and artificial neural networks. These estimations are compared using execution speed, power consumption, accuracy, root mean square error, and mean absolute percentage error.
Styles APA, Harvard, Vancouver, ISO, etc.
41

Chattaraj, Suvendu, et Abhik Mukherjee. « Utilizing Time Redundancy for Particle Filter-Based Transfer Alignment ». Fluctuation and Noise Letters 15, no 04 (29 septembre 2016) : 1650024. http://dx.doi.org/10.1142/s0219477516500243.

Texte intégral
Résumé :
Signal detection in the presence of high noise is a challenge in natural sciences. From understanding signals emanating out of deep space probes to signals in protein interactions for systems biology, domain specific innovations are needed. The present work is in the domain of transfer alignment (TA), which deals with estimation of the misalignment of deliverable daughter munitions with respect to that of the delivering mother platform. In this domain, the design of noise filtering scheme has to consider a time varying and nonlinear system dynamics at play. The accuracy of conventional particle filter formulation suffers due to deviations from modeled system dynamics. An evolutionary particle filter can overcome this problem by evolving multiple system models through few support points per particle. However, this variant has even higher time complexity for real-time execution. As a result, measurement update gets deferred and the estimation accuracy is compromised. By running these filter algorithms on multiple processors, the execution time can be reduced, to allow frequent measurement updates. Such scheme ensures better system identification so that performance improves in case of simultaneous ejection of multiple daughters and also results in better convergence of TA algorithms for single daughter.
Styles APA, Harvard, Vancouver, ISO, etc.
42

Astolfi, Laura, Febo Cincotti, Donatella Mattia, Fabrizio De Vico Fallani, Giovanni Vecchiato, Serenella Salinari, Gianni Vecchiato, Herbert Witte et Fabio Babiloni. « Time-Varying Cortical Connectivity Estimation from Noninvasive, High-Resolution EEG Recordings ». Journal of Psychophysiology 24, no 2 (janvier 2010) : 83–90. http://dx.doi.org/10.1027/0269-8803/a000017.

Texte intégral
Résumé :
Objective: In this paper, we propose a body of techniques for the estimation of rapidly changing connectivity relationships between EEG signals estimated in cortical areas, based on the use of adaptive multivariate autoregressive modeling (AMVAR) for the estimation of a time-varying partial directed coherence (PDC). This approach allows the observation of rapidly changing influences between the cortical areas during the execution of a task, and does not require the stationarity of the signals. Methods: High resolution EEG data were recorded from a group of spinal cord injured (SCI) patients during the attempt to move a paralyzed limb. These data were compared with the time-varying connectivity patterns estimated in a control group during the real execution of the movement. Connectivity was estimated with the use of realistic head modeling and the linear inverse estimation of the cortical activity in a series of regions of interest by using time-varying PDC. Results: The SCI population involved a different cortical network than those generated by the healthy subjects during the task performance. Such a network differs for the involvement of the parietal cortices, which increases in strength near to the movement imagination onset for the SCI when compared to the normal population. Conclusions: The application of time-varying PDC allows tracking the evolution of the connectivity between cortical areas in the analyzed populations during the proposed tasks. Such details about the temporal evolution of the connectivity patterns estimated cannot be obtained with the application of the standard estimators of connectivity.
Styles APA, Harvard, Vancouver, ISO, etc.
43

Iconaru, Elena Ioana, Manuela Mihaela Ciucurel, Mariana Tudor et Constantin Ciucurel. « Nonlinear Dynamics of Reaction Time and Time Estimation during Repetitive Test ». International Journal of Environmental Research and Public Health 19, no 3 (5 février 2022) : 1818. http://dx.doi.org/10.3390/ijerph19031818.

Texte intégral
Résumé :
(1) Background: In this research, we aimed to investigate a computational model of repetitive reaction time (RT) and virtual reaction time (VRT) testing. (2) Methods: The study involved 180 subjects (50 men, 130 women, mean age 31.61 ± 13.56 years). The data were statistically analyzed through the coefficient of variation (CV) and the Poincaré plot indicators. (3) Results: We obtained an excellent level of reliability for both sessions of testing and we put into evidence a relationship of association of the RT and VRT with the subjects’ age, which was more pregnant for RT (p < 0.05). For both RT and VRT data series, we determined a consistent closer association between CV and the Poincaré plot descriptors SD1, SD2 (SD—standard deviation), and the area of the fitting ellipse (AFE) (p < 0.01). We reported an underestimation of the time interval of 2 s during the VRT session of testing, with an average value of CV of VRT, the equivalent of the Weber fraction, of 15.21 ± 8.82%. (4) Conclusions: The present study provides novel evidence that linear and nonlinear analysis of RT and VRT variability during serial testing bring complementary insights to the understanding of complex neurocognitive processes implied in the task execution.
Styles APA, Harvard, Vancouver, ISO, etc.
44

Popova, Ivilina, et Elmira Popova. « Estimation of Performance and Execution Time Effect on High-Frequency Statistical Arbitrage Strategies ». Journal of Trading 5, no 2 (31 mars 2010) : 23–30. http://dx.doi.org/10.3905/jot.2010.5.2.023.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
45

Çelikten, Baran, Ozan Eren et Yusuf Selim Karataş. « An execution time optimized state of charge estimation method for lithium-ion battery ». Journal of Energy Storage 51 (juillet 2022) : 104307. http://dx.doi.org/10.1016/j.est.2022.104307.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
46

Troitskiy, A. M., et D. V. Buzdalov. « A static approach to estimation of execution time of components in AADL models ». Proceedings of the Institute for System Programming of the RAS 28, no 2 (2016) : 157–72. http://dx.doi.org/10.15514/ispras-2016-28(2)-10.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
47

NOZDRZYKOWSKI, Łukasz. « Analysis of the significance of model parameters for program loop execution time estimation ». PRZEGLĄD ELEKTROTECHNICZNY 1, no 12 (5 décembre 2015) : 239–41. http://dx.doi.org/10.15199/48.2015.12.61.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
48

Kishimoto, Yoshinori, et Shuichi Ichikawa. « Optimizing the configuration of a heterogeneous cluster with multiprocessing and execution-time estimation ». Parallel Computing 31, no 7 (juillet 2005) : 691–710. http://dx.doi.org/10.1016/j.parco.2005.04.004.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
49

Hardy, Damien, et Isabelle Puaut. « Static probabilistic worst case execution time estimation for architectures with faulty instruction caches ». Real-Time Systems 51, no 2 (5 novembre 2014) : 128–52. http://dx.doi.org/10.1007/s11241-014-9212-x.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
50

Kumar, Bittu. « Real-time Performance Evaluation of Modified Cascaded Median-based Noise Estimation for Speech Enhancement System ». Fluctuation and Noise Letters 18, no 04 (21 novembre 2019) : 1950020. http://dx.doi.org/10.1142/s0219477519500202.

Texte intégral
Résumé :
In this paper, the performance evaluation of Modified Cascaded Median (MCM)-based noise estimation method for speech enhancement system has been carried out. The MCM-based method, though reported earlier, was not extensively evaluated; particularly, its real-time performance had not been considered. In the present study, the performance of the MCM-based noise estimation method has been compared with those based on Dynamic Quantile Tracking (DQT) and Cascaded Median (CM), through simulation as well as real-time implementation using TMS320C6416T DSK. All comparisons were made for speech quality (subjectively — mean opinion score and objectively — PESQ score, log-likelihood ratio, weighted spectral slope distance, segmented signal-to-noise ratio and composite measures for signal distortion [Formula: see text], background intrusiveness [Formula: see text] and overall distortion [Formula: see text]) at the 95% level of confidence. The real-time parameters such as memory consumption and execution time have been used for real-time implementation and compared for the three methods. The results, for different SNR-based degraded speech signals, show that the modified cascaded median-based noise estimation is the best in terms of PESQ score, [Formula: see text], [Formula: see text], [Formula: see text] and mean opinion score. On the other hand, for different noise corrupted-based speech signals, it performs well as compared to the original CM. Memory consumption and average execution time for the MCM-based noise estimation lie in-between those for DQT and CM-based methods.
Styles APA, Harvard, Vancouver, ISO, etc.
Vous pouvez également être intéressé par les bibliographies sur le sujet « Execution Time estimation » pour d’autres types de sources :
Thèses
Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!

Vers la bibliographie