A lower limit for the probability of success of computing tasks in a grid

Christer Carlsson, R. Fullér, J́ozsef Mezei

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

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.

Original languageEnglish
Title of host publication10th International Symposium of Hungarian Researchers on Computational Intelligence and Informatics, CINTI 2009
Publication statusPublished - 2009
Event10th International Symposium of Hungarian Researchers on Computational Intelligence and Informatics, CINTI 2009 - Budapest, Hungary
Duration: Nov 12 2009Nov 14 2009

Other

Other10th International Symposium of Hungarian Researchers on Computational Intelligence and Informatics, CINTI 2009
CountryHungary
CityBudapest
Period11/12/0911/14/09

ASJC Scopus subject areas

  • Artificial Intelligence
  • Information Systems

Cite this

Carlsson, C., Fullér, R., & Mezei, J. (2009). A lower limit for the probability of success of computing tasks in a grid. In 10th International Symposium of Hungarian Researchers on Computational Intelligence and Informatics, CINTI 2009

A lower limit for the probability of success of computing tasks in a grid. / Carlsson, Christer; Fullér, R.; Mezei, J́ozsef.

10th International Symposium of Hungarian Researchers on Computational Intelligence and Informatics, CINTI 2009. 2009.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Carlsson, C, Fullér, R & Mezei, J 2009, A lower limit for the probability of success of computing tasks in a grid. in 10th International Symposium of Hungarian Researchers on Computational Intelligence and Informatics, CINTI 2009. 10th International Symposium of Hungarian Researchers on Computational Intelligence and Informatics, CINTI 2009, Budapest, Hungary, 11/12/09.
Carlsson C, Fullér R, Mezei J. A lower limit for the probability of success of computing tasks in a grid. In 10th International Symposium of Hungarian Researchers on Computational Intelligence and Informatics, CINTI 2009. 2009
Carlsson, Christer ; Fullér, R. ; Mezei, J́ozsef. / A lower limit for the probability of success of computing tasks in a grid. 10th International Symposium of Hungarian Researchers on Computational Intelligence and Informatics, CINTI 2009. 2009.
@inproceedings{f8677c8e78ed42a6b5bd6ca9ddbe3b64,
title = "A lower limit for the probability of success of computing tasks in a grid",
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.",
author = "Christer Carlsson and R. Full{\'e}r and J́ozsef Mezei",
year = "2009",
language = "English",
booktitle = "10th International Symposium of Hungarian Researchers on Computational Intelligence and Informatics, CINTI 2009",

}

TY - GEN

T1 - A lower limit for the probability of success of computing tasks in a grid

AU - Carlsson, Christer

AU - Fullér, R.

AU - Mezei, J́ozsef

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84883112693&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84883112693&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84883112693

BT - 10th International Symposium of Hungarian Researchers on Computational Intelligence and Informatics, CINTI 2009

ER -