
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
P.F. Corbett, "Rotator Graphs: An Efficient Topology for PointtoPoint Multiprocessor Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 3, no. 5, pp. 622626, September, 1992.  
BibTex  x  
@article{ 10.1109/71.159045, author = {P.F. Corbett}, title = {Rotator Graphs: An Efficient Topology for PointtoPoint Multiprocessor Networks}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {3}, number = {5}, issn = {10459219}, year = {1992}, pages = {622626}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.159045}, 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  Rotator Graphs: An Efficient Topology for PointtoPoint Multiprocessor Networks IS  5 SN  10459219 SP622 EP626 EPD  622626 A1  P.F. Corbett, PY  1992 KW  Index Termstopology; pointtopoint multiprocessor networks; directed permutation graphs; FaberMoore graphs; optimal routing algorithm; rotator graphs; fault tolerant; onestep fault diagnosable; Hamiltonian circuit; directed graphs; multiprocessor interconnection networks VL  3 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] S. B. Akers, D. Harel, and B. Krishnamurthy, "The star graph: An attractive alternative to thencube," inProc. Int. Conf. Parallel Processing, St. Charles, IL, Aug. 1987, pp. 393400.
[2] S. B. Akers and B. Krishnamurthy, "Group graphs as interconnection networks," inProc. 14th Int. Conf. Fault Tolerant Comput., 1984, pp. 422427.
[3] S. B. Akers and B. Krishnamurthy, "A grouptheoretic model for symmetric interconnection networks,"IEEE Trans. Comput., vol. 38, no. 4, pp. 555566, Apr. 1989.
[4] P. F. Corbett, "Network structures and algorithms for large multiprocessors," Ph.D. dissertation, Princeton Univ., Princeton, NJ, 1990.
[5] F. P. Preparata, G. Metze, and R. T. Chien, "On the connection assignment problem of diagnosable systems,"IEEE Trans. Electron. Comput., vol. EC16, no. 6, pp. 848853, Dec. 1967.
[6] V. Faber and J. W. Moore, "Highdegree, lowdiameter interconnection networks with vertex symmetry: The directed case," Available upon request LAUR881051, Los Alamos National Lab., Los Alamos, NM, 1988.
[7] W. H. Gates and C. H. Papadimitriou, "Bounds for sorting by prefix reversal,"Discrete Mathemat., vol. 27, no. 1, pp. 4757, 1979.
[8] J. D. Russel and C. R. Kime, "System fault diagnosis: Closure and diagnosability with repairs,"IEEE Trans. Comput., vol. C24, no. 11, pp. 10781089, Nov. 1975.
[9] J. D. Russel and C. R. Kime, "System fault diagnosis: Masking, exposure and diagnosability without repair,"IEEE Trans. Comput., vol. C24, no. 12, pp. 11551161, Dec. 1975.