@Article{catania:mass,
  author = {V. Catania and A. Puliafito and L. Vita},
  title = {An {I/O} subsystem supporting mass storage functions in parallel
  systems},
  journal = {Computer standards \& interfaces},
  year = {1996},
  volume = {18},
  number = {2},
  pages = {117},
  keyword = {verify month and pages and authors, parallel I/O, pario-bib}
}

@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 = {42},
  number = {1},
  pages = {5--14},
  keyword = {verify authors, 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.}
}

@Article{miller:pass,
  author = {L.~L. Miller and S.~R. Inglett and A.~R. Hurson},
  title = {{PASS}--- A Multiuser Parallel File System Based on Microcomputers},
  journal = {Journal of systems and software},
  year = {1992},
  month = {September},
  volume = {19},
  number = {1},
  pages = {75--83},
  keyword = {parallel I/O, parallel file system, multiprocessor file system,
  pario-bib},
  abstract = {Data intensive computer applications suffer from inadequate use
  of parallelism for processing data stored on secondary storage devices.
  Devices such as database machines are useful in some applications, but many
  applications are too small or specialized to use such technology. To bridge
  this gap, the authors introduce the parallel secondary storage (PASS) system.
  PASS is based on a network of microcomputers. The individual microcomputers
  are assigned to a unit of secondary storage and the operations of the
  microcomputers are initiated and monitored by a control processor. The file
  system is capable of acting as either an SIMD or an MIMD machine.
  Communication between the individual microcomputers and the control processor
  is described. The integration of the multiple microcomputers into the
  primitive operations on a file is examined. Finally, the strategies employed
  to enhance performance in the multiprogramming environment are discussed.}
}

@Article{perez:evaluate,
  author = {F. Perez and J. Carretero and L. Alonso},
  title = {Evaluating {ParFiSys}: A high-performance parallel and distributed
  file system},
  journal = {Journal of Systems Architecture},
  year = {1997},
  month = {May},
  volume = {43},
  number = {8},
  pages = {533--542},
  keyword = {verify authors, parallel I/O, multiprocessor file system,
  pario-bib},
  abstract = {We present an overview of ParFiSys, a coherent parallel file
  system developed at the UPM to provide I/O services to the GPMIMD machine, an
  MPP built within the ESPRIT project P-5404. Special emphasis is made on the
  results obtained during ParFiSys evaluation. They were obtained using several
  I/O benchmarks (PARKBENCH, IOBENCH, etc.) and several MPP platforms (T800,
  T9000, etc.) to cover a big spectrum of the ParFiSys features, being
  specifically oriented to measure throughput for scientific applications I/O
  patterns. ParFiSys is specially well suited to provide I/O services to
  scientific applications requiring high I/O bandwidth, to minimize application
  porting effort, and to exploit the parallelism of generic message-passing
  multicomputers.}
}