% IMPORTANT: The following is UTF-8 encoded.  This means that in the presence
% of non-ASCII characters, it will not work with BibTeX 0.99 or older.
% Instead, you should use an up-to-date BibTeX implementation like “bibtex8” or
% “biber”.

@ARTICLE{Lippert:860343,
      author       = {Lippert, T. and Seyfried, A. and Bode, A. and Schilling,
                      K.},
      title        = {{H}yper-systolic parallel computing},
      journal      = {IEEE transactions on parallel and distributed systems},
      volume       = {9},
      number       = {2},
      issn         = {1045-9219},
      address      = {New York, NY},
      publisher    = {IEEE},
      reportid     = {FZJ-2019-01118},
      pages        = {97 - 108},
      year         = {1998},
      abstract     = {We introduce a new class of parallel algorithms for the
                      exact computation of systems with pairwise mutual
                      interactions of n elements, so called n/sup 2/-problems.
                      Hitherto, practical conventional parallelization strategies
                      could achieve a complexity of O(np) with respect to the
                      inter-processor communication, p being the number of
                      processors. Our new approach can reduce the inter-processor
                      communication complexity to a number O(np). In the framework
                      of Additive Number Theory, the determination of the optimal
                      communication pattern can be formulated as h-range
                      minimization problem that can be solved numerically. Based
                      on a complexity model, the scaling behavior of the new
                      algorithm is numerically tested on the connection machine
                      CM5. As a real life example, we have implemented a fast code
                      for globular cluster n-body simulations, a generic n/sup
                      2/-problem, on the CRAY T3D, with striking success. Our
                      parallel method promises to be useful in various scientific
                      and engineering fields like polymer chain computations,
                      protein folding, signal processing, and, in particular, for
                      parallel level-3 BLAS.},
      ddc          = {004},
      typ          = {PUB:(DE-HGF)16},
      doi          = {10.1109/71.663861},
      url          = {https://juser.fz-juelich.de/record/860343},
}