Faster Column Operations in Star networks

Authors

Nader Bagherzadeh, University of California, IrvineFollow
Martin Dowd, University of California, IrvineFollow
Shahram Latifi, University of Nevada, Las VegasFollow

Document Type

Article

Publication Date

10-1-1998

Publication Title

Telecommunication Systems

Volume

10

First page number:

33

Last page number:

44

Abstract

Using the methods used to obtain O(log N) routings of permutations, basic algorithms on the star graph which are faster than those previously reported in the literature are obtained. In particular, an O(log2 N) sort and an O(log N) Fourier transform are presented. A simulation of meshes is also given.

Keywords

Cayley graphs; Computer algorithms; Hypercube networks (Computer networks); Parallel computers

Disciplines

Applied Mathematics | Computer and Systems Architecture | Digital Circuits | Non-linear Dynamics

Language

English

Permissions

Use Find in Your Library, contact the author, or interlibrary loan to garner a copy of the item. Publisher policy does not allow archiving the final published version. If a post-print (author's peer-reviewed manuscript) is allowed and available, or publisher policy changes, the item will be deposited.

Repository Citation

Bagherzadeh, N., Dowd, M., Latifi, S. (1998). Faster Column Operations in Star networks. Telecommunication Systems, 10 33-44.