See: Description
| Class | Description |
|---|---|
| AMGraph |
Class AMGraph provides an adjacency matrix data structure for a graph with
any number of vertices.
|
| AMGraph64 |
Class AMGraph64 provides an adjacency matrix data structure for a graph with
up to 64 vertices.
|
| BCAClu |
Class BCAClu is a cluster parallel program that computes the evolution of a
binary cellular automaton (CA).
|
| BCASmp |
Class BCASmp is an SMP parallel program that computes the evolution of a
binary cellular automaton (CA).
|
| BigPrimeClu |
Class BigPrimeClu is a cluster parallel main program that finds a big prime
number.
|
| BigPrimeSeq |
Class BigPrimeSeq is a sequential main program that finds a big prime number.
|
| CCACell |
Class CCACell provides one cell in a continuous cellular automaton.
|
| CCAClu |
Class CCAClu is a hybrid SMP cluster parallel program that calculates the
evolution of a continuous cellular automaton and stores the result in a
grayscale PNG image file.
|
| CCASeq |
Class CCASeq is a sequential program that calculates the evolution of a
continuous cellular automaton and stores the result in a grayscale PNG image
file.
|
| CCASmp |
Class CCASmp is an SMP parallel program that calculates the evolution of a
continuous cellular automaton and stores the result in a grayscale PNG image
file.
|
| HamCycClu |
Class HamCycClu is a cluster parallel program that finds a Hamiltonian cycle
in a graph via exhaustive search.
|
| HamCycSeq |
Class HamCycSeq is a sequential program that finds a Hamiltonian cycle in a
graph via exhaustive search.
|
| HamCycSmp |
Class HamCycSmp is a multicore parallel program that finds a Hamiltonian
cycle in a graph via exhaustive search.
|
| HamCycState |
Class HamCycState encapsulates the state of a search for a Hamiltonian cycle
in a graph.
|
| HamCycStateClu |
Class HamCycStateClu encapsulates the state of a search for a Hamiltonian
cycle in a graph in a cluster parallel program.
|
| HamCycStateSmp |
Class HamCycStateSmp encapsulates the state of a search for a Hamiltonian
cycle in a graph in a multicore parallel program.
|
| MandelbrotClu |
Class MandelbrotClu is a cluster parallel program that calculates the
Mandelbrot Set.
|
| MandelbrotSeq |
Class MandelbrotSeq is a sequential program that calculates the Mandelbrot
Set.
|
| MandelbrotSeq3 |
Class MandelbrotSeq3 is a sequential program that calculates the Mandelbrot
Set.
|
| MandelbrotSmp |
Class MandelbrotSmp is an SMP parallel program that calculates the Mandelbrot
Set.
|
| MandelbrotSmp2 |
Class MandelbrotSmp2 is an SMP parallel program that calculates the
Mandelbrot Set.
|
| MandelbrotSmp3 |
Class MandelbrotSmp3 is an SMP parallel program that calculates the
Mandelbrot Set.
|
| MineCoinClu |
Class MineCoinClu is a cluster parallel program that does a simplified
version of Bitcoin mining.
|
| MineCoinClu2 |
Class MineCoinClu2 is a cluster parallel program that does a simplified
version of Bitcoin mining.
|
| MineCoinClu3 |
Class MineCoinClu3 is a cluster parallel program that does a simplified
version of Bitcoin mining.
|
| MineCoinSeq |
Class MineCoinSeq is a sequential program that does a simplified version of
Bitcoin mining.
|
| MineCoinSmp |
Class MineCoinSmp is an SMP parallel program that does a simplified version
of Bitcoin mining.
|
| MinVerCovClu3 |
Class MinVerCovSeq3 is a cluster parallel program that finds a minimum vertex
cover of a graph via heuristic search.
|
| MinVerCovDist |
Class MinVerCovDist is a multicore cluster parallel program that investigates
the distribution of minimum vertex covers in random graphs.
|
| MinVerCovSeq |
Class MinVerCovSeq is a sequential program that finds a minimum vertex cover
of a graph via exhaustive search.
|
| MinVerCovSeq2 |
Class MinVerCovSeq2 is a sequential program that finds a minimum vertex cover
of a graph via exhaustive search.
|
| MinVerCovSeq3 |
Class MinVerCovSeq3 is a sequential program that finds a minimum vertex cover
of a graph via heuristic search.
|
| MinVerCovSmp |
Class MinVerCovSmp is an SMP parallel program that finds a minimum vertex
cover of a graph via exhaustive search.
|
| MinVerCovSmp2 |
Class MinVerCovSmp2 is an SMP parallel program that finds a minimum vertex
cover of a graph via exhaustive search.
|
| MinVerCovSmp3 |
Class MinVerCovSeq3 is an SMP parallel program that finds a minimum vertex
cover of a graph via heuristic search.
|
| OddPrimeList |
Class OddPrimeList encapsulates a list of odd prime numbers.
|
| PiClu |
Class PiClu is a cluster parallel program that calculates an approximate
value for π using a Monte Carlo technique.
|
| PiSeq |
Class PiSeq is a sequential program that calculates an approximate value for
π using a Monte Carlo technique.
|
| PiSmp |
Class PiSmp is an SMP parallel program that calculates an approximate value
for π using a Monte Carlo technique.
|
| PiSmp2 |
Class PiSmp2 is an SMP parallel program that calculates an approximate value
for π using a Monte Carlo technique.
|
| PrimeSeq |
Class PrimeSeq is a sequential program that tests numbers for primality.
|
| PrimeSmp |
Class PrimeSmp is an SMP parallel program that tests numbers for primality.
|
| StatTestSeq |
Class StatTestSeq is a sequential program that performs a statistical test on
a pseudorandom number generator.
|
| StatTestSmp |
Class StatTestSmp is a multicore parallel program that performs a statistical
test on a pseudorandom number generator.
|
| TotientClu |
Class TotientClu is a cluster parallel program that computes the Euler
totient of a number.
|
| TotientSeq |
Class TotientSeq is a sequential program that computes the Euler totient of a
number.
|
| TotientSmp |
Class TotientSmp is an SMP parallel program that computes the Euler totient
of a number.
|
| TotientSmp2 |
Class TotientSmp2 is an SMP parallel program that computes the Euler totient
of a number.
|
| ZombieClu |
Class ZombieClu is a cluster parallel program to compute the motion of a
group of zombies.
|
| ZombieSeq |
Class ZombieSeq is a sequential program to compute the motion of a group of
zombies.
|
| ZombieSmp |
Class ZombieSmp is an SMP parallel program to compute the motion of a group
of zombies.
|
Copyright © 2013–2018 by Alan Kaminsky. All rights reserved. Send comments to ark@cs.rit.edu.