In this paper the mapping of algorithms into multidimentional systolic structures by setting bounds on the computation time complexity, considering the dimension of these parallel computing structures, is discussed. A decomposition method based on the properties of associativity and commutativity of linear operators used, thus mapping to a higher dimensional structure than that by a conventional approach, without increasing the number of processing elements is proposed. This makes 3D integration reasonably popular. An improvement of latency which is crucial for real time applications is achieved.