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 bartering double auction resource allocation model in cloud environments

TL;DR: Wang et al. as discussed by the authors presented an auction-inspired model for providing/demanding resources without exchanging money among CSPs, which can increase CSP's social welfare and profitability while significantly reducing SLA violations.
Proceedings ArticleDOI

A Truthful Auction Mechanism for Cumulative Resource Allocation in Mobile Edge Computing

TL;DR: This paper innovatively considers a continuous task offloading problem in mobile edge computing in which the task can be partially executed and the task owner provides a nonlinear value function to pay for the executed task.
Journal ArticleDOI

Enhanced Multi-attribute Combinative Double Auction (EMCDA) for Resource Allocation in Cloud Computing

TL;DR: The experimental result demonstrates that the proposed Enhanced Multi-attribute Combinative Double Auction (EMCDA) resource allocation algorithm performs efficiently than the existing Combinatorial Double Auction Resource Allocation (CDARA) model.
Journal ArticleDOI

A Vehicular Edge Computing-Based Architecture and Task Scheduling Scheme for Cooperative Perception in Autonomous Driving

Yuankui Wei, +1 more
- 14 Sep 2022 - 
TL;DR: Detailed simulations indicate that the proposed architecture with the TSHS can enable cooperative perception, with a fast running speed and advanced performance, that is superior to that of the benchmarks, especially when most AVs face limitations in terms of storage and computation.
References
More filters
Journal ArticleDOI

Truthful approximation mechanisms for restricted combinatorial auctions

TL;DR: A set of techniques are developed that allow constructing efficiently computable truthful mechanisms for combinatorial auctions in the special case where each bidder desires a specific known subset of items and only the valuation is unknown by the mechanism (the single parameter case).
Proceedings ArticleDOI

An online auction framework for dynamic resource provisioning in cloud computing

TL;DR: This work represents the first online combinatorial auction designed in the cloud computing paradigm, which is general and expressive enough to both optimize system efficiency across the temporal domain instead of at an isolated time point, and model dynamic provisioning of heterogeneous Virtual Machine (VM) types in practice.
Journal ArticleDOI

Multi-Resource Fair Allocation in Heterogeneous Cloud Computing Systems

TL;DR: Large-scale simulations driven by Google cluster traces show that DRFH significantly outperforms the traditional slot-based scheduler, leading to much higher resource utilization with substantially shorter job completion times.
Journal ArticleDOI

Truthful Greedy Mechanisms for Dynamic Virtual Machine Provisioning and Allocation in Clouds

TL;DR: This work forms the dynamic VM provisioning and allocation problem for the auction-based model as an integer program considering multiple types of resources and designs truthful greedy and optimal mechanisms for the problem such that the cloud provider provisions VMs based on the requests of the winning users and determines their payments.
Journal ArticleDOI

An Online Mechanism for Resource Allocation and Pricing in Clouds

TL;DR: An auction-based online mechanism for VM provisioning, allocation, and pricing in clouds that considers several types of resources is designed and it is proved that the mechanism is incentive-compatible, that is, it gives incentives to the users to reveal their actual requests.
Related Papers (5)