Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms

Frank K. H. A. Dehne, David A. Hutchinson, Anil Maheshwari, Wolfgang Dittrich. Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms. In 13th International Parallel Processing Symposium / 10th Symposium on Parallel and Distributed Processing (IPPS / SPDP 99), 12-16 April 1999, San Juan, Puerto Rico, Proceedings. pages 14-20, IEEE Computer Society, 1999. [doi]

@inproceedings{DehneHMD99,
  title = {Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms},
  author = {Frank K. H. A. Dehne and David A. Hutchinson and Anil Maheshwari and Wolfgang Dittrich},
  year = {1999},
  url = {http://computer.org/proceedings/ipps/0143/01430014abs.htm},
  researchr = {https://researchr.org/publication/DehneHMD99},
  cites = {0},
  citedby = {0},
  pages = {14-20},
  booktitle = {13th International Parallel Processing Symposium / 10th Symposium on Parallel and Distributed Processing (IPPS / SPDP  99), 12-16 April 1999, San Juan, Puerto Rico, Proceedings},
  publisher = {IEEE Computer Society},
  isbn = {0-7695-0143-5},
}