> On 11/06/2017 08:30 PM, aravindan.muthuku...@intel.com wrote:
> > From: Aravindan Muthukumar
> >
> > Now the complexity has been reduced to O(1)
> >
> > Algorithm calculates the index using matrix method.
> > Matrix arrangement is as below:
> > Assuming PAGE_SIZE is 4096.
> >
> > 1*409
On 11/06/2017 08:30 PM, aravindan.muthuku...@intel.com wrote:
> From: Aravindan Muthukumar
>
> Now the complexity has been reduced to O(1)
>
> Algorithm calculates the index using matrix method.
> Matrix arrangement is as below:
> Assuming PAGE_SIZE is 4096.
>
> 1*4096 2*40963*4
From: Aravindan Muthukumar
Now the complexity has been reduced to O(1)
Algorithm calculates the index using matrix method.
Matrix arrangement is as below:
Assuming PAGE_SIZE is 4096.
1*4096 2*40963*40964*4096
5*4096 6*40967*40968*4096
10*4096 1
From: Aravindan Muthukumar
Avoiding the loop which was running with O(n) complexity.
Now the complexity has been reduced to O(1)
Algorithm calculates the index using matrix method.
Matrix arrangement is as below:
Assuming PAGE_SIZE is 4096.
1*4096 2*40963*40964*4096
