Re: [algogeeks] optimisation

[atul anand]

strassen multiplication , but it may cause overflow

On Tue, Feb 28, 2012 at 5:27 AM, Arun Vishwanathan
wrote:

> Hi all,
>
> We have this challenge to make the fastest executing serial matrix
> multiplication code. I have tried using matrix transpose( in C for row
> major ) and loop unrolling.I was able to obtain little speedup. Does anyone
> have any hints/papers that I could read upon and try to speed up further?I
> had tried a bit of block tiling but was not successful.
>
> Thanks
> Arun
>
>
>  --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] optimisation

[Arun Vishwanathan]

Hi all,

We have this challenge to make the fastest executing serial matrix
multiplication code. I have tried using matrix transpose( in C for row
major ) and loop unrolling.I was able to obtain little speedup. Does anyone
have any hints/papers that I could read upon and try to speed up further?I
had tried a bit of block tiling but was not successful.

Thanks
Arun

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Optimisation to reduce time...

[sunny agrawal]

You should have posted the problem link
i think u are trying this one. 

 use RMQ or Binary Indexed Trees.
Brute Force won't work

On Sun, Jul 3, 2011 at 1:17 PM, rajeevrvis wrote:

> Hi Here is the code  . I want to optimize it to run faster .
> Can Anyone help me???
>
> #include
> void main()
> {
>  int n,q,a[10]={0},b[10],c[10],d[10],i,count,j;
>  scanf("%d%d",&n,&q);
>  for(i=0;i  for(i=0;i   if(b[i]==0)
>   {
>for(j=c[i];j<=d[i];j++)
> a[j]=a[j]+1;
>   }
>else
>{
> count =0;
> for(j=c[i];j<=d[i];j++)
>  if(a[j]%3==0)
>   count++;
> printf("%d\n",count);
> }
>}
>
>  Regards
>
> rajeevrvis
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>


-- 
Sunny Aggrawal
B-Tech IV year,CSI
Indian Institute Of Technology,Roorkee

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Optimisation to reduce time...

[Sandeep Jain]

Can you give an insight to what exactly this code does? That may help quiet
a lot.



Regards,
Sandeep Jain




On Sun, Jul 3, 2011 at 1:17 PM, rajeevrvis wrote:

> Hi Here is the code  . I want to optimize it to run faster .
> Can Anyone help me???
>
> #include
> void main()
> {
>  int n,q,a[10]={0},b[10],c[10],d[10],i,count,j;
>  scanf("%d%d",&n,&q);
>  for(i=0;i  for(i=0;i   if(b[i]==0)
>   {
>for(j=c[i];j<=d[i];j++)
> a[j]=a[j]+1;
>   }
>else
>{
> count =0;
> for(j=c[i];j<=d[i];j++)
>  if(a[j]%3==0)
>   count++;
> printf("%d\n",count);
> }
>}
>
>  Regards
>
> rajeevrvis
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Optimisation to reduce time...

[rajeevrvis]

Hi Here is the code  . I want to optimize it to run faster .
Can Anyone help me???

#include
void main()
{
 int n,q,a[10]={0},b[10],c[10],d[10],i,count,j;
 scanf("%d%d",&n,&q);
 for(i=0;ihttp://groups.google.com/group/algogeeks?hl=en.