Sieve of Eratosthenes benchmarks for the Z8 FORTH microcontroller

More documents

Recommendations

Info

FLAGS allocates 2 bytes for a variable called FLAGS. The sequence SIZE ALLOT allocates SIZE more bytes for the variable, thus defining SIZE + 2 bytes (8,192) bytes total. A correct definition of the FLAGS array is: 0 VARIABLE FLAGS SIZE 1 - ALLOT A better way of defining the FLAGS array is to use the standard FORTH word for array definition, ARRAY-YARIABLE, to define an array of length SIZE+l: SIZE 1+ ARRAY-VARIABLE FLAGS A corrected version of the Gilbreaths’ version of the sieve algorithm is: 1. 2. 3. 4. 5. 6. 7. 8. 9. IO. 11. 12. 13. 8190 CONSTANT SIZE SIZE I+ ARRAY-VARIABLE : DO-PRIME FLAGS SIZE 1+ 1 FILL 0 SIZE 0 DO FLAGS I + C@ IF 1 DUP + 3 + DUP I + BEGIN DUP SIZE
1. 2. 3. 4. 5. 6. 7. 8. 9. IO. 11. 12. 13. 14. 15. 16. 8190 CONSTANT SIZE SIZE I+ ARRAY-VARIAELE FLAGS : DO-PRIME FLAGS SIZE I+ 1 FILL 0 SIZE 0 DO FLAGS I + C@ IF I DUP + 3 + DUP I + BEG IN DUP SIZE
Page 1 and 2: I hlAH IIN MARlElTA ENERG< SYSTEMS
Page 3: Energy Division SEVE OF ERATOSTHENE
Page 7: . TABLEOFCONTENTS 1 . INTRODUCTION
Page 11 and 12: 1. 1NTRODUCTION The Oak Ridge Natio
Page 13 and 14: Smart House can be thought of as th
Page 15 and 16: detailed remarks for each of the FO
Page 17 and 18: 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11.
Page 19: 5. THE GILBREATHS’ FORTH PROGRAM
Page 23 and 24: 6. IMPROVING THE EFFICIENCY OF THE
Page 25 and 26: 7. IMPROVING THE EFFICIENCY OF THE
Page 27 and 28: 8. ELIMINATING DUPLICATE MARKING OF
Page 29 and 30: The time to perform ten iterations
Page 31 and 32: 10. REFERENCES Brodie, L., Starting
Page 33 and 34: APPENDIX B IMPLEMENTATION OF ROW-FI
Page 35: : LOAD-WRD OVER 1+ OVER 0 100 U/ RR

Sieve of Eratosthenes benchmarks for the Z8 FORTH microcontroller

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?