Nimrod is a tool for the parametrization of serial programs to create and execute embarrassingly parallel programs over a computational grid. It is a co-allocating, scheduling and brokering service.[1] Nimrod was one of the first tools to make use of heterogeneous resources in a grid for a single computation.[2] It was also an early example of using a market economy to perform grid scheduling.[3] This enables Nimrod to provide a guaranteed completion time despite using best-effort services.[4]

The tool was created as a research project funded by the Distributed Systems Technology Centre. The principal investigator is Professor David Abramson of Monash University.

References

  1. ↑ Foster, Ian; Zhao, Yong; Raicu, Ioan (2008). "Cloud Computing and Grid Computing 360-Degree Compared". 2008 Grid Computing Environments Workshop. pp. 1–10. arXiv:0901.0131. doi:10.1109/GCE.2008.4738445. ISBN 978-1-4244-2860-1. S2CID 3187572.
  2. ↑ Abramson, D.; Foster, I.; Giddy, J.; Lewis, A.; Sosic, R.; Sutherst, R.; White, N. (February 1997). "The Nimrod Computational Workbench: A Case Study in Desktop Metacomputing" (PDF). Proceedings of the Australian Computer Science Conference (ACSC 97).
  3. ↑ Abramson, D.; Giddy, J.; Kotler, L. (May 2000). "High Performance Parametric Modeling with Nimrod/G: Killer Application for the Global Grid?" (PDF). Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS 2000). USA: IEEE Computer Society Press. pp. 520–528.
  4. ↑ Buyya, R.; Abramson, D.; Giddy, J. (May 2000). "Nimrod/G: An Architecture of a Resource Management and Scheduling System in a Global Computational Grid" (PDF). Proceedings of HPC Asia 2000. USA: IEEE Computer Society Press. pp. 283–289.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.