Lower Time and Processor Bounds for Efficient Mapping of Uniform Dependence Algorithms into Systolic Arrays.
Theodore AndronikosNectarios KozirisZacharias TsiatsoulisGeorge K. PapakonstantinouPanayotis TsanakasPublished in: Parallel Algorithms Appl. (1997)
Keyphrases
- worst case
- computationally expensive
- computationally efficient
- parallel architectures
- orders of magnitude
- significant improvement
- uniform sampling
- upper bound
- error bounds
- computational cost
- computational complexity
- upper and lower bounds
- algorithmic solutions
- lower bound
- database systems
- efficient solutions
- learning algorithm
- computationally complex
- linear array
- computationally demanding
- systolic array
- single processor
- parallel processors
- highly scalable
- average case
- image processing algorithms
- evolutionary algorithm
- data structure