Strongly Minimal MapReduce Algorithms: A TeraSort Case Study

Daniel Xia, Michael Simpson, Venkatesh Srinivasan, Alex Thomo. Strongly Minimal MapReduce Algorithms: A TeraSort Case Study. In Andreas Herzig, Juha Kontinen, editors, Foundations of Information and Knowledge Systems - 11th International Symposium, FoIKS 2020, Dortmund, Germany, February 17-21, 2020, Proceedings. Volume 12012 of Lecture Notes in Computer Science, pages 301-317, Springer, 2020. [doi]

@inproceedings{XiaSST20,
  title = {Strongly Minimal MapReduce Algorithms: A TeraSort Case Study},
  author = {Daniel Xia and Michael Simpson and Venkatesh Srinivasan and Alex Thomo},
  year = {2020},
  doi = {10.1007/978-3-030-39951-1_18},
  url = {https://doi.org/10.1007/978-3-030-39951-1_18},
  researchr = {https://researchr.org/publication/XiaSST20},
  cites = {0},
  citedby = {0},
  pages = {301-317},
  booktitle = {Foundations of Information and Knowledge Systems - 11th International Symposium, FoIKS 2020, Dortmund, Germany, February 17-21, 2020, Proceedings},
  editor = {Andreas Herzig and Juha Kontinen},
  volume = {12012},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-030-39951-1},
}