@Article{latifi:network,
  author = {S. Latifi and M. Moraes de Azevedo and N. Bagherzadeh},
  title = {A star-based {I/O}-bounded network for massively parallel systems},
  journal = {IEE Proceedings--- Computers and Digital Techniques},
  year = {1995},
  month = {January},
  volume = {142},
  number = {1},
  pages = {5--14},
  keywords = {parallel I/O, parallel computer architecture, pario-bib},
  abstract = {The paper describes a new interconnection network for massively
  parallel systems, referred to as star-connected cycles (SCC). The SCC graph
  presents an I/O-bounded structure that results in several advantages over
  variable degree graphs like the star and the hypercube. The description of
  the SCC graph includes issues such as labelling of nodes, degree, diameter
  and symmetry. The paper also presents an optimal routeing algorithm for the
  SCC and efficient broadcasting algorithms with O(n) running time, with n
  being the dimensionality of the graph. A comparison with the cube-connected
  cycles (CCC) and other interconnection networks is included, indicating that,
  for even n, an n-SCC and a CCC of similar sizes have about the same diameter.
  In addition, it is shown that one-port broadcasting in an n-SCC graph can be
  accomplished with a running time better than or equal to that required by an
  n-star containing (n-1) times fewer nodes.}
}