VISA Serial and Elapsed Time as a Timeout
Hi folks,
Still new to LabView, so please bear with me...
I have a VI that sits and wait for a certain character string to arrive over the serial port, but I need a timeout that doesn't rely on the VISA timeout.
I expect a bunch of text through the serial port for ~45 seconds, then my input string will compare the matching string and move on to the next VI.
In the event of no string match, the serial port may keep on sending serial data, or may be inactive (non-determinisitic because this test is to see if a computer system booted correctly). But once the VI starts, I should have 60 seconds to find the match, or set the bool output 'selection' to fail.
I have tried putting my Elapsed Time loop inside the main loop, outside, with/without SRs, and now I'm at a loss. I looked at the VI highlighted and the serial activity wasn't active until the 60 second timer expired.
Please take a look at the attached, and thanks for taking a look at this post.
Solved!
Go to Solution.
Attachments:
Untitled 1 (SubVI).vi 33 KB
I'm not entirely certain that I understand what you are trying to accomplish. However here are my thoughts:
The VI you attached will wait 60 seconds before checking the serial port for waiting bytes ONCE then read bytes if they are availale and quit immediately. This is because you have the while loop around the elapsed time and it must execute completely before moving on to the serial communication loop.
I assume you have setup the serial port and set termination characters, etc in a main vi
Please try the modified VI attached and let us know if that helps
Thanks,
Charles Chickering
Charles Chickering
Architecture is art with rules.
...and the rules are more like guidelines
Attachments:
Untitled 1 (SubVI) Modified.vi 33 KB
Similar Messages
-
Same sqlID with different execution plan and Elapsed Time (s), Executions time
Hello All,
The AWR reports for two days with same sqlID with different execution plan and Elapsed Time (s), Executions time please help me to find out what is reason for this change.
Please find the below detail 17th day my process are very slow as compare to 18th
17th Oct 18th Oct
221,808,602
21
2tc2d3u52rppt
213,170,100
72,495,618
9c8wqzz7kyf37
209,239,059
71,477,888
9c8wqzz7kyf37
139,331,777
1
7b0kzmf0pfpzn
144,813,295
1
0cqc3bxxd1yqy
102,045,818
1
8vp1ap3af0ma5
128,892,787
16,673,829
84cqfur5na6fg
89,485,065
1
5kk8nd3uzkw13
127,467,250
16,642,939
1uz87xssm312g
67,520,695
8,058,820
a9n705a9gfb71
104,490,582
12,443,376
a9n705a9gfb71
62,627,205
1
ctwjy8cs6vng2
101,677,382
15,147,771
3p8q3q0scmr2k
57,965,892
268,353
akp7vwtyfmuas
98,000,414
1
0ybdwg85v9v6m
57,519,802
53
1kn9bv63xvjtc
87,293,909
1
5kk8nd3uzkw13
52,690,398
0
9btkg0axsk114
77,786,274
74
1kn9bv63xvjtc
34,767,882
1,003
bdgma0tn8ajz9
Not only queries are different but also the number of blocks read by top 10 queries are much higher on 17th than 18th.
The other big difference is the average read time on two days
Tablespace IO Stats
17th Oct
Tablespace
Reads
Av Reads/s
Av Rd(ms)
Av Blks/Rd
Writes
Av Writes/s
Buffer Waits
Av Buf Wt(ms)
INDUS_TRN_DATA01
947,766
59
4.24
4.86
185,084
11
2,887
6.42
UNDOTBS2
517,609
32
4.27
1.00
112,070
7
108
11.85
INDUS_MST_DATA01
288,994
18
8.63
8.38
52,541
3
23,490
7.45
INDUS_TRN_INDX01
223,581
14
11.50
2.03
59,882
4
533
4.26
TEMP
198,936
12
2.77
17.88
11,179
1
732
2.13
INDUS_LOG_DATA01
45,838
3
4.81
14.36
348
0
1
0.00
INDUS_TMP_DATA01
44,020
3
4.41
16.55
244
0
1,587
4.79
SYSAUX
19,373
1
19.81
1.05
14,489
1
0
0.00
INDUS_LOG_INDX01
17,559
1
4.75
1.96
2,837
0
2
0.00
SYSTEM
7,881
0
12.15
1.04
1,361
0
109
7.71
INDUS_TMP_INDX01
1,873
0
11.48
13.62
231
0
0
0.00
INDUS_MST_INDX01
256
0
13.09
1.04
194
0
2
10.00
UNDOTBS1
70
0
1.86
1.00
60
0
0
0.00
STG_DATA01
63
0
1.27
1.00
60
0
0
0.00
USERS
63
0
0.32
1.00
60
0
0
0.00
INDUS_LOB_DATA01
62
0
0.32
1.00
60
0
0
0.00
TS_AUDIT
62
0
0.48
1.00
60
0
0
0.00
18th Oct
Tablespace
Reads
Av Reads/s
Av Rd(ms)
Av Blks/Rd
Writes
Av Writes/s
Buffer Waits
Av Buf Wt(ms)
INDUS_TRN_DATA01
980,283
91
1.40
4.74The AWR reports for two days with same sqlID with different execution plan and Elapsed Time (s), Executions time please help me to find out what is reason for this change.
Please find the below detail 17th day my process are very slow as compare to 18th
You wrote with different execution plan, I think, you saw plans. It is very difficult, you get old plan.
I think Execution plans is not changed in different days, if you not added index or ...
What say ADDM report about this script?
As you know, It is normally, different Elapsed Time for same statement in different day.
It is depend your database workload.
It think you must use SQL Access and SQl Tuning advisor for this script.
You can get solution for slow running problem.
Regards
Mahir M. Quluzade -
Diffrence between cpu and elapse time in tkprof
Hi All
i found huge diffrence between cpu and elapsed time in tkprof. can you please advice me on this issue.
>call count cpu elapsed disk query current rows
==================================================
Parse 1 0.12 1.36 2 11 0 0
Execute 1 14.30 720.20 46548 190520 205 100
Fetch 0 0.00 0.00 0 0 0 0
======================================================
total 2 14.42 721.56 46550 190531 205 100
Misses in library cache during parse: 1
Optimizer goal: CHOOSE
Parsing user id: 173 (recursive depth: 1)
Elapsed times include waiting on following events:
Event waited on Times waited Max. Wait Total Waited
===========================================
db file sequential read 46544 0.49 632.12
db file scattered read 1 0.00 0.00
my select statement
SELECT cst.customer_id> ,DECODE(COUNT(cr.deposit_date), 0, 0, ROUND(SUM(cr.deposit_date - ps.trx_date) / COUNT(cr.deposit_date))) avgdays
> ,DECODE(COUNT(cr.deposit_date), 0, 0, ROUND(SUM(cr.deposit_date - ps.due_date) / COUNT(cr.deposit_date))) avgdayslate
> ,NVL(SUM(DECODE(SIGN(cr.deposit_date - ps.due_date),1, 1, 0)), 0) newlate
> ,NVL(SUM( DECODE(SIGN(cr.deposit_date - ps.due_date),1, 0, 1)), 0) newontime
>
> FROM ar_receivable_applications_all ra
> ,ar_cash_receipts_all cr
> ,ar_payment_schedules_all ps
> ,zz_ar_customer_summary_all cst
> WHERE ra.cash_receipt_id = cr.cash_receipt_id
> AND ra.apply_date BETWEEN ADD_MONTHS(SYSDATE, -12) AND SYSDATE
> AND ra.status = 'APP'
> AND ra.display = 'Y'
> AND ra.applied_payment_schedule_id = ps.payment_schedule_id
> AND ps.customer_id = cst.customer_id
> AND NVL(ps.receipt_confirmed_flag,'Y') = 'Y'
> group by cst.customer_id ;
Thanks,
Anuuser653066 wrote:
Hi All
i found huge diffrence between cpu and elapsed time in tkprof. can you please advice me on this issue.
call count cpu elapsed disk query current rows
================================================================================
Parse 1 0.12 1.36 2 11 0 0
Execute 1 14.30 720.20 46548 190520 205 100
Fetch 0 0.00 0.00 0 0 0 0
================================================================================
total 2 14.42 721.56 46550 190531 205 100
Misses in library cache during parse: 1
Optimizer goal: CHOOSE
Parsing user id: 173 (recursive depth: 1)
Elapsed times include waiting on following events:
Event waited on Times waited Max. Wait Total Waited
===========================================================================
db file sequential read 46544 0.49 632.12
db file scattered read 1 0.00 0.00
SELECT cst.customer_id
,DECODE(COUNT(cr.deposit_date), 0, 0, ROUND(SUM(cr.deposit_date - ps.trx_date) / COUNT(cr.deposit_date))) avgdays
,DECODE(COUNT(cr.deposit_date), 0, 0, ROUND(SUM(cr.deposit_date - ps.due_date) / COUNT(cr.deposit_date))) avgdayslate
,NVL(SUM(DECODE(SIGN(cr.deposit_date - ps.due_date),1, 1, 0)), 0) newlate
,NVL(SUM( DECODE(SIGN(cr.deposit_date - ps.due_date),1, 0, 1)), 0) newontime
FROM ar_receivable_applications_all ra
,ar_cash_receipts_all cr
,ar_payment_schedules_all ps
,zz_ar_customer_summary_all cst
WHERE ra.cash_receipt_id = cr.cash_receipt_id
AND ra.apply_date BETWEEN ADD_MONTHS(SYSDATE, -12) AND SYSDATE
AND ra.status = 'APP'
AND ra.display = 'Y'
AND ra.applied_payment_schedule_id = ps.payment_schedule_id
AND ps.customer_id = cst.customer_id
AND NVL(ps.receipt_confirmed_flag,'Y') = 'Y'
group by cst.customer_id ; Toon Koppelaars seems to have pinpointed the problem. Where are the 74 seconds unaccounted for seconds (I might have calculated it incorrectly, but I arrived at 88.08 seconds of unaccounted for time: 721.56 total - 1.36 parse - 632.12 db file sequential reads)?
It is interesting that the maximum wait for a single block read reported by TKPROF is 0.49 seconds - this might be an indication of excessive competition for the server's CPU - processes are waiting in the CPU run queue, and therefore not on the CPU. As Toon indicated, 632.12 of the 721.56 seconds were spent waiting for single block reads to complete with 46,544 blocks read. Note also that the query executed at dep=1, and TKPROF may be providing misleading information about what actually happened during those executions. An example of misleading information:
CREATE TABLE T11 (
C1 NUMBER,
C2 VARCHAR2(30));
CREATE TABLE T12 (
C1 NUMBER,
C2 VARCHAR2(30));
CREATE TABLE T13 (
C1 NUMBER,
C2 VARCHAR2(30));
CREATE TABLE T14 (
C1 NUMBER,
C2 VARCHAR2(30));
CREATE OR REPLACE TRIGGER HPM_T11 AFTER
INSERT OR DELETE OR UPDATE OF C1 ON T11
REFERENCING OLD AS OLDDATA NEW AS NEWDATA FOR EACH ROW
BEGIN
IF INSERTING THEN
INSERT INTO T12
SELECT
ROWNUM,
DBMS_RANDOM.STRING('A',25)
FROM
DUAL
CONNECT BY
LEVEL <= 100;
END IF;
END;
CREATE OR REPLACE TRIGGER HPM_T12 AFTER
INSERT OR DELETE OR UPDATE OF C1 ON T12
REFERENCING OLD AS OLDDATA NEW AS NEWDATA FOR EACH ROW
BEGIN
IF INSERTING THEN
INSERT INTO T13
SELECT
ROWNUM,
DBMS_RANDOM.STRING('A',25)
FROM
DUAL
CONNECT BY
LEVEL <= 100;
END IF;
END;
CREATE OR REPLACE TRIGGER HPM_T13 AFTER
INSERT OR DELETE OR UPDATE OF C1 ON T13
REFERENCING OLD AS OLDDATA NEW AS NEWDATA FOR EACH ROW
BEGIN
IF INSERTING THEN
INSERT INTO T14
SELECT
ROWNUM,
DBMS_RANDOM.STRING('A',25)
FROM
DUAL
CONNECT BY
LEVEL <= 100;
END IF;
END;
ALTER SESSION SET TRACEFILE_IDENTIFIER = 'MY_TEST_FIND_ME2';
ALTER SESSION SET EVENTS '10046 TRACE NAME CONTEXT FOREVER, LEVEL 8';
SET TIMING ON
INSERT INTO T11 VALUES (1,'MY LITTLE TEST CASE');
ALTER SESSION SET EVENTS '10046 TRACE NAME CONTEXT OFF';The partial TKPROF output:
INSERT INTO T11
VALUES
(1,'MY LITTLE TEST CASE')
call count cpu elapsed disk query current rows
Parse 1 0.00 0.00 0 8 0 0
Execute 1 0.00 0.00 0 9788 29 1
Fetch 0 0.00 0.00 0 0 0 0
total 2 0.00 0.00 0 9796 29 1
Misses in library cache during parse: 1
Optimizer mode: ALL_ROWS
Parsing user id: 56
Rows Row Source Operation
0 LOAD TABLE CONVENTIONAL (cr=9788 pr=7 pw=0 time=0 us)
Elapsed times include waiting on following events:
Event waited on Times Max. Wait Total Waited
---------------------------------------- Waited ---------- ------------
SQL*Net message to client 1 0.00 0.00
SQL*Net message from client 1 0.00 0.00
SQL ID : 6asaf110fgaqg
INSERT INTO T12 SELECT ROWNUM, DBMS_RANDOM.STRING('A',25) FROM DUAL CONNECT
BY LEVEL <= 100
call count cpu elapsed disk query current rows
Parse 1 0.00 0.00 0 0 0 0
Execute 1 0.04 0.09 0 2 130 100
Fetch 0 0.00 0.00 0 0 0 0
total 2 0.04 0.09 0 2 130 100
Misses in library cache during parse: 1
Optimizer mode: ALL_ROWS
Parsing user id: 56 (recursive depth: 1)
Rows Row Source Operation
0 LOAD TABLE CONVENTIONAL (cr=9754 pr=7 pw=0 time=0 us)
100 COUNT (cr=0 pr=0 pw=0 time=0 us)
100 CONNECT BY WITHOUT FILTERING (cr=0 pr=0 pw=0 time=0 us)
1 FAST DUAL (cr=0 pr=0 pw=0 time=0 us cost=2 size=0 card=1)
SQL ID : db46bkvy509w4
INSERT INTO T13 SELECT ROWNUM, DBMS_RANDOM.STRING('A',25) FROM DUAL CONNECT
BY LEVEL <= 100
call count cpu elapsed disk query current rows
Parse 1 0.00 0.00 0 0 0 0
Execute 100 1.31 1.27 0 93 10634 10000
Fetch 0 0.00 0.00 0 0 0 0
total 101 1.31 1.27 0 93 10634 10000
Misses in library cache during parse: 1
Optimizer mode: ALL_ROWS
Parsing user id: 56 (recursive depth: 2)
Rows Row Source Operation
0 LOAD TABLE CONVENTIONAL (cr=164 pr=0 pw=0 time=0 us)
100 COUNT (cr=0 pr=0 pw=0 time=0 us)
100 CONNECT BY WITHOUT FILTERING (cr=0 pr=0 pw=0 time=0 us)
1 FAST DUAL (cr=0 pr=0 pw=0 time=0 us cost=2 size=0 card=1)
SQL ID : 6542yyk084rpu
INSERT INTO T14 SELECT ROWNUM, DBMS_RANDOM.STRING('A',25) FROM DUAL CONNECT
BY LEVEL <= 100
call count cpu elapsed disk query current rows
Parse 2 0.00 0.00 0 0 0 0
Execute 10001 41.60 41.84 0 8961 52859 1000000
Fetch 0 0.00 0.00 0 0 0 0
total 10003 41.60 41.84 0 8961 52859 1000000
Misses in library cache during parse: 1
Optimizer mode: ALL_ROWS
Parsing user id: 56 (recursive depth: 3)
Rows Row Source Operation
0 LOAD TABLE CONVENTIONAL (cr=2 pr=0 pw=0 time=0 us)
100 COUNT (cr=0 pr=0 pw=0 time=0 us)
100 CONNECT BY WITHOUT FILTERING (cr=0 pr=0 pw=0 time=0 us)
1 FAST DUAL (cr=0 pr=0 pw=0 time=0 us cost=2 size=0 card=1)
Elapsed times include waiting on following events:
Event waited on Times Max. Wait Total Waited
---------------------------------------- Waited ---------- ------------
log file switch completion 2 0.07 0.07
********************************************************************************In the above note that the "INSERT INTO T11" is reported as completing in 0 seconds, but it actually required roughly 42 seconds - and that would be visible by manually reviewing the resulting trace file. Also note that the log file switch completion wait was not reported for the "INSERT INTO T11" even though it impacted the execution time.
Back to the possibility of CPU starvation causing lost time. Another test with an otherwise idle server, followed by a second test with the same server having 240 other processes fighting for CPU resources (a simulated load).
ALTER SYSTEM FLUSH BUFFER_CACHE;
ALTER SESSION SET TRACEFILE_IDENTIFIER = 'MY_TEST_QUERY_NO_LOAD';
ALTER SESSION SET EVENTS '10046 TRACE NAME CONTEXT FOREVER, LEVEL 8';
SET TIMING ON
SELECT
COUNT(*)
FROM
T14;
SELECT
SYSDATE
FROM
DUAL;
SQL> SELECT
2 COUNT(*)
3 FROM
4 T14;
COUNT(*)
1000000
Elapsed: 00:00:01.37With no load the COUNT(*) completed in 1.37 seconds. The TKPROF output looks like this:
SQL ID : gy8nw9xzyg3bj
SELECT /* OPT_DYN_SAMP */ /*+ ALL_ROWS IGNORE_WHERE_CLAUSE
NO_PARALLEL(SAMPLESUB) opt_param('parallel_execution_enabled', 'false')
NO_PARALLEL_INDEX(SAMPLESUB) NO_SQL_TUNE */ NVL(SUM(C1),:"SYS_B_0"),
NVL(SUM(C2),:"SYS_B_1")
FROM
(SELECT /*+ NO_PARALLEL("T14") FULL("T14") NO_PARALLEL_INDEX("T14") */
:"SYS_B_2" AS C1, :"SYS_B_3" AS C2 FROM "T14" SAMPLE BLOCK (:"SYS_B_4" ,
:"SYS_B_5") SEED (:"SYS_B_6") "T14") SAMPLESUB
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 0.01 0.84 523 172 1 1
total 3 0.01 0.84 523 172 1 1
Misses in library cache during parse: 1
Misses in library cache during execute: 1
Optimizer mode: ALL_ROWS
Parsing user id: 56 (recursive depth: 1)
Rows Row Source Operation
1 SORT AGGREGATE (cr=172 pr=523 pw=0 time=0 us)
8733 TABLE ACCESS SAMPLE T14 (cr=172 pr=523 pw=0 time=0 us cost=2 size=12 card=1)
Elapsed times include waiting on following events:
Event waited on Times Max. Wait Total Waited
---------------------------------------- Waited ---------- ------------
db file sequential read 3 0.02 0.04
db file parallel read 1 0.31 0.31
db file scattered read 52 0.03 0.47
SQL ID : 96g93hntrzjtr
select /*+ rule */ bucket_cnt, row_cnt, cache_cnt, null_cnt, timestamp#,
sample_size, minimum, maximum, distcnt, lowval, hival, density, col#,
spare1, spare2, avgcln
from
hist_head$ where obj#=:1 and intcol#=:2
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 0.00 0.06 2 2 0 0
total 3 0.00 0.06 2 2 0 0
Misses in library cache during parse: 0
Optimizer mode: RULE
Parsing user id: SYS (recursive depth: 2)
Rows Row Source Operation
0 TABLE ACCESS BY INDEX ROWID HIST_HEAD$ (cr=2 pr=2 pw=0 time=0 us)
0 INDEX RANGE SCAN I_HH_OBJ#_INTCOL# (cr=2 pr=2 pw=0 time=0 us)(object id 413)
Elapsed times include waiting on following events:
Event waited on Times Max. Wait Total Waited
---------------------------------------- Waited ---------- ------------
db file sequential read 2 0.02 0.04
SELECT
COUNT(*)
FROM
T14
call count cpu elapsed disk query current rows
Parse 1 0.00 0.00 1 1 0 0
Execute 1 0.00 0.00 0 0 0 0
Fetch 2 0.03 0.43 6558 6983 0 1
total 4 0.03 0.44 6559 6984 0 1
Misses in library cache during parse: 1
Optimizer mode: ALL_ROWS
Parsing user id: 56
Rows Row Source Operation
1 SORT AGGREGATE (cr=6983 pr=6558 pw=0 time=0 us)
1000000 TABLE ACCESS FULL T14 (cr=6983 pr=6558 pw=0 time=0 us cost=1916 size=0 card=976987)
Elapsed times include waiting on following events:
Event waited on Times Max. Wait Total Waited
---------------------------------------- Waited ---------- ------------
db file sequential read 1 0.02 0.02
SQL*Net message to client 2 0.00 0.00
db file scattered read 111 0.02 0.38
SQL*Net message from client 2 0.00 0.00Note that TKPROF reported that it only required 0.44 seconds for the query to execute while the SQL*Plus timing indicate that it required 1.37 seconds for the SQL statement to execute. The SQL optimization (parse) with dynamic sampling query accounted for the remaining time, yet TKPROF provided no indication that this was the case.
Now the query with 240 other processes competing for CPU time:
ALTER SYSTEM FLUSH BUFFER_CACHE;
ALTER SESSION SET TRACEFILE_IDENTIFIER = 'MY_TEST_QUERY_WITH_LOAD';
SELECT COUNT(*) FROM T14;
SELECT
SYSDATE
FROM
DUAL;
SQL> SELECT COUNT(*) FROM T14;
COUNT(*)
1000000
Elapsed: 00:00:59.03The query this time required just over 59 seconds. The TKPROF output:
SQL ID : gy8nw9xzyg3bj
SELECT /* OPT_DYN_SAMP */ /*+ ALL_ROWS IGNORE_WHERE_CLAUSE
NO_PARALLEL(SAMPLESUB) opt_param('parallel_execution_enabled', 'false')
NO_PARALLEL_INDEX(SAMPLESUB) NO_SQL_TUNE */ NVL(SUM(C1),:"SYS_B_0"),
NVL(SUM(C2),:"SYS_B_1")
FROM
(SELECT /*+ NO_PARALLEL("T14") FULL("T14") NO_PARALLEL_INDEX("T14") */
:"SYS_B_2" AS C1, :"SYS_B_3" AS C2 FROM "T14" SAMPLE BLOCK (:"SYS_B_4" ,
:"SYS_B_5") SEED (:"SYS_B_6") "T14") SAMPLESUB
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 0.00 0.28 423 69 0 1
total 3 0.00 0.28 423 69 0 1
Misses in library cache during parse: 0
Optimizer mode: ALL_ROWS
Parsing user id: 56 (recursive depth: 1)
Rows Row Source Operation
1 SORT AGGREGATE (cr=69 pr=423 pw=0 time=0 us)
8733 TABLE ACCESS SAMPLE T14 (cr=69 pr=423 pw=0 time=0 us cost=2 size=12 card=1)
Elapsed times include waiting on following events:
Event waited on Times Max. Wait Total Waited
---------------------------------------- Waited ---------- ------------
db file scattered read 54 0.01 0.27
db file sequential read 2 0.00 0.00
SQL ID : 7h04kxpa13w1x
SELECT COUNT(*)
FROM
T14
call count cpu elapsed disk query current rows
Parse 1 0.00 0.03 1 1 0 0
Execute 1 0.00 0.00 0 0 0 0
Fetch 2 0.06 58.71 6551 6983 0 1
total 4 0.06 58.74 6552 6984 0 1
Misses in library cache during parse: 1
Optimizer mode: ALL_ROWS
Parsing user id: 56
Rows Row Source Operation
1 SORT AGGREGATE (cr=6983 pr=6551 pw=0 time=0 us)
1000000 TABLE ACCESS FULL T14 (cr=6983 pr=6551 pw=0 time=0 us cost=1916 size=0 card=976987)
Elapsed times include waiting on following events:
Event waited on Times Max. Wait Total Waited
---------------------------------------- Waited ---------- ------------
db file sequential read 1 0.02 0.02
SQL*Net message to client 2 0.00 0.00
db file scattered read 110 1.54 58.59
SQL*Net message from client 1 0.00 0.00Note in the above that the max wait for the db file scattered read is 1.54 seconds due to the extra CPU competition - about 3 times longer than your max wait for a single block read. On your database platform with single block reads, it might be possible that the time in the CPU run queue is not always counted in the db file sequential read wait time or the CPU wait time - what if your operating system is slow at returning timing information to the database instance due to CPU saturation - this might explain the 74 (or 88) lost seconds.
Charles Hooper
IT Manager/Oracle DBA
K&M Machine-Fabricating, Inc.
Edited by: Charles Hooper on Aug 28, 2009 10:26 AM
Fixing formatting problems -
Check Scan for NI435X and elapsed time doesn't run in loop
Dear all Labview Experts
i have 2 questions
(1) i written program with Check Scan for NI435X (input to no of scan to NI 435X read ) and one with only NI435X read( to read in voltage) with constant input to no of scan,
the data i obtained is attached in 2 doucments; With Check Scan and without check scan ( the left column is temperature read in ( a formula is used to convert volt to temperature, right column is time)
strangely the program with check scan shows values in negative ==> Voltage read in is 0, strange, why is this so??? and why is there a diff?? Hope u understand my question
(2) For elapsed time, i want to find the total elapsed time for the whole program as well as individual cases, there is no "running" elapsed time or individual running time,
what happen is that when the each case end, the time will jump (e.g. from 0 at start, it will change to 5.35 at end of case) , is there any where to make the time run, i need it because some case required
c
ondition such as case will move to next after 5 seconds, but if above case happen, the vi will only stop if i put >= 5 rather than just place = 5
hope u understand,
does it help if i placed the condition as another loop , will it mean the same things
Attach are vi and some doucments, however as my vi contains PID tool kit as will as ni435x ni DC power which cannot be opened if you do
not have these kits.......however mayb u can help to look at the portion of timing as this is the main problem i faced now.........
Hope it is not too confusing for you to understand me...........
i can only attach max 3, the next post i will attach 2 vis...........
Attachments:
Picture of check scan and without.rtf 15 KB
With Check Scan.txt 4 KB
Without Check Scan.txt 1 KBThks Brian
Attached are 3 VIs
1.the first vi is the one with the check scan
2. the next two vi the only diff is the placement of the where i put the elapsed time and time of each case.........(without check scan)--the first
one is within the big loop, the other outside big loop -- the purpose i did this is because when i run the vi with the timing in the big loop, the timing does not run continuously but "skip". for e.g. Denature time: from 0 . it jump to 5.15s without showing the running.............
i will attached another 2 vi s in my next attachment
Hope this clarifies a bit
your help is really appreciated
thks
Attachments:
PCR Control_State Machine_4 channel_Timing within Loop.vi 438 KB
PCR Control_State Machine_4 channel_with_check scan.vi 443 KB
PCR Control_State Machine_4 channel_Timing outside of loop.vi 442 KB -
Help with quit function and elapsed time function.
I have this annoying assignment game here and I am almost finished with it. I got two problems, the first is that the quit function partly works it quits from the game but it is giving me a "Guess is to high" message. I've tried so many things but nothing seems to work.
The other problem is that the elapsed time " *(long f = System.currentTimeMillis()/1000;)* " starts to count before you actually write something for example if you run the program without writing something for 5 minutes, the highscore list will show your time you finished the game + these 5 minutes.
If somebody could give me a hint or could explain to me how I could fix these problems I would be very thankful.
import java.util.*;
class Game {
public static void main(String[] arg) {
int RAN,Entered_number=0,count=0;
String guess1[] = new String[1];
int guess2[] = new int[1];
int time[] = new int[1];
String NP1[];
int NP2[];
int NP3[];
int j=0;
Scanner scan=new Scanner(System.in);
Scanner kb = new Scanner(System.in);
Random myRandomizer = new Random();
RAN= Math.abs(myRandomizer.nextInt() % 1000) + 1;
System.out.println("\t\t\t"+"Hello and welcome to this guessing game!");
System.out.println("\t\t\t"+"Start guessing, it's a number between 1 and 1000...");
System.out.print("--------------------------------------------------");
System.out.println("-----------------------------");
System.out.println("please enter your number:");
String control="";//control is just a name for the variable. it's used to read in the whole line if you have written something that is not a number.
String name="";
String answer="";
boolean okgame=true;//is used so that you can play the game as long as the variable okgame is true.
long f = System.currentTimeMillis()/1000;
while((Entered_number!=RAN) && okgame)//controls if the number is different then RAN and that okgame is true.
System.out.print(RAN);
System.out.print(">");
if(scan.hasNextInt())//checks in advance that what you have written is a number, if so then it can read it as Entered_number.
Entered_number=scan.nextInt();
else
control=scan.nextLine();//Reads int the whole line to control what has been written in.
if(control.equalsIgnoreCase("quit"))//if control is = quit, then compare to will return 0.
okgame=false; //if you have written quit okgame, you put in false to quit the game.
// Entered_number=0;//initiates entered_number all over again to show message stupid guess i wont count that.
if(okgame)//as long as okgame is true it will show the result otherwise you go to else to show that the game is finished.
if((Entered_number>RAN)&&(Entered_number>=1)&&(Entered_number<=1000))
System.out.println("Guess is too high!");
count++;
else if((Entered_number<RAN)&&(Entered_number>=1)&&(Entered_number<=1000))
System.out.println("Guess is too low!");
count++;
else if((Entered_number>1000)||(Entered_number<1))
System.out.println("Stupid guess! I won't count that...");
else if (Entered_number==RAN)
long p = System.currentTimeMillis()/1000;
count++;
System.out.println("****Guess is CORRECT!");
System.out.print("****You guessed it in"+" "+count+" guesses and ");
System.out.print(p - f);
System.out.println(" seconds.");
System.out.println("please enter your name:");
System.out.print(">");
name=kb.next();
System.out.println("Do you want to play again ?(y/n)");
System.out.print(">");
answer=kb.next();
if(answer.equalsIgnoreCase("n"))
System.out.println("**** The game is over.");
okgame=false;
if(answer.equalsIgnoreCase("y"))
Random myRandom = new Random();
RAN = Math.abs(myRandom.nextInt() % 1000) + 1;
System.out.println("current high score list:");
long ttime = p-f;
int ta = (int)ttime;
j++;
if (j > 1){
NP1 = new String[j];
NP2 = new int[j];
NP3 = new int[j];
for (int n = 1; n < j; n++){
NP1[n-1] = guess1[n-1];
NP2[n-1] = guess2[n-1];
NP3[n-1] = time[n-1];
NP1[j-1] = name;
NP2[j-1] = count;
NP3[j-1] = ta;
guess1 = new String[j];
guess1 = NP1;
time = new int[j];
guess2 = new int[j];
guess2 = NP2;
time = NP3;
for (int w = 1; w < guess2.length; w++) {
for (int x = 1; x < guess2.length; x++) {
if (guess2[x] < guess2[x-1]) {
int z4, z5,z6,z7;
String z2, z3;
z4 = guess2[x];
z5 = guess2[x-1];
guess2[x] = z5;
guess2[x-1] = z4;
z2 = guess1[x];
z3 = guess1[x-1];
guess1[x] = z3;
guess1[x-1] = z2;
z6 = time[x];
z7 = time[x-1];
time[x] = z7;
time[x-1] = z6;
for (int al = 1; al < time.length; al++) {
for (int o = 1; o < time.length; o++) {
if (guess2[o] == guess2[o-1]) {
if (time[o] < time[o-1]) {
int z4, z5, z6 ,z7;
String z2, z3;
z2 = guess1[o]; z3 = guess1[o-1];
z4 = guess2[o]; z5 = guess2[o-1];
z6 = time[o]; z7 = time[o-1];
guess1[o] = z3; guess1[o-1] = z2;
guess2[o] = z5; guess2[o-1] = z4;
time[o] = z7; time[o-1] = z6;
else {
guess1[j-1] = name;
guess2[j-1] = count;
time[j-1] = ta;
System.out.println("Number\t\tName\t\tHigh Score\tTime (Seconds)");
System.out.println("------\t\t----\t\t----------\t--------------");
for (int h = 0; h < j; h++) {
System.out.println(" " + (h+1) + "\t\t" + guess1[h] + "\t\t" + guess2[h] + "\t\t" + time[h]);
System.out.println("");
System.out.println("Start guessing, it's a number between 1 and 1000...");
count=0;
//-----------------------------------------------------------------------------------------------------------------------------------------------------PS I'm not done with the comments yet so that could be a little confusing for you guys =P
Thanks!
/chillelse {
guess1[j-1] = name;
guess2[j-1] = count;
time[j-1] = ta;
System.out.println("Number\t\tName\t\tHigh Score\tTime (Seconds)");
System.out.println("------\t\t----\t\t----------\t--------------");
for (int h = 0; h < j; h++) {
System.out.println(" " + (h+1) + "\t\t" + guess1[h] + "\t\t" + guess2[h] + "\t\t" + time[h]);
System.out.println("");
System.out.println("Start guessing, it's a number between 1 and 1000...");
f=System.currentTimeMillis()/1000;////////////include this line here
count=0;
} -
CPU time and ELAPSED time in tkprof question
Hi,
I have a statment that is running more than 3 HR.
I run 10046 event and found that the CPU time and the ELAPSED time is almost the same:
call count cpu elapsed disk query current rows
Parse 2 0.00 0.00 0 0 0 0
Execute 2 0.00 0.00 0 3 0 1
Fetch 97 10175.76 10094.81 11216 56387604 0 1441
total 101 10175.76 10094.82 11216 56387607 0 1442
Is that can indicate of a problem in the machine ?
The TOP activity also shows 99% cpu usage.
CPU TTY PID USERNAME PRI NI SIZE RES STATE TIME %WCPU %CPU COMMAND
6 ? 24700 oracle 232 20 5448M 13184K run 195:34 99.18 99.00 oraclepcr
ThanksHi,
Thank you for your replay.
Its version 10204 on HP-UX with 24GB and 8 CPUs.
No i dont have any MERGE JOIN CARTESIAN.
The reason that i didnt upload the plan is because its too long...far too long ....
call count cpu elapsed disk query current rows
Parse 1 42.20 41.38 0 0 0 0
Execute 1 0.00 0.00 0 0 0 0
Fetch 5 444.12 447.27 1153 2486187 0 61
total 7 486.32 488.65 1153 2486187 0 61
Misses in library cache during parse: 1
Optimizer mode: ALL_ROWS
Parsing user id: 65 (PSSYS)
Rows Execution Plan
0 SELECT STATEMENT MODE: ALL_ROWS
0 UNION-ALL
0 CONCATENATION
0 NESTED LOOPS (OUTER)
0 NESTED LOOPS (OUTER)
0 NESTED LOOPS (OUTER)
0 NESTED LOOPS
0 NESTED LOOPS (OUTER)
0 NESTED LOOPS (OUTER)
0 NESTED LOOPS (OUTER)
0 NESTED LOOPS (OUTER)
0 NESTED LOOPS (OUTER)
0 NESTED LOOPS
0 NESTED LOOPS
0 NESTED LOOPS (OUTER)
0 HASH JOIN (OUTER)
0 HASH JOIN (OUTER)
0 NESTED LOOPS (OUTER)
0 NESTED LOOPS (OUTER)
0 NESTED LOOPS (OUTER)
0 NESTED LOOPS (OUTER)
0 NESTED LOOPS (OUTER)
0 NESTED LOOPS
0 NESTED LOOPS
0 NESTED LOOPS
(OUTER)
0 NESTED LOOPS
(OUTER)
0 NESTED LOOPS
(OUTER)
0 NESTED LOOPS
(OUTER)
0 NESTED
LOOPS (OUTER)
0 FILTER
0 HASH
JOIN (OUTER)
0
TABLE ACCESS MODE: ANALYZED (BY
INDEX ROWID) OF 'PS_RD_COMPANY'
(TABLE)
0
NESTED LOOPS
0
NESTED LOOPS (OUTER)
0
NESTED LOOPS
0
NESTED LOOPS
0
HASH JOIN
0
TABLE ACCESS MODE:
ANALYZED (FULL) OF 'PS_PROD
_ITEM' (TABLE)
0
TABLE ACCESS MODE:
ANALYZED (BY INDEX ROWID)
OF 'PS_RO_LINE' (TABLE)
0
NESTED LOOPS
0
HASH JOIN
0
INDEX MOD
E: ANALYZED (FULL SCAN)
OF 'PS0RO_DEFN_HDSTAT'
(INDEX)
0
TABLE ACCES
S MODE: ANALYZED (BY
INDEX ROWID) OF 'PS_RO_H
EADER' (TABLE)
0
INDEX
MODE: ANALYZED (RANGE
SCAN) OF 'PSERO_HEADER'
(INDEX)
0
INDEX MODE:
ANALYZED (RANGE SCAN) OF
'PSARO_LINE' (INDEX (UNIQ
UE))
0
TABLE ACCESS MODE:
ANALYZED (BY INDEX ROWID) OF
'PS_RO_BOID' (TABLE)
0
INDEX MODE: ANALYZ
ED (UNIQUE SCAN) OF 'PS_RO_
BOID' (INDEX (UNIQUE))
0
TABLE ACCESS MODE:
ANALYZED (BY INDEX ROWID) OF
'PS_RF_INST_PROD' (TABLE)
0
INDEX MODE: ANALYZED
(RANGE SCAN) OF 'PS_RF_INST_
PROD' (INDEX (UNIQUE))
0
TABLE ACCESS MODE: ANALYZED
(BY INDEX ROWID) OF 'PS_RD_PER
SON' (TABLE)
0
INDEX MODE: ANALYZED
(UNIQUE SCAN) OF 'PS_RD_PERSO
N' (INDEX (UNIQUE))
0
INDEX MODE: ANALYZED (RANGE
SCAN) OF 'PS0RD_COMPANY' (INDEX)
0 VIEW
OF 'XLATTABLE_VW' (VIEW)
0
NESTED LOOPS
0
TABLE ACCESS MODE: ANALYZED
(FULL) OF 'PSXLATITEM' (TABLE)
0
INDEX MODE: ANALYZED (UNIQUE
SCAN) OF 'PS_PSXLATDEFN' (INDEX
(UNIQUE))
0 TABLE
ACCESS MODE: ANALYZED (BY INDEX
ROWID) OF 'PS_RSF_INDUSTRY' (TABLE)
0 INDEX
MODE: ANALYZED (RANGE SCAN) OF
'PS3RSF_INDUSTRY' (INDEX)
0 TABLE
ACCESS MODE: ANALYZED (BY INDEX
ROWID) OF 'NAP_CATALOG_NUM' (TABLE)
0 INDEX
MODE: ANALYZED (UNIQUE SCAN) OF
'PS_NAP_CATALOG_NUM' (INDEX (UNIQUE)
0 MAT_VIEW
ACCESS MODE: ANALYZED (BY INDEX
ROWID) OF 'BB_CODE_TABLE' (MAT_VIEW)
0 INDEX
MODE: ANALYZED (RANGE SCAN) OF
'BB_CODE_TABLE_I' (INDEX)
0 MAT_VIEW
ACCESS MODE: ANALYZED (BY INDEX
ROWID) OF 'BB_CODE_TABLE' (MAT_VIEW)
0 INDEX
MODE: ANALYZED (RANGE SCAN) OF
'BB_CODE_TABLE_I' (INDEX)
0 MAT_VIEW ACCESS
MODE: ANALYZED (BY INDEX ROWID) OF
'IP_CONNECTION_TYPES' (MAT_VIEW)
0 INDEX MODE:
ANALYZED (RANGE SCAN) OF
'IP_CONNECTION_TYPES_X1' (INDEX)
0 TABLE ACCESS
MODE: ANALYZED (BY INDEX ROWID) OF
'NAP_INTERNET' (TABLE)
0 INDEX MODE:
ANALYZED (UNIQUE SCAN) OF
'PS_NAP_INTERNET' (INDEX (UNIQUE))
0 TABLE ACCESS MODE:
ANALYZED (BY INDEX ROWID) OF
'PS_RF_INST_PROD' (TABLE)
0 INDEX MODE:
ANALYZED (RANGE SCAN) OF
'PS_RF_INST_PROD' (INDEX (UNIQUE))
0 MAT_VIEW ACCESS
MODE: ANALYZED (BY INDEX ROWID) OF
'BB_CODE_TABLE' (MAT_VIEW)
0 INDEX MODE:
ANALYZED (RANGE SCAN) OF
'BB_CODE_TABLE_I' (INDEX)
0 TABLE ACCESS MODE:
ANALYZED (BY INDEX ROWID) OF
'NAP_CATALOG_NUM' (TABLE)
0 INDEX MODE: ANALYZED
(UNIQUE SCAN) OF 'PS_NAP_CATALOG_NUM'
(INDEX (UNIQUE))
0 MAT_VIEW ACCESS MODE:
ANALYZED (BY INDEX ROWID) OF 'BB_CODE_TABLE'
(MAT_VIEW)
0 INDEX MODE: ANALYZED
(RANGE SCAN) OF 'BB_CODE_TABLE_I' (INDEX)
0 MAT_VIEW ACCESS MODE:
ANALYZED (BY INDEX ROWID) OF 'BB_CODE_TABLE'
(MAT_VIEW)
0 INDEX MODE: ANALYZED
(RANGE SCAN) OF 'BB_CODE_TABLE_I' (INDEX)
0 MAT_VIEW ACCESS MODE:
ANALYZED (BY INDEX ROWID) OF
'IP_CONNECTION_TYPES' (MAT_VIEW)
0 INDEX MODE: ANALYZED
(RANGE SCAN) OF 'IP_CONNECTION_TYPES_X1'
(INDEX)
0 MAT_VIEW ACCESS MODE: ANALYZED
(FULL) OF 'IP_PIRSUM_CODE' (MAT_VIEW)
0 MAT_VIEW ACCESS MODE: ANALYZED
(FULL) OF 'IP_PIRSUM_CODE' (MAT_VIEW)
0 TABLE ACCESS MODE: ANALYZED (BY
INDEX ROWID) OF 'PS_BO_NAME' (TABLE)
0 INDEX MODE: ANALYZED (RANGE SCAN)
OF 'PS_BO_NAME' (INDEX (UNIQUE))
0 TABLE ACCESS MODE: ANALYZED (BY
INDEX ROWID) OF 'PS_BO_CM' (TABLE)
0 INDEX MODE: ANALYZED (RANGE SCAN)
OF 'PS_BO_CM' (INDEX (UNIQUE))
0 TABLE ACCESS MODE: ANALYZED (BY INDEX
ROWID) OF 'PS_BO_CM_USE' (TABLE)
0 INDEX MODE: ANALYZED (RANGE SCAN) OF
'PS_BO_CM_USE' (INDEX (UNIQUE))
0 TABLE ACCESS MODE: ANALYZED (BY INDEX
ROWID) OF 'PS_CM' (TABLE)
0 INDEX MODE: ANALYZED (UNIQUE SCAN) OF
'PS_CM' (INDEX (UNIQUE))
0 MAT_VIEW ACCESS MODE: ANALYZED (BY INDEX
ROWID) OF 'BB_CODE_TABLE' (MAT_VIEW)
0 INDEX MODE: ANALYZED (RANGE SCAN) OF
'BB_CODE_TABLE_I' (INDEX)
0 INDEX MODE: ANALYZED (FULL SCAN) OF
'PSHBO_NAME' (INDEX)
0 INDEX MODE: ANALYZED (RANGE SCAN) OF
'PS1RD_PERSON' (INDEX)
0 TABLE ACCESS MODE: ANALYZED (BY INDEX ROWID) OF
'PS_RB_WORKER' (TABLE)
0 INDEX MODE: ANALYZED (UNIQUE SCAN) OF
'PS_RB_WORKER' (INDEX (UNIQUE))
0 INDEX MODE: ANALYZED (FULL SCAN) OF 'PSHBO_NAME'
(INDEX)
0 TABLE ACCESS MODE: ANALYZED (BY INDEX ROWID) OF
'PS_RD_PERSON' (TABLE)
0 INDEX MODE: ANALYZED (RANGE SCAN) OF
'PS1RD_PERSON' (INDEX)
0 TABLE ACCESS MODE: ANALYZED (BY INDEX ROWID) OF
'PS_RF_GRP_MEMBER' (TABLE)
0 INDEX MODE: ANALYZED (RANGE SCAN) OF
'PSARF_GRP_MEMBER' (INDEX)
0 TABLE ACCESS MODE: ANALYZED (BY INDEX ROWID) OF
'PS_RF_PROVIDER_GRP' (TABLE)
0 INDEX MODE: ANALYZED (UNIQUE SCAN) OF
'PS_RF_PROVIDER_GRP' (INDEX (UNIQUE))
0 NESTED LOOPS (OUTER)
0 NESTED LOOPS (OUTER)
0 NESTED LOOPS (OUTER)
0 NESTED LOOPS
0 NESTED LOOPS (OUTER)
0 NESTED LOOPS (OUTER)
0 NESTED LOOPS (OUTER)
0 NESTED LOOPS (OUTER)
0 NESTED LOOPS (OUTER)
0 NESTED LOOPS
0 NESTED LOOPS
0 NESTED LOOPS (OUTER)
0 HASH JOIN (OUTER)
0 HASH JOIN (OUTER)
0 NESTED LOOPS (OUTER)
0 NESTED LOOPS (OUTER)
0 NESTED LOOPS (OUTER)
0 NESTED LOOPS (OUTER)
0 NESTED LOOPS (OUTER)
0 NESTED LOOPS
0 NESTED LOOPS
0 NESTED LOOPS
(OUTER)
0 NESTED LOOPS
(OUTER)
0 NESTED LOOPS
(OUTER)
0 NESTED LOOPS
(OUTER)
0 NESTED
LOOPS (OUTER)
0 FILTER
0 HASH
JOIN (OUTER)
0
TABLE ACCESS MODE: ANALYZED (BY
INDEX ROWID) OF 'PS_RD_COMPANY'
(TABLE)
0
NESTED LOOPS
0
NESTED LOOPS
0
NESTED LOOPS (OUTER)
0
NESTED LOOPS
0
HASH JOIN
0
TABLE ACCESS MODE:
ANALYZED (FULL) OF 'PS_PROD
_ITEM' (TABLE)
0
TABLE ACCESS MODE:
ANALYZED (BY INDEX ROWID)
OF 'PS_RO_LINE' (TABLE)
0
NESTED LOOPS
0
HASH JOIN
0
INDEX MOD
E: ANALYZED (FULL SCAN)
OF 'PS0RO_DEFN_HDSTAT'
(INDEX)
0
TABLE ACCES
S MODE: ANALYZED (BY
INDEX ROWID) OF 'PS_RO_H
EADER' (TABLE)
0
INDEX
MODE: ANALYZED (RANGE
SCAN) OF 'PSERO_HEADER'
(INDEX)
0
INDEX MODE:
ANALYZED (RANGE SCAN) OF
'PSARO_LINE' (INDEX (UNIQ
UE))
0
TABLE ACCESS MODE:
ANALYZED (BY INDEX ROWID) OF
'PS_RO_BOID' (TABLE)
0
INDEX MODE: ANALYZ
ED (UNIQUE SCAN) OF 'PS_RO_
BOID' (INDEX (UNIQUE))
0
TABLE ACCESS MODE:
ANALYZED (BY INDEX ROWID) OF
'PS_RD_PERSON' (TABLE)
0
INDEX MODE: ANALYZED
(UNIQUE SCAN) OF 'PS_RD_PERS
ON' (INDEX (UNIQUE))
0
TABLE ACCESS MODE: ANALYZED
(BY INDEX ROWID) OF 'PS_RF_INS
T_PROD' (TABLE)
0
INDEX MODE: ANALYZED
(RANGE SCAN) OF 'PS_RF_INST_P
ROD' (INDEX (UNIQUE))
0
INDEX MODE: ANALYZED (RANGE
SCAN) OF 'PS0RD_COMPANY' (INDEX)
0 VIEW
OF 'XLATTABLE_VW' (VIEW)
0
NESTED LOOPS
0
TABLE ACCESS MODE: ANALYZED
(FULL) OF 'PSXLATITEM' (TABLE)
0
INDEX MODE: ANALYZED (UNIQUE
SCAN) OF 'PS_PSXLATDEFN' (INDEX
(UNIQUE))
0 TABLE
ACCESS MODE: ANALYZED (BY INDEX
ROWID) OF 'PS_RSF_INDUSTRY' (TABLE)
0 INDEX
MODE: ANALYZED (RANGE SCAN) OF
'PS3RSF_INDUSTRY' (INDEX)
0 TABLE
ACCESS MODE: ANALYZED (BY INDEX
ROWID) OF 'NAP_CATALOG_NUM' (TABLE)
0 INDEX
MODE: ANALYZED (UNIQUE SCAN) OF
'PS_NAP_CATALOG_NUM' (INDEX (UNIQUE)
0 MAT_VIEW
ACCESS MODE: ANALYZED (BY INDEX
ROWID) OF 'BB_CODE_TABLE' (MAT_VIEW)
0 INDEX
MODE: ANALYZED (RANGE SCAN) OF
'BB_CODE_TABLE_I' (INDEX)
0 MAT_VIEW
ACCESS MODE: ANALYZED (BY INDEX
ROWID) OF 'BB_CODE_TABLE' (MAT_VIEW)
0 INDEX
MODE: ANALYZED (RANGE SCAN) OF
'BB_CODE_TABLE_I' (INDEX)
0 MAT_VIEW ACCESS
MODE: ANALYZED (BY INDEX ROWID) OF
'IP_CONNECTION_TYPES' (MAT_VIEW)
0 INDEX MODE:
ANALYZED (RANGE SCAN) OF
'IP_CONNECTION_TYPES_X1' (INDEX)
0 TABLE ACCESS
MODE: ANALYZED (BY INDEX ROWID) OF
'NAP_INTERNET' (TABLE)
0 INDEX MODE:
ANALYZED (UNIQUE SCAN) OF
'PS_NAP_INTERNET' (INDEX (UNIQUE))
0 TABLE ACCESS MODE:
ANALYZED (BY INDEX ROWID) OF
'PS_RF_INST_PROD' (TABLE)
0 INDEX MODE:
ANALYZED (RANGE SCAN) OF
'PS_RF_INST_PROD' (INDEX (UNIQUE))
0 MAT_VIEW ACCESS
MODE: ANALYZED (BY INDEX ROWID) OF
'BB_CODE_TABLE' (MAT_VIEW)
0 INDEX MODE:
ANALYZED (RANGE SCAN) OF
'BB_CODE_TABLE_I' (INDEX)
0 TABLE ACCESS MODE:
ANALYZED (BY INDEX ROWID) OF
'NAP_CATALOG_NUM' (TABLE)
0 INDEX MODE: ANALYZED
(UNIQUE SCAN) OF 'PS_NAP_CATALOG_NUM'
(INDEX (UNIQUE))
0 MAT_VIEW ACCESS MODE:
ANALYZED (BY INDEX ROWID) OF 'BB_CODE_TABLE'
(MAT_VIEW)
0 INDEX MODE: ANALYZED
(RANGE SCAN) OF 'BB_CODE_TABLE_I' (INDEX)
0 MAT_VIEW ACCESS MODE:
ANALYZED (BY INDEX ROWID) OF 'BB_CODE_TABLE'
(MAT_VIEW)
0 INDEX MODE: ANALYZED
(RANGE SCAN) OF 'BB_CODE_TABLE_I' (INDEX)
0 MAT_VIEW ACCESS MODE:
ANALYZED (BY INDEX ROWID) OF
'IP_CONNECTION_TYPES' (MAT_VIEW)
0 INDEX MODE: ANALYZED
(RANGE SCAN) OF 'IP_CONNECTION_TYPES_X1'
(INDEX)
0 MAT_VIEW ACCESS MODE: ANALYZED
(FULL) OF 'IP_PIRSUM_CODE' (MAT_VIEW)
0 MAT_VIEW ACCESS MODE: ANALYZED
(FULL) OF 'IP_PIRSUM_CODE' (MAT_VIEW)
0 TABLE ACCESS MODE: ANALYZED (BY
INDEX ROWID) OF 'PS_BO_NAME' (TABLE)
0 INDEX MODE: ANALYZED (RANGE SCAN)
OF 'PS_BO_NAME' (INDEX (UNIQUE))
0 TABLE ACCESS MODE: ANALYZED (BY
INDEX ROWID) OF 'PS_BO_CM' (TABLE)
0 INDEX MODE: ANALYZED (RANGE SCAN)
OF 'PS_BO_CM' (INDEX (UNIQUE))
0 TABLE ACCESS MODE: ANALYZED (BY INDEX
ROWID) OF 'PS_BO_CM_USE' (TABLE)
0 INDEX MODE: ANALYZED (RANGE SCAN) OF
'PS_BO_CM_USE' (INDEX (UNIQUE))
0 TABLE ACCESS MODE: ANALYZED (BY INDEX
ROWID) OF 'PS_CM' (TABLE)
0 INDEX MODE: ANALYZED (UNIQUE SCAN) OF
'PS_CM' (INDEX (UNIQUE))
0 MAT_VIEW ACCESS MODE: ANALYZED (BY INDEX
ROWID) OF 'BB_CODE_TABLE' (MAT_VIEW)
0 INDEX MODE: ANALYZED (RANGE SCAN) OF
'BB_CODE_TABLE_I' (INDEX)
0 INDEX MODE: ANALYZED (FULL SCAN) OF
'PSHBO_NAME' (INDEX)
0 INDEX MODE: ANALYZED (RANGE SCAN) OF
'PS1RD_PERSON' (INDEX)
0 TABLE ACCESS MODE: ANALYZED (BY INDEX ROWID) OF
'PS_RB_WORKER' (TABLE)
0 INDEX MODE: ANALYZED (UNIQUE SCAN) OF
'PS_RB_WORKER' (INDEX (UNIQUE))
0 INDEX MODE: ANALYZED (FULL SCAN) OF 'PSHBO_NAME'
(INDEX)
0 TABLE ACCESS MODE: ANALYZED (BY INDEX ROWID) OF
'PS_RD_PERSON' (TABLE)
0 INDEX MODE: ANALYZED (RANGE SCAN) OF
'PS1RD_PERSON' (INDEX)
0 TABLE ACCESS MODE: ANALYZED (BY INDEX ROWID) OF
'PS_RF_GRP_MEMBER' (TABLE)
0 INDEX MODE: ANALYZED (RANGE SCAN) OF
'PSARF_GRP_MEMBER' (INDEX)
0 TABLE ACCESS MODE: ANALYZED (BY INDEX ROWID) OF
'PS_RF_PROVIDER_GRP' (TABLE)
0 INDEX MODE: ANALYZED (UNIQUE SCAN) OF
'PS_RF_PROVIDER_GRP' (INDEX (UNIQUE))
0 NESTED LOOPS (OUTER)
0 NESTED LOOPS (OUTER)
0 NESTED LOOPS (OUTER)
0 NESTED LOOPS (OUTER)
0 NESTED LOOPS (OUTER)
0 NESTED LOOPS
0 NESTED LOOPS
0 NESTED LOOPS (OUTER)
0 NESTED LOOPS (OUTER)
0 HASH JOIN (OUTER)
0 NESTED LOOPS (OUTER)
0 NESTED LOOPS (OUTER)
0 NESTED LOOPS (OUTER)
0 NESTED LOOPS
0 NESTED LOOPS (OUTER)
0 NESTED LOOPS
0 NESTED LOOPS
0 NESTED LOOPS (OUTER)
0 FILTER
0 NESTED LOOPS (OUTER)
0 NESTED LOOPS
0 NESTED LOOPS (OUTER)
0 NESTED LOOPS
(OUTER)
0 NESTED LOOPS
0 NESTED LOOPS
(OUTER)
0 NESTED LOOPS
(OUTER)
0 NESTED
LOOPS (OUTER)
0 NESTED
LOOPS
0 NESTED
LOOPS (OUTER)
0
NESTED LOOPS
0
HASH JOIN
0
TABLE ACCESS MODE: ANALYZED
(FULL) OF 'PS_PROD_ITEM' (TABLE)
0
TABLE ACCESS MODE: ANALYZED
(BY INDEX ROWID) OF 'PS_RO_LINE
' (TABLE)
0
NESTED LOOPS
0
HASH JOIN
0
INDEX MODE: ANALYZED
(FULL SCAN) OF 'PS0RO_DEFN_H
DSTAT' (INDEX)
0
TABLE ACCESS MODE:
ANALYZED (BY INDEX ROWID) OF
'PS_RO_HEADER' (TABLE)
0
INDEX MODE: ANALYZ
ED (RANGE SCAN) OF 'PSERO_H
EADER' (INDEX)
0
INDEX MODE: ANALYZED
(RANGE SCAN) OF 'PSARO_LINE'
(INDEX (UNIQUE))
0
TABLE ACCESS MODE: ANALYZED
(BY INDEX ROWID) OF 'PS_RO_BOID'
(TABLE)
0
INDEX MODE: ANALYZED (UNIQUE
SCAN) OF 'PS_RO_BOID' (INDEX
(UNIQUE))
0
TABLE ACCESS MODE: ANALYZED (BY
INDEX ROWID) OF 'PS_RD_PERSON'
(TABLE)
0
INDEX MODE: ANALYZED (UNIQUE
SCAN) OF 'PS_RD_PERSON' (INDEX
(UNIQUE))
0 TABLE
ACCESS MODE: ANALYZED (BY INDEX
ROWID) OF 'PS_RF_INST_PROD' (TABLE)
0
INDEX MODE: ANALYZED (RANGE
SCAN) OF 'PS_RF_INST_PROD' (INDEX
(UNIQUE))
0 TABLE
ACCESS MODE: ANALYZED (BY INDEX
ROWID) OF 'PS_BO_NAME' (TABLE)
0 INDEX
MODE: ANALYZED (RANGE SCAN) OF
'PS_BO_NAME' (INDEX (UNIQUE))
0 TABLE
ACCESS MODE: ANALYZED (BY INDEX
ROWID) OF 'NAP_CATALOG_NUM' (TABLE)
0 INDEX
MODE: ANALYZED (UNIQUE SCAN) OF
'PS_NAP_CATALOG_NUM' (INDEX (UNIQUE)
0 MAT_VIEW
ACCESS MODE: ANALYZED (BY INDEX
ROWID) OF 'IP_CONNECTION_TYPES'
(MAT_VIEW)
0 INDEX
MODE: ANALYZED (RANGE SCAN) OF
'IP_CONNECTION_TYPES_X1' (INDEX)
0 INDEX MODE:
ANALYZED (RANGE SCAN) OF
'PS_NAP_IP_DEBIT' (INDEX (UNIQUE))
0 SORT
(AGGREGATE)
0 INDEX
MODE: ANALYZED (RANGE SCAN) OF
'PS_NAP_IP_DEBIT' (INDEX (UNIQUE))
0 TABLE ACCESS
MODE: ANALYZED (BY INDEX ROWID) OF
'NAP_CATALOG_NUM' (TABLE)
0 INDEX MODE:
ANALYZED (UNIQUE SCAN) OF
'PS_NAP_CATALOG_NUM' (INDEX (UNIQUE))
0 MAT_VIEW ACCESS
MODE: ANALYZED (BY INDEX ROWID) OF
'IP_CONNECTION_TYPES' (MAT_VIEW)
0 INDEX MODE:
ANALYZED (RANGE SCAN) OF
'IP_CONNECTION_TYPES_X1' (INDEX)
0 TABLE ACCESS MODE:
ANALYZED (BY INDEX ROWID) OF
'PS_RD_COMPANY' (TABLE)
0 INDEX MODE:
ANALYZED (RANGE SCAN) OF 'PS0RD_COMPANY'
(INDEX)
0 VIEW PUSHED PREDICATE
OF 'XLATTABLE_VW' (VIEW)
0 NESTED LOOPS
0 TABLE ACCESS
MODE: ANALYZED (BY INDEX ROWID) OF
'PSXLATITEM' (TABLE)
0 INDEX MODE:
ANALYZED (RANGE SCAN) OF
'PSBPSXLATITEM' (INDEX)
0 INDEX MODE:
ANALYZED (UNIQUE SCAN) OF
'PS_PSXLATDEFN' (INDEX (UNIQUE))
0 TABLE ACCESS MODE:
ANALYZED (BY INDEX ROWID) OF
'PS_RSF_INDUSTRY' (TABLE)
0 INDEX MODE: ANALYZED
(RANGE SCAN) OF 'PS3RSF_INDUSTRY' (INDEX)
0 TABLE ACCESS MODE:
ANALYZED (BY INDEX ROWID) OF 'PS_BO_CM'
(TABLE)
0 INDEX MODE: ANALYZED
(RANGE SCAN) OF 'PS_BO_CM' (INDEX (UNIQUE))
0 TABLE ACCESS MODE: ANALYZED
(BY INDEX ROWID) OF 'PS_BO_CM_USE' (TABLE)
0 INDEX MODE: ANALYZED
(RANGE SCAN) OF 'PS_BO_CM_USE' (INDEX (UNIQUE)
0 TABLE ACCESS MODE: ANALYZED
(BY INDEX ROWID) OF 'PS_CM' (TABLE)
0 INDEX MODE: ANALYZED (UNIQUE
SCAN) OF 'PS_CM' (INDEX (UNIQUE))
0 TABLE ACCESS MODE: ANALYZED (BY
INDEX ROWID) OF 'NAP_INTERNET' (TABLE)
0 INDEX MODE: ANALYZED (UNIQUE
SCAN) OF 'PS_NAP_INTERNET' (INDEX (UNIQUE))
0 MAT_VIEW ACCESS MODE: ANALYZED (BY
INDEX ROWID) OF 'BB_CODE_TABLE' (MAT_VIEW)
0 INDEX MODE: ANALYZED (RANGE SCAN)
OF 'BB_CODE_TABLE_I' (INDEX)
0 MAT_VIEW ACCESS MODE: ANALYZED (BY
INDEX ROWID) OF 'BB_CODE_TABLE' (MAT_VIEW)
0 INDEX MODE: ANALYZED (RANGE SCAN)
OF 'BB_CODE_TABLE_I' (INDEX)
0 MAT_VIEW ACCESS MODE: ANALYZED (BY
INDEX ROWID) OF 'BB_CODE_TABLE' (MAT_VIEW)
0 INDEX MODE: ANALYZED (RANGE SCAN) OF
'BB_CODE_TABLE_I' (INDEX)
0 MAT_VIEW ACCESS MODE: ANALYZED (FULL) OF
'IP_PIRSUM_CODE' (MAT_VIEW)
0 MAT_VIEW ACCESS MODE: ANALYZED (BY INDEX
ROWID) OF 'BB_CODE_TABLE' (MAT_VIEW)
0 INDEX MODE: ANALYZED (RANGE SCAN) OF
'BB_CODE_TABLE_I' (INDEX)
0 MAT_VIEW ACCESS MODE: ANALYZED (BY INDEX
ROWID) OF 'BB_CODE_TABLE' (MAT_VIEW)
0 INDEX MODE: ANALYZED (RANGE SCAN) OF
'BB_CODE_TABLE_I' (INDEX)
0 TABLE ACCESS MODE: ANALYZED (BY INDEX ROWID)
OF 'PS_BO_NAME' (TABLE)
0 INDEX MODE: ANALYZED (RANGE SCAN) OF
'PS_BO_NAME_IDX1' (INDEX)
0 TABLE ACCESS MODE: ANALYZED (BY INDEX ROWID) OF
'PS_RD_PERSON' (TABLE)
0 INDEX MODE: ANALYZED (RANGE SCAN) OF
'PS1RD_PERSON' (INDEX)
0 TABLE ACCESS MODE: ANALYZED (BY INDEX ROWID) OF
'PS_RF_GRP_MEMBER' (TABLE)
0 INDEX MODE: ANALYZED (RANGE SCAN) OF
'PSARF_GRP_MEMBER' (INDEX)
0 TABLE ACCESS MODE: ANALYZED (BY INDEX ROWID) OF
'PS_RF_PROVIDER_GRP' (TABLE)
0 INDEX MODE: ANALYZED (UNIQUE SCAN) OF
'PS_RF_PROVIDER_GRP' (INDEX (UNIQUE))
0 TABLE ACCESS MODE: ANALYZED (BY INDEX ROWID) OF
'PS_BO_NAME' (TABLE)
0 INDEX MODE: ANALYZED (RANGE SCAN) OF
'PS_BO_NAME_IDX1' (INDEX)
0 INDEX MODE: ANALYZED (RANGE SCAN) OF 'PS1RD_PERSON'
(INDEX)
0 TABLE ACCESS MODE: ANALYZED (BY INDEX ROWID) OF
'PS_RB_WORKER' (TABLE)
0 INDEX MODE: ANALYZED (UNIQUE SCAN) OF 'PS_RB_WORKER'
(INDEX (UNIQUE)) -
Youtube videos won't show duration time and elapsed time!
Hello all.
I have a problem with YouTube on iOS 5.1.1
Whenever I play a video from YouTube in safari there is no duration time or elapsed time dispayed .
However restoring from an iCloud backup fixed the problem.
A few days later this problem occurred again. So I searched iCloud for any safari related elements, I found com.apple.webviewservice
I google it but I couldn't find any relations with playing videos;(
Then I discovered videos from other web page play without any problems so the problem only occurs only when i play YouTube videos from safari
Also I think this is a problem with the video player not safari because I used another browser (mercury) and tried to watch a video on YouTube, same problem. So I hope any of you have enough knowledge unlike me to help me solve this problem.Thanks for your support lllaass.
The YouTube app works just fine.
I just want to know what causes the problem.
Or is it a YouTube bug after all? -
I have successfully built a vi which communicates with a piece of equipment via the serial port using ASCII characters. I am trying to replace the older versions of Serial Read and Write VIs with the VISA Serial Read and Write VIs. The VISA Write works fine, but the when reading data coming from the "box", the VISA Read VI returns string data with foreign looking characters instead of the usual correct ASCII characters as shown by a dumb terminal which is in parallel with the serial data line. Is there a special property node which needs to be configured on the VISA Serial Read vi, or do I need to set something on the VISA Configure Serial port v
i?
Why aren't the VISA serial vis compatible with the older serial vis?
Thanks...Usually, garbage characters are an indication of a baud rate or parity mismatch, or maybe a stop bit or number of data bits setting. Make sure that you have configured your port correctly with VISA Configure Serial Port. I have used VISA serial successfully many times.
- tbob
Inventor of the WORM Global -
Repository Size / RPCLEAN elapsed time
I'm curious about people's repository size and their corresponding
rpclean elapsed time. Without other sizes and times to compare to,
there's no way of me knowing if our current environment is as
efficient as it can be.
If you don't mind, please send me your repository size and elapsed
time of your rpclean. (also send the number number of objects in the
rpclean stats if you can). At this point, I'm not interested in the
quick clean, just a full clean. Also include your platform that
you're running on. Please send information for all repositories that
you have.
Thanks.Randy Wilkinson wrote:
>
I'm curious about people's repository size and their corresponding
rpclean elapsed time. Without other sizes and times to compare to,
there's no way of me knowing if our current environment is as
efficient as it can be.The best way to keep your environment efficient, is to do cleans frequently.
If you have heavy development in your repos, do a quick clean every night and
a full clean on the weekend.
In addition, you should create a new repos from time to time. We use gemstone
and we have been told the repos degrade over time even when you keep it clean.
We always get great performance out of a new repos with plenty of code in it. I can
tell when our repos has degraded and it is time for a new one. It will get slow.
You can use rpcopy or create a new repos and import your code.
You really need to be pro-active with repository maintenance. You can work yourself
into a corner if your not cleaning or the cleans are failing (you have to check to make
sure the cleans are successful).
Another way to get better repos performance is with parallel disk I/O. Keep you
repositories on different drives (do not access them across NFS). You can create
symbolic links to the files.
Robert Crisafulli
AMISYS
301-838-7540
>
If you don't mind, please send me your repository size and elapsed
time of your rpclean. (also send the number number of objects in the
rpclean stats if you can). At this point, I'm not interested in the
quick clean, just a full clean. Also include your platform that
you're running on. Please send information for all repositories that
you have.
Thanks. -
Memory leak in Real-Time caused by VISA Read and Timed Loop data nodes? Doesn't make sense.
Working with LV 8.2.1 real-time to develop a host of applications that monitor or emulate computers on RS-422 busses. The following screen shots were taken from an application that monitors a 200Hz transmission. After a few hours, the PXI station would crash with an awesome array of angry messages...most implying something about a loss of memory. After much hair pulling and passing of the buck, my associate was able to discover while watching the available memory on the controller that memory loss was occurring with every loop containing a VISA read and error propogation using the data nodes (see Memory Leak.jpg). He found that if he switched the error propogation to regular old-fashioned shift registers, then the available memory was rock-solid. (a la No Memory Leak.jpg)
Any ideas what could be causing this? Do you see any problems with the way we code these sorts of loops? We are always attempting to optimize the way we use memory on our time-critical applications and VISA reads and DAQmx Reads give us the most heartache as we are never able to preallocate memory for these VIs. Any tips?
Dan Marlow
GDLS
Solved!
Go to Solution.
Attachments:
Memory Leak.JPG 136 KB
No Memory Leak.JPG 137 KBHi thisisnotadream,
This problem has been reported, and you seem to be exactly reproducing the conditions required to see this problem. This was reported to R&D (# 134314) for further investigation. There are multiple possible workarounds, one of which is the one that you have already found of wiring the error directly into the loop. Other situations that result in no memory leak are:
1. If the bytes at port property node is not there and a read just happens in every iteration and resulting timeouts are ignored.
2. If the case structure is gone and just blindly check the bytes at port and read every iteration.
3. If the Timed Loop is turned into a While loop.
Thanks for the feedback!
Regards,Stephen S.
National Instruments
Applications Engineering -
I live in Italy and I am trying to buy an App, for the first time with my iphone4...in the past only downloaded free apps free apps; I have a US Visa card and it is not accepted by italian Itunes...what can I do to do my purchases?
On the apple website that is correct i beleive.... but i have an italian american express and am able to purchase stuff here in the US.
I mean, i dont think it really matters -
Please help me fix this problem it's driving me crazy. I have tried installing and reinstalling photoshop EXTENDED several time and each time i lunch it ask me for the serial number in which i entered it once entered nothing happens
Hi Glenn,
Kindly try out the steps mentioned in the link below and see if you are able to serialize your software.
Sign in, activation, or connection errors | CS5.5 and later, Acrobat DC
Try Solution 2: Clean up cached user login information.
Please share the results after performing the steps.
Thanks,
Atul Saini -
RT Network Shared Variable and Visa Serial Instr class
Hi,
I'm using Labview 2009 SP1 with the RT module. I've had no problems creating a RT Target application and a Host PC application which are interconnected using Network Shared Variables, until I came to the COM ports fitted to the RT Target (PXI Embedded Controller and 2 x 4 port COM cards).
I can configure and use the COM ports in the RT Target application providing I use constants to define which COM port to use, i.e. VISA OPEN function accepts hardcoded "COM2" , (VISA Serial Instr class).
But I want to pass the COM Port resource name from my host application.
Is there a suitable Network Shared Variable I can create ? or how do I change the string value (COM Port name) of the VISA Serial Instr class variable in the RT Target application ?
thanks,
Gary.Hi there Gary,
Thanks fot the post. I think I have found something that may be if use to yourself.
http://labviewwiki.org/Functional_global_variable
This is the functional global variable.
Take a look at it and let me know what you think!
Many thanks,
Liam A.
National Instruments
Applications Engineer -
Query Execution/Elapsed Time and Oracle Data Blocks
Hi,
I have created 3 tables with one column only. As an example Table 1 below:
SQL> create table T1 ( x char(2000));
So 3 tables are created in this way i.e. T1,T2 and T3.
T1 = in the default database tablespace of 8k (11g v11.1.0.6.0 - Production) (O.S=Windows).
T2 = I created in a Tablespace with Blocksize 16k.
T3 = I created in a Tablespace with Blocksize 4k. In the same Instance.
Each table has approx. 500 rows (So, table sizes are same in all the cases to test Query execution time ). As these 3 tables are created under different data block sizes so the ALLOCATED no. of data blocks are different in all cases.
T1 = 8k = 256 Blocks = 00:00:04.76 (query execution time/elapsed time)
T2 = 16k=121 Blocks = 00:00:04.64
T3 = 4k = 490 Blocks = 00:00:04.91
Table Access is FULL i.e. I have used select * from table_name; in all 3 cases. No Index nothing.
My Question is why query execution time is nearly the same in all 3 cases because Oracle has to read all the data blocks in each case to fetch the records and there is a much difference in the allocated no. of blocks ???
In 4k block size example, Oracle has to read just 121 blocks and it's taking nearly the same time as it's taking to read 490 blocks???
This is just 1 example of different data blocks. I have around 40 tables in each block size tablespace and the result are nearly the same. It's very strange for me because there is a much difference in the no. of allocated blocks but execution time is almost the same, only difference in milliseconds.
I'll highly appreciate the expert opinions.
Bundle of thanks in advance.
Best Regards,Hi Chris,
No I'm not using separate databases, it's 8k database with non-standard blocksizes of 16k and 4k.
Actually I wanted to test the Elapsed time of these 3 tables, so for that I tried to create the same size
tables.
And how I equalize these is like I have created one column table with char(2000).
555 MB is the figure I wanted to use for these 3 tables ( no special figure, just to make it bigger than the
RAM used for my db at the db startup to be sure of not retrieving the records from cache).
so row size with overhead is 2006 * 290,000 rows = 581740000(bytes) / 1024 = 568105KB / 1024 = 555MB.
Through this math calculation I thought It will be the total table size. So I Created the same no. of rows in 3 blocksizes.
If it's wrong then what a mes because I was calculating tables sizes in the same way from the last few months.
Can you please explain a little how you found out the tables sizes in different block sizes.Though I understood how you
calculated size in MB from these 3 block sizes
T8K =97177 BLOCKS=759MB *( 97177*8 = 777416KB / 1024 = 759MB )*
T16K=41639 BLOCKS=650MB
BT4K=293656 BLOCKS=1147MB
For me it's new to calculate the size of a table. Can you please tell me then how many rows I can create in each of
these 3 tables to make them equal in MB to test for elapsed time.
Then I'll again run my test and put the results here. Because If I've wrongly calculated table sizes then there is no need to talk about elapsed time. First I must equalize the table sizes properly.
SQL> select sum(bytes)/1024/1024 "Size in MB" from dba_segments> 2 where segment_name = 'T16K';
Size in MB
655
Is above SQL is correct to calculate the size or is it the correct alternative way to your method of calculating the size??
I created the same table again with everything same and the result is :
SQL> select num_rows,blocks from user_tables where table_name = 'T16K';NUM_ROWS BLOCKS
290000 41703
64 more blocks are allocated this time so may be that's y it's showing total size of 655 instead of 650.
Thanks alot for your help.
Best Regards,
KAm
Edited by: kam555 on Nov 20, 2009 5:57 PM -
I have put my serial number in several times and each time it is invalid now what?
I have put my serial number in several times and each time it is invalid now what?
Serial number in what program?
Are you sure you have a serial number and not a redemption code?
Redemption Code http://helpx.adobe.com/x-productkb/global/redemption-code-help.html
Serial number and activation chat support (non-CC) may help
http://helpx.adobe.com/x-productkb/global/service1.html
Maybe you are looking for
-
My safari keeps quitting and I can't for the life of me figure it out. Help PLEASE!
Here is the information that keeps coming up. Process: Safari [611] Path: /Users/TaniaB/Desktop/Safari.app/Contents/MacOS/Safari Identifier: com.apple.Safari Version: 5.0.6 (5533.22.3) Build Info: WebBrowser-75332
-
Appreciate if any one help me out to solve this problem ?
-
BB Curve 9320 messages deleted
For the past few days email messages disappear from my inbox. They are on my computer but no longer on my BB inbox. Any idea?
-
802.1x EAP type not configured
Hi, a simple 802.1x test with XP client sp2, 3560 with IOS 12.2(35)SE5 and ACS 4.1(1) build 23. EAP MD5 selected on the client and enabled on the ACS but I receive in ACS an authentication failure message, with Authen-Failure-Code "EAP type not confi
-
Is it possible to have two iCloud albums in the newest Aperture?
How to have two iCloud albums in Aperture on a MacBook Pro. Thanks