HackerPapers

arXiv:1503.07038cs.DC

A QoS aware Novel Probabilistic strategy for Dynamic Resource Allocation

G Arun Kumar, Snehanshu Saha, Aravind Sundaresan, Bidisha Goswami

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

Abstract

The paper proposes a two player game based strategy for resource allocation in service computing domain such as cloud, grid etc. The players are modeled as demand/workflows for the resource and represent multiple types of qualitative and quantitative factors. The proposed strategy will classify them in two classes. The proposed system would forecast outcome using a priori information available and measure/estimate existing parameters such as utilization and delay in an optimal load-balanced paradigm. Keywords: Load balancing; service computing; Logistic Regression; probabilistic estimation

arXiv comments
Journal reference
DOI
Subjects
cs.DCDistributed, Parallel, and Cluster Computing

On Hacker News

No comments linking this paper were found in the collected sources. Found in 1 HN submission from Mar 2015 to Mar 2015. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.