Algorithmic approach to calculating minimal resource allocation recommender for grid using reliability and trust computations

dc.contributor.author Krishna, Gutha Jaya
dc.contributor.author Wankar, Rajeev
dc.date.accessioned 2022-03-27T06:01:19Z
dc.date.available 2022-03-27T06:01:19Z
dc.date.issued 2011-08-16
dc.description.abstract In this paper we aim at minimally allocating resources on the grid by providing a recommender that gives us a recommendation of which allocation is a minimal resource allocation out of allocation matrices space. The recommender uses reliability, trust and search(2-way split backward search) algorithms. The resource allocation matrices are generated according to the search algorithm. The reliability and trust computations are used as factors to judge the minimal resource allocation from the resource allocation matrices generated by the 2-way split backward search algorithm [6]. Reliability is based on rate of failure of grid nodes, communication links and also on reliability of services on the grid. Trust is internally based on reputation which is overall grid service reliability and direct trust which is the availability of resources. In this work it is assumed that the arrival rate of failure of grid elements follows the Poisson process. © 2011 Springer-Verlag.
dc.identifier.citation Communications in Computer and Information Science. v.190 CCIS(PART 1)
dc.identifier.issn 18650929
dc.identifier.uri 10.1007/978-3-642-22709-7_39
dc.identifier.uri http://link.springer.com/10.1007/978-3-642-22709-7_39
dc.identifier.uri https://dspace.uohyd.ac.in/handle/1/9125
dc.subject Grid Computing
dc.subject Reliability
dc.subject Search
dc.subject Trust
dc.title Algorithmic approach to calculating minimal resource allocation recommender for grid using reliability and trust computations
dc.type Book Series. Conference Paper
dspace.entity.type
Files
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Plain Text
Description: