• Dr VISWA BHARATHI
• DEEPIKA APPIDI

This work investigates a non-polynomial (NP)-hard combinatorial optimization problem related to growing service capacity and boosting service dependability in grid-based utility computing. With theoretical justification, the problem is deconstructed into master and slave sub problems, and a computationally efficient two-level iterative approach for solving it is proposed. An ordinal optimization-based n-stage technique is used to solve the slave sub problem, together with an approximate model for objective value evaluation. A bisection method is employed to solve the master sub problem. The solution achieved using the suggested iterative two-level technique is optimal under certain conditions.

GRID-BASED UTILITY COMPUTING: OPTIMIZING SERVICE RELIABILITIES AND INCREASING SERVICE CAPACITIES

"GRID-BASED UTILITY COMPUTING: OPTIMIZING SERVICE RELIABILITIES AND INCREASING SERVICE CAPACITIES", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 2, page no.160-165, February-2019, Available :http://www.jetir.org/papers/JETIRFE06029.pdf

"GRID-BASED UTILITY COMPUTING: OPTIMIZING SERVICE RELIABILITIES AND INCREASING SERVICE CAPACITIES", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 2, page no. pp160-165, February-2019, Available at : http://www.jetir.org/papers/JETIRFE06029.pdf