System reliability estimation of constrained multi-state computational grids

Computational grid has attained quiet a significant attention due to it is distributed feature and scalability. The two major factors that affect the design of a computational grid are cost and reliability. Reliability is a function of time, bandwidth and load and is depicted as [R = f(t,b,l)]. Desi...

Full description

Saved in:
Bibliographic Details
Published in:International journal of information technology (Singapore. Online) 2020-12, Vol.12 (4), p.1419-1425
Main Authors: Das, Debashreet, Tripathy, C. R., Tripathy, P. K., Kabat, M. R.
Format: Article
Language:English
Subjects:
Artificial Intelligence
Computer Imaging
Computer Science
Image Processing and Computer Vision
Machine Learning
Original Research
Pattern Recognition and Graphics
Software Engineering
Vision
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Computational grid has attained quiet a significant attention due to it is distributed feature and scalability. The two major factors that affect the design of a computational grid are cost and reliability. Reliability is a function of time, bandwidth and load and is depicted as [R = f(t,b,l)]. Design of a cost-effective, reliable computational grid is highly desirable. In this context, a multi-state grid is defined as a grid network which can have multiple states of load with different probability over a single link. The system reliability computations of a multi-state grid have to be NP-hard in nature. The problem even becomes more complex when the system reliability is computed while taking into account different design factors. Here, in this paper, a new method is proposed for building system reliability estimation of computational grids. A new reliability function is presented in this paper so as to enhance the efficiency of system reliability of a multi-state computational grid through an analysis.
ISSN:2511-2104
2511-2112
DOI:10.1007/s41870-018-0132-1