[Tutor] Generate Prime Numbers
Laura Creighton
lac at openend.se
Wed Jun 10 21:08:15 CEST 2015
In a message of Wed, 10 Jun 2015 23:11:36 +0530, Mirage Web Studio writes:
>
>
>
>On 2015-05-31 5:04 AM, Alan Gauld wrote:
>> On 30/05/15 19:14, George wrote:
>
>Excuse me please for replying late.
>
>I got lists to use the method and it is more efficient and faster.
>(Takes about 10 secs to process first 50 mil numbers)
>
>But now another problem i seem to notice that only 1 core of my amd
>Athlon X2 4core processor is being used. I suppose if all the four
>cores are simultaneously used then the programme might run even faster.
>Is there a way.
>
>Kindly guide me.
>
>Thank You.
>
>George
If you want, you can use the STM branch of the pypy interpreter. This
is a Python without the global interpreter lock. One of the tests
we did was, surprise, to calculate prime numbers.
See the blog post here:
http://morepypy.blogspot.se/2014/11/tornado-without-gil-on-pypy-stm.html
Laura
More information about the Tutor
mailing list