On solaris10, Performance of  JDK1.6_12/JDK1.6_19 is worse than JDK1.5_22?

1. My test is ON solaris 10
bash-3.00# cat /etc/release
                       Solaris 10 5/08 s10s_u5wos_10 SPARC
           Copyright 2008 Sun Microsystems, Inc.  All Rights Reserved.
                        Use is subject to license terms.
                             Assembled 24 March 2008
         T-3000 Recovery Version:  T3.04.01.01  Tue Nov 25 08:25:07 CST 2008
bash-3.00#
bash-3.00# showrev
Hostname: T2000G2
Hostid: 84cb7384
Release: 5.10
Kernel architecture: sun4v
Application architecture: sparc
Hardware provider: Sun_Microsystems
Domain: emsdomain
Kernel version: SunOS 5.10 Generic_137111-052. My test code:
public class Test {
    public static void main(String[] args){
        long start = System.currentTimeMillis();
        int n=0;
        for (long i=0;i<100000000;i++){
            n ++;
        System.out.println("time: "+(System.currentTimeMillis()-start)/1000.0);       
}3.Test result
a) Default JDK is JDK1.6_12.
It print:
bash-3.00# java Test
time: 2.834b) Latest JDK1.6_19:
It print:
bash-3.00# java Test
time: 2.912c) JDK1.5_22
It print:
bash-3.00# java Test
time: 1.0394.Summary:
JDK1.6_12/JDK1.6_19 is almost *3 times slower than* JDK1.5_22.
After J2SE_Solaris_10_Recommended.zip is installed(ONLY part of them is installed successfully),
the result is the same!!!
Does this because the solaris 10 OS is not patched with the latest patch[10_Recommended.zip]?
Edited by: xiangyingbing on Apr 8, 2010 8:31 PM

I am wondering why the default JDK1.6_12 on solaris is sooooooooooooooooo slow&#65281;&#65281;&#65281;
I am wondering why the default JDK1.6_12 on solaris is sooooooooooooooooo slow&#65281;&#65281;&#65281;
I am wondering why the default JDK1.6_12 on solaris is sooooooooooooooooo slow&#65281;&#65281;&#65281;

Similar Messages

  • Is JDK1.4.0 compiled code faster than JDK1.3.1?

    I'm compiling my code using JDK1.3.1, but I'm running it using JRE1.4.0. If I compile all of my code using JDK1.4.0, should I expect a performance boost? Particularly in terms of GUI components?
    The reason I haven't compiled in JDK1.4.0 is because I'm using Forte, and it has some major Form Editor bugs when running with JDK1.4.0, so I can't use it at this time.
    Thanks.

    Hi, referring to the latest Java Live Session (High Performance GUIs With the JFC/Swing API, http://developer.java.sun.com/developer/community/chat/JavaLive/2002/jl0423.html), you will get better performance, although "boost" would be quite optimistic.
    Here's a snipped from that session:
    "... SeanOfVA: Are the performance improvements in v1.4 such that a Swing application compiled with v1.3.x, but executed in a v1.4 JVM would exhibit improved performance? There are a variety of reasons I would prefer not to incorporate 1.4 features yet into my source code base.
    WilsonSD: Absolutely. For starters look at the Performance and Scalability Guide [http://java.sun.com/j2se/1.4/performance.guide.html]. Specifically, the enhancements in Java2D will provide nice speed-ups for typical Swing apps in terms of GUI responsiveness. The 2D pipeline architecture allows for faster performance on many graphics operations. Since Swing uses J2D your Swing application benefits. Also, the Swing "back buffer" was rewritten to use the new 2D VolitileImage class. This will give many parts of your Swing application access to hardware acceleration without recoding..."
    Patrick

  • Performance of synchronized blocks on Linux much worse than on Windows

    Our application is a J2EE application currently deployed in WebLogic 6.1 which utilizes Oracle iFS as a content store. We access the iFS CMS through the api's provided in the cmdsk.jar. Our reference implementation has been Solaris and that's where most of our testing has been done so far. However, we recently began doing performance tests on Linux and ran into a strange problem. We found that we were not getting sufficient throughput and that this was coupled with underutilization of CPU resources on the Application Server (AS) node. With sufficient DB resources, which we had in this case, we expect to see full CPU utilization on the AS tier, so we knew something was wrong.
    A great deal of investigation revealed that all active threads were stuck at the same spot accessing an iFS cache. We found that this cache is implemented as a hashtable and accesses to hashtables are synchronized. However, we were not seeing the same problem on other platforms (Solaris and Windows) with dual CPU machines.
    In order to simplify things, we developed a test program to look at what we felt to be the root cause. This test program, which I will attach, essentially creates a hashtable then a number of threads (as specified by the user). These threads then use the hashtable.get method to access the hashtable concurrently and time how long it takes. The info is then returned at the end of the run.
    We ran a set of tests where we increased the number of threads from 1 to 100. This test was run once with Windows 2000 and once with Red Hat Linux 2.1 (kernel 2.4.9-e.12). The exact same hardware (dual 1.2 GHz PIII) was used in both cases. The results show that we were clearly able to reproduce the behaviour with this simple program. What these results show is that with one thread, access times are exactly the same for Windows and Linux. However, as we increase the number of threads, access times for Linux increase at a much greater rate than Windows. We also see underutilization of CPU resources on Linux while Windows uses all available.
    The first round of tests was run with Sun's JDK 1.3.1. We repeated the testing with 1.4.1 and found that there was no significant difference. I just tried it quickly with 1.4.2 and found the behaviour to be much the same. We also altered the program to use an unsynchronized hashmap instead of a hashtable and, as expected, performance on Linux was much better. CPU was fully utilized during the test.
    In order to determine if this was a problem "in the VM" or "in the kerenel", I tried repeating it with the JRocket VM provided by WebLogic. When running the same test with the JRocket VM, we saw performance roughly equivalent to what we saw with a hashmap and the Sun VM. That is, JRocket did not have the same problem as the Sun VM.
    So, it appears that there is something with the implementation of synchronized blocks in the Sun VM that is problematic, especially when compared to other platforms. It is likely that the problem lies in a combination of how the synchronization is implemention is based on the underlying operating system infrastructure. At this point, we don't really have a way to deal with the problem, aside from deploying multiple WebLogic nodes on the same 2 CPU physical AS node. Changes to the iFS infrastructure would help, but that's beyond our control. I've searched the bug database and have not seen mention of this problem. With the test program, it can be easily reproduced, but I wanted to run it by the folks on this list before submitting a bug.
    Thanks,
    Justin

    # File #1: Driver.java
    import java.io.*;
    import java.util.HashMap;
    import java.util.Hashtable;
    * Created on May 13, 2003
    * @author llai
    * Driver to test the access of hash table on various platforms.
    public class Driver
         public static void main(String[] args)
              * Obtain the following input values:
              * 1. Number of Elements
              *      - The number of elements in the hash table
              * 2. Size of Element
              * - The size of each element in the hash table
              * 3. Number of threads
              * - The number of concurrent threads in the test
              * 4. Focused Access
              * - Determines whether each thread access the same element or a random element
              * 5. Number of Accesses
              * - The number of accesses which each thread will complete before exiting
              * 6. Start offset
              * - The number of accesses at the beginning which will not be timed
              * 7. End offset
              * - The number of accesses at the end which will not be timed.
              * Initialize all input variables.
              * SET DEFAULT VALUES HERE...
              int numberOfElements = 10000;
              int sizeOfElement = 100;
              int numberOfThreads = 25;
              boolean focusedAccess = true;
              int numberOfAccesses = 1000000;
              int startOffset = 100000;
              int endOffset = 100000;
              boolean mapOrTable = false;
              * Input number of elements.
              try
                   BufferedReader in =
                        new BufferedReader(new InputStreamReader(System.in));
                   String tempInput;
                   boolean inputInvalid = true;
                   while (inputInvalid)
                        System.out.print(
                             "Enter a non-negative value for the number of elements to be in the hashtable: ");
                        tempInput = in.readLine();
                        if (tempInput.equals(""))
                             System.out.println("default value used.\n");
                             inputInvalid = false;
                        else
                             try
                                  numberOfElements = Integer.parseInt(tempInput);
                                  if (numberOfElements >= 0)
                                       inputInvalid = false;
                                  else
                                       System.out.println(
                                            "You entered a negative value for the number of elements. Try again.");
                             catch (NumberFormatException nfe)
                                  System.out.println(
                                       "You entered an invalid value for the number of elements. Try again.");
                   * Input size of elements.
                   inputInvalid = true;
                   while (inputInvalid)
                        System.out.print(
                             "Enter the size of each element in the hash table (ie. length of a string): ");
                        tempInput = in.readLine();
                        if (tempInput.equals(""))
                             System.out.println("default value used.\n");
                             inputInvalid = false;
                        else
                             try
                                  sizeOfElement = Integer.parseInt(tempInput);
                                  if (sizeOfElement >= 0)
                                       inputInvalid = false;
                                  else
                                       System.out.println(
                                            "You entered a negative value for the size of elements. Try again.");
                             catch (NumberFormatException nfe)
                                  System.out.println(
                                       "You entered an invalid value for the size of elements. Try again.");
                   * Input number of threads.
                   inputInvalid = true;
                   while (inputInvalid)
                        System.out.print(
                             "Enter the number of concurrent threads in the test: ");
                        tempInput = in.readLine();
                        if (tempInput.equals(""))
                             System.out.println("default value used.\n");
                             inputInvalid = false;
                        else
                             try
                                  numberOfThreads = Integer.parseInt(tempInput);
                                  if (numberOfThreads >= 0)
                                       inputInvalid = false;
                                  else
                                       System.out.println(
                                            "You entered a negative value for the number of threads. Try again.");
                             catch (NumberFormatException nfe)
                                  System.out.println(
                                       "You entered an invalid value for the number of threads. Try again.");
                   * Input focused access option.
                   inputInvalid = true;
                   while (inputInvalid)
                        System.out.print(
                             "Focused access? Determines whether each thread access the same element or a random element (y/n or blank for default): ");
                        String tempFocusedAccess = in.readLine();
                        if (tempFocusedAccess.equals("y"))
                             focusedAccess = true;
                             inputInvalid = false;
                        else if (tempFocusedAccess.equals("n"))
                             focusedAccess = false;
                             inputInvalid = false;
                        else if (tempFocusedAccess.equals(""))
                             System.out.println("default value used.\n");
                             inputInvalid = false;
                        else
                             System.out.println(
                                  "You entered an invalid input for focused access. Try again.");
                   * Input number of accesses.
                   inputInvalid = true;
                   while (inputInvalid)
                        System.out.print(
                             "Enter a non-negative value for the number of accesses each thread will complete: ");
                        tempInput = in.readLine();
                        if (tempInput.equals(""))
                             System.out.println("default value used.\n");
                             inputInvalid = false;
                        else
                             try
                                  numberOfAccesses = Integer.parseInt(tempInput);
                                  if (numberOfAccesses >= 0)
                                       inputInvalid = false;
                                  else
                                       System.out.println(
                                            "You entered a negative value for the number of accesses per thread. Try again.");
                             catch (NumberFormatException nfe)
                                  System.out.println(
                                       "You entered an invalid value for the number of accesses per thread. Try again.");
                   * Input start offset.
                   inputInvalid = true;
                   while (inputInvalid)
                        System.out.print("Enter the start offset: ");
                        tempInput = in.readLine();
                        if (tempInput.equals(""))
                             System.out.println("default value used.\n");
                             inputInvalid = false;
                        else
                             try
                                  startOffset = Integer.parseInt(tempInput);
                                  if (startOffset <= numberOfAccesses
                                       && startOffset >= 0)
                                       inputInvalid = false;
                                  else
                                       System.out.println(
                                            "You entered an invalid input for start offset. Try again.");
                             catch (NumberFormatException nfe)
                                  System.out.println(
                                       "You entered an invalid value for the start offset. Try again.");
                   * Input end offset.
                   inputInvalid = true;
                   while (inputInvalid)
                        System.out.print("Enter the end offset: ");
                        tempInput = in.readLine();
                        if (tempInput.equals(""))
                             System.out.println("default value used.\n");
                             inputInvalid = false;
                        else
                             try
                                  endOffset = Integer.parseInt(tempInput);
                                  if (endOffset <= numberOfAccesses && endOffset >= 0)
                                       inputInvalid = false;
                                  else
                                       System.out.println(
                                            "You entered an invalid input for end offset. Try again.");
                             catch (NumberFormatException nfe)
                                  System.out.println(
                                       "You entered an invalid value for the end offset. Try again.");
                   * Create a Hashtable, or a Hashmap?
                   inputInvalid = true;
                   while (inputInvalid)
                        System.out.print(
                             "Use HashMap or HashTable (enter m for HashMap, t for HashTable)? ");
                        String tempMapTable = in.readLine();
                        if (tempMapTable.equals("m"))
                             mapOrTable = true;
                             inputInvalid = false;
                        else if (tempMapTable.equals("t"))
                             mapOrTable = false;
                             inputInvalid = false;
                        else if (tempMapTable.equals(""))
                             System.out.println("default value used.\n");
                             inputInvalid = false;
                        else
                             System.out.println(
                                  "You entered an invalid input. Try again.");
              catch (IOException i)
                   System.out.println("IOException caught: " + i.getMessage());
              * End of obtaining input section. *****
              * Create a HashTable or HashMap of the size and distribution specified.
              Object hash;
              if (mapOrTable)
                   // create a HashMap
                   hash = new HashMap(numberOfElements);
              else
                   // create a HashTable
                   hash = new Hashtable(numberOfElements);
              char c[] = new char[sizeOfElement];
              for (int i = 0; i < numberOfElements; i++)
                   if (mapOrTable)
                        ((HashMap) hash).put(new Integer(i), new String(c));
                   else
                        ((Hashtable) hash).put(new Integer(i), new String(c));
              c = null; // Explicitly release c.
              * Create the specified number of threads.
              AccessorThread accessor[] = new AccessorThread[numberOfThreads];
              long seed;
              for (int i = 0; i < numberOfThreads; i++)
                   // Have a different seed for creating random number for each thread.
                   seed = System.currentTimeMillis() + 77 * i;
                   accessor[i] =
                        new AccessorThread(
                             hash,
                             numberOfElements,
                             focusedAccess,
                             numberOfAccesses,
                             startOffset,
                             endOffset,
                             seed);
                   // Start the thread.
                   accessor.start();
              * Make main wait for all threads to die before continuing.
              try
                   for (int i = 0; i < numberOfThreads; i++)
                        accessor[i].join();
              catch (InterruptedException ie)
                   System.out.println(
                        "InterruptedException caught: " + ie.getMessage());
              * Threads have now been run, so create a statistical report.
              System.out.println(
                   "The following settings were used for this test: \n"
                        + "Number of elements: "
                        + numberOfElements
                        + "\n"
                        + "Size of elements: "
                        + sizeOfElement
                        + "\n"
                        + "Number of threads: "
                        + numberOfThreads
                        + "\n"
                        + "Focused access: "
                        + focusedAccess
                        + "\n"
                        + "Number of accesses: "
                        + numberOfAccesses
                        + "\n"
                        + "Start offset: "
                        + startOffset
                        + "\n"
                        + "End offset: "
                        + endOffset);
              System.out.print("HashMap or HashTable: ");
              if (mapOrTable)
                   System.out.println("HashMap.\n");
              else
                   System.out.println("HashTable.\n");
              System.out.println("Statistic report: ");
              long avgTime;
              long avgTotalTime = 0;
              for (int i = 1; i <= numberOfThreads; i++)
                   avgTotalTime += accessor[i - 1].getAccessTime();
                   avgTime = accessor[i - 1].getAccessTime() / numberOfAccesses;
                   System.out.println(
                        "Thread "
                             + i
                             + "... "
                             + accessor[i
                             - 1].getStatus()
                             + " Total access time: "
                             + accessor[i
                             - 1].getAccessTime()
                             + " ms. Avg individual access time: "
                             + avgTime
                             + " ms.");
              avgTotalTime = avgTotalTime / numberOfThreads;
              // Make it an average over all threads.
              System.out.println(
                   "\nThe average total access time over all threads: "
                        + avgTotalTime
                        + " ms.");
    File#2: AccessorThread.java
    import java.util.Hashtable;
    import java.util.HashMap;
    import java.util.Random;
    * Created on May 13, 2003
    * @author llai
    * Threaded class that accesses a hashtable a certain number of times
    * and measures the access time for a certain number of accesses.
    public class AccessorThread extends Thread
         private Object hash;
         private int numberOfElements;
         private boolean focusedAccess;
         private int numberOfAccesses;
         private int startOffset;
         private int endOffset;
         private long seed;
         private long totalAccessTime;
         private String status;
         * Constructor
         * @param h the Hashtable or HashMap
         * @param keyToAccess the key to access for this thread
         * @param numberOfAccesses the number of access times
         * @param startOffset the start offset
         * @param endOffset the end offset
         public AccessorThread(
              Object h,
              int numberOfElements,
              boolean focusedAccess,
              int numberOfAccesses,
              int startOffset,
              int endOffset,
              long seed)
              this.hash = h;
              this.numberOfElements = numberOfElements;
              this.focusedAccess = focusedAccess;
              this.numberOfAccesses = numberOfAccesses;
              this.startOffset = startOffset;
              this.endOffset = endOffset;
              this.seed = seed;
              status = "Status: alive.";
         * @return the total access time.
         public long getAccessTime()
              return totalAccessTime;
         * @return the status of the thread.
         public String getStatus()
              return status;
         * @return the seed.
         public long getSeed()
              return seed;
         * Run method, accesses the hashtable at keyToAccess for
         * numberOfAccesses times, and measures the response time for
         * a certain number of those accesses.
         public void run()
              * Begin accessing the table, time only after startOffset accesses,
              * and only up to (numberOfAccesses - endOffset) accesses.
              * Access one value if focusedAccess on.
              * Access random values if focusedAccess off.
              Random numGenerator = new Random(seed);
              if (focusedAccess)
                   Object keyToAccess =
                        new Integer(numGenerator.nextInt(numberOfElements));
                   // Access without timing for the first startOffset accesses.
                   int i;
                   // Check if hash is a HashMap or Hashtable.
                   if (hash instanceof HashMap)
                        for (i = 0; i < startOffset; i++)
                             ((HashMap) hash).get(keyToAccess);
                        // Now start timing for the accesses.
                        long startTime = System.currentTimeMillis();
                        while (i < numberOfAccesses - endOffset)
                             ((HashMap) hash).get(keyToAccess);
                             i++;
                        long stopTime = System.currentTimeMillis();
                        totalAccessTime = stopTime - startTime;
                        // Finish accessing the remainder of endOffset times if endOffset is not >= (numberOfAccesses - startOffset).
                        while (i < numberOfAccesses)
                             ((HashMap) hash).get(keyToAccess);
                             i++;
                   else if (hash instanceof Hashtable)
                        for (i = 0; i < startOffset; i++)
                             ((Hashtable) hash).get(keyToAccess);
                        // Now start timing for the accesses.
                        long startTime = System.currentTimeMillis();
                        while (i < numberOfAccesses - endOffset)
                             ((Hashtable) hash).get(keyToAccess);
                             i++;
                        long stopTime = System.currentTimeMillis();
                        totalAccessTime = stopTime - startTime;
                        // Finish accessing the remainder of endOffset times if endOffset is not >= (numberOfAccesses - startOffset).
                        while (i < numberOfAccesses)
                             ((Hashtable) hash).get(keyToAccess);
                             i++;
              // Or else !focusedAccess, therefore access random values.
              else
                   * Get random keys to access and store in an array of Integer objects.
                   * Limit the array to 1000 integer objects.
                   int numberOfRandomInts = numberOfAccesses;
                   if (numberOfAccesses > 1000)
                        numberOfRandomInts = 1000;
                   Integer keysToAccess[] = new Integer[numberOfRandomInts];
                   for (int q = 0; q < numberOfRandomInts; q++)
                        keysToAccess[q] =
                             new Integer(numGenerator.nextInt(numberOfElements));
                   int i;
                   if (hash instanceof HashMap)
                        for (i = 0; i < startOffset; i++)
                             ((HashMap) hash).get(keysToAccess[i % numberOfRandomInts]);
                        // Now start timing for the accesses.
                        long startTime = System.currentTimeMillis();
                        while (i < numberOfAccesses - endOffset)
                             ((HashMap) hash).get(keysToAccess[i % numberOfRandomInts]);
                             i++;
                        // Stop the timing.
                        long stopTime = System.currentTimeMillis();
                        totalAccessTime = stopTime - startTime;
                        // Finish accessing the remainder of endOffset times if endOffset is not >= (numberOfAccesses - startOffset).
                        while (i < numberOfAccesses)
                             ((HashMap) hash).get(keysToAccess[i % numberOfRandomInts]);
                             i++;
                   else if (hash instanceof Hashtable)
                        for (i = 0; i < startOffset; i++)
                             ((Hashtable) hash).get(keysToAccess[i % numberOfRandomInts]);
                        // Now start timing for the accesses.
                        long startTime = System.currentTimeMillis();
                        while (i < numberOfAccesses - endOffset)
                             ((Hashtable) hash).get(keysToAccess[i % numberOfRandomInts]);
                             i++;
                        // Stop the timing.
                        long stopTime = System.currentTimeMillis();
                        totalAccessTime = stopTime - startTime;
                        // Finish accessing the remainder of endOffset times if endOffset is not >= (numberOfAccesses - startOffset).
                        while (i < numberOfAccesses)
                             ((Hashtable) hash).get(keysToAccess[i % numberOfRandomInts]);
                             i++;
              status = "Status: dead.";
    # File #3: run.sh
    echo Compiling the program...
    javac Driver.java AccessorThread.java
    export CLASSPATH=.
    echo Running the program...
    java Driver

  • Cannot perform rounding for invoices with a currency other than the documen

    Hi all,
    I need some one to help me
    I want to process the incoming payment.
    The AR Invoice is using USD
    In Incoming Payment i want to pay using SGD,
    I already set the BP in all currency
    I also set the Bank account in Bank transfer payment mean in all currency.
    But when i add the document i saw the message like this
    "Cannot perform rounding for invoices with a currency other than the document currency.  [Message 3524-31]"
    What should i do ?
    Thanks in advance
    Regards
    KK

    Hi gordon,
    Thanks for your respon.
    I still do not understand, what you mean.
    I test it in SBO DEMO Au which is the local currency is AUD and the system currency is also AUD.
    Is the any special setting for this issue?
    Or Do i miss the settings in SBO
    My version is 8.81 pl 9
    Thanks in advance

  • Camera Raw 6.1pre - scrolling performance worse than in CR6 for me

    Hi
    I like the quality of the new processing in CR6, but the performance  is much worse than in CS4/CR5.x. This is especially annoying when you  try to scroll in a Raw file using the hand-tool. But then I saw the 6.1 prerelease announced containing "performance enhancements designed to improve the responsiveness  of the controls and the scrolling mechanism relative to Camera Raw 6.0". Happily I immediately decided to give the new prerelease a try...
    But unfortunately I don't see a performance gain when scrolling in CR6.1pre. It is actually worse for me in 6.1 than it was in 6.0. It is now almost impossible to scroll out to the corners of a Raw file using the hand-tool. It fells like it get stuck. And I know never know if I have actually have reached a corner or it is just stuck somewhere on the way out to it. So now if I want to go to a corner, I find it much easier to zoom out by double clicking the hand, and then zoom into the corner by clicking the magnify tool in the corner.
    But the new lens correction is great ! :-)
    Win XP Pro x64 Edition.
    /Stig

    Stig N wrote:
    If you double-click you open CR hosted by Photoshop, ie. 64 bit (Or at least that is the default, you might be able to change it in the settings). But if you right-click a raw file in Bridge and choose "Open in Camera Raw" it is hosted by Bridge.
    Oh?  Was not aware of this; and, come to think of it, I cannot see the reasoning behind not always opening in the faster/better mode.
    Or am I missing something?

  • Performance of Standard much worse than Premium?

    After recently using up my 60 days of the premium trial, I decided I didn't need any of the additional features of premium and decided to purchase a license for standard instead.  Everything went smoothly and once I'd upgraded to the latest AIRSDK, I was able to point to my previous workspace and all my projects built and ran fine, straight away.
    Everything was good until I went to install one of the projects onto my Android phone (16GB Nexus 4).  With the premium trial, I'd gotten accustomed to this only taking a few seconds for simple debugging, and a little longer for a release build.  Since I've come to standard this is taking *much* longer, as in 2-4 minutes on average.
    I'm still within my cancellation period for this, so I *can* take the decision to get premium instead, but the financial hit is... unwanted.  If it is a case that the performance of standard is plain and simply just *worse* than premium, I may choose to go back to that, but I'd like to be 100% and get confirmation of that, before doing so.

    From here:
    http://www.adobe.com/products/flash-builder/faq.html
    "Why use Flash Builder Premium Edition over Flash Builder Standard Edition?
    Flash Builder 4.7 Premium adds professional testing tools, including profilers, network monitoring, an automated testing framework, integration with Flex unit testing, and command-line build support"
    The only thing I could think of would be the command-line support. If Premium builds with the command line and Standard version doesn't that might explain the speed differences - but that seems very odd for them to do. If you deactivate your key I think it restarts your trial and if you restart Flash Builder it should load in Premium mode so you could try that and see if it builds faster. (You can always reactivate your standard key later with no issues since you just deactivated it before this)

  • I have Airport Extreme as the base unit and an Express unit in a room separated by a brick wall to improve signal. Express shows a green light indicating signal but my iPad does not perform well. How can I improve other than hardwire ethernet connection?

    I have Airport Extreme as the base unit and an Express unit in a room separated by a brick wall to improve signal. Express shows a green light indicating signal but my iPad does not perform well. How can I improve other than hardwire ethernet connection?

    Other suggestions, and more info about the nature of the problem, may be in this Apple tech note.
    http://support.apple.com/kb/HT1365
    For example, you might find that the brick wall is not the only problem. There may be other devices pumping out enough wireless interference to be making things even worse.
    I agree with Bob Timmons that Ethernet is best and most reliable. And that powerline (which I use) is easier and potentially faster than wireless...but only if your power lines do not have electrical devices plugged in which produce electrical noise on the line. Powerline will be slower than Gigabit Ethernet.
    Ethernet cable is the only way to ensure that the signal goes directly there in a shielded way for a clear fast signal. Wireless and powerline are much slower because of all the other things the signal has to fight past to get to the other device.

  • MSI 8800gts performing worse than my friends 8600gt

    I have a 8800gts 320 with a anthlon 6000+, 2 gigs of RAM, 610w power supply.. and in cod4 Im getting FPS drops while my friend is sitting next to me running smoothly on a 8600gt 256 and anthlon x2 4200+ 2 gigs of RAM.. Im positive my setup should be running better than his, and I have the latest drivers, 6 pin is plugged in.
    I took off antialiasing and my frame drops went away, so it seems like theres more of a load on my vid card than there should be.

    Quote from: Karst on 22-January-13, 06:58:50
    Mobo - EVGA 780i Sli Nforce
    CPU - Intel Core 2 Duo E8400 Wolfgang 3.0ghz (with aftermarket heatsink)
    Ram - 4GB DDR2 Gskill 1066
    Here is my problem, the MSI 660 Ti is performing the same, or worse, than my 260 GTX.
    GTX 660 does not fit with your 6 years old config.
    Your mainboard, processor and RAM are a bottleneck for your GPU.
    Nforce 780i - released 6 years ago
    Core 2 Duo E8400 - released 5 years ago
    Gskill DDR2-1066 - overvolted DDR2-800 modules, released 7 years ago.

  • Performance degradation in j2sdk1.4 than jdk1.3 for jdbc with oracle

    Hi All
    I am working on performance issues regarding response time . i have upgraded my system from jdk1.3 to j2sdk1.4 . I was expecting the performance gain in terms of response time in j2sdk1.4. but to my surprise it shows varied results with my application. it shows that j2sdk1.4 is taking higher time for executing the application when it has to deal with database. I am using oracle 9i as the backend database server.
    if any body has the idea about, why j2sdk1.4 is showing higher responce time while interacting with database as compare to jdk1.3. then do let me know this.
    Thanx in advance

    I'm not sure about the error you're getting, but you might want to try a few things:
    1) Try the thin driver instead of the oci driver. The thin driver is all java, while the oci requires an Oracle client installation (which might be why your getting the memory error). I think the only programming difference is the URL, so if you need to switch later it should be relatively easy.
    2) Instead of DriverManager.registerDriver(), try Class.forName("oracle.jdbc.driver.OracleDriver").newInstance();
    3) I know this sounds bad, but try throwing some print statements in to see how far you're getting.
    Here a quick sample. And remember to include the classes111.zip in your classpath.
    import java.sql.*;
    public class OracleTest {
      public static void main(String args[]) {
        try {
          Class.forName("oracle.jdbc.driver.OracleDriver").newInstance();
          Connection c = DriverManager.getConnection(
                      "jdbc:oracle:thin:@localhost:1521:orcl","scott","tiger");
          System.out.println("Got connection.");     
          c.close();
       } catch (Exception e) {
          System.out.println("Error: " + e);

  • J2sdk1.4 takes higher response time in database interaction than jdk1.3

    Hi All
    I am working on performance issues regarding response time . i have upgraded my system from jdk1.3 to j2sdk1.4 . I was expecting the performance gain in terms of response time in j2sdk1.4. but to my surprise it shows varied results with my application. it shows that j2sdk1.4 is taking higher time for executing the application when it has to deal with database. I am using oracle 9i as the backend database server.
    if any body has the idea about, why j2sdk1.4 is showing higher responce time while interacting with database as compare to jdk1.3. then do let me know this.
    Thanx in advance

    Hi All
    I am working on performance issues regarding response time . i have upgraded my system from jdk1.3 to j2sdk1.4 . I was expecting the performance gain in terms of response time in j2sdk1.4. but to my surprise it shows varied results with my application. it shows that j2sdk1.4 is taking higher time for executing the application when it has to deal with database. I am using oracle 9i as the backend database server.
    if any body has the idea about, why j2sdk1.4 is showing higher responce time while interacting with database as compare to jdk1.3. then do let me know this.
    Thanx in advance

  • How does xalan.jar work with jdk1.3.1 and not work with jdk1.4.1

    Hi,
    i am using java, xalan, xerces for web development. The environment is jdk1.4.1, xerces.jar, xalan.jar. i am facing problem while transforming xml, xsl. Its giving the following error
    java.lang.NoSuchMethodError: org.apache.xalan.xslt.Process.getDefaultLiaison()Ljava/lang/String;
         at org.apache.xalan.xslt.XSLTEngineImpl.(XSLTEngineImpl.java:367)
         at org.apache.xalan.xslt.XSLTProcessorFactory.getProcessor(XSLTProcessorFactory.java:79)
    I tried with jdk1.3.1, xalan.jar, xerces.jar. Its working fine. Can anyone tell me what is the problem with jdk1.4.1 ?
    Regards
    Ashok

    I have the same problem, but the version within SUN seems imcomplete,what version is ?
    For example I am using the xsl tag library provided by Apache (I know this now deprecated). In its ApplyTag.java it uses XSLTDataSource this is not in the SUN 1.4 distribution so it falls over. If I add XALAN 1.0.1 it falls over because it on getDefaultLiason() because it starts loading somne classes from rt.jar and some from xalan.jar, how are you meant to override this.

  • Error in creatinf XML file in JDK1.5.0 but it works in jdk1.4.2

    currently i m using jdk1.5.0 with netbeans4.1, i have code for creating xml file which was work well and succefully write root element via root.tostring() method to file with jdk1.4.2 and it is returning null while using jdk1.5.0. i am using appendchild,createtextnode ,createelement method for this. pls do the need ful. its too urgent

    This error was verified by the java people, to be a new bug.
    It's bugID is 5071879

  • Want to use something faster than jdk1.2

    Is there an oracle jdbc driver available for IBM's JIT compiler? I have been trying to get IBM's java to work with the classes11.zip file, but with no luck (my oracle version is: 8.1.6.1.0).
    Also, I see in the FAQ there is a reference to a classes12.zip file, but I haven't found this file anywhere, not even in later versions of oracle I have downloaded. classes11.zip works fine with my copy of Suns jdk1.2, so I am wondinering whether I am missing classes12.zip.
    Thanks in advance for any help,
    Andy
    Some info on the IBM Java I would like to use:
    Java(TM) 2 Runtime Environment, Standard Edition (build 1.3.0)
    null

    Hi Kevin,
    Thank you for participating in the Small Business support community. My name is Nico Muselle from Cisco Sofia SBSC.
    Indeed this is the best option, to reserve the default (management) VLAN for what it is intended for ... management and set your clients to use another VLAN. I'm not sure if it is possible to separate SNMP traffic on a Windows XP machine and send that over the management VLAN, however, what you could do, is enable inter-vlan routing (either on the router, or set the switch to L3) and create an access-list that only allows the snmp traffic to be routed to and from the management VLAN.
    This way you can keep your SNMP server in the management VLAN.
    Wouldn't that be an option ?
    Best regards,
    Nico Muselle
    Sr. Network Engineer - CCNA

  • JDK1.4  javax.Print  Any one tried JDK1.4 Printing

    I am trying JDK1.4 Printing. Also i want to have it plugable for 1.3.x and 1.2.X. JRE
    so you have any solution for that.
    please mail me asap
    Rajesh

    Could you be more spcefice , or can you redescribe the problem

  • IPhoto 6.0.3 (293) Performance Worse Than Any Other Version

    Interesting. I have 9,990 photos and my iPhoto 6 just came to a crawl. I have 1.5GB of memory. Something is definitely wrong. When I start iPhoto it appears to behave normally for about 30 seconds.
    I've read many of the other speed/performance/slow threads in this forum. Here's what I've tried:
    I have all my Rolls collapsed. After doing a couple transactions (eg: scrolling up/down or editing one picture), iPhoto freezes.
    When this happens I'll open Activity Monitor and find my dual CPUs pegged at about 97%.
    I've rebuilt my library, my small thumbnails, my large thumbnails, loaded IPLM (iPhoto Library Manager) and rebuilt the library using its copy function, and I've even moved my library to another volume. Nothing has worked. I've even run Disk Warrior against my volume that hosts iPhoto, reset permissions and run Disk Utility and verified that the hard drive is OK. I've also removed my iPhoto preference file. Nothing has helped.
    I'm beside myself.
    I'm currently running a manual rebuild test (UGGGH!!!!!) to see it's a problem with my existing library's data (i.e. corruption?) or my instance of iPhoto.
    (NOTE: a smaller, newer library helps but I don't want to lose my meta data. That's, frankly, the most important feature of iPhoto for my wife and me.)
    I've never heard the fans on my Dual G4 PPC (mirror door model) run so loudly. Of course, I've rebooted several times too.
    If anyone has any other suggestions, please let me know. I have a backup but I feer the backup contains the same, assumed, corrupt files as my active volume.
    Dual 1.25GHz G4 PowerPC Mac OS X (10.4.6)

    G4Monster:
    Have you tried rebuilding the library with iPLM and it's File->Rebuild Library... menu option? That create a new, library, copying the files and rebuilding the database, etc.? Or is that what you meant by "using its copy function,"?
    If you find you have to create new libraries in the end, there is a way to preserve the comments and keywords. See Tutorial #1 on how to preserve them.

Maybe you are looking for

  • How to use mime type..

    Hi frnds i have my data in a tabular format in jsp. my requirement is to create a EXCEL report for tht data using javascript (using MIME type change). can anyone help me to create xl report.

  • Retrieve Crystal SQL statements without first submitting parameter values?

    Hi, I am retrieving SQL statements for Crystal reports without issue, but a large number of our reports have parameters and for these the following error is thrown when I try to retrieve the SQL statement via RAS using getSQLStatement(): com.crystald

  • Layer effect deleted - can it be restored?

    I inadvertantly deleted the drop shadow layer effect when I was intending to just delete a layer. Is there a way to restore it?  I looked in my recycle can and didn't see it but I might not know what to look for. Thanks! Susan

  • Characters allowed inside LIKE operator

    Hi, DB: Oracle 10g SELECT   count(*)   FROM   mytable WHERE   LOWER(mycolumn) LIKE LOWER('%<th sc="row">Havana</th>%')I am not sure if this pattern will be matched by LIKE operator because it has all sorts of characters as you can see -> <, = ", /. S

  • Trust tablet doesn't work

    Hello everyone! Recently I bought Trust TB-5300 tablet, and faced a problem: I cannot draw anything using it! When I try to draw a line, nothing happens. Sometimes, when i tap repeatedly on tablet, it makes some dots on screen, or when I draw with a