Achieving Superlinear Speedups for the Multiple Polynomial Quadratic Sieve Factoring Algorithm on a Distributed Memory Multiprocessor.
Michel CosnardJean-Laurent PhilippePublished in: CONPAR (1990)
Keyphrases
- distributed memory
- multiprocessor systems
- computational complexity
- parallel implementation
- dynamic programming
- preprocessing
- objective function
- ibm sp
- image processing
- simulated annealing
- similarity measure
- probabilistic model
- ant colony optimization
- matching algorithm
- search space
- pairwise
- scientific computing
- matrix multiplication
- computer vision