Sieve of Eratosthenes benchmarks for the Z8 FORTH microcontroller

More documents

Recommendations

Info

the limit to eliminate many multiples is shown below. The additional FORTH words used in this benchmark (limit>i:if and word-then) are defined in Appendix @: 1. 8190 CONSTANT SIZE 2. SIZE 1+ ARRAY-VARIABLE FLAGS 3. : SIEVESUB 4. FLAGS 5. I I DUQ+3+ 6.. SIZE 0 7. FILL-ROW ; a. 1 I FLAGS + C! ; 9. : OUTER-LOOP 10. do-code, 11. LTBAI, 12. nx if, 13. limit>i:if, 14. GOFORTH SIEVESUB 15. word-then, 16. inc-prime-count, 17. then, 18. 1 oop- code I 19. EXIT, ; 20. : DO-PRIME 21. FLAGS SIZE 1+ 1 FILL 22. 0 23. SIZE 0 OUTER-LOOP 24. . -I1 PRIMES" ; Define constant SlZE with value 8190 Define an array of length 8191 (0 .. 8190) Define a FORTH yosd to mark primes Put the address of FLAGS on the stack Put row index and PRIME (2*I+3) on stack Matrix size, initialization constant to stack Invoke word to zero last row of matrix Restore the value of the primts FLAG Push the Limit, starting index to RStack Load the byte at I, test if on-zero If the byte at 1 is nonzero; mrk its wttiptes Test if LIMIT > outer-loop index Use a FORTH word to mark ntultiples Pairs with limit>i:if conditional test Increment prim count End of multiple-marking section End of outer Loop Exit back to DO-PRIME word Define a FORTH word called DO-PRIME Initialize 8191 bytes of FLAGS to 1 Initialize prim count to 0 Loop to examine 8191 FLAG bytes Print out prime countl. 18
The time to perform ten iterations of the prime calculation with the program just presented is only five seconds. This result is shown with the benchmarks previously presented in the table below: Table 5. 28 FORTH Benchmark Results - Duplicate Marking Avoidance Version of the FORTH Benchmark Computer Languege Time for 10 Iterations (Seconds) I0M 3033 Assembly -0078 VAX 1 1/780 C Conpiler 1.42 IBM AT (6 HHz) C Campiler .7 IBW PC (5 MHz) Assembly 4. IBM PC (5 HHz) C Cornpiter 30. IBH PC (5 MHzI FORTH 70. Apple II Assembly 13.9 Apple I1 FORTH 190. FORTH FORTH FORTH FORTH 19 102. 36. 21. 5. (Gilbreath program) (Version using RMJ-FILL) (Assembly language for outer loop) (Avoid duplicate marking of multiples)
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 and 20: 5. THE GILBREATHS’ FORTH PROGRAM
Page 21 and 22: 1. 2. 3. 4. 5. 6. 7. 8. 9. IO. 11.
Page 23 and 24: 6. IMPROVING THE EFFICIENCY OF THE
Page 25 and 26: 7. IMPROVING THE EFFICIENCY OF THE
Page 27: 8. ELIMINATING DUPLICATE MARKING OF
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?