Hyper-Systolic Parallel Computing

Simple item page
dc.creatorLippert, Th.
dc.creatorSeyfried, A.
dc.creatorBode, A.
dc.creatorSchilling, K.
dc.date1995-07-25
dc.date.accessioned2026-07-07T09:13:53Z
dc.date.available2026-07-07T09:13:53Z
dc.descriptionA new class of parallel algorithms is introduced that can achieve a complexity of O(n^3/2) with respect to the interprocessor communication, in the exact computation of systems with pairwise mutual interactions of all elements. Hitherto, conventional methods exhibit a communicational complexity of O(n^2). The amount of computation operations is not altered for the new algorithm which can be formulated as a kind of h-range problem, known from the mathematical field of Additive Number Theory. We will demonstrate the reduction in communicational expense by comparing the standard-systolic algorithm and the new algorithm on the connection machine CM5 and the CRAY T3D. The parallel method can be useful in various scientific and engineering fields like exact n-body dynamics with long range forces, polymer chains, protein folding or signal processing.
dc.description32 pages, selfextracting uuencoded Z-compressed tex-file and ps-figures
dc.identifierhttps://arxiv.org/abs/hep-lat/9507021
dc.identifierhttp://arxiv.org/abs/hep-lat/9507021
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/152483
dc.subjectHigh Energy Physics - Lattice
dc.subjectAstrophysics
dc.subjectChemical Physics
dc.subjectCellular Automata and Lattice Gases
dc.subjectCondensed Matter
dc.titleHyper-Systolic Parallel Computing
dc.typetext

Files

Collections

arXiv