Abstract
Grid computing focuses on large-scale resource sharing. Using a general reliability model for grid computing to relax some impractical assumptions, a heuristic algorithm is presented to evaluate grid program/ service reliability. The heuristic algorithm is based on two heuristic criteria that determine the significance of an entity and prune those insignificant ones. Through algorithm analysis, the heuristic algorithm is shown to have a linear complexity. This is much better than the previous algorithms, which are of exponential complexity. Another advantage of the heuristic algorithm is that the running time is controllable by adjusting the parameter of significant level (SL) and significant rate. A regression method is proposed to adjust the SL and predict the running time. Two examples are given. © 2007 IEEE.
| Original language | English |
|---|---|
| Pages (from-to) | 189-200 |
| Journal | IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans |
| Volume | 37 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - Mar 2007 |
| Externally published | Yes |
Research Keywords
- Bayesian analysis
- Distributed computing
- Graph theory
- Grid program/service reliability
- Heuristic algorithm
Fingerprint
Dive into the research topics of 'A heuristic algorithm for reliability modeling and analysis of grid systems'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver