Evaluating linear recursive filters on clusters of workstations
Abstract
The aim of this paper is to show that the recently developed high performance algorithm for solving linear recurrence systems with constant coefficients together with the new BLAS-based algorithm for narrow-banded triangular Toeplitz matrix-vector multiplication allow to evaluate linear recursive filters efficiently, even on clusters of workstations. The results of experiments performed on a cluster of twelve Linux workstations are also presented. The performance of the algorithm is comparable with the performance of two processors of Cray SV-1 for such kind of recursive problems.
Full Text:
PDFDOI: http://dx.doi.org/10.17951/ai.2004.2.1.263-268
Date of publication: 2015-01-04 00:00:00
Date of submission: 2016-04-27 10:11:17
Statistics
Total abstract view - 393
Downloads (from 2020-06-17) - PDF - 0
Indicators
Refbacks
- There are currently no refbacks.
Copyright (c) 2015 Annales UMCS Sectio AI Informatica
This work is licensed under a Creative Commons Attribution 4.0 International License.