Fast Digit‐Index Permutations

We introduce a tensor sum which is useful for the design and analysis of digit‐index permutations (DIPs) algorithms. Using this operation we obtain a new high‐performance algorithm for the family of DIPs. We discuss an implementation in the applicative language Sisal and show how different choices o...

Full description

Saved in:
Bibliographic Details
Published in:Scientific programming 1996-01, Vol.5 (2), p.137-146
Main Authors: Bollman, Dorothy, Seguel, Jaime, Feo, John
Format: Article
Language:English
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We introduce a tensor sum which is useful for the design and analysis of digit‐index permutations (DIPs) algorithms. Using this operation we obtain a new high‐performance algorithm for the family of DIPs. We discuss an implementation in the applicative language Sisal and show how different choices of parameters yield different DIPs. The efficiency of the special case of digit reversal is illustrated with performance results on a Cray C‐90.
ISSN:1058-9244
1875-919X
DOI:10.1155/1996/836910