Author Topic: Prime Sieve again - stumbling through quite a bit of memory  (Read 18958 times)

dedndave

  • Member
  • *****
  • Posts: 8829
  • Still using Abacus 2.0
    • DednDave
Re: Prime Sieve again - stumbling through quite a bit of memory
« Reply #30 on: November 07, 2013, 05:15:28 AM »
well - i may not use MUL - i will probably use the extended addressing modes   :P

for now, i am just writing a test to 8,589,934,591 so i can compare it with Eratosthenes odd-bit
with a little luck, i can develop a theorem to eliminate mod-7's
then, i can use an "Atkin-like" method to create a new "Sheldon-Atkin-Bernstein" sieve

herge

  • Member
  • ***
  • Posts: 477
Re: Prime Sieve again - stumbling through quite a bit of memory
« Reply #31 on: November 10, 2013, 10:48:55 AM »

 Hi Bit Coders:

 Some times it's quicker to tick off a byte or word than a bit and
 yes you are wasting mwmory like a pig? Some of the bit manipulation
 instructions are  quite large.
 Bit manipulation is not always faster.
Regards herge
Read "Slow Death by Rubber Duck"
for chemical Laughs.