Performance Problems with intrinsic array multiplikation in Fortran with Su

Hello,
I found a serious performance problem in my application with intrinsic array multiplikation. Therefore I wrote a small test program to check if this a general problem or only exists in my code.
The test program (as seen below) was compiled with Sunstudio12 und Solaris 5.10 on an 64 bit Amd Opteron Machine. First with high optimization (f95 -fast -g), and the second time with out optimization (f95 -O0 -g). In both cases the intrinsic array mupltiplication had a lot of tlb and L2 cache misses (I made some test with the performance analyzer) which caused a huge increase in computation time compared to the explicit loop. In the ideal case the compiler should create the nested loops from the intrinsic statement and both functions should use exactly the same computing time.
I also tried compiling with Studio11, the problem also occurs there. Maybe its a compiler bug but I'm not sure.
Greetings
Michael Kroeger
program test
!Test zur Ausfuehrung einer einfachen array Multiplikation
implicit none
real,dimension(:,:,:),pointer::check1,check2
integer i,j,k,ni,nj,nk,status
ni=1000
nj=1000
nk=100
allocate(check1(0:ni,0:nj,0:nk),STAT=status)
write(*,*)status
allocate(check2(0:ni,0:nj,0:nk),STAT=status)
write(*,*)status
check1(i,j,k)=25
check2(i,j,k)=25
call intrinsic_f(check1)
call withloop(check2,i,j,k)
deallocate(check1,check2)
contains
subroutine intrinsic_f(check1)
real, dimension(:,:,:),pointer::check1
check1=check1*5
end subroutine intrinsic_f
subroutine withloop(check2,ni,nj,nk)
real, dimension(:,:,:),pointer::check2
integer i,j,k,nk,nj,ni
do k=0,nk
do j=0,nj
do i=0,ni
check2(i,j,k)=check2(i,j,k)*5
enddo
enddo
enddo
end subroutine withloop
end program

I will try the large pages, but what me puzzles is, that the intrinsic function has cache misses, but the loop function has not. All documentation says, that the compiler would expand the intrinsic function into 3 nested loops, so that both functions should be essential the same (and the compiler says it has created 3 loops from the intrinsic). Since they are not the same, this is a severe problem.
I have a fairly large code for high performance simulations, and this intrinsic functions are a significant bottle neck. If it is not a compiler bug, I would have to rewrite all intrinsic functions into loops.

Similar Messages

Performance problem with graphs on Tabs (LV7.1)

I have huge performance problems in a subsystem using tab controls with graphs on top. The whole thing worked nice, until I record a measurement (abou 10k of double as data displayed on the graph). The win task manager indicates above 50% on both CPUs, the app hangs (or lags), my queues generate timeout messages...
The graph is located in one of the pages of a tab control. As well are several clusters of config data for the measurement.
As I said, the problems started, when I put the data of that size on the graph indicator.
The clusters are some nested typ defs, but it worked with them before, no huge arrays involved. All are bundled in a huge cluster (less than 1 k if saved as xml).
So I wonder, if the clusters and/or the graphs are the problem PLUS is that problem resolved in current LV-Versions (hoping to get the faster car & and I love the current GUI with tabs)?
Sorry, can't post the code, but if none of you knows that kind of problems and I can't solve it on my on in an hour or so, I can make some imitation code.
Felix
www.aescusoft.de
My latest community nugget on producer/consumer design
My current blog: A journey through uml

How many graphs are you referring to?
Are they all on your User Interface and running in the UI thread?
You might want to try putting your graphs in their own threads i.e., called dynamically or otherwise in a structure that allows LabVIEW to put them in their own thread. I've gotten good performance out of a PXI-8106 controller by calling a graph template dynamically. That's four graphs showing at once, 12 plots per graph, 10000 XY value pairs per plot. Each graph was setup to get its data every 50-200ms.
How much data you can plot with decent performance also depends on the hardware you're using, i.e., CPU speed, RAM size, video capability, etc. It can also depend on how efficiently you've coded your application. Are you initializing your data arrays and using "Replace Subset" or are you using the less efficient "Build Array" for example?
Message Edited by Bill@NGC on 09-11-2007 09:31 PM
“A child of five could understand this. Send someone to fetch a child of five.”
― Groucho Marx

Performance problem with WPF Viewer CRVS2010

Hi,
We are using Crystal Reports 2010 and the new WPF Viewer. Last week when we set up a test machine to run our integration tests (several hundred) all report tests failed (about 30 tests) with a timeout exception.
The testmachine setup:
HP DL 580 G5
WMWare ESXi 4.0
Guest OS: Windows 7 Enterprise 64-bit
Memory (guest OS): 3GB
CPU: 1
Visual Studio 2010
Crystal Reports for Visual Studio 2010 with 64 bit runtime installed
Visual Studio 2008 installed
Microsoft Office 2010 installed
Macafee antivirus
There are about 10 other virtual machines on the same HW.
I think the performance problem is related to text obejcts on a report document viewed in a WPF Viewer. I made a simple WPF GUI with 2 buttons and the first button executes a very simple report that only has a text object with a few words in it and the other button is also a simple report with only 1 text object with approx. 100 words (about 800 charchters).
The first report executes and displays almost instantly and the second report executes instantantly but displays after approx. 1 min 30 sec.
And execute in this context means that all VB.Net code runs in the compiler without any exception or performance problem. The performance problem seems to come after viewer.Show() (in the code below) has executed.
I did another test on the second report and replaced the text obejct with a formula field with the same text as the text object and this test executed and displayed the report instantly.
So the performance problem seems to have something to do with rendering of textobjects in the WPF Viewer on a virtual machine with the above setup.
I've made several tests on local machines with Windows XP (32 bit) or Winows 7 (64 bit) installed and none of them have this performance problem. Its not a critical issue for us because our users will run this application on their local PCs with Windows 7 64-bit but its a bit problematic for our project not being able to run all of our integration tests but I will probably solve this by using a local PC instead.
Here is the VB.Net code Im using to View the reports:
Private Sub LightWeight_Click(ByVal sender As System.Object, ByVal e As System.Windows.RoutedEventArgs)
        Dim lightWeightReport As New CrystalDecisions.CrystalReports.Engine.ReportDocument
        lightWeightReport.Load(Environment.CurrentDirectory & "\LightWeight.rpt")
        ' Initialize Viewer
        Dim viewer As LF.LIV.PEAAT.Crystal.Views.ReportViewer = New LF.LIV.PEAAT.Crystal.Views.ReportViewer()
        viewer.Owner = Me
        viewer.reportViewer.ViewerCore.ReportSource = lightWeightReport
        viewer.Show()
    End Sub
    Private Sub LightWeightSlow_Click(ByVal sender As System.Object, ByVal e As System.Windows.RoutedEventArgs)
        Dim lightWeightReport As New CrystalDecisions.CrystalReports.Engine.ReportDocument
        lightWeightReport.Load(Environment.CurrentDirectory & "\LightWeightSlow.rpt")
        ' Initialize Viewer
        Dim viewer As LF.LIV.PEAAT.Crystal.Views.ReportViewer = New LF.LIV.PEAAT.Crystal.Views.ReportViewer()
        viewer.Owner = Me
        viewer.reportViewer.ViewerCore.ReportSource = lightWeightReport
        viewer.Show()
    End Sub
The reports are 2 empty default reports with only 1 textobject on the details section.
// Thomas

See if the KB [
[1448013 - Connecting to Oracle database. Error; Failed to load database information|http://www.sdn.sap.com/irj/servlet/prt/portal/prtroot/com.sap.km.cm.docs/oss_notes_boj/sdn_oss_boj_bi/sap(bD1lbiZjPTAwMQ==)/bc/bsp/spn/scn_bosap/notes%7B6163636573733d36393736354636443646363436353344333933393338323636393736354637333631373036453646373436353733354636453735364436323635373233443330333033303331333433343338333033313333%7D.do] helps.
Also the following may not hurt to have a look at (if only for ideas):
[1217021 - Err Msg: "Unable to connect invalid log on parameters" using Oracle in VS .NET|http://www.sdn.sap.com/irj/servlet/prt/portal/prtroot/com.sap.km.cm.docs/oss_notes_boj/sdn_oss_boj_bi/sap(bD1lbiZjPTAwMQ==)/bc/bsp/spn/scn_bosap/notes%7B6163636573733d36393736354636443646363436353344333933393338323636393736354637333631373036453646373436353733354636453735364436323635373233443330333033303331333233313337333033323331%7D.do]
[1471508 - Logon error when connecting to Oracle database in a VS .NET application|http://www.sdn.sap.com/irj/servlet/prt/portal/prtroot/com.sap.km.cm.docs/oss_notes_boj/sdn_oss_boj_bi/sap(bD1lbiZjPTAwMQ==)/bc/bsp/spn/scn_bosap/notes%7B6163636573733d36393736354636443646363436353344333933393338323636393736354637333631373036453646373436353733354636453735364436323635373233443330333033303331333433373331333533303338%7D.do]
[1196712 - Error: "Failed to load the oci.dll" in ASP.NET application against an Oracle database|http://www.sdn.sap.com/irj/servlet/prt/portal/prtroot/com.sap.km.cm.docs/oss_notes_boj/sdn_oss_boj_bi/sap(bD1lbiZjPTAwMQ==)/bc/bsp/spn/scn_bosap/notes%7B6163636573733d36393736354636443646363436353344333933393338323636393736354637333631373036453646373436353733354636453735364436323635373233443330333033303331333133393336333733313332%7D.do]
Ludek
Follow us on Twitter http://twitter.com/SAPCRNetSup

Performance Problems with Excel Client

Hello all,
We installed BPC 7.5 SP7 NW on our customeru2019s system and experience massive performance problems on our local clients in combination with Excel and MS Office in general.
u2022When opening u201CMaintain Dimension Membersu201D it takes some time (approx. 2 min) to open the Excel Sheet with the elements. The u201CSave to Serveru201D as well as the u201CProcess Dimensionu201D also takes time to execute. When executing u201CProcess Dimensionu201D the sandbox appears and it takes approx 2 min until the Process popup window appears. The process itself has normal performance.
u2022We also experienced slow performance with the opening or saving dynamic templates dialogue in the Excel Client. It takes some time until this dialogue appears.
In general, we experience slow performance every time BPC is opening a pop up window! We also experience slow performance when opening a (non BPC) MS Office document.
In order to resolve this issue we looked at the following notes and forum entries:
Notes: 1541181, 1531059, 1507575, 1479436, 1448502, 1288810
Forum: BPC NW slow Performance (Expand, Refresh, Saving) - How to enhance it?, [BPC for Excel] Dimension clicked, then Excel hangs
Can anybody give me tipps on how to solve this issue?
Thanks in Advance

Hi,
It will work if in IE, Advanced, Security you uncheck "Check for publisher's certificate revocation "
=======================
http://CSC3-2004-crl.verisign.com/CSC3-2004.crl
http://ocsp.verisign.com/MFEwTzBNMEswSTAJBgUrDgMCGgUABBQ%2FxkCfyHfJr7GQ6M658NRZ4SHo%2FAQUCPVR6Pv%2BPT1kNnxoz1t4qN%2B5xTcCEH6eR%2B%2FPmw5g6qZVJ2HNXK4%3D
http://crl.verisign.com/pca3.crl
=========================
Regards to all,
Laurentiu Bogdan

Performance problem running forms on a VPN

Overall performance is OK
I have one form with a performance problem on insert (Inserting 1 record takes about 1 minute)
When I run the same form in our LAN-environment, there is no performance
problem.
It's on a table with a lot of fields, among them a lot of look-up fields (but
most of them are validated on entry)
On my modem, I see a lot of switching Send-Receive (which I wouldn't expect
when inserting 1 record)
null

I guess, the amount of memory is the problem, in case of LAN, you're client's memory is being used, in case of web, your web servers memory is being used. Try to increase the memory to it which would buffer your data before accessing the modem, so your operating system would decide when to send the data and when to not to send the data, in this case, you wont see lots of flickering in your modem's switch. Hope this would trigger something in your mind to check the parameters defined in the ora.ini file and web server parameters etc etc etc
null

Performance problems with jdk 1.5 on Linux plattform

Performance problems with jdk 1.5 on Linux plattform
(not tested on Windows, might be the same)
After refactoring using the new features from java 1.5 I lost
performance significantly:
public Vector<unit> units;
The new code:
for (unit u: units) u.accumulate();
runs more than 30% slower than the old code:
for (int i = 0; i < units.size(); i++) units.elementAt(i).accumulate();
I expected the opposite.
Is there any information available that helps?

Here's the complete benchmark code I used:package test;
import java.text.NumberFormat;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.Vector;
public class IterationPerformanceTest {
     private int m_size;
     public IterationPerformanceTest(int size) {
          m_size = size;
     public long getArrayForLoopDuration() {
          Integer[] testArray = new Integer[m_size];
          for (int item = 0; item < m_size; item++) {
               testArray[item] = new Integer(item);
          StringBuilder builder = new StringBuilder();
          long start = System.nanoTime();
          for (int index = 0; index < m_size; index++) {
               builder.append(testArray[index]);
          long end = System.nanoTime();
          System.out.println(builder.length());
          return end - start;
     public long getArrayForEachDuration() {
          Integer[] testArray = new Integer[m_size];
          for (int item = 0; item < m_size; item++) {
               testArray[item] = new Integer(item);
          StringBuilder builder = new StringBuilder();
          long start = System.nanoTime();
          for (Integer item : testArray) {
               builder.append(item);
          long end = System.nanoTime();
          System.out.println(builder.length());
          return end - start;
     public long getArrayListForLoopDuration() {
          ArrayList<Integer> testList = new ArrayList<Integer>();
          for (int item = 0; item < m_size; item++) {
               testList.add(item);
          StringBuilder builder = new StringBuilder();
          long start = System.nanoTime();
          for (int index = 0; index < m_size; index++) {
               builder.append(testList.get(index));
          long end = System.nanoTime();
          System.out.println(builder.length());
          return end - start;
     public long getArrayListForEachDuration() {
          ArrayList<Integer> testList = new ArrayList<Integer>();
          for (int item = 0; item < m_size; item++) {
               testList.add(item);
          StringBuilder builder = new StringBuilder();
          long start = System.nanoTime();
          for (Integer item : testList) {
               builder.append(item);
          long end = System.nanoTime();
          System.out.println(builder.length());
          return end - start;
     public long getArrayListIteratorDuration() {
          ArrayList<Integer> testList = new ArrayList<Integer>();
          for (int item = 0; item < m_size; item++) {
               testList.add(item);
          StringBuilder builder = new StringBuilder();
          long start = System.nanoTime();
          Iterator<Integer> iterator = testList.iterator();
          while(iterator.hasNext()) {
               builder.append(iterator.next());
          long end = System.nanoTime();
          System.out.println(builder.length());
          return end - start;
     public long getLinkedListForLoopDuration() {
          LinkedList<Integer> testList = new LinkedList<Integer>();
          for (int item = 0; item < m_size; item++) {
               testList.add(item);
          StringBuilder builder = new StringBuilder();
          long start = System.nanoTime();
          for (int index = 0; index < m_size; index++) {
               builder.append(testList.get(index));
          long end = System.nanoTime();
          System.out.println(builder.length());
          return end - start;
     public long getLinkedListForEachDuration() {
          LinkedList<Integer> testList = new LinkedList<Integer>();
          for (int item = 0; item < m_size; item++) {
               testList.add(item);
          StringBuilder builder = new StringBuilder();
          long start = System.nanoTime();
          for (Integer item : testList) {
               builder.append(item);
          long end = System.nanoTime();
          System.out.println(builder.length());
          return end - start;
     public long getLinkedListIteratorDuration() {
          LinkedList<Integer> testList = new LinkedList<Integer>();
          for (int item = 0; item < m_size; item++) {
               testList.add(item);
          StringBuilder builder = new StringBuilder();
          long start = System.nanoTime();
          Iterator<Integer> iterator = testList.iterator();
          while(iterator.hasNext()) {
               builder.append(iterator.next());
          long end = System.nanoTime();
          System.out.println(builder.length());
          return end - start;
     public long getVectorForLoopDuration() {
          Vector<Integer> testVector = new Vector<Integer>();
          for (int item = 0; item < m_size; item++) {
               testVector.add(item);
          StringBuilder builder = new StringBuilder();
          long start = System.nanoTime();
          for (int index = 0; index < m_size; index++) {
               builder.append(testVector.get(index));
          long end = System.nanoTime();
          System.out.println(builder.length());
          return end - start;
     public long getVectorForEachDuration() {
          Vector<Integer> testVector = new Vector<Integer>();
          for (int item = 0; item < m_size; item++) {
               testVector.add(item);
          StringBuilder builder = new StringBuilder();
          long start = System.nanoTime();
          for (Integer item : testVector) {
               builder.append(item);
          long end = System.nanoTime();
          System.out.println(builder.length());
          return end - start;
     public long getVectorIteratorDuration() {
          Vector<Integer> testVector = new Vector<Integer>();
          for (int item = 0; item < m_size; item++) {
               testVector.add(item);
          StringBuilder builder = new StringBuilder();
          long start = System.nanoTime();
          Iterator<Integer> iterator = testVector.iterator();
          while(iterator.hasNext()) {
               builder.append(iterator.next());
          long end = System.nanoTime();
          System.out.println(builder.length());
          return end - start;
      * @param args
     public static void main(String[] args) {
          IterationPerformanceTest test = new IterationPerformanceTest(1000000);
          System.out.println("\n\nRESULTS:");
          long arrayForLoop = test.getArrayForLoopDuration();
          long arrayForEach = test.getArrayForEachDuration();
          long arrayListForLoop = test.getArrayListForLoopDuration();
          long arrayListForEach = test.getArrayListForEachDuration();
          long arrayListIterator = test.getArrayListIteratorDuration();
//          long linkedListForLoop = test.getLinkedListForLoopDuration();
          long linkedListForEach = test.getLinkedListForEachDuration();
          long linkedListIterator = test.getLinkedListIteratorDuration();
          long vectorForLoop = test.getVectorForLoopDuration();
          long vectorForEach = test.getVectorForEachDuration();
          long vectorIterator = test.getVectorIteratorDuration();
          System.out.println("Array      for-loop: " + getPercentage(arrayForLoop, arrayForLoop) + "% ("+getDuration(arrayForLoop)+" sec)");
          System.out.println("Array      for-each: " + getPercentage(arrayForLoop, arrayForEach) + "% ("+getDuration(arrayForEach)+" sec)");
          System.out.println("ArrayList for-loop: " + getPercentage(arrayForLoop, arrayListForLoop) + "% ("+getDuration(arrayListForLoop)+" sec)");
          System.out.println("ArrayList for-each: " + getPercentage(arrayForLoop, arrayListForEach) + "% ("+getDuration(arrayListForEach)+" sec)");
          System.out.println("ArrayList iterator: " + getPercentage(arrayForLoop, arrayListIterator) + "% ("+getDuration(arrayListIterator)+" sec)");
//          System.out.println("LinkedList for-loop: " + getPercentage(arrayForLoop, linkedListForLoop) + "% ("+getDuration(linkedListForLoop)+" sec)");
          System.out.println("LinkedList for-each: " + getPercentage(arrayForLoop, linkedListForEach) + "% ("+getDuration(linkedListForEach)+" sec)");
          System.out.println("LinkedList iterator: " + getPercentage(arrayForLoop, linkedListIterator) + "% ("+getDuration(linkedListIterator)+" sec)");
          System.out.println("Vector     for-loop: " + getPercentage(arrayForLoop, vectorForLoop) + "% ("+getDuration(vectorForLoop)+" sec)");
          System.out.println("Vector     for-each: " + getPercentage(arrayForLoop, vectorForEach) + "% ("+getDuration(vectorForEach)+" sec)");
          System.out.println("Vector     iterator: " + getPercentage(arrayForLoop, vectorIterator) + "% ("+getDuration(vectorIterator)+" sec)");
     private static NumberFormat percentageFormat = NumberFormat.getInstance();
     static {
          percentageFormat.setMinimumIntegerDigits(3);
          percentageFormat.setMaximumIntegerDigits(3);
          percentageFormat.setMinimumFractionDigits(2);
          percentageFormat.setMaximumFractionDigits(2);
     private static String getPercentage(long base, long value) {
          double result = (double) value / (double) base;
          return percentageFormat.format(result * 100.0);
     private static NumberFormat durationFormat = NumberFormat.getInstance();
     static {
          durationFormat.setMinimumIntegerDigits(1);
          durationFormat.setMaximumIntegerDigits(1);
          durationFormat.setMinimumFractionDigits(4);
          durationFormat.setMaximumFractionDigits(4);
     private static String getDuration(long nanos) {
          double result = (double)nanos / (double)1000000000;
          return durationFormat.format(result);
}

Performance problems with new Java Tiger style recommendations

Performance problems with jdk 1.5 on Linux plattform
(not tested on Windows, might be the same)
using the new style recommendations.
I need fast Vector loops for high speed mathematical calculations, some
hints about the fastest way to program that loop would be also great!
After refactoring using the new features from java 1.5 (as recommended from
SUN) I lost performance significantly:
using a vector:
public Vector<unit> units;
The new code (recommended from SUN for Java Tiger for redesign):
for (unit u: units) u.accumulate();
runs more than 30% slower than the old code:
for (int i = 0; i < units.size(); i++) units.elementAt(i).accumulate();
I expected the opposite.
Is there any information available that helps?
The following additional information I got from Mr. Shankar Unni:
I got some fairly anomalous results comparing ArrayList and Vector: for the
1.5-style loops, ArrayList was faster then Vector, but for a loop with get()
calls, Vector was faster. Vector was even faster than that using
elementAt(), which was a surprise:
For a million summing iterations over a 100-element array:
vector elementAt loop took 3446 ms.
vector get loop took 3796 ms.
vector iterator loop took 5469 ms.
arraylist get loop took 4136 ms.
arraylist iterator loop took 4668 ms.

If your topic doesn't change, please stay in your original post.

Performance problem with S873,S691,S679,S716

Hi All,
I am using tables S873,S691,S679,S716 in my report. Since these have huge data its creating performance problem. Right now i am selecting data from tables as Select single.. in Loop.. endloop.
If i try to get it out and use FOR ALL ENTRIES, its taking longer time.
I dont have all keys with me and i m trying to use index whereever possible.
Any hints, comments are really appreciable.
My code goes like this.
This is not a full code... only a part where i am fetching data from 'S' tables.
loop at i_mvke.
SELECT kunnr zzobklgq zzcbklgq
FROM s679 INTO
(s679-kunnr,s679-zzobklgq,s679-zzcbklgq) WHERE
matnr EQ i_mvke-matnr AND
vrsio EQ p_versn AND
sptag IN s_billed AND
werks EQ p_werks AND
vkorg EQ i_mvke-vkorg AND
kunnr IN s_kunnr.
SELECT SUM( zznslqty ) FROM s691 INTO
w_s691_net_bill_qty WHERE
Use index Z5
matnr EQ i_mvke-matnr AND
spmon EQ w_spmon AND
vrsio EQ p_versn AND
werks EQ p_werks AND
vkorg EQ i_mvke-vkorg AND
kunnr IN s_kunnr."
SELECT SUM( zznslqty ) SUM( zzninvnum ) FROM s873 INTO
(work01-zznslqty, work01-zzninvnum) WHERE
use index Z02
vkorg EQ i_mvke-vkorg AND
werks EQ p_werks AND
matnr EQ i_mvke-matnr AND
sptag IN s_billed AND
vrsio EQ p_versn AND
kunnr IN s_kunnr.
SELECT zcrdotov FROM s716 INTO s716-zcrdotov WHERE
matnr EQ i_mvke-matnr AND
sptag IN s_billed AND
vkorg EQ i_mvke-vkorg AND
kunnr IN s_kunnr AND
werks = p_werks AND
vrsio EQ p_versn.
GET THE RECORD TOTAL
ADD 1 TO w_s716_total_count.
GET THE ONTIME TOTAL
IF s716-zcrdotov = 1.
ADD 1 TO w_s716_ontime_count.
ENDIF.
ENDSELECT.
PERFORM fill_output_table.
endloop. "i_mvke
Message was edited by: Agasti Kale

hi
good
wrong->
SELECT kunnr zzobklgq zzcbklgq
FROM s679 INTO
(s679-kunnr,s679-zzobklgq,s679-zzcbklgq) WHERE
matnr EQ i_mvke-matnr AND
vrsio EQ p_versn AND
sptag IN s_billed AND
werks EQ p_werks AND
vkorg EQ i_mvke-vkorg AND
kunnr IN s_kunnr.
write->
SELECT kunnr zzobklgq zzcbklgq
FROM s679 INTO CORRESPONDING FIELDS OF TABLE I_MVKE
WHERE
matnr EQ i_mvke-matnr AND
vrsio EQ p_versn AND
sptag IN s_billed AND
werks EQ p_werks AND
vkorg EQ i_mvke-vkorg AND
kunnr IN s_kunnr.
do the changes accordingly in the below select statements. you have not post the detail report otherwise i could have help you in other select statements also.
thanks
mrutyun

Performance problems with Leopard 10.5.1

Hello,
I use an iMac 24 Alu 2,8Ghz and upgraded to Leopard. There are some major performance problems and bugs in the recent version of Leopard:
1. While accessing USB devices, the display speed, windows moving, animations etc. slow down
2. Adobe CS3 Photoshop 10.01 and Flash CS3 are sometimes extremly slow. I tried the recent demo packages from Adobe:
2.1. The Photoshop dialogue "save for web" slows down the system completly, and this problem stays when quitting Photoshop. A restart is neccessary then.
2.2. Flash CS3 movie preview is very slow and stuttering. It's so slow you cannot imagine how the real movie flow will be.
2.3. Recent Flash Player 9,0,115,0 with hardware acceleration enabled doesn't really work with QuartzGL enabled Leopard: The movies slow down a lot. Try www.neave.tv for example.
3. Safari, Mail and other bundled software hang sometimes. You have to force quit them then. It doesn't matter whether QuartzGL is enabled or not. This especially happens to my system if it is online for some hours.
4. A lot of Apple applications doesn't seem to work with 2dextreme enabled. Why this? Apple supporters told me in Leopard there will be a much better 2dextreme support. Also Quartz2dExtreme in OSX 10.4 worked with all applications and i guess it's the same feature like "QuartzGL" in Leopard. So Leopard isn't finished here. It would be nice if Apple could make it's own software QuartzGL compatible.
5. Very often the desktop slows down or lags. This is the main reason I often still witch to Windows XP PC to do work in a faster, less annoying way.
6. Safari crashes randomly sometimes. It is unstable still. Also it crashes more often if you resize/move the window a lot, so I guess it is a graphics extension-related problem.
I hope you people from Apple will fix these annoying points and optimize your new system in the next update release.
Best regards

Thanks for you answer. I repaired in the way as described above. There were some errors, some file index was wrong (don't remember exactly the phrase), now the DU reports the partition was successfully repaired / the volume appears to be ok.
The crashes in Safari are gone, but all other described problems still exist. Adobe CS3 is not really usable for me.
By the way, in iMacSoftwareUpdate 1.3, which was replaced by OSX 10.5.1 update, there is one extension called AppleVADriver.kext that does not exist in the OSX 10.5.1 update. Is it an important extension?

Performance problems with SAP GUI 7.10 and BEx 3.5 Patch 400?

Hi everybody,
we installed SAP GUI 7.10 and BEx 3.5 Patch 400 and detected hugh performance problems with this version in comparison to the SAP GUI 6.40 and BEx 3.5 or BEx 7.0 Patch 800.
Does anybody detect the same problems?
Best regards,
Ulli

Most important question when you are talking about performance-issues:
which OC are you working on and which excel version?
ciao
Joke

Performance Problems with "For all Entries" and a big internal table

We have big Performance Problems with following Statement:
SELECT * FROM zeedmt_zmon INTO TABLE gt_zmon_help
FOR ALL ENTRIES IN gt_zmon_help
    WHERE
    status = 'IAI200' AND
    logdat IN gs_dat AND
    ztrack = gt_zmon_help-ztrack.
In the internal table gt_zmon_help are over 1000000 entries.
Anyone an Idea how to improve the Performance?
Thank you!

>
Matthias Weisensel wrote:
> We have big Performance Problems with following Statement:
>
>
SELECT * FROM zeedmt_zmon INTO TABLE gt_zmon_help
>   FOR ALL ENTRIES IN gt_zmon_help
>     WHERE
>     status = 'IAI200' AND
>     logdat IN gs_dat AND
>     ztrack = gt_zmon_help-ztrack.
>
> In the internal table gt_zmon_help are over 1000000 entries.
> Anyone an Idea how to improve the Performance?
>
> Thank you!
You can't expect miracles. With over a million entries in your itab any select is going to take a bit of time. Do you really need all these records in the itab? How many records is the select bringing back? I'm assuming that you have got and are using indexes on your ZEEDMT_ZMON table.
In this situation, I'd first of all try to think of another way of running the query and restricting the amount of data, but if this were not possible I'd just run it in the background and accept that it is going to take a long time.

Performance problems with EP 6 and MS IE

Hi everybody,
since a couple of days, we are facing a sever performance problem with our SAP EP 6.0. When I access the system with MS Internet Explorer 6.0, it takes 5-10 minutes after the Login. With Firefox Browser, the performance is ok. Therefore I assume that it must be a problem with the IE settings. Does anybody know a solution?
Best regards,
Michael

There are a few things that this could be. I've seen the setting "Empty Temporary Internet Files folder when browser is closed" cause a lot of performance problems (This is in the advanced settings in your IE).
This will cause your cache to be cleared out each time the browser is closed and cause a lot more data to be downloaded each time you login to the system.
For more analysis I'd recommend putting a tool like HTTPWatch into your IE browser and seeing which requests are using the most time.

Performance problems with DFSN, ABE and SMB

Hello,
We have identified a problem with DFS-Namespace (DFSN), Access Based Enumeration (ABE) and SMB File Service.
Currently we have two Windows Server 2008 R2 servers providing the domain-based DFSN in functional level Windows Server 2008 R2 with activated ABE.
The DFSN servers have the most current hotfixes for DFSN and SMB installed, according to http://support.microsoft.com/kb/968429/en-us and http://support.microsoft.com/kb/2473205/en-us
We have only one AD-site and don't use DFS-Replication.
Servers have 2 Intel X5550 4 Core CPUs and 32 GB Ram.
Network is a LAN.
Our DFSN looks like this:
\\contoso.com\home
   Contains 10.000 Links
   Drive mapping on clients to subfolder \\contoso.com\home\username
\\contoso.com\group
   Contains 2500 Links
   Drive mapping on clients directly to \\contoso.com\group
On \\contoso.com\group we serve different folders for teams, projects and other groups with different access permissions based on AD groups.
We have to use ABE, so that users see only accessible Links (folders)
We encounter sometimes multiple times a day enterprise-wide performance problems for 30 seconds when accessing our Namespaces.
After six weeks of researching and analyzing we were able to identify the exact problem.
Administrators create a new DFS-Link in our Namespace \\contoso.com\group with correct permissions using the following command line:
dfsutil.exe link \\contoso.com\group\project123 \\fileserver1\share\project123
dfsutil.exe property sd grant \\contoso.com\group\project123 CONTOSO\group-project123:RX protect replace
This is done a few times a day.
There is no possibility to create the folder and set the permissions in one step.
DFSN process on our DFSN-servers create the new link and the corresponding folder in C:\DFSRoots.
At this time, we have for example 2000+ clients having an active session to the root of the namespace \\contoso.com\group.
Active session means a Windows Explorer opened to the mapped drive or to any subfolder.
The file server process (Lanmanserver) sends a change notification (SMB-Protocol) to each client with an active session \\contoso.com\group.
All the clients which were getting the notification now start to refresh the folder listing of \\contoso.com\group
This was identified by an network trace on our DFSN-servers and different clients.
Due to ABE the servers have to compute the folder listing for each request.
DFS-Service on the servers doen't respond for propably 30 seconds to any additional requests. CPU usage increases significantly over this period and went back to normal afterwards. On our hardware from about 5% to 50%.
Users can't access all DFS-Namespaces during this time and applications using data from DFS-Namespace stop responding.
Side effect: Windows reports on clients a slow-link detection for \\contoso.com\home, which can be offline available for users (described here for WAN-connections: http://blogs.technet.com/b/askds/archive/2011/12/14/slow-link-with-windows-7-and-dfs-namespaces.aspx)
Problem doesn't occure when creating a link in \\contoso.com\home, because users have only a mapping to subfolders.
Currently, the problem doesn't occure also for \\contoso.com\app, because users usually don't use Windows Explorer accessing this mapping.
Disabling ABE reduces the DFSN freeze time, but doesn't solve the problem.
Problem also occurs with Windows Server 2012 R2 as DFSN-server.
There is a registry key available for clients to avoid the reponse to the change notification (NoRemoteChangeNotify, see http://support.microsoft.com/kb/812669/en-us)
This might fix the problem with DFSN, but results in other problems for the users. For example, they have to press F5 for refreshing every remote directory on change.
Is there a possibility to disable the SMB change notification on server side ?
TIA and regards,
Ralf Gaudes

Hi,
Thanks for posting in Microsoft Technet Forums.
I am trying to involve someone familiar with this topic to further look at this issue. There might be some time delay. Appreciate your patience.
Thank you for your understanding and support.
Regards.
We
are trying to better understand customer views on social support experience, so your participation in this
interview project would be greatly appreciated if you have time.
Thanks for helping make community forums a great place.

Performance problems with XMLTABLE and XMLQUERY involving relational data

Hello-
Is anyone out there using XMLTABLE or XMLQUERY with more than a toy set of data? I am running into serious performance problems tyring to do basic things such as:
* Combine records in 10 relational tables into a single table of XMLTYPE records using XMLTABLE. This hangs indefinitely for any more than 800 records. Oracle has confirmed that this is a problem and is working on a fix.
* Combine a single XMLTYPE record with several relational code tables into a single XMLTYPE record using XMLQUERY and ora:view() to insert code descriptions after each code. Performance is 10 seconds for 10 records (terrible) passing a batch of records , or 160 seconds for one record (unacceptable!). How can it take 10 times longer to process 1/10th the number of records? Ironically, the query plan says it will do a full table scan of records for the batch, but an index access for the one record passed to the XMLQUERY.
I am rapidly losing faith in XML DB, and desparately need some hints on how to work around these performance problems, or at least some assurance that others have been able to get this thing to perform.

<Note>Long post, sorry.</Note>
First, thanks for the responses above. I'm impressed with the quality of thought put into them. (Do the forum rules allow me to offer rewards? :) One suggestion in particular made a big performance improvement, and I’m encouraged to hear of good performance in pure XML situations. Unfortunately, I think there is a real performance challenge in two use cases that are pertinent to the XML+relational subject of this post and probably increasingly common as XML DB usage increases:
•     Converting legacy tabular data into XML records; and
•     Performing code table lookups for coded values in XML records.
There are three things I want to accomplish with this post:
•     Clarify what we are trying to accomplish, which might expose completely different approaches than I have tried
•     Let you know what I tried so far and the rationale for my approach to help expose flaws in my thinking and share what I have learned
•     Highlight remaining performance issues in hopes that we can solve them
What we are trying to accomplish:
•     Receive a monthly feed of 10,000 XML records (batched together in text files), each containing information about an employee, including elements that repeat for every year of service. We may need to process an annual feed of 1,000,000 XML records in the future.
•     Receive a one-time feed of 500,000 employee records stored in about 10 relational tables, with a maximum join depth of 2 or 3. This is inherently a relational-to-XML process. One record/second is minimally acceptable, but 10 records/sec would be better.
•     Consolidate a few records (from different providers) for each employee into a single record. Given the data volume, we need to achieve a minimum rate of 10 records per second. This may be an XML-only process, or XML+relational if code lookups are done during consolidation.
•     Allow the records to be viewed and edited, with codes resolved into user-friendly descriptions. Since a user is sitting there, code lookups done when a record is viewed (vs. during consolidation) should not take more than 3 seconds total. We have about 20 code tables averaging a few hundred rows each, though one has 450,000 rows.
As requested earlier, I have included code at the end of this post for example tables and queries that accurately (but simply) replicate our real system.
Why we did and why:
•     Stored the source XML records as CLOBS: We did this to preserve the records exactly as they were certified and sent from providers. In addition, we always access the entire XML record as a whole (e.g., when viewing a record or consolidating employee records), so this storage model seemed like a good fit. We can copy them into another format if necessary.
•     Stored the consolidated XML employee records as “binary XML”. We did this because we almost always access a single, entire record as a whole (for view/edit), but might want to create some summary statistics at some point. Binary XML seemed the best fit.
•     Used ora:view() for both tabular source records and lookup tables. We are not aware of any alternatives at this time. If it made sense, most code tables could be pre-converted into XML documents, but this seemed risky from a performance standpoint because the lookups use both code and date range constraints (the meaning of codes changes over time).
•     Stored records as XMLTYPE columns in a table with other key columns on the table, plus an XMLTYPE metadata column. We thought this would facilitate pulling a single record (or a few records for a given employee) quickly. We knew this might be unnecessary given XML indexes and virtual columns, but were not experienced with those and wanted the comfort of traditional keys. We did not used XMLTYPE tables or the XML Repository for documents.
•     Used XMLTABLE to consolidate XML records by looping over each distinct employee ID in the source batch. We also tried XMLQUERY and it seems to perform about the same. We can achieve 10 to 20 records/second if we do not do any code lookups during consolidation, just meeting our performance requirement, but still much slower than expected.
•     Used PL/SQL with XMLFOREST to convert tabular source records to XML by looping over distinct employee IDs. We tried this outside PL/SQL both with XMLFOREST and XMLTABLE+ora:view(), but it hangs in both cases for more than 800 records (a known/open issue). We were able to get it to work by using an explicit cursor to loop over distinct employee IDs (rather than processing all records at once within the query). The performance is one record/second, which is minimally acceptable and interferes with other database activity.
•     Used XMLQUERY plus ora:view() plus XPATH constraints to perform code lookups. When passing a single employee record, the response time ranges from 1 sec to 160 sec depending on the length of the record (i.e., number of years of service). We achieved a 5-fold speedup using an XMLINDEX (thank you Marco!!). The result may be minimally acceptable, but I’m baffled why the index would be needed when processing a single XML record. Other things we tried: joining code tables in the FOR...WHERE clauses, joining code tables using LET with XPATH constraints and LET with WHERE clause constraints, and looking up codes individually via JDBC from the application code at presentation time. All those approaches were slower. Note: the difference I mentioned above in equality/inequality constraint performance was due to data record variations not query plan variations.
What issues remain?
We have a minimally acceptable solution from a performance standpoint with one very awkward PL/SQL workaround. The performance of a mixed XML+relational data query is still marginal IMHO, until we properly utilize available optimizations, fix known problems, and perhaps get some new query optimizations. On the last point, I think the query plan for tabular lookups of codes in XML records is falling short right now. I’m reminded of data warehousing in the days before hash joins and star join optimization. I would be happy to be wrong, and just as happy for viable workarounds if I am right!
Here are the details on our code lookup challenge. Additional suggestions would be greatly appreciated. I’ll try to post more detail on the legacy table conversion challenge later.
-- The main record table:
create table RECORDS (
SSN varchar2(20),
XMLREC sys.xmltype
xmltype column XMLREC store as binary xml;
create index records_ssn on records(ssn);
-- A dozen code tables represented by one like this:
create table CODES (
CODE varchar2(4),
DESCRIPTION varchar2(500)
create index codes_code on codes(code);
-- Some XML records with coded values (the real records are much more complex of course):
-- I think this took about a minute or two
DECLARE
ssn varchar2(20);
xmlrec xmltype;
i integer;
BEGIN
xmlrec := xmltype('<?xml version="1.0"?>
<Root>
<Id>123456789</Id>
<Element>
<Subelement1><Code>11</Code></Subelement1>
<Subelement2><Code>21</Code></Subelement2>
<Subelement3><Code>31</Code></Subelement3>
</Element>
<Element>
<Subelement1><Code>11</Code></Subelement1>
<Subelement2><Code>21</Code></Subelement2>
<Subelement3><Code>31</Code></Subelement3>
</Element>
<Element>
<Subelement1><Code>11</Code></Subelement1>
<Subelement2><Code>21</Code></Subelement2>
<Subelement3><Code>31</Code></Subelement3>
</Element>
</Root>
for i IN 1..100000 loop
insert into records(ssn, xmlrec) values (i, xmlrec);
end loop;
commit;
END;
-- Some code data like this (ignoring date ranges on codes):
DECLARE
description varchar2(100);
i integer;
BEGIN
description := 'This is the code description ';
for i IN 1..3000 loop
insert into codes(code, description) values (to_char(i), description);
end loop;
commit;
end;
-- Retrieve one record while performing code lookups. Takes about 5-6 seconds...pretty slow.
-- Each additional lookup (times 3 repeating elements in the data) adds about 1 second.
-- A typical real record has 5 Elements and 20 Subelements, meaning more than 20 seconds to display the record
-- Note we are accessing a single XML record based on SSN
-- Note also we are reusing the one test code table multiple times for convenience of this test
select xmlquery('
for $r in Root
return
<Root>
<Id>123456789</Id>
{for $e in $r/Element
    return
    <Element>
      <Subelement1>
        {$e/Subelement1/Code}
<Description>
{ora:view("disaac","codes")/ROW[CODE=$e/Subelement1/Code]/DESCRIPTION/text() }
</Description>
</Subelement1>
<Subelement2>
{$e/Subelement2/Code}
<Description>
{ora:view("disaac","codes")/ROW[CODE=$e/Subelement2/Code]/DESCRIPTION/text()}
</Description>
</Subelement2>
<Subelement3>
{$e/Subelement3/Code}
<Description>
{ora:view("disaac","codes")/ROW[CODE=$e/Subelement3/Code]/DESCRIPTION/text() }
</Description>
</Subelement3>
</Element>
</Root>
' passing xmlrec returning content)
from records
where ssn = '10000';
The plan shows the nested loop access that slows things down.
By contrast, a functionally-similar SQL query on relational data will use a hash join and perform 10x to 100x faster, even for a single record. There seems to be no way for the optimizer to see the regularity in the XML structure and perform a corresponding optimization in joining the code tables. Not sure if registering a schema would help. Using structured storage probably would. But should that be necessary given we’re working with a single record?
Operation Object
|SELECT STATEMENT ()
| SORT (AGGREGATE)
| NESTED LOOPS (SEMI)
| TABLE ACCESS (FULL) CODES
| XPATH EVALUATION ()
| SORT (AGGREGATE)
| NESTED LOOPS (SEMI)
| TABLE ACCESS (FULL) CODES
| XPATH EVALUATION ()
| SORT (AGGREGATE)
| NESTED LOOPS (SEMI)
| TABLE ACCESS (FULL) CODES
| XPATH EVALUATION ()
| SORT (AGGREGATE)
| XPATH EVALUATION ()
| SORT (AGGREGATE)
| XPATH EVALUATION ()
| TABLE ACCESS (BY INDEX ROWID) RECORDS
| INDEX (RANGE SCAN) RECORDS_SSN
With an xmlindex, the same query above runs in about 1 second, so is about 5x faster (0.2 sec/lookup), which is almost good enough. Is this the answer? Or is there a better way? I’m not sure why the optimizer wants to scan the code tables and index into the (one) XML record, rather than the other way around, but maybe that makes sense if the optimizer wants to use the same general plan as when the WHERE clause constraint is relaxed to multiple records.
-- Add an xmlindex. Takes about 2.5 minutes
create index records_record_xml ON records(xmlrec)
indextype IS xdb.xmlindex;
Operation Object
|SELECT STATEMENT ()
| SORT (GROUP BY)
| FILTER ()
| NESTED LOOPS ()
| FAST DUAL ()
| TABLE ACCESS (BY INDEX ROWID) SYS113473_RECORDS_R_PATH_TABLE
| INDEX (RANGE SCAN) SYS113473_RECORDS_R_PATHID_IX
| SORT (AGGREGATE)
| FILTER ()
| TABLE ACCESS (FULL) CODES
| FILTER ()
| NESTED LOOPS ()
| FAST DUAL ()
| TABLE ACCESS (BY INDEX ROWID) SYS113473_RECORDS_R_PATH_TABLE
| INDEX (RANGE SCAN) SYS113473_RECORDS_R_PATHID_IX
| SORT (GROUP BY)
| FILTER ()
| NESTED LOOPS ()
| FAST DUAL ()
| TABLE ACCESS (BY INDEX ROWID) SYS113473_RECORDS_R_PATH_TABLE
| INDEX (RANGE SCAN) SYS113473_RECORDS_R_PATHID_IX
| SORT (AGGREGATE)
| FILTER ()
| TABLE ACCESS (FULL) CODES
| FILTER ()
| NESTED LOOPS ()
| FAST DUAL ()
| TABLE ACCESS (BY INDEX ROWID) SYS113473_RECORDS_R_PATH_TABLE
| INDEX (RANGE SCAN) SYS113473_RECORDS_R_PATHID_IX
| SORT (GROUP BY)
| FILTER ()
| NESTED LOOPS ()
| FAST DUAL ()
| TABLE ACCESS (BY INDEX ROWID) SYS113473_RECORDS_R_PATH_TABLE
| INDEX (RANGE SCAN) SYS113473_RECORDS_R_PATHID_IX
| SORT (AGGREGATE)
| FILTER ()
| TABLE ACCESS (FULL) CODES
| FILTER ()
| NESTED LOOPS ()
| FAST DUAL ()
| TABLE ACCESS (BY INDEX ROWID) SYS113473_RECORDS_R_PATH_TABLE
| INDEX (RANGE SCAN) SYS113473_RECORDS_R_PATHID_IX
| SORT (AGGREGATE)
| FILTER ()
| NESTED LOOPS ()
| FAST DUAL ()
| TABLE ACCESS (BY INDEX ROWID) SYS113473_RECORDS_R_PATH_TABLE
| INDEX (RANGE SCAN) SYS113473_RECORDS_R_PATHID_IX
| SORT (AGGREGATE)
| TABLE ACCESS (BY INDEX ROWID) SYS113473_RECORDS_R_PATH_TABLE
| INDEX (RANGE SCAN) SYS113473_RECORDS_R_PATHID_IX
| TABLE ACCESS (BY INDEX ROWID) RECORDS
| INDEX (RANGE SCAN) RECORDS_SSN
Am I on the right path, or am I totally using the wrong approach? I thought about using XSLT but was unsure how to reference the code tables.
I’ve done the best I can constraining the main record to a single row passed to the XMLQUERY. Given Mark’s post (thanks!) should I be joining and constraining the code tables in the SQL WHERE clause too? That’s going to make the query much more complicated, but right now we’re more concerned about performance than complexity.

Is anyone facing the similar problem of visible lag while opening app with 3G data on? It seems apple has made 5s slow to improve iphone 4 performance.5s was very smooth on 7.0.6 even with 3G data on. Is this a bug? Is apple going to fix this soon?

Is anyone facing the similar problem of visible lag while opening app with 3G data on? It seems apple has made 5s slow to improve iphone 4 performance.5s was very smooth on 7.0.6 even with 3G data on. Is this a bug? Is apple going to fix this soon?

I have same Problem. I tried all options - Reset All Settings, Erase Content & reset all settings, Upgrated to IOS8.1, Restore using iTune. But problem persists.
When I turn Cellular Data or Wifi ON, then there is a lag while opening the Apps. But If I turn Data/Wifi off, phone becomes super fast. I have checked with my friends. They are not facing this issue. Not sure if Apple know this.

Performance Problems with intrinsic array multiplikation in Fortran with Su

Similar Messages

Maybe you are looking for