On the Computation of 2-Dimensional Recurrence Equations

Giuseppe Natale

On the Computation of 2-Dimensional Recurrence Equations

Data Structures and Algorithms 2024-06-05 v1 Computational Complexity Distributed, Parallel, and Cluster Computing

Authors: Giuseppe Natale

Abstract

The paper demonstrates how a 2-dimensional recurrence problem can be reduced to a mono-dimensional recurrence problem where the Kogge and Stone algorithm is applicable, with the computation time - excluding the reduction step - becoming proportional to $log_2(2n-1)$ .

Keywords

matrix multiplication

Cite

@article{arxiv.2406.02082,
  title  = {On the Computation of 2-Dimensional Recurrence Equations},
  author = {Giuseppe Natale},
  journal= {arXiv preprint arXiv:2406.02082},
  year   = {2024}
}

Comments

The reduction step and increase in space complexity might make the application of this method impractical, unless alternative architectures - such as dataflow computing architectures - or parallel data manipulation mechanisms are employed

On the Computation of 2-Dimensional Recurrence Equations

Abstract

Keywords

Cite

Comments

Related papers