@article {Simula.ND.22,
	title = {An Efficient and Deadlock-Free Network Reconfiguration Protocol},
	journal = {IEEE Transactions on Computers},
	volume = {57},
	number = {6},
	year = {2008},
	month = {June},
	pages = {762-779},
	abstract = {Component failures and planned component replacements cause changes in the topology and routing paths supplied by the interconnection network of a parallel processor system over time. Such changes may require the network to be reconfigured such that the existing routing function is replaced by one which enables packets to reach their intended destinations amid the changes. Efficient reconfiguration methods are desired that allow the network to function uninterruptedly over the course of the reconfiguration process while remaining free from deadlocking behavior. In this paper, we propose, evaluate, and prove deadlock freedom of a new network reconfiguration protocol that overlaps various phases of {\textquotedblleft}static{\textquotedblright} reconfiguration processes traditionally used in commercial and research systems to provide performance efficiency on par with that of recently proposed {\textquotedblleft}dynamic{\textquotedblright} reconfiguration processes, but without their complexity. Simulation results show that the proposed Overlapping Static Reconfiguration protocol can reduce reconfiguration time by up to 50\%, reduce packet latency by several orders of magnitude, reduce packet dropping by an order of magnitude, and provide unhalted packet injection as compared to traditional static reconfiguration while allowing network throughput similar to dynamic reconfiguration.},
	author = {Lysne, Olav and Jose Miguel {Montanana} and Flich, Jos{\'e} and Duato, Jose and Timothy Mark {Pinkston} and Skeie, Tor}
}
@article {Lysne.2005.2,
	title = {A Methodology for Developing Deadlock-Free Dynamic Network Reconfiguration Processes},
	journal = {IEEE Transactions on Parallel and Distributed Systems},
	volume = {16},
	number = {5},
	year = {2005},
	month = {May},
	pages = {428-443},
	publisher = {IEEE},
	abstract = {Dynamic network reconfiguration is defined as the process of changing from one routing function to another while the network remains up and running. The main challenge is in avoiding deadlock anomalies while keeping restrictions on packet injection and forwarding minimal. Current approaches either require virtual channels in the network or they work only for a limited set of routing algorithms and/or fault patterns. In this paper, we present a methodology for devising deadlock free and dynamic transitions between old and new routing functions that is consistent with recently proposed theory. The methodology is independent of topology, can be applied to any deadlock-free routing function, and puts no restrictions on the routing function changes that can be supported. Furthermore, it does not require any virtual channels to guarantee deadlock freedom. This research is motivated by current trends toward using increasingly larger Internet and transaction processing servers based on clusters of PCs that have very high availability and dependability requirements, as well as other local, system, and storage area network-based computing systems.},
	isbn = {1045-9219},
	doi = {10.1109/TPDS.2005.59},
	author = {Lysne, Olav and Timothy Mark {Pinkston} and Duato, Jose}
}
@article {Duato.2005.1,
	title = {A Theory for Deadlock-Free Dynamic Network Reconfiguration},
	journal = {IEEE Transactions on Parallel and Distributed Systems},
	volume = {16},
	number = {5},
	year = {2005},
	month = {May},
	pages = {412-427},
	abstract = {This paper develops theoretical support useful for determining deadlock properties of dynamic network reconfiguration techniques and serves as a basis for the development of design methodologies useful for deriving such 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 reconfiguration.},
	author = {Duato, Jose and Lysne, Olav and Pang, Ruoming and Timothy Mark {Pinkston}}
}
@inproceedings {Lysne.2004.1,
	title = {Simple Deadlock-Free Dynamic Network Reconfiguration},
	journal = {High Performance Computing - HiPC 2004: 11th International Conference, Bangalore, India, December 19-22, 2004},
	year = {2004},
	month = {December},
	pages = {504-515},
	publisher = {Springer Verlag},
	type = {1},
	author = {Lysne, Olav and Jose Miguel {Montanana} and Timothy Mark {Pinkston} and Duato, Jose and Skeie, Tor and Flich, Jos{\'e}},
	editor = {Victor Prasanna L {Bouge}}
}
@inproceedings {ND.5.Reinemo.2003.b,
	title = {Admission Control for DiffServ Based Quality of Service in Cut-Through Networks},
	journal = {Proceedings of the 10th International Conference on High Performance Computing (HiPC 2003)},
	year = {2003},
	month = {December 17-20},
	pages = {118-129},
	publisher = {Springer},
	type = {1},
	address = {Heidelberg},
	abstract = {Previous work on Quality of Service in Cut-through networks shows that resource reservation mechanisms are only effective below the saturation point. Admission control in these networks will therefore need to keep network utilization below the saturation point, while still utilising the network resources to the maximum extent possible. In this paper we propose and evaluate three admission control schemes. Two of these use a centralised bandwidth broker, while the third is a distributed measurement based approach. We combine these admission control schemes with a DiffServ based QoS scheme for virtual cut-through networks to achieve class based bandwidth and latency guarantees. Our simulations show that the measurement based approach favoured in the Internet communities performs poorly in cut-through networks. Furthermore it demonstrates that detailed knowledge on link utilization improves performance significantly.},
	author = {Reinemo, Sven-Arne and Frank Olaf {Sem-Jacobsen} and Skeie, Tor and Lysne, Olav},
	editor = {Timothy Mark {Pinkston} and Viktor K. {Prasanna}}
}
