### 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 language | English |
---|---|

Title of host publication | 10th International Symposium of Hungarian Researchers on Computational Intelligence and Informatics, CINTI 2009 |

Publication status | Published - 2009 |

Event | 10th International Symposium of Hungarian Researchers on Computational Intelligence and Informatics, CINTI 2009 - Budapest, Hungary Duration: Nov 12 2009 → Nov 14 2009 |

### Other

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

Country | Hungary |

City | Budapest |

Period | 11/12/09 → 11/14/09 |

### ASJC Scopus subject areas

- Artificial Intelligence
- Information Systems

### Cite this

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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

}

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 -