Spawn: A Distributed Computational Economy
IEEE Transactions on Software Engineering
Auction allocation of computing resources
Communications of the ACM
Public access to the Internet
The POPCORN market—an online market for computational resources
Proceedings of the first international conference on Information and computation economies
The grid: blueprint for a new computing infrastructure
The grid: blueprint for a new computing infrastructure
Journal of Parallel and Distributed Computing
Heuristics for Scheduling Parameter Sweep Applications in Grid Environments
HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
A Comparison among Grid Scheduling Algorithms for Independent Coarse-Grained Tasks
SAINT-W '04 Proceedings of the 2004 Symposium on Applications and the Internet-Workshops (SAINT 2004 Workshops)
Brain Meets Brawn: Why Grid and Agents Need Each Other
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
From market-driven agents to market-oriented grids (position paper)
ACM SIGecom Exchanges
Pricing congestible network resources
IEEE Journal on Selected Areas in Communications
Hi-index | 0.01 |
Whereas Grids enable the sharing, selection, query and aggregation of geographically distributed resources for solving large-scale problems, providing efficient resource allocation mechanism managing Grid resources is a complex undertaking. In this work, we consider the problem of engineering agents that act as proxies for the procurement of computational and data resources. Since applications may require multiple Grid services, mechanisms such as single-good auctions may not be appropriate for the management of these services, we propose a new scheduling algorithm based on multi-unit auction. We provide the design of prices announcement, agent creation and resource situation submission, bidding rules, and temporary allocation rules. A simulation environment is established based on the Gridsim toolkit and the simulation experiments indicate that the algorithm needs less communication and meet the requirements of user's QoS better than the conventional algorithms.