@InProceedings{wickremesinghe:active-storage,
  author = {Rajiv Wickremesinghe and Jeffrey S. Chase and Jeffrey S. Vitter},
  title = {Distributed Computing with Load-Managed Active Storage},
  booktitle = {Proceedings of the Eleventh IEEE International Symposium on High
  Performance Distributed Computing},
  year = {2002},
  pages = {24--34},
  publisher = {IEEE Computer Society Press},
  address = {Edinburgh, Scotland},
  keywords = {I/O, active storage, TPIE, grid, parallel I/O, pario-bib},
  comment = {Very interesting talk... an extension of the TPIE work. They
  assign a mapping of computations to storage-based processors. This stuff is
  very similar to Armada. They place "functors" that have bounded per-record
  processing and bounded internal state at the ASU (active storage unit). Since
  functors have bounded computation and state, they have predictive behavior
  (used for load balancing and scheduling). The extensions to TPIE include data
  aggregation primitives for sets (unordered data), streams (sequential data),
  and arrays (random access data). They also allow functors to process
  "packets" (groups of records) useful for applications like a merge sort. The
  example applications include the standard TPIE GIS app, along with a merge
  sort.}
}