Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Algorithmic mechanism design (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Looking up data in P2P systems
Communications of the ACM
Computational Markets to Regulate Mobile-Agent Systems
Autonomous Agents and Multi-Agent Systems
On the performance of user equilibria in traffic networks
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Experiments with Scheduling Using Simulated Annealing in a Grid Environment
GRID '02 Proceedings of the Third International Workshop on Grid Computing
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
The Performance Impact of Advance Reservation Meta-scheduling
IPDPS '00/JSSPP '00 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Truthful Mechanisms for One-Parameter Agents
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Sub optimal scheduling in a grid using genetic algorithms
Parallel Computing - Special issue: Parallel and nature-inspired computational paradigms and applications
The Price of Stability for Network Design with Fair Cost Allocation
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Making the Grid Predictable through Reservations and Performance Modelling
The Computer Journal
Distributed Algorithmic Mechanism Design for Scheduling on Unrelated Machines
ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks
The virtual resource manager: an architecture for SLA-aware resource management
CCGRID '04 Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Selfish grid computing: game-theoretic modeling and NAS performance results
CCGRID '05 Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid (CCGrid'05) - Volume 2 - Volume 02
Tight bounds for worst-case equilibria
ACM Transactions on Algorithms (TALG)
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A lower bound for scheduling mechanisms
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Truthful Approximation Mechanisms for Scheduling Selfish Related Machines
Theory of Computing Systems
The Price of Stability in Selfish Scheduling Games
IAT '07 Proceedings of the 2007 IEEE/WIC/ACM International Conference on Intelligent Agent Technology
Approximate Strong Equilibrium in Job Scheduling Games
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Future Generation Computer Systems
ProtoPeer: a P2P toolkit bridging the gap between simulation and live deployement
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
Utility-driven solution for optimal resource allocation in computational grid
Computer Languages, Systems and Structures
Theoretical Computer Science
Resource Leasing and the Art of Suspending Virtual Machines
HPCC '09 Proceedings of the 2009 11th IEEE International Conference on High Performance Computing and Communications
Market based resource allocation with incomplete information
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Virtual Infrastructure Management in Private and Hybrid Clouds
IEEE Internet Computing
Convergence time to Nash equilibria
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Colocation games: and their application to distributed resource management
HotCloud'09 Proceedings of the 2009 conference on Hot topics in cloud computing
Non-cooperative, semi-cooperative, and cooperative games-based grid resource allocation
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
The efficiency of optimal taxes
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
Hi-index | 0.00 |
Today, large-scale distributed Cloud computing infrastructures are often characterized by the fact that each participating organization, like a company in the free economy scenario, when making its resources available, will strive for reducing its own cost and for optimizing its own benefit, regardless of the consequences on the global Cloud's welfare, in terms of effectiveness and performance losses. The selfish behavior of all these entities (end-users, Cloud providers, underlying enterprises/data centers), competing strategically for resources (distributed storage, processing power, bandwidth), motivates the use of game theory and autonomous agents for effective Multi-User Task Scheduling. Accordingly, we present a novel uncoordinated fully distributed scheduling scheme for federated cloud organizations, based on independent, competing, and self-interested job/task execution agents, driven by optimum social welfare criteria towards a Nash equilibrium solution. The agents' behavior is also conditioned by marginal costs, to force some kind of implicit coordination between the (often conflicting) objectives of the various entities involved in the cloud. Due to its inherent parallel nature, such schema can provide a significantly better scalability in presence of a large number of tasks and resources involved into the scheduling system.