Double auction protocols for resource allocation in grids
Umesh Kant, Daniel Grosu
Abstract
Umesh Kant, Daniel Grosu
Abstract
In this paper we propose the double auction allocation model for grids, and three double auction protocols for resource allocation: Preston-McAfee Double Auction Protocol (PMDA), threshold price double auction protocol (TPDA) and continuous double auction protocol (CDA). We study these protocols in terms of economic efficiency and system performance. The results show that CDA protocol is better from both resource's and user's perspective providing high resource utilization.
OpenAlex reports 64 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper we propose the double auction allocation model for grids, and three double auction protocols for resource allocation: Preston-McAfee Double Auction Protocol (PMDA), threshold price double auction protocol (TPDA) and continuous double auction protocol (CDA). We study these protocols in terms of economic efficiency and system performance. The results show that CDA protocol is better from both resource's and user's perspective providing high resource utilization.
Key concepts: Double auction, Computer science, Resource allocation, Protocol (science), Resource (disambiguation), Combinatorial auction, Resource management (computing), Distributed computing