Results 1 to 2 of 2
  1. #1
    lulzim is offline Member
    Join Date
    Feb 2011
    Posts
    44
    Rep Power
    0

    Default I need fast multiplication of array???

    I am using Strassen algorithm but still is taking too much time to finish the multiplication of matrix by 2000X2000 elements , can u please tell me any way how can i do it in JAVA.
    \

  2. #2
    toadaly is offline Senior Member
    Join Date
    Jan 2009
    Posts
    671
    Rep Power
    6

    Default

    Personally, I would not use Java for this problem. I'd use c or maybe even CUDA, and I'd be very careful with how I dealt with memory to avoid cache hits.

    Is the concern wall clock time, or CPU time (or both)? You can reduce wall clock time by throwing more CPUs/GPUs at it. Matrix multiplication is easily parallelizedusing the standard algorithm, but I'd have to think really hard to figure out how to parallelize something like the Strassen algorithm, and would probably give up and throw GPUs at it, or hire a mathematician if I had to.

Similar Threads

  1. need help with multiplication
    By dakid2 in forum New To Java
    Replies: 10
    Last Post: 03-08-2011, 04:41 AM
  2. Fast array for insertion/removal
    By Skiller in forum New To Java
    Replies: 4
    Last Post: 02-20-2011, 04:23 PM
  3. Multiplication Table
    By SwEeTAcTioN in forum New To Java
    Replies: 4
    Last Post: 02-24-2010, 05:11 AM
  4. Multiplication table
    By rjones215 in forum New To Java
    Replies: 3
    Last Post: 10-19-2009, 05:34 PM
  5. Help with Multiplication
    By phil028 in forum New To Java
    Replies: 1
    Last Post: 12-06-2007, 08:39 PM

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •