The Byte Sieve is a computer-based implementation of the Sieve of Eratosthenes published by Byte as a programming language performance benchmark. It first...

In mathematics, the sieve of Eratosthenes is an ancient algorithm for finding all prime numbers up to any given limit. It does so by iteratively marking...

Benchmark". Byte. pp. 180–198. Gilbreath, Jim; Gilbreath, Gary (January 1983). "Eratosthenes Revisited: Once More through the Sieve". BYTE. Vol. 8, no...

during computation. BYTE RTCLOK=20, ; addr of sys timer SDMCTL=559 ; DMA control BYTE ARRAY FLAGS(8190) CARD COUNT,I,K,PRIME,TIME PROC SIEVE() SDMCTL=0 ; shut...

(discontinued) AnTuTu – commonly used on phones and ARM-based devices. Byte Sieve - originally tested language performance, but widely used as a machine...

machines like the Commodore PET or Apple II. For instance, running the Byte Sieve in BASIC took 3960 seconds in TI BASIC, while the same test in Applesoft...

quadratic sieve algorithm (QS) is an integer factorization algorithm and, in practice, the second-fastest method known (after the general number field sieve)....

Z8000 was not more popular: Comparing assembly language versions of the Byte Sieve, one sees that the 5.5 MHz Z8000's 1.1 seconds is impressive when compared...

purchase it". From the PROMAL program disk: PROGRAM SIEVE  ; Sieve of Eratosthenes Benchmark  ; test (BYTE magazine)  ; 10 iterations, 1800 element array....

Its primary competition in the early 1980s in the United States was the Byte Sieve, of September 1981, while the earlier Rugg/Feldman benchmarks of June...