@Article{lin:optimizing,
  author = {Yih-Fang Lin and Chien-Min Wang and Jan-Jan Wu},
  title = {Optimizing I/O server placement for parallel I/O on switch-based
  irregular networks},
  journal = {Lecture Notes in Computer Science},
  booktitle = {2nd International Symposium on Parallel and Distributed
  Processing and Applications; December 13-15, 2004; Hong Kong, PEOPLES R
  CHINA},
  editor = {Cao, J; Yang, LT; Guo, M; Lau, F},
  year = {2004},
  month = {November},
  volume = {3358},
  pages = {997--1006},
  institution = {Acad Sinica, Inst Sci Informat, Taipei 115, Taiwan; Natl
  Taiwan Univ, Dept Comp Sci \& Informat Engn, Taipei 10764, Taiwan},
  publisher = {SPRINGER-VERLAG BERLIN},
  copyright = {(c)2005 The Thomson Corporation},
  URL =
  {http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=3358&spage=997},
  keywords = {I/O server placement, network topologies, switch-based clusters,
  pario-bib},
  abstract = {In this paper, we study I/O server placement for optimizing
  parallel I/O performance on switch-based clusters, which typically adopt
  irregular network topologies to allow construction of scalable systems with
  incremental expansion capability. Finding optimal solution to this problem is
  computationally intractable. We quantified the number of messages travelling
  through each network link by a workload function, and developed three
  heuristic algorithms to find good solutions based on the values of the
  workload function. Our simulation results demonstrate performance advantage
  of our algorithms over a number of algorithms commonly used in existing
  parallel systems. In particular, the load-balance-based algorithm is superior
  to the other algorithms in most cases, with improvement ratio of 10% to 95  in terms of parallel I/O throughput.}
}