Exploiting non-uniform program execution time to evade record/replay forensic analysis

2020 ◽  
Vol 88 ◽  
pp. 101516
Author(s):  
Yang Hu ◽  
Mingshen Sun ◽  
John C.S. Lui
Keyword(s):  
Execution Time ◽  
Forensic Analysis ◽  
Program Execution

SYMBOLIC PERFORMANCE ESTIMATION OF SPECULATIVE PARALLEL PROGRAMS

2003 ◽  
Vol 13 (04) ◽  
pp. 513-524 ◽  
Author(s):  
H. GAUTAMA ◽  
A. J. C. VAN GEMUND
Keyword(s):  
Performance Prediction ◽  
Execution Time ◽  
Time Distribution ◽  
Prediction Accuracy ◽  
Analytical Approach ◽  
Parallel Programs ◽  
Performance Estimation ◽  
Program Execution ◽  
Empirical Distributions ◽  
Measurement Results

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.

scholarly journals Using Combined Static Analysis and Profiling for Logic Program Execution Time Estimation

2006 ◽  
pp. 431-432 ◽  
Author(s):  
Edison Mera ◽  
Pedro López-García ◽  
Germán Puebla ◽  
Manuel Carro ◽  
Manuel Hermenegildo
Keyword(s):  
Static Analysis ◽  
Execution Time ◽  
Logic Program ◽  
Time Estimation ◽  
Program Execution

scholarly journals Implementation of master-slave method on multiprocessor-based embedded system: case study on mobile robot

2018 ◽  
Vol 7 (2.2) ◽  
pp. 53
Author(s):  
Agusma Wajiansyah ◽  
Hari Purwadi ◽  
Asrina Astagani ◽  
Supriadi Supriadi
Keyword(s):  
Embedded Systems ◽  
Mobile Robot ◽  
Embedded System ◽  
Execution Time ◽  
Experimental Results ◽  
Program Execution ◽  
Time Average ◽  
Single Processor ◽  
Number Of Iterations

In this research the master-slave method implemented on an embedded system using 3 processor applied to the mobile robot, to know the speed of program execution of robot. As a comparison is also used a robot with an embedded system based on single processor. From the experimental results, by applying the slave master method obtained the execution time of 546,5 μs and the number of iteration 1079, while for single processor-based system obtained execution time average 67828 μs and the amount of iteration average 147 times. Where the number of iterations is obtained by running the robot for 10 s. From this experiment, it can be concluded that there is a performance increase of 7.3% when compared to embedded systems based on single processor. 

Sign in / Sign up

Export Citation Format

Share Document