edu.rit.hyb.prime

Class PrimeCountFunctionSeq

java.lang.Object

edu.rit.hyb.prime.PrimeCountFunctionSeq

public class PrimeCountFunctionSeq
extends java.lang.Object

Class PrimeCountFunctionSeq is a sequential program that calculates the prime counting function π(x). π(x) is the number of primes less than or equal to x. The program uses a list of 32-bit primes stored in a file. The prime file must be generated by the Prime32File program. To find the primes, the program calculates a series of sieves. Each sieve consists of one million numbers.

Usage: java edu.rit.hyb.prime.PrimeCountFunctionSeq x primefile
x = Argument of prime counting function, 0 <= x <= 2⁶³-1
primefile = Prime file name

The computation is performed sequentially in a single processor. The program measures the total running time. This establishes a benchmark for measuring the running time on a parallel processor.

Method Summary

Modifier and Type	Method and Description
static void	main(java.lang.String[] args) Main program.

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Method Detail

main

public static void main(java.lang.String[] args)
                 throws java.lang.Exception

Main program.

Throws:

java.lang.Exception