
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Carmen Martínez, Ramón Beivide, Esteban Stafford, Miquel Moretó, Ernst M. Gabidulin, "Modeling Toroidal Networks with the Gaussian Integers," IEEE Transactions on Computers, vol. 57, no. 8, pp. 10461056, August, 2008.  
BibTex  x  
@article{ 10.1109/TC.2008.57, author = {Carmen Martínez and Ramón Beivide and Esteban Stafford and Miquel Moretó and Ernst M. Gabidulin}, title = {Modeling Toroidal Networks with the Gaussian Integers}, journal ={IEEE Transactions on Computers}, volume = {57}, number = {8}, issn = {00189340}, year = {2008}, pages = {10461056}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2008.57}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Modeling Toroidal Networks with the Gaussian Integers IS  8 SN  00189340 SP1046 EP1056 EPD  10461056 A1  Carmen Martínez, A1  Ramón Beivide, A1  Esteban Stafford, A1  Miquel Moretó, A1  Ernst M. Gabidulin, PY  2008 KW  Packetswitching networks KW  Network topology KW  Graph theory KW  Graphs and networks KW  Packet routing VL  57 JA  IEEE Transactions on Computers ER   
[1] N.R. Adiga et al., “An Overview of the BlueGene/L Supercomputer,” Supercomputing 2002 Technical Papers, http://sc2002.org/paperpdfspap.pap207.pdf , Nov. 2002.
[2] A. Agarwal, “Limits on Interconnection Network Performance,” IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 4, pp. 398412, Oct. 1991.
[3] R. Beivide, E. Herrada, J.L. Balcázar, and A. Arruabarrena, “Optimal Distance Networks of Low Degree for Parallel Computers,” IEEE Trans. Computers, vol. 40, no. 10, pp. 11091124, Oct. 1991.
[4] R. Beivide, E. Herrada, J.L. Balcazar, and J. Labarta, “Optimized MeshConnected Networks for SIMD and MIMD Architectures,” Proc. 14th Ann. Int'l Symp. Computer Architecture, pp. 163169, 1987.
[5] E.R. Berlekamp, Algebraic Coding Theory. Aegean Park Press, 1984.
[6] B. Bose, B. Broeg, Y. Known, and Y. Ashir, “Lee Distance and Topological Properties of $k\hbox{}{\rm Ary}$ $n\hbox{}{\rm Cubes}$ ,” IEEE Trans. Computers, vol. 44, no. 8, pp. 10211030, Aug. 1995.
[7] J.Y. Cai, G. Havas, B. Mans, A. Nerurkar, J.P. Seifert, and I. Shparlinski, “On Routing in Circulant Graphs,” Proc. Fifth Ann. Int'l Computing and Combinatorics Conf., 1999.
[8] J. Camara, M. Moreto, E. Vallejo, R. Bievide, J. MiguelAlonso, C. Martinez, and J. Navaridas, “MixedRadix Twisted Torus Interconnection Networks,” Proc. 21st IEEE Int'l Parallel and Distributed Processing Symp., Mar. 2007.
[9] Cray X1E Datasheet, http://www.cray.com/downloadsX1E_ datasheet.pdf , 2008.
[10] Z. Cvetanovic, “Performance Analysis of the Alpha 21364Based HP GS1280 Multiprocessor,” Proc. 30th Ann. Int'l Symp. Computer Architecture, pp. 218228, 2003.
[11] M.A. Fiol, J.L. Yebra, I. Alegre, and M. Valero, “A Discrete Optimization Problem in Local Networks and Data Alignment,” IEEE Trans. Computers, vol. 36, no. 6, pp. 702713, June 1987.
[12] E. Gabidulin, C. Martínez, R. Beivide, and J. Gutierrez, “On the Weight Distribution of Gaussian Graphs with an Application to Coding Theory,” Proc. Eighth Int'l Symp. Comm. Theory and Applications, pp. 1722, July 2005.
[13] D. Gómez, J. Gutierrez, A. Ibeas, C. Martínez, and R. Beivide, “On Finding a Shortest Path in Circulant Graphs with Two Jumps,” Lecture Notes in Computer Science, vol. 3595, pp. 777786, SpringerVerlag, 2005.
[14] K. Huber, “Codes over Tori,” IEEE Trans. Information Theory, vol. 43, no. 2, pp. 740744, Mar. 1997.
[15] J.H. Jordan and C.J. Potratz, “Complete Residue Systems in the Gaussian Integers,” Math. Magazine, pp. 112, 1965.
[16] C. Martínez, E. Vallejo, R. Beivide, C. Izu, and M. Moretó, “Dense Gaussian Networks: Suitable Topologies for OnChip Multiprocessors,” Int'l J. Parallel Programming, vol. 34, no. 3, June 2006.
[17] C. Martínez, M. Moretó, R. Beivide, and E. Gabidulin, “A Generalization of Perfect Lee Codes over Gaussian Integers,” Proc. IEEE Int'l Symp. Information Theory, July 2006.
[18] C. Martínez, R. Beivide, and E. Gabidulin, “Perfect Codes for Metrics Induced by Circulant Graphs,” IEEE Trans. Information Theory, vol. 53, no. 9, pp. 30423052, Sept. 2007.
[19] M.M.K. Martin, M.D. Hill, and D.A. Wood, “Token Coherence: Decoupling Performance and Correctness,” Proc. 30th Ann. Int'l Symp. Computer Architecture, pp. 182193, 2003.
[20] J. MellorCrummey and M. Scott, “Algorithms for Scalable Synchronization on SharedMemory Multiprocessors,” ACM Trans. Computer Systems, vol. 9, no. 1, pp. 2165, Feb. 1991.
[21] B. Robic, “Optimal Routing in 2Jump Circulant Networks,” TR397, Univ. of Cambridge Computer Laboratory, 1996.
[22] S.L. Scott and G.M. Thorson, “The Cray T3E Network: Adaptive Routing in a High Performance 3D Torus,” Proc. IEEE Hot Interconnects IV Symp., Aug. 1996.
[23] C.H. Sequin, “Doubly Twisted Torus Networks for VLSI Processor Arrays,” Proc. Eighth Ann. Int'l Symp. Computer Architecture, pp.471480, 1981.
[24] C.K. Wong and D. Coppersmith, “A Combinatorial Problem Related to Multimodule Memory Organizations,” J. ACM, vol. 21, no. 3, pp. 392402, 1974.
[25] Y. Yang, A. Funashi, A. Jouraku, H. Nishi, H. Amano, and T. Sueyoshi, “Recursive Diagonal Torus: An Interconnection Network for Massively Parallel Computers,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 7, July 2001.