Flexible parallelization of fast wavelet transforms

Flexible parallelization of fast wavelet transforms
复制标题

快速小波变换的灵活并行化

DOI:
10.1080/10637190310001633637
复制
发表时间:
2003
期刊:
Parallel Algorithms and Applications
影响因子:
--
通讯作者:
N. Ford
N. Ford
中科院分区:
--
文献类型:
--
作者:
J. Ford;Ke Chen;N. Ford

文献摘要

被引文献

相似文献

本文提出了一种新的并行算法,用于任意大小矩阵的快速小波变换(FWT),使用任何给定数量的并行处理器。实现最佳负载平衡的主要思想是通过复杂性分析和最小化触发器。这使得FWT的并行实现的可行性和高效的分布式存储器的机器上,只有少量的处理器和局域网上。通过数值实验对新算法进行了验证。
In this paper, we present a new parallel algorithm for fast wavelet transforms (FWT) of a matrix of arbitrary size using any given number of parallel processors. The main idea in achieving the optimal load balancing is through a complexity analysis and flops minimization. This makes parallel implementation of FWT feasible and efficient on distributed memory machines with only a small number of processors and on local area networks. The new algorithm is tested by numerical experiments.