@InProceedings{durand:coloring,
  author = {Dannie Durand and Ravi Jain and David Tseytlin},
  title = {Applying Randomized Edge Coloring Algorithms to Distributed
  Communication: An Experimental Study},
  booktitle = {Proceedings of the Seventh Symposium on Parallel Algorithms and
  Architectures},
  year = {1995},
  pages = {264--274},
  keywords = {parallel I/O, scheduling, pario-bib},
  comment = {They note that the set of data transfers in a parallel I/O
  architecture can be expressed as a graph coloring problem. Realistically, a
  centralized solution is not possible because the information is inherently
  distributed. So they develop some distributed algorithms and experimentally
  compare them to the centralized algorithm. They get within 5\% and do better
  than earlier algorithms.}
}