Skip to main content
Log in

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. 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.

  2. 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.

  3. 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.

  4. F. Annexstein, M. Baumslag and A.L. Rosenberg, Group action graphs and parallel architectures, SIAM Journal on Computing 19 (1990) 544-569.

    Article  Google Scholar 

  5. 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.

    Article  Google Scholar 

  6. 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.

    Google Scholar 

Download references

Authors

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1019150529592

Keywords

Navigation