Issue No.03 - March (2014 vol.25)
Lena Mashayekhy , Dept. of Comput. Sci., Wayne State Univ., Detroit, MI, USA
Daniel Grosu , Dept. of Comput. Sci., Wayne State Univ., Detroit, MI, USA
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2013.93
Executing large-scale application programs in grids requires resources from several grid service providers (GSPs). These providers form virtual organizations (VOs) by pooling their resources together to provide the required capabilities to execute the application. We model the VO formation in grids using concepts from the coalitional game theory and design a mechanism for VO formation. The mechanism enables the GSPs to organize into VOs reducing the cost of execution and guaranteeing maximum profit for the GSPs. Furthermore, the mechanism guarantees that the VOs are stable, that is, the GSPs do not have incentives to break away from the current VO and join some other VO. We perform extensive simulation experiments using real-workload traces to characterize the properties of the proposed mechanism. The results show that the mechanism produces VOs that are stable yielding high revenue for the participating GSPs.
Silicon, Games, Organizations, Vectors, Game theory, Mechanical factors, Resource management,coalitional game theory, Virtual organizations, grid computing, VO formation
Lena Mashayekhy, Daniel Grosu, "A Merge-and-Split Mechanism for Dynamic Virtual Organization Formation in Grids", IEEE Transactions on Parallel & Distributed Systems, vol.25, no. 3, pp. 540-549, March 2014, doi:10.1109/TPDS.2013.93