scispace - formally typeset
Journal ArticleDOI

An online auction mechanism for time-varying multidimensional resource allocation in clouds

Reads0
Chats0
TLDR
This work proposes a novel integer programming model for the time-varying multidimensional resource allocation problem and designs a truthful online auction mechanism for resource allocation in a competitive environment and proves that the mechanism is truthful and individual rationality.
About
This article is published in Future Generation Computer Systems.The article was published on 2020-10-01. It has received 39 citations till now. The article focuses on the topics: Resource allocation & Resource (project management).

read more

Citations
More filters
Journal ArticleDOI

A metaheuristic method for joint task scheduling and virtual machine placement in cloud data centers

TL;DR: Simulation results show that optimizing joint task scheduling and VM placement leads to better overall results in terms of minimizing execution cost, makespan and degree of imbalance and maximizing PHs resource utilization.
Journal ArticleDOI

Truthful auction mechanisms for resource allocation in the Internet of Vehicles with public blockchain networks

TL;DR: Wang et al. as discussed by the authors proposed two auction mechanisms for the blockchain network formed by edge computing service providers and miners to maximize the social welfare, and the experiments show that the proposed auction mechanism can effectively maximize social welfare in blockchain network and provide an effective resource allocation strategy for edge Computing service providers.
Journal ArticleDOI

Strategy-proof mechanism for online resource allocation in cloud and edge collaboration

TL;DR: This paper proposes a framework for cloud-edge collaboration based on live video webcast services and transforms the resource allocation problem into a constrained integer programming (IP) model and introduces an auction mechanism to solve the problem of resource competition among the anchor users in live services.
Journal ArticleDOI

Efficient autonomic and elastic resource management techniques in cloud environment: taxonomy and analysis

TL;DR: A comprehensive review along with a taxonomy of the most recent existing autonomic and elastic RM techniques in a cloud environment is presented to ensure the Quality-of-Service (QoS) of cloud-based applications, satisfy the cloud user requirements, and avoid a Service-Level Agreement (SLA) violations.
Journal ArticleDOI

Resource allocation mechanisms in cloud computing: a systematic literature review

TL;DR: A systematic resource allocation survey with innovations in resource management system architecture, categorising mechanisms, addressing the challenges, and issues is presented.
References
More filters
Journal ArticleDOI

An online auction mechanism for cloud computing resource allocation and pricing based on user evaluation and cost

TL;DR: This work proposes a truthful online auction mechanism based on user evaluation and cost and applies it to the allocation and pricing of cloud computing virtual resources and proves that the resource providers can obtain increased social welfare and guarantee that the mechanism is truthful.
Journal ArticleDOI

Strategy-Proof Mechanism for Provisioning and Allocation Virtual Machines in Heterogeneous Clouds

TL;DR: Experimental results demonstrate that the proposed approximation mechanism can obtain near optimal solutions and significantly improve allocation efficiency, while generating greater social welfare.
Journal ArticleDOI

Truthful Mechanisms for Competitive Reward-Based Scheduling

TL;DR: This work designs novel truthful mechanisms in which it is always in the agent's best interest to report their true task characteristics and proposes two truthful mechanisms (an exact and approximate) for selecting a feasible subset of agents and an allocation of optional execution that maximizes the total reward obtained by the selected tasks.
Journal ArticleDOI

Efficient mechanism design for online scheduling

TL;DR: A deterministic IC mechanism is proposed and it is shown that such a simple mechanism works very well for two models: in the preemption-restart model, the mechanism can achieve the optimal competitive ratio of 5 for equal-length jobs and a near optimal ratio of (1/(1-e)2 + o(1))κ/ln κ for unequal- length jobs.
Journal ArticleDOI

Optimal interval scheduling with nonidentical given machines

TL;DR: It turns out that GreedyBS requires less total units of machines under time constrain when comparing withGreedyMR and exact methods in most cases, while GreedyMR costs the minimum time.
Related Papers (5)