Where academic tradition
meets the exciting future

A Lower Limit for the Probability of Success of Computing Tasks in a Grid

Christer Carlsson, Robert Fullér, Jozsef Mezei, A Lower Limit for the Probability of Success of Computing Tasks in a Grid. In: Proceedings of the Tenth International Symposium of Hungarian Researchers on Computational Intelligence and Informatics (CINTI 2009), 717-722, 2009.

Abstract:

We will consider an approximation to the probability that a particular computing task in a grid is successful. This happens if there will always be at least a single idle node available in the system in the case of a node failure. In this paper we will show a lower limit for the probability of success of a computing task in a grid.

Files:

Full publication in PDF-format

BibTeX entry:

@INPROCEEDINGS{inpCaFuMe09a,
  title = { A Lower Limit for the Probability of Success of Computing Tasks in a Grid},
  booktitle = {Proceedings of the Tenth International Symposium of Hungarian Researchers on Computational Intelligence and Informatics (CINTI 2009)},
  author = {Carlsson, Christer and Fullér, Robert and Mezei, Jozsef},
  pages = {717-722},
  year = {2009},
}

Belongs to TUCS Research Unit(s): Other

Edit publication