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.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
S.B. Akers, D. Harel and B. Krishnamurthy, The star graph: An attractive alternative to the n-cube, in: Proc. of the International Conf. on Parallel Processing (1987) pp. 393-400.
S.B. Akers and B. Krishnamurthy, A group-theoretic model for symmetric interconnection networks, in: Proc. of the International Conf. on Parallel Processing (1986) pp. 216-223.
F. Annexstein and M. Baumslag, A unified approach to off-line permutation routing on parallel networks, in: ACM Symposium on Parallel Algorithms and Architectures (1990) pp. 398-406.
F. Annexstein, M. Baumslag and A.L. Rosenberg, Group action graphs and parallel architectures, SIAM Journal on Computing 19 (1990) 544-569.
K. Day and A. Tripathi, A comparative study of topological properties of hypercubes and star graphs, IEEE Transactions on Parallel and Distributed Systems 5(1) (1994) 31-38.
A. Menn and A.K. Somani, An efficient sorting algorithm for the star graph interconnection network, in: Proc. of the International Conf. on Parallel Processing, Vol. III (1990) pp. 1-8.
Rights and permissions
About this article
Cite this article
Bagherzadeh, N., Dowd, M. & Latifi, S. Faster column operations in star networks. Telecommunication Systems 10, 33–44 (1998). https://doi.org/10.1023/A:1019150529592
Issue Date:
DOI: https://doi.org/10.1023/A:1019150529592