Simultaneous Cost and QoS Optimization for Cloud Resource Allocation
Bibliographic record
Abstract
Cloud computing is a new era of computing that offers resources and services for Web applications. Selection of optimal cloud resources is the main goal in cloud resource allocation. Sometimes, customers pay more than required since cloud providers' pricing strategy is designed for the interest of the providers. Nonetheless, cloud customers are interested in selecting cloud resources to meet their quality of service (QoS) requirements. Thus, for the interest of both providers and customers, it is vital to balance the two conflicting objectives of deployment cost and QoS performance. In this paper, we present a cost-effective and runtime friendly algorithm that minimizes the deployment cost while meeting the QoS performance requirements. In other words, the algorithm offers an optimal choice, from customers' point of view, for deploying a Web application in cloud environment. The multi-objective optimization algorithm minimizes cost and maximizes QoS performance simultaneously. The proposed algorithm is verified by a series of experiments on different workload scenarios deployed in two distinct cloud providers. The results show that the proposed algorithm finds the optimal combination of cloud resources that provides a balanced trade-off between deployment cost and QoS performance in relatively low runtime.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.002 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".