|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Dilip K. Saikia, R. Badrinath, Ranjan K. Sen, "Embedding Torus on the Star Graph," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 7, pp. 650-663, July, 1998. | |||
| BibTex | x | ||
| @article{ 10.1109/71.707542, author = {Dilip K. Saikia and R. Badrinath and Ranjan K. Sen}, title = {Embedding Torus on the Star Graph}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {9}, number = {7}, issn = {1045-9219}, year = {1998}, pages = {650-663}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.707542}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Parallel and Distributed Systems TI - Embedding Torus on the Star Graph IS - 7 SN - 1045-9219 SP650 EP663 EPD - 650-663 A1 - Dilip K. Saikia, A1 - R. Badrinath, A1 - Ranjan K. Sen, PY - 1998 KW - Graph embedding KW - star graph KW - torus embedding KW - cycle construction KW - interconnection network KW - parallel processing. VL - 9 JA - IEEE Transactions on Parallel and Distributed Systems ER - | |||
Abstract—In this paper, we present a scheme for efficient embedding of torus of any dimension on a star graph. The dilation of the embedding is four. The expansion is small. Congestion depends upon the routing scheme used. With one routing scheme, the congestion is bound by a small constant
[1] S.B. Akers, K. Harel, and B. Krishnamurthy, "The Star Graph: An Attractive Alternative to the n-Cube," Proc. Int'l Conf. Parallel Processing, pp. 333-340, 1987.
[2] S.B. Akers and B. Krishnamurthy, “A Group-Theoretic Model for Symmetric Interconnection Networks,” IEEE Trans. Computers, vol. 38, no. 4, pp. 555-566, Apr. 1989.
[3] A. Bouabdallah, M.C. Heydemann, J. Opatrny, and D. Sotteau, "Embedding Complete Binary Trees into Star Networks," Proc. Int'l Symp. Mathematical Foundations of Computer Science, pp. 266-275, 1994.
[4] M.C. Heydemann, J. Opatrny, and D. Sotteau, "Embeddings of Complete Binary Trees into Star Graphs with Congestion-1," Proc. 28th Hawaii Int'l Conf. Systems Sciences, vol. 2, pp. 546-554, 1995.
[5] J. Jwo, S. Lakshmivarahan, and S.K. Dhall, "Embedding of Cycles and Grids in Star Graphs," J. Circuits, Systems, and Computers, vol. 1, no. 1, pp. 43-74, 1991.
[6] Z. Miller, D. Pritikin, I.H. Sudborough, "Near embeddings of hypercubes into Cayley graphs on the symmetric group," IEEE Trans. Computers, vol. 43, no. 1, pp. 13-22, Jan. 1994.
[7] M. Nigam, S. Sahni, and B. Krishnamurthy, "Embedding Hamiltonians and Hypercubes in Star Graphs," Proc. Int'l Conf. Parallel Processing, pp. 340-343, Aug. 1990.
[8] K. Qiu, H. Meijer, and S.G. Akl, "On the Cycle Structure of Star Graphs," Proc. 24th Southwestern Conf. Combinatorics, Graph Theory, and Computing,Boca Raton, Fla., 1993.
[9] S. Ranka, J.C. Wang, and N. Yeh, "Embedding Meshes on the Star Graph," J. Parallel and Distributed Computing, vol. 19, no. 2, pp. 131-135, Oct. 1993.
[10] D.K. Saikia, R. Badrinath, and R.K. Sen, "Congestion Free Dilation 2 Embedding of Full Binary Trees on Star Graphs," Proc. Int'l Conf. High Performance Computing,Thiruvanandapuram, India, Dec. 1996.
[11] D.K. Saikia and R.K. Sen, "Data Communication on the Star Interconnection Network," Proc. Int'l Workshop Parallel Processing,Bangalore, India, Dec. 1994.
[12] D. Saika and R.K. Sen, "Two Ranking Schemes for Efficient Computation on the Star Interconnection Network," IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 4, pp. 321-327, Apr. 1996.