@inproceedings {Simula.ND.54,
	title = {Efficient and Deadlock-Free Reconfiguration for Source Routed Networks},
	journal = {Communication Architecture for Clusters (CAC)},
	year = {2009},
	publisher = {IEEE Computer Society},
	type = {Workshop},
	abstract = {Overlapping Reconfiguration is currently the most efficient method to reconfigure an interconnection network, but is only valid for systems that apply distributed routing. This paper proposes a solution which enables utilization of Overlapping Reconfiguration in a source routed environment. We demonstrate how a synchronized injection of tokens has a significant impact on the performance of the method. Furthermore, we propose and evaluate an optimization of the original algorithm that reduces (and in some cases even eliminates) performance issues caused by the token forwarding regime, such as increased latency and decreased throughput.},
	isbn = {978-1-4244-3750-4},
	author = {{\r A}shild Gr{\o}nstad {Solheim} and Lysne, Olav and Berm{\'u}dez, Aurelio and Casado, Rafael and S{\o}dring, Thomas and Skeie, Tor and Robles-Gomez, Antonio},
	editor = {Yang, Yuanyuan}
}
@inproceedings {Simula.ND.293,
	title = {A Framework for Routing and Resource Allocation in Network Virtualization},
	journal = {International Conference on High Performance Computing (HiPC{\textquoteright}09)},
	year = {2009},
	pages = {129-139},
	publisher = {IEEE},
	type = {Conference},
	abstract = {Computer architectures for high performance computing have traditionally been based on an assumption of one parallel application running alone on one machine. The current trend is, however, that huge computer installations offer compute power to a set of users or customers, each demanding only a subset of the available compute resources. This places new requirements on the architecture, in that it must support dynamic partitioning of the resources into several virtual servers as demand changes. We introduce a novel framework which supports flexible formation of such virtual servers while preventing interference between the communication of different virtual servers. This paper investigates the impacts of a shared interconnection network on applications running on virtual compute servers. We show that the interconnect performance supplied to each job is highly unpredictable, and that a job can experience a performance degradation of 97\% when its traffic interferes with the traffic of concurrent jobs. With a minor reduction in the utilization of each processing node, this can be considerably improved through a combination of routing-containment in the interconnection network and a carefully designed resource allocation strategy.},
	isbn = {978-1-4244-4921-7},
	author = {{\r A}shild Gr{\o}nstad {Solheim} and Lysne, Olav and Skeie, Tor and S{\o}dring, Thomas and Reinemo, Sven-Arne},
	editor = {Yang, Yuanyuan and Parashar, M. and Muralidhar, R. and V. K. {Prasanna}}
}
