Measure execution time with PowerShell

What would be the best way to accomplish following:
1. Get start time and write it to variable
2. Do something
3. Get end time and measure how long it taked from start to end and store the result in variable
I would need the result be in format like this hours:minutes:seconds and to support 24 hour clock so if the execution starts e.g 11:30 and ends 14:30 it shows correct time.

PowerShell already comes with a CmdLet that allows you to measure the time a script block takes to execute, that sounds like what you are after.
See these for more details on Measure-Command:
https://technet.microsoft.com/en-us/library/hh849910.aspx?f=255&MSPPError=-2147217396
https://technet.microsoft.com/en-us/library/ee176899.aspx

Similar Messages

Tool for measuring execution time?

Hi,
i'm trying to measure the time of some determined methods in my app.
I've tried System.currentMillis(), but i don't get the accuracy i need (System.nanoTime() - from 1.5.0 sdk won't help me neihter).
Does anyone know a simple java tool that i can use to do this ???
I thought about optimized (borland), but i just don't have it :-( also i don't know if it ease to use (and i need this measuring as soon as possible).
Thanks for any sugestion,
ltcmelo

<<In Windows at least the resolution of System.currentTimeMillis() seems to be 10ms.
If the operation that takes 9 ms is called a thousand times, and the one that takes 5 ms is called 20
million times, and the one that takes 1 �s is called 200 million times, all will be fast to measure,
all will come in at zero ms by currentTimeMillis(). It would be useful to know the respective execution times of each method.>>
This is not correct. Windows does have 10 ms. granularity, however if you average many measurements this limitation disappears.
For example let's say that a particular method takes 5 ms. on average and we take 10 measurements. You claim that the 10 measurements will all be 0, whereas the actual measurements will either be 0 or 10 depending on how close the clock was to ticking when currentTimeMillis() was called. For example the 10 measurements might look like 0, 0, 10, 0, 10, 0, 0, 10, 10, 0. If you take the average of these numbers you get quite good accuracy (i.e. 50/10=5 ms. the actual time we said the method took). In principle the average should even get you sub-ms. accuracy.
Try it with jamon (http://www.jamonapi.com). JAMon calculates averages and so gets around the windows limitation. If you are coding a web app then jamon has a report page that displays all the results (hits, average time, totals time, min time, max time, ...). If not then you can get the raw data and display it as you like.
One question for the original poster. Why do you think you need sub-millisecond timings? If you are coding a business app IO tends to be the bottleneck and much greater than sub-millisecond.
Steve - http://www.jamonapi.com - a fast, free monitoring tool that is suitable for production applications.

SQL Tuning and OPTIMIZER - Execution Time with " AND col .."

Hi all,
I get a question about SQL Tuning and OPTIMIZER.
There are three samples with EXPLAIN PLAN and execution time.
This "tw_pkg.getMaxAktion" is a PLSQL Package.
1.) Execution Time : 0.25 Second
2.) Execution Time : 0.59 Second
3.) Execution Time : 1.11 Second
The only difference is some additional "AND col <> .."
Why is this execution time growing so strong?
Many Thanks,
Thomas
----[First example]---
Connected to Oracle Database 10g Enterprise Edition Release 10.2.0.3.0
Connected as dbadmin2
SQL>
SQL> EXPLAIN PLAN FOR
2 SELECT * FROM ( SELECT studie_id, tw_pkg.getMaxAktion(studie_id) AS max_aktion_id
3                    FROM studie
4                 ) max_aktion
5 WHERE max_aktion.max_aktion_id < 900 ;
Explained
SQL> SELECT * FROM TABLE(dbms_xplan.display);
PLAN_TABLE_OUTPUT
Plan hash value: 3201460684
| Id | Operation            | Name        | Rows | Bytes | Cost (%CPU)| Time
|   0 | SELECT STATEMENT     |             |   220 |   880 |     5 (40)| 00:00:
|* 1 | INDEX FAST FULL SCAN| SYS_C005393 |   220 |   880 |     5 (40)| 00:00:
Predicate Information (identified by operation id):
   1 - filter("TW_PKG"."GETMAXAKTION"("STUDIE_ID")<900)
13 rows selected
SQL>
Execution time (PL/SQL Developer says): 0.25 seconds
----[/First]---
----[Second example]---
Connected to Oracle Database 10g Enterprise Edition Release 10.2.0.3.0
Connected as dbadmin2
SQL>
SQL> EXPLAIN PLAN FOR
2 SELECT * FROM ( SELECT studie_id, tw_pkg.getMaxAktion(studie_id) AS max_aktion_id
3                    FROM studie
4                 ) max_aktion
5 WHERE max_aktion.max_aktion_id < 900
6    AND max_aktion.max_aktion_id <> 692;
Explained
SQL> SELECT * FROM TABLE(dbms_xplan.display);
PLAN_TABLE_OUTPUT
Plan hash value: 3201460684
| Id | Operation            | Name        | Rows | Bytes | Cost (%CPU)| Time
|   0 | SELECT STATEMENT     |             |    11 |    44 |     6 (50)| 00:00:
|* 1 | INDEX FAST FULL SCAN| SYS_C005393 |    11 |    44 |     6 (50)| 00:00:
Predicate Information (identified by operation id):
   1 - filter("TW_PKG"."GETMAXAKTION"("STUDIE_ID")<900 AND
              "TW_PKG"."GETMAXAKTION"("STUDIE_ID")<>692)
14 rows selected
SQL>
Execution time (PL/SQL Developer says): 0.59 seconds
----[/Second]---
----[Third example]---
SQL> EXPLAIN PLAN FOR
2 SELECT * FROM ( SELECT studie_id, tw_pkg.getMaxAktion(studie_id) AS max_aktion_id
3                    FROM studie
4                 ) max_aktion
5 WHERE max_aktion.max_aktion_id < 900
6    AND max_aktion.max_aktion_id <> 692
7    AND max_aktion.max_aktion_id <> 392;
Explained
SQL> SELECT * FROM TABLE(dbms_xplan.display);
PLAN_TABLE_OUTPUT
Plan hash value: 3201460684
| Id | Operation            | Name        | Rows | Bytes | Cost (%CPU)| Time
|   0 | SELECT STATEMENT     |             |     1 |     4 |     6 (50)| 00:00:
|* 1 | INDEX FAST FULL SCAN| SYS_C005393 |     1 |     4 |     6 (50)| 00:00:
Predicate Information (identified by operation id):
   1 - filter("TW_PKG"."GETMAXAKTION"("STUDIE_ID")<900 AND
              "TW_PKG"."GETMAXAKTION"("STUDIE_ID")<>692 AND
              "TW_PKG"."GETMAXAKTION"("STUDIE_ID")<>392)
15 rows selected
SQL>
Execution time (PL/SQL Developer says): 1.11 seconds
----[/Third]---Edited by: thomas_w on Jul 9, 2010 11:35 AM
Edited by: thomas_w on Jul 12, 2010 8:29 AM

Hi,
this is likely because SQL Developer fetches and displays only limited number of rows from query results.
This number is a parameter called 'sql array fetch size', you can find it in SQL Developer preferences under Tools/Preferences/Database/Advanced tab, and it's default value is 50 rows.
Query scans a table from the beginning and continue scanning until first 50 rows are selected.
If query conditions are more selective, then more table rows (or index entries) must be scanned to fetch first 50 results and execution time grows.
This effect is usually unnoticeable when query uses simple and fast built-in comparison operators (like = <> etc) or oracle built-in functions, but your query uses a PL/SQL function that is much more slower than built-in functions/operators.
Try to change this parameter to 1000 and most likely you will see that execution time of all 3 queries will be similar.
Look at this simple test to figure out how it works:
CREATE TABLE studie AS
SELECT row_number() OVER (ORDER BY object_id) studie_id, o.*
FROM (
SELECT * FROM all_objects
CROSS JOIN
(SELECT 1 FROM dual CONNECT BY LEVEL <= 100)
) o;
CREATE INDEX studie_ix ON studie(object_name, studie_id);
ANALYZE TABLE studie COMPUTE STATISTICS;
CREATE OR REPLACE FUNCTION very_slow_function(action IN NUMBER)
RETURN NUMBER
IS
BEGIN
RETURN action;
END;
/'SQL array fetch size' parameter in SQLDeveloper has been set to 50 (default). We will run 3 different queries on test table.
Query 1:
SELECT * FROM ( SELECT studie_id, very_slow_function(studie_id) AS max_aktion_id
                     FROM studie
              ) max_aktion
WHERE max_aktion.max_aktion_id < 900
call     count       cpu    elapsed       disk      query    current        rows
Parse        1      0.00       0.00          0          0          0           0
Execute      1      0.00       0.00          0          0          0           0
Fetch        1      1.22       1.29          0       1310          0          50
total        3      1.22       1.29          0       1310          0          50
Misses in library cache during parse: 1
Optimizer mode: ALL_ROWS
Parsing user id: 93 (TEST)
Rows     Row Source Operation
     50 INDEX FAST FULL SCAN STUDIE_IX (cr=1310 pr=0 pw=0 time=355838 us cost=5536 size=827075 card=165415)(object id 79865)
Rows     Execution Plan
      0 SELECT STATEMENT   MODE: ALL_ROWS
     50   INDEX   MODE: ANALYZED (FAST FULL SCAN) OF 'STUDIE_IX' (INDEX)Query 2:
SELECT * FROM ( SELECT studie_id, very_slow_function(studie_id) AS max_aktion_id
                     FROM studie
              ) max_aktion
WHERE max_aktion.max_aktion_id < 900
      AND max_aktion.max_aktion_id > 800
call     count       cpu    elapsed       disk      query    current        rows
Parse        1      0.00       0.01          0          0          0           0
Execute      1      0.00       0.00          0          0          0           0
Fetch        1      8.40       8.62          0       9351          0          50
total        3      8.40       8.64          0       9351          0          50
Misses in library cache during parse: 1
Optimizer mode: ALL_ROWS
Parsing user id: 93 (TEST)
Rows     Row Source Operation
     50 INDEX FAST FULL SCAN STUDIE_IX (cr=9351 pr=0 pw=0 time=16988202 us cost=5552 size=41355 card=8271)(object id 79865)
Rows     Execution Plan
      0 SELECT STATEMENT   MODE: ALL_ROWS
     50   INDEX   MODE: ANALYZED (FAST FULL SCAN) OF 'STUDIE_IX' (INDEX)Query 3:
SELECT * FROM ( SELECT studie_id, very_slow_function(studie_id) AS max_aktion_id
                     FROM studie
              ) max_aktion
WHERE max_aktion.max_aktion_id = 600
call     count       cpu    elapsed       disk      query    current        rows
Parse        1      0.01       0.00          0          0          0           0
Execute      1      0.00       0.00          0          0          0           0
Fetch        1     18.72      19.16          0      19315          0           1
total        3     18.73      19.16          0      19315          0           1
Misses in library cache during parse: 1
Optimizer mode: ALL_ROWS
Parsing user id: 93 (TEST)
Rows     Row Source Operation
      1 INDEX FAST FULL SCAN STUDIE_IX (cr=19315 pr=0 pw=0 time=0 us cost=5536 size=165415 card=33083)(object id 79865)
Rows     Execution Plan
      0 SELECT STATEMENT   MODE: ALL_ROWS
      1   INDEX   MODE: ANALYZED (FAST FULL SCAN) OF 'STUDIE_IX' (INDEX)Query 1 - 1,29 sec, 50 rows fetched, 1310 index entries scanned to find these 50 rows.
Query 2 - 8,64 sec, 50 rows fetched, 9351 index entries scanned to find these 50 rows.
Query 3 - 19,16 sec, only 1 row fetched, 19315 index entries scanned (full index).
Now 'SQL array fetch size' parameter in SQLDeveloper has been set to 1000.
Query 1:
SELECT * FROM ( SELECT studie_id, very_slow_function(studie_id) AS max_aktion_id
                     FROM studie
              ) max_aktion
WHERE max_aktion.max_aktion_id < 900
call     count       cpu    elapsed       disk      query    current        rows
Parse        1      0.00       0.00          0          0          0           0
Execute      1      0.00       0.00          0          0          0           0
Fetch        1     18.35      18.46          0      19315          0         899
total        3     18.35      18.46          0      19315          0         899
Misses in library cache during parse: 0
Optimizer mode: ALL_ROWS
Parsing user id: 93 (TEST)
Rows     Row Source Operation
    899 INDEX FAST FULL SCAN STUDIE_IX (cr=19315 pr=0 pw=0 time=20571272 us cost=5536 size=827075 card=165415)(object id 79865)
Rows     Execution Plan
      0 SELECT STATEMENT   MODE: ALL_ROWS
    899   INDEX   MODE: ANALYZED (FAST FULL SCAN) OF 'STUDIE_IX' (INDEX)Query 2:
SELECT * FROM ( SELECT studie_id, very_slow_function(studie_id) AS max_aktion_id
                     FROM studie
              ) max_aktion
WHERE max_aktion.max_aktion_id < 900
      AND max_aktion.max_aktion_id > 800
call     count       cpu    elapsed       disk      query    current        rows
Parse        1      0.00       0.00          0          0          0           0
Execute      1      0.00       0.00          0          0          0           0
Fetch        1     18.79      18.86          0      19315          0          99
total        3     18.79      18.86          0      19315          0          99
Misses in library cache during parse: 0
Optimizer mode: ALL_ROWS
Parsing user id: 93 (TEST)
Rows     Row Source Operation
     99 INDEX FAST FULL SCAN STUDIE_IX (cr=19315 pr=0 pw=0 time=32805696 us cost=5552 size=41355 card=8271)(object id 79865)
Rows     Execution Plan
      0 SELECT STATEMENT   MODE: ALL_ROWS
     99   INDEX   MODE: ANALYZED (FAST FULL SCAN) OF 'STUDIE_IX' (INDEX)Query 3:
SELECT * FROM ( SELECT studie_id, very_slow_function(studie_id) AS max_aktion_id
                     FROM studie
              ) max_aktion
WHERE max_aktion.max_aktion_id = 600
call     count       cpu    elapsed       disk      query    current        rows
Parse        1      0.00       0.00          0          0          0           0
Execute      1      0.00       0.00          0          0          0           0
Fetch        1     18.69      18.84          0      19315          0           1
total        3     18.69      18.84          0      19315          0           1
Misses in library cache during parse: 0
Optimizer mode: ALL_ROWS
Parsing user id: 93 (TEST)
Rows     Row Source Operation
      1 INDEX FAST FULL SCAN STUDIE_IX (cr=19315 pr=0 pw=0 time=0 us cost=5536 size=165415 card=33083)(object id 79865)
Rows     Execution Plan
      0 SELECT STATEMENT   MODE: ALL_ROWS
      1   INDEX   MODE: ANALYZED (FAST FULL SCAN) OF 'STUDIE_IX' (INDEX)And now:
Query 1 - 18.46 sec, 899 rows fetched, 19315 index entries scanned.
Query 2 - 18.86 sec, 99 rows fetched, 19315 index entries scanned.
Query 3 - 18.84 sec, 1 row fetched, 19315 index entries scanned.

Reduce execution time with selects

Hi,
I have to reduce the execution time in a report, most of the consumed time is in the select query.
I have a table, gt_result:
DATA: BEGIN OF gwa_result,
      tknum            LIKE vttk-tknum,
      stabf            LIKE vttk-stabf,
      shtyp            LIKE vttk-shtyp,
      route            LIKE vttk-route,
      vsart            LIKE vttk-vsart,
      signi            LIKE vttk-signi,
      dtabf            LIKE vttk-dtabf,
      vbeln            LIKE likp-vbeln,
      /bshm/le_nr_cust LIKE likp-/bshm/le_nr_cust,
      vkorg            LIKE likp-vkorg,
      werks            LIKE likp-werks,
      regio            LIKE kna1-regio,
      land1            LIKE kna1-land1,
      xegld            LIKE t005-xegld,
      intca            LIKE t005-intca,
      bezei            LIKE tvrot-bezei,
      bezei1           LIKE t173t-bezei,
      fecha(10) type c.
DATA: END OF gwa_result.
DATA: gt_result LIKE STANDARD TABLE OF gwa_result.
And the select query is this:
SELECT ktknum kstabf kshtyp kroute kvsart ksigni
k~dtabf
         lvbeln l/bshm/le_nr_cust lvkorg lwerks   nregio nland1 oxegld ointca
             tbezei   ttbezei
FROM vttk AS k
INNER JOIN vttp AS p ON ktknum = ptknum
INNER JOIN likp AS l ON pvbeln = lvbeln
INNER JOIN kna1 AS n ON lkunnr = nkunnr
INNER JOIN t005 AS o ON nland1 = oland1
INNER JOIN tvrot AS t ON troute = kroute AND t~spras = sy-langu
INNER JOIN t173t AS tt ON ttvsart = kvsart AND tt~spras = sy-langu
INTO TABLE gt_result
WHERE ktknum IN s_tknum AND ktplst IN s_tplst AND k~route IN s_route AND
     k~erdat BETWEEN s_erdat-low AND s_erdat-high AND
     l~/bshm/le_nr_cust <> ' '    "IS NOT NULL
     AND k~stabf = 'X'
     AND ktknum NOT IN ( SELECT tktknum FROM vttk AS tk
                         INNER JOIN vttp AS tp ON tktknum = tptknum
                         INNER JOIN likp AS tl ON tpvbeln = tlvbeln
                         WHERE l~/bshm/le_nr_cust IS NULL )
     AND k~tknum NOT IN ( SELECT tknum FROM /bshs/ssm_eship )
     AND ( o~xegld = ' '
           OR ( o~xegld = 'X' AND
                ( ( n~land1 = 'ES'
                    AND ( nregio = '51' OR nregio = '52'
                          OR nregio = '35' OR nregio = '38' ) )
                           OR n~land1 = 'ESC' ) )
                  OR ointca = 'AD' OR ointca = 'GI' ).
Does somebody know how to reduce the execution time ?.
Thanks.

Hi,
Try to remove the join. Use seperate selects as shown in example below and for the sake of selection, keep some key fields in your internal table.
Then once your final table is created, you can copy the table into GT_FINAL which will contain only fields you need.
EX
data : begin of it_likp occurs 0,
         vbeln like likp-vbeln,
         /bshm/le_nr_cust like likp-/bshm/le_nr_cust,
         vkorg like likp-vkorg,
         werks like likp-werks,
         kunnr likr likp-kunnr,
       end of it_likp.
data : begin of it_kna1 occurs 0,
       kunnr like...
       regio....
       land1...
      end of it_kna1 occurs 0,
Select tknum stabf shtyp route vsart signi dtabf
from VTTP
into table gt_result
WHERE tknum IN s_tknum AND
      tplst IN s_tplst AND
      route IN s_route AND
      erdat BETWEEN s_erdat-low AND s_erdat-high.
select vbeln /bshm/le_nr_cust
       vkorg werks kunnr
       from likp
       into table it_likp
       for all entries in gt_result
       where vbeln = gt_result-vbeln.
select kunnr
       regio
       land1
       from kna1
       into it_kna1
       for all entries in it_likp.
similarly for other tables.
Then loop at gt result and read corresponding table and populate entire record :
loop at gt_result.
read table it_likp where vbeln = gt_result-vbeln.
if sy-subrc eq 0.
move corresponding fields of it_likp into gt_result.
gt_result-kunnr = it_likp-kunnr.
modify gt_result.
endif.
read table it_kna1 where kunnr = gt_result-vbeln.
if sy-subrc eq 0.
gt_result-regio = it-kna1-regio.
gt_result-land1 = it-kna1-land1.
modify gt_result.
endif.
endloop.

How to know child procedure Execution time with in parent procedure

Hi Team,
I've a requirement in which I need to get the execution time of a child procedure while its running in a parent procedure in PLSQL. While the child process is running, I want to know its execution time so that if it execution time exceeds more than 5 seconds than I want to through an error. Please let me know by what means this can be achieved in plsql.
Regards,
Tech D.

TechD wrote:
Hi Team,
I've a requirement in which I need to get the execution time of a child procedure while its running in a parent procedure in PLSQL. While the child process is running, I want to know its execution time so that if it execution time exceeds more than 5 seconds than I want to through an error. Please let me know by what means this can be achieved in plsql.
Regards,
Tech D.PL/SQL is NOT a Real Time programming language.
The procedure that invokes the child procedure is effectively dormant while the child runs.
Plus there is no easy way to know when 5 seconds has elapsed.

Execution Time with Forge

Is there any Performance improvements that can be applied to improve the run time with Forge? It takes us 90 minutes to complete.

Hi Harley,
The short answer is "it depends". There's a few quick hit things you can watch out for:
unnecessary properties,
work done in Forge that could be pushed to a database,
Then there's more involved efforts that may or may not apply to your case, such as moving to parallel forge or removing Java manipulators.
Dgidx has a few other things you can tune but it's mostly dependent on the character of your index and whether or not you are enabling unnecessary features on your properties and dimensions.
Hope that helps, let us know if there's anything else you need.
Patrick Rafferty
http://branchbird.com

Measuring execution time

Hi, I had written a program a while back which was
simply loading in an xml file, parsing out a few
tags, and then writing back to the same file. I
thought of a way the parsing could be made more
efficient, and it certainly seems to be running faster,
however I am looking for suggestions on how I could
prove this?
Basically I am looking for a tool that could monitor
the length of time taken for the program to finish, so
I could do this using both versions of the program using
a set data set and compare the results.
Thanks in advance for any ideas/suggestions :)

It's fun putting subject lines in the search box
http://search.java.sun.com/search/java/index.jsp?and=ex
cution+time&phr=&qt=�=&field=title&since=&nh=10&col=
avaforums&rf=0&Search.x=19&Search.y=7Why limit yourself to 19 results, though? Search all the forums for "execution time" and you get 55,061 results. "Performance testing" yields 36,651 hits. I guess there's an outside chance one of those threads might be helpful, eh?

Conductance (current) Measurement vs Time with SR830

Dear all.
I'm totally new to lock-in amplifier as well as LabVIEW. We have the Stanford Research SR830 in our lab and I want to setup an experiment to measure the conductance (or current) versus time. The conductance I want to measure is in the order of 1 nS. I have read many papers and they used lock-in amplifier for the measurement, sometime with the preamplifier. Most of the time they put a modulated voltage of frequency 10 to 100 Hz, amplitude 30mV to the drain and the source of the device. Though I am not sure how they set up the experiment.
It would be really appreciated that you could suggest me a setup for the measurement? Any other instrument is required?
Thank you very much.

Hi ncthanh1986,
I would not know how to set up an experiment with your specific piece of hardware, this might be something you would ask Stanford Research or consult the manual.
Instrument wise, the way to get the measurements from your SR830 to LabVIEW would be to have either a GPIB or RS-232 interface. National Instruments offers both of these interfaces with USB if needed.
Once you have the measurement in LabVIEW, you will be able to calculate the conductance in software.
Hope this helps!
Robert R. | Applications Engineer | National Instruments

How Can I reduce Query Execution time with use of filter

Dear Experts,
In a query execution is faster when there is no product filter and these products can be a list contaning mare than 300 items.
I am using In operator for that filter.

Maybe if you posted the quer[y][ies] we could get a better idea.

Refresh IE page if computer idle for a specified time with powershell

Hi,
I have a Windows 8 pc that i have created a kiosk mode for and i want to be able to check the idle time so that if the idle is more than three minutes it will close all tabs without a warning and navigate the primary tab to a specific web site.
The script needs to be constantly running i the background, I'll add the script to a scheduled task to start when the user logs in.
Could you please help me?
Cheers,
CredFX

The Windows 8 computer is a touch screen as well so idle means any mouse movement, keyboard stroke or touch of the screen.
I have found this from a site that gets the idle time, I'm just not sure how to create the IE navigation part from it.
Add-Type @'
using System;
using System.Diagnostics;
using System.Runtime.InteropServices;
namespace PInvoke.Win32 {
public static class UserInput {
[DllImport("user32.dll", SetLastError=false)]
private static extern bool GetLastInputInfo(ref LASTINPUTINFO plii);
[StructLayout(LayoutKind.Sequential)]
private struct LASTINPUTINFO {
public uint cbSize;
public int dwTime;
public static DateTime LastInput {
get {
DateTime bootTime = DateTime.UtcNow.AddMilliseconds(-Environment.TickCount);
DateTime lastInput = bootTime.AddMilliseconds(LastInputTicks);
return lastInput;
public static TimeSpan IdleTime {
get {
return DateTime.UtcNow.Subtract(LastInput);
public static int LastInputTicks {
get {
LASTINPUTINFO lii = new LASTINPUTINFO();
lii.cbSize = (uint)Marshal.SizeOf(typeof(LASTINPUTINFO));
GetLastInputInfo(ref lii);
return lii.dwTime;
Function getidletime
$Last = [PInvoke.Win32.UserInput]::LastInput
$Idle = [PInvoke.Win32.UserInput]::IdleTime
Write-Host ("Idle for " + $Idle.Days + " days, " + $Idle.Hours + " hours, " + $Idle.Minutes + " minutes, " + $Idle.Seconds + " seconds.")

Why the execution time increases with a while loop, but not with "Run continuously" ?

Hi all,
I have a serious time problem that I don't know how to solve because I don't know exactly where it comes from.
I command two RF switches via a DAQ card (NI USB-6008). Only one position at the same time can be selected on each switch. Basically, the VI created for this functionnality (by a co-worker) resets all the DAQ outputs, and then activates the desired ones. It has three inputs, two simp0le string controls, and an array of cluster, which contains the list of all the outputs and some informations to know what is connected (specific to my application).
I use this VI in a complex application, and I get some problems with the execution time, which increased each time I callled the VI, so I made a test VI (TimeTesting.vi) to figure out where the problem came from. In this special VI I record the execution time in a csv file to analyse then with excel.
After several tests, I found that if I run this test VI with the while loop, the execution time increases at each cycle, but if I remove the while loop and use the "Run continuously" funtionnality, the execution time remains the same. In my top level application I have while loops and events, and so the execution time increases too.
Could someone explain me why the execution time increases, and how can I avoid that? I attached my test VI and the necessary subVIs, as well as a picture of a graph which shows the execution time with a while loop and with the "run continuously".
Thanks a lot for your help!
Solved!
Go to Solution.
Attachments:
TimeTesting.zip ‏70 KB
Graph.PNG ‏20 KB

jul7290 wrote:
Thank you very much for your help! I added the "Clear task" vi and now it works properly.
If you are still using the RUn Continuously you should stop. That is meant strictly for debugging. In fact, I can't even tell you the last time I ever used it. If you want your code to repeat you should use loops and control the behavior of the code.
Mark Yedinak
"Does anyone know where the love of God goes when the waves turn the minutes to hours?"
Wreck of the Edmund Fitzgerald - Gordon Lightfoot

Measure procedure execution time..

Hi,
Is there any possibility to measure how long each of a procedure in database take?? Is that possible for Oracle's V$ views or by performance report like AWR? On the other hand, is that possible to measure execution time for SQL statements, but without using "set timing on".
Best,
tutus

This is just an add-on to Satish's reply. You may want to chck this link to see how Profiler works,
http://www.oracle-base.com/articles/9i/DBMS_PROFILER.php
HTH
Aman....

Long execution times for TestStand conditional statements

I have two test stations – one here, one at the factory in China that has been operating for about a year. The test program uses TestStand 3.1 and calls primarily dll's developed using CVI. Up until a couple months ago, both test stations performed in a similar manner, then the computer at the factory died and was replaced with a new, faster computer. Now the same test sequence at the factory take three times as long to execute (30 min at the facotry, 10min here).
I have recoded the execution time at various point during the execution, and have found that the extra times seems to be occurring during the evaluation of conditional statements in TestStand (i.e. for loops, if statements, case statements). For example, one particular ‘for’ evaluation takes 30 ms on the test station here, but takes 400 ms at the test station at the factory (note: this is just the evaluation of the for condition, not the execution of the steps contained within the for loop).
The actual dll calls seem to be slightly faster with the new computer.
Also the ‘Module Times’ reported don’t seem to match the actual time for the module for the computer at the factory. For example, for the following piece of TestStand code:
Label1
Subsequence Call
Label2
I record the execution time to the report text in both Label1 and Label2. Subtracting one from the other gives me about 18 seconds. However the ‘Module Time’ recorded for ‘Subsequence Call’ is only 3.43 seconds.
Any body have any ideas why the long execution time with the new computer? I always setup the computers in exactly the same way, but maybe there is a TestStand setting somewhere that I have missed? Keep in mind, both test stations are running exactly the same revision of code.

Got some more results from the factory this morning:
1) Task Manager shows that the TestExec.exe is the only thing using CPU to any significant degree. Also CPU Usage History show that the CPU Usage never reaches 100%.
2) I sent a new test program that will log test execution time in more places. Longer execution times are seen in nearly every area of the program, but one area where this is very dramatic is the time taken to return from one particular subsequence call. In this subsequence I log the time just before the <End Group> at then end of Main. There is nothing in Cleanup. I then log the time immediately after returning from this sequence. On the test system I have here this takes approximately 160 ms. On the test system at the factory this takes approximately 14.5 seconds! The program seems to be hanging here for some reason. Every time this function is called the same thing happens and for the same amount of time (and this function is called about 40 times in the test program, so this is kill me).

Ideal execution time for any program

Hi,
Is there any method to determine the ideal execution time for a program ?
Or else how to determine that ?
I just wanted the max. time that a program can take so that the performance would not be hampered.
Thanks,
Binay.

did you ask for the 'ideal execution time' or 'how to measure execution times'?
The second question was answered in one of your other questions.
Optimization:
Do SQL Trace, go to Summary by SQL statement, check 10 Top contributions (time = duration).
Try to optimize them, note minimal time per record, if larger than 10.000 microsecodns, then you should index usage.
Do SE30, go to hit list, sort by net time, again address 10 Top contributions, try to optimize, check the coding.
Do optimization and trace again, check again 10 Top contributions ....
Siegfried

How to measure fpga execution time

Howdy--
I'm hacking through my first FPGA project without yet having the hardware on hand, and I find I could answer a lot of my own questions if I could predict what the execution time (ticks, mSec, whatever) of bits of my code will be. Running FPGA VIs on the Dev Computer with built in tick counters does not seem to be the proper way to go. Is it possible to know the execution time of FPGA code before compiling and running it on the target?
If it matters to anyone, my context for the question is a situation where a 10 uSec loop is imposed by the sample time of my hardware (cRIO 9076, with a couple of 100 ks/S I/O cards), and I'm trying to figure out how much signal processing I can afford between samples.
Thanks everyone, and have a great day.
Solved!
Go to Solution.

bcro,
You can look into cycle accurate simulation, which would give you a better understanding of how your code will work. More information can be found here: http://zone.ni.com/devzone/cda/tut/p/id/12917
As a rough measure, you can estimate that simple functions will take one tick to execute. However, there is not list of what is and is not a simple function.
You could also try placing code inside a single cycle timed loop (SCTL), which would then guarantee that all of the code in the loop will execute in 1 tick. However, if you are doing a lot of operations or trying to acquire an analog input, this will fail compilation.
Drew T.
NIC AE Specialist

Measure execution time with PowerShell

Similar Messages

Maybe you are looking for