primes for large n: 2^30, system memory limit -凯发k8网页登录

created by richard zapor

{"relationships":[{"relationshiptype":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetmode":"","relationshipid":"rid1","target":"/matlab/document.xml"},{"relationshiptype":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetmode":"","relationshipid":"rid2","target":"/matlab/output.xml"}],"parts":[{"parturi":"/matlab/document.xml","relationship":[],"contenttype":"application/vnd.mathworks.matlab.code.document xml","content":"<?xml version=\"1.0\" encoding=\"utf-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:ppr><w:pstyle w:val=\"text\"/></w:ppr><w:r><w:t>this challenge is to further improve the \"primes\" function for speed/memory usage to the limit of cody memory.</w:t></w:r></w:p><w:p><w:ppr><w:pstyle w:val=\"text\"/></w:ppr><w:r><w:t>the matlab function \"primes\" has a very efficient sieving method but it suffers from memory usage issues, especially on limited memory systems.</w:t></w:r></w:p><w:p><w:ppr><w:pstyle w:val=\"text\"/></w:ppr><w:r><w:t>the</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:doclocation=\"http://www.mathworks.com/matlabcentral/cody/problems/1761-primes-faster-for-large-n\"><w:r><w:t>primes faster challenge</w:t></w:r></w:hyperlink><w:r><w:t> gives the first half to maximizing the primes function for optimal memory usage and speed.</w:t></w:r></w:p><w:p><w:ppr><w:pstyle w:val=\"text\"/></w:ppr><w:r><w:t>cody appears to have 2gb of ram based upon \"out of memory\" messages observed.</w:t></w:r></w:p><w:p><w:ppr><w:pstyle w:val=\"text\"/></w:ppr><w:r><w:t>the test case of 2^30 pushes the upper limits of cody memory.</w:t></w:r></w:p><w:p><w:ppr><w:pstyle w:val=\"text\"/></w:ppr><w:r><w:t>the reference solution can process n=2^32 on an 8gb machine in 68sec.</w:t></w:r></w:p><w:p><w:ppr><w:pstyle w:val=\"text\"/></w:ppr><w:r><w:rpr><w:b/></w:rpr><w:t>input:</w:t></w:r><w:r><w:t> n (max of primes to find)</w:t></w:r></w:p><w:p><w:ppr><w:pstyle w:val=\"text\"/></w:ppr><w:r><w:rpr><w:b/></w:rpr><w:t>output:</w:t></w:r><w:r><w:t> vector of primes (all primes less than or equal to n)</w:t></w:r></w:p><w:p><w:ppr><w:pstyle w:val=\"text\"/></w:ppr><w:r><w:rpr><w:b/></w:rpr><w:t>scoring:</w:t></w:r><w:r><w:t> time to find all primes < 2^30</w:t></w:r></w:p><w:p><w:ppr><w:pstyle w:val=\"text\"/></w:ppr><w:r><w:rpr><w:b/></w:rpr><w:t>hints:</w:t></w:r></w:p><w:p><w:ppr><w:pstyle w:val=\"code\"/></w:ppr><w:r><w:t><![cdata[1) doubles use 8 bytes;\n2) the primes method p(((k*k 1)/2):k:q) creates a vector using q/k*8 bytes. this is 8/3 the size of p for k=3 because k is a double. \n3) segmentation will keep memory usage below limits at the cost of time.\n4) cody available memory appears to be 537.27mb. xp operating system eats memory.\n5) usage of profiler and task manager combined give performance insights.]]></w:t></w:r></w:p></w:body></w:document>"},{"parturi":"/matlab/output.xml","contenttype":"text/xml","content":"<?xml version=\"1.0\" encoding=\"utf-8\" standalone=\"no\" ?><embeddedoutputs><metadata><evaluationstate>manual</evaluationstate><layoutstate>code</layoutstate><outputstatus>ready</outputstatus></metadata><outputarray type=\"array\"/><regionarray type=\"array\"/></embeddedoutputs>"}]}

this challenge is to further improve the "primes" function for speed/memory usage to the limit of cody memory.the matlab function "primes" has a very efficient sieving method but it suffers from memory usage issues, especially on limited memory systems.the <a href = "http://www.mathworks.com/matlabcentral/cody/problems/1761-primes-faster-for-large-n">primes faster challenge</a> gives the first half to maximizing the primes function for optimal memory usage and speed.cody appears to have 2gb of ram based upon "out of memory" messages observed.the test case of 2^30 pushes the upper limits of cody memory.the reference solution can process n=2^32 on an 8gb machine in 68sec.input: n (max of primes to find)output: vector of primes (all primes less than or equal to n)scoring: time to find all primes < 2^30hints:<pre class="language-matlab">1) doubles use 8 bytes;
2) the primes method p(((k*k 1)/2):k:q) creates a vector using q/k*8 bytes. this is 8/3 the size of p for k=3 because k is a double. 
3) segmentation will keep memory usage below limits at the cost of time.
4) cody available memory appears to be 537.27mb. xp operating system eats memory.
5) usage of profiler and task manager combined give performance insights.
</pre>

this challenge is to further improve the "primes" function for speed/memory usage to the limit of cody memory.
the matlab function "primes" has a very efficient sieving method but it suffers from memory usage issues, especially on limited memory systems.
the <http://www.mathworks.com/matlabcentral/cody/problems/1761-primes-faster-for-large-n primes faster challenge> gives the first half to maximizing the primes function for optimal memory usage and speed.
cody appears to have 2gb of ram based upon "out of memory" messages observed.
the test case of 2^30 pushes the upper limits of cody memory.
the reference solution can process n=2^32 on an 8gb machine in 68sec.
*input:* n (max of primes to find)
*output:* vector of primes (all primes less than or equal to n)
*scoring:* time to find all primes < 2^30
*hints:*
 1) doubles use 8 bytes;
 2) the primes method p(((k*k 1)/2):k:q) creates a vector using q/k*8 bytes. this is 8/3 the size of p for k=3 because k is a double. 
 3) segmentation will keep memory usage below limits at the cost of time.
 4) cody available memory appears to be 537.27mb. xp operating system eats memory.
 5) usage of profiler and task manager combined give performance insights.

solution stats

last submitted on may 06, 2023

last 200 solutions

problem comments

3 comments

3 comments

on 6 aug 2013

nice problem!

i have had some problems to get trough the test suite, one of them was that my primes where in uint32 and that failed the 'isprime' assertion.

maybe you could change the following line
pchk=p(ptr);
to
pchk=double(p(ptr));

richard zapor on 7 aug 2013

double implemented in test suite. intent is to find the primes, not to get snared by errant function limitations.

on 21 sep 2020

currently the matlab function primes is able to solve this problem. since systems always evolve, the problem's author will probably have to be constantly updating it. or at least, once a year.

solution comments

problem recent solvers

problem tags

community treasure hunt

find the treasures in matlab central and discover how the community can help you!

start hunting!

primes for large n: 2^30, system memory limit -凯发k8网页登录

solution stats

last 200 solutions

problem comments

solution comments

problem recent solvers

suggested problems

more from this author

problem tags

community treasure hunt

primes for large n: 2^30, system memory limit -凯发k8网页登录

solution stats

last 200 solutions

problem comments

solution comments

problem recent solvers

suggested problems

more from this author

problem tags

community treasure hunt

players

wechat