2002 · 29 citations · 6 references
ComputingComputer SystemsAuction TheoryDistributed SystemsGrid ComputingAuction DesignCompetitive BiddingGrid ArchitectureResource AllocationResource ProvisioningAuction AlgorithmsAuction-based Task AllocationBidding SystemsGrid Resource Broker ArchitectureGrid Resource BrokeringGrid SchedulingWinner Determination Problem
we present the overall design for an auctioning based resource trading/acquiring system that can be deployed in wide-area computing systems such as Grid systems. Selecting the winning bids is one of the core issues in any system that utilizes the auctioning paradigm. We identify the unique aspects of our system that impact the winner selection process. More specifically, the necessity to acquire or trade resources as a bundle (i.e., perform co-allocation) presents a challenge to traditional bidding mechanisms. We present a new bidding mechanism called “co-bids” to address this problem. Two heuristics for winner selection with co-bids are proposed. The performance of the heuristics are examined via simulations.
6
Spawn: a distributed computational economy
Carl A. Waldspurger, Tad Hogg, Bernardo A. Huberman et al. · IEEE Transactions on Software Engineering · 1992 · 651 citations
Mariposa: a wide-area distributed database system
Michael Stonebraker, Paul M. Aoki, Witold Litwin et al. · The VLDB Journal · 1996 · 359 citations
Optimal solutions for multi-unit combinatorial auctions
Rica Gonen, Daniel Lehmann · 2000 · 150 citations