Publication 2005 Issue No. 5 - May Abstract - Part I: A Theory for Deadlock-Free Dynamic Network Reconfiguration
 This Article Share Bibliographic References Add to: Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb Search Similar Articles Articles by Jos? Duato Articles by Olav Lysne Articles by Ruoming Pang Articles by Timothy M. Pinkston
Part I: A Theory for Deadlock-Free Dynamic Network Reconfiguration
May 2005 (vol. 16 no. 5)
pp. 412-427
 ASCII Text x Jos? Duato, Olav Lysne, Ruoming Pang, Timothy M. Pinkston, "Part I: A Theory for Deadlock-Free Dynamic Network Reconfiguration," IEEE Transactions on Parallel and Distributed Systems, vol. 16, no. 5, pp. 412-427, May, 2005.
 BibTex x @article{ 10.1109/TPDS.2005.58,author = {Jos? Duato and Olav Lysne and Ruoming Pang and Timothy M. Pinkston},title = {Part I: A Theory for Deadlock-Free Dynamic Network Reconfiguration},journal ={IEEE Transactions on Parallel and Distributed Systems},volume = {16},number = {5},issn = {1045-9219},year = {2005},pages = {412-427},doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2005.58},publisher = {IEEE Computer Society},address = {Los Alamitos, CA, USA},}
 RefWorks Procite/RefMan/Endnote x TY - JOURJO - IEEE Transactions on Parallel and Distributed SystemsTI - Part I: A Theory for Deadlock-Free Dynamic Network ReconfigurationIS - 5SN - 1045-9219SP412EP427EPD - 412-427A1 - Jos? Duato, A1 - Olav Lysne, A1 - Ruoming Pang, A1 - Timothy M. Pinkston, PY - 2005KW - Interconnection networkKW - dynamic reconfigurationKW - deadlock-freedom theoryKW - system reliability and availability.VL - 16JA - IEEE Transactions on Parallel and Distributed SystemsER -

Abstract—This paper develops theoretical support useful for determining deadlock properties of dynamic network reconfiguration techniques and also serves as a basis for the development of design methodologies useful for deriving deadlock-free reconfiguration techniques. It is applicable to interconnection networks typically used in multiprocessor servers, network-based computing clusters, and distributed storage systems, and also has potential application to system-on-chip networks. This theory builds on basic principles established by previous theories while pioneering new concepts fundamental to the case of dynamic network reconfiguration.

[1] J. Duato, S. Yalamanchili, and L. Ni, Interconnection Networks: An Engineering Approach. Morgan Kauffman, 2003.
[2] F.J. Quiles, J.L. Sanchez, R. Casado, A. Bermudez, and J. Duato, “A Protocol for Deadlock-Free Dynamic Reconfiguration in High-Speed Local Area Networks,” IEEE Trans. Parallel and Distributed Systems, special issue on dependable network computing, vol. 12, no. 2, pp. 115-132, Feb. 2001.
[3] N. Natchev, D. Avresky, and V. Shurbanov, “Dynamic Reconfiguration in High-Speed Computer Clusters,” Proc. Int'l Conf. Cluster Computing, pp. 380-387, Oct. 2001.
[4] T.M. Pinkston, R. Pang, and J. Duato, “Deadlock-Free Dynamic Reconfiguration Schemes for Increased Network Dependability,” IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 8, pp. 780-794, Aug. 2003.
[5] O. Lysne and J. Duato, “Fast Dynamic Reconfiguration in Irregular Networks,” Proc. Int'l Conf. Parallel Processing, pp. 449-458, Aug. 2000.
[6] InfiniBand$^{\rm TM}$ Architecture Specification Volume 1. InfiniBand Trade Assoc., Oct. 2000.
[7] J. Duato, “A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 12, pp. 1320-1331, Dec. 1993.
[8] J. Duato and T.M. Pinkston, “A General Theory for Deadlock-Free Adaptive Routing Using a Mixed Set of Resources,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 12, Dec. 2001.
[9] J. Duato, “A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 10, pp. 1055-1067, Oct. 1995.
[10] J. Duato, “A Necessary and Sufficient Condition for Deadlock-Free Routing in Cut-Through and Store-and-Forward Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 8, pp. 841-854, Aug. 1996.
[11] Y. Tamir and G. Frazier, “Dynamically-Allocated Multi-Queue Buffers for VLSI Communication Switches,” IEEE Trans. Computers, vol. 41, no. 6, pp. 725-734, June 1992.
[12] S. Warnakulasuriya and T.M. Pinkston, “A Formal Model of Message Blocking and Deadlock Resolution in Interconnection Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 11, no. 2, pp. 212-229, Mar. 2000.
[13] O. Lysne, T.M. Pinkston, and J. Duato, “Part II: A Methodology for Developing Deadlock-Free Dynamic Network Reconfiguration Processes,” IEEE Trans. Parallel and Distributed Processing, vol. 16, no. 5, pp. 428-443, 2005.
[14] M.D. Schroeder et al., “Autonet: A High-Speed, Self-Configuring Local Area Network Using Point-to-Point Links,” IEEE J. Selected Areas in Comm., vol. 9, no. 8, pp. 1318-1335, Oct. 1991.
[15] A.M. Turing, “On Computable Numbers, with an Application to the Entscheidungsproblem,” Proc. London Math. Soc., vol. 2, no. 42, pp. 230-265, 1936.
[16] C.A.R. Hoare, “An Axiomatic Basis for Computer Programming (Reprint of Paper from 1969),” Comm. of the ACM, vol. 26, no. 1, pp. 53-56, Jan. 1983.
[17] D. Jacobs and D. Gries, “General Correctness: A Unification of Partial and Total Correctness,” Acta Informatica, vol. 22, no. 1, pp. 67-83, Apr. 1985.

Index Terms:
Interconnection network, dynamic reconfiguration, deadlock-freedom theory, system reliability and availability.
Citation:
Jos? Duato, Olav Lysne, Ruoming Pang, Timothy M. Pinkston, "Part I: A Theory for Deadlock-Free Dynamic Network Reconfiguration," IEEE Transactions on Parallel and Distributed Systems, vol. 16, no. 5, pp. 412-427, May 2005, doi:10.1109/TPDS.2005.58