Skip to content

Find the smallest number of switches necessary to build topologies of a given number of hosts and bisection bandwidth for the EGFT, HyperX, and Jellyfish topologies.

Notifications You must be signed in to change notification settings

bestephe/topo_opt

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 

Repository files navigation

topo_opt

Find the smallest number of switches necessary to build topologies of a given number of hosts and bisection bandwidth for the EGFT, HyperX, and Jellyfish topologies.

If this program is used to generate topologies referenced in publication, the authors ask that the publication cites ``PAST: Scalable Ethernet for data centers'', CoNext '12. This program was originally used to build the topologies used the PAST paper.

Copyright

Copyright (c) 2013, Rice University and Brent Stephens ([email protected]) All rights reserved.

Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:

  1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
  2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.

THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

About

Find the smallest number of switches necessary to build topologies of a given number of hosts and bisection bandwidth for the EGFT, HyperX, and Jellyfish topologies.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages