A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
An Efficient Shortest-Path Routing Algorithm in the Data Centre Network DPillar
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
DPillar has recently been proposed as a server-centric data centre network and is combinatorially related to the well-known wrapped butterfly network. ...
We use this symmetry property to establish a single-path routing algorithm for DPillar that computes a shortest path and has time complexity O(k log(n)), where k parameterizes the dimension of DPillar ...
Acknowledgement This work has been funded by the Engineering and Physical Sciences Research Council (EPSRC) through grants EP/K015680/1 and EP/K015699/1. ...
doi:10.1007/978-3-319-26626-8_16
fatcat:5gihumpisjgxbfcsnj4bh32oyy
An Optimal Single-Path Routing Algorithm in the Datacenter Network DPillar
2017
IEEE Transactions on Parallel and Distributed Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We use this symmetry property to establish a single-path routing algorithm for DPillar that computes a shortest path and has time complexity O(k), where k parameterizes the dimension of DPillar (we refer ...
Moreover, our algorithm is trivial to implement, being essentially a conditional clause of numeric tests, and improves significantly upon a routing algorithm earlier employed for DPillar. ...
We are also grateful for the insightful comments of the reviewers which helped to significantly improve this paper. ...
doi:10.1109/tpds.2016.2591011
fatcat:ljkrjinwizfjjk6f6t5ztlhhim
INRFlow: An interconnection networks research flow-level simulation framework
2019
Journal of Parallel and Distributed Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
. • It is a mature, flexible and efficient tool for simulating large scale systems. • It models network, storage, scheduler and applications. • It has been used extensively for our research in the past ...
We will describe the main aspects of the simulator, including system models, traffic models and the large variety of topologies and routings implemented so far. ...
For full disclosure statements refer to https://doi.org/10.1016/j.jpdc.2019.03.013. ...
doi:10.1016/j.jpdc.2019.03.013
fatcat:m2pvuszu6ja2zjjgcndnhsvjai
Proactive dynamic virtual-machine consolidation for energy conservation in cloud data centres
2018
Journal of Cloud Computing: Advances, Systems and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Data center power consumption is among the largest commodity expenditures for many organizations. ...
This paper provides an in-depth survey of the most recent techniques and algorithms used in proactive dynamic VM consolidation focused on energy consumption. ...
Acknowledgements Authors are grateful to the reviewers of this manuscript for their expert advice. Authors are thankful to Department of Computer Science at Ryerson University, for support. ...
doi:10.1186/s13677-018-0111-x
fatcat:2rqfyhzu4nhxvd27dxs56qrjha