The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (2014 vol.25)
pp: 540-549
Lena Mashayekhy , Wayne State University, Detroit
Daniel Grosu , Wayne State University, Detroit
ABSTRACT
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.
INDEX TERMS
coalitional game theory, Virtual organizations, grid computing, VO formation,
CITATION
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
REFERENCES
[1] K. Czajkowski, I. Foster, C. Kesselman, V. Sander, and S. Tuecke, "SNAP: A Protocol for Negotiating Service Level Agreements and Coordinating Resource Management in Distributed Systems," Proc. Eighth Workshop Job Scheduling Strategies for Parallel Processing, pp. 153-183, 2002.
[2] J. Frey, T. Tannenbaum, I. Foster, M. Livny, and S. Tuecke, "Condor-G: A Computation Management Agent for Multi-Institutional Grids," Cluster Computing, vol. 5, no. 3, pp. 237-246, 2002.
[3] A.S. Grimshaw and W.A. Wulf, "The Legion Vision of a Worldwide Virtual Computer," Comm. the ACM, vol. 40, no. 1, Jan. 1997.
[4] I. Foster and C. Kesselman, The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, 2004.
[5] G. DeSanctis and P. Monge, "Communication Processes for Virtual Organizations," Organization Science, vol. 10, no. 6, pp. 693-703, 1999.
[6] M.J. Osborne and A. Rubinstein, A Course in Game Theory. MIT Press, 1994.
[7] Parallel Workloads Archive, http://www.cs.h-uji.ac.il/labs/parallelworkload /, 2013.
[8] W. Cirne, D. Paranhos, L. Costa, E. Santos-Neto, F. Brasileiro, J. Sauvé, F. Silva, C. Barros, and C. Silveira, "Running Bag-of-Tasks Applications on Computational Grids: The Mygrid Approach," Proc. Int'l Conf. Parallel Processing, pp. 407-416, 2003.
[9] C. Weng and X. Lu, "Heuristic Scheduling for Bag-of-Tasks Applications in Combination with QoS in the Computational Grid," Future Generation Computer Systems, vol. 21, no. 2, pp. 271-280, 2005.
[10] M. Pinedo, Scheduling: Theory, Algorithms, and Systems. Prentice Hall, 2002.
[11] G. Owen, Game Theory, third ed. Academic Press, 1995.
[12] L. Shapley, "A Value for N-Person Games," Contributions to the Theory of Games, H. Kuhn and A. Tucker, eds., vol. 2, pp. 307-317, Princeton Univ. Press, 1953.
[13] O. Shehory and S. Kraus, "Task Allocation via Coalition Formation among Autonomous Agents," Proc. Int'l Joint Conf. Artificial Intelligence, vol. 14, pp. 655-661, 1995.
[14] K. Apt and A. Witzel, "A Generic Approach to Coalition Formation," Int'l Game Theory Rev., vol. 11, no. 3, pp. 347-367, 2009.
[15] T. Sandholm, K. Larson, M. Andersson, O. Shehory, and F. Tohme, "Coalition Structure Generation with Worst Case Guarantees," Artificial Intelligence, vol. 111, pp. 209-238, 1999.
[16] D. Knuth, The Art of Computer Programming, Vol. 4, Fascicle 3: Generating All Combinations and Partitions. Addison-Wesley Professional, 2005.
[17] E. Lawler and D. Wood, "Branch-and-Bound Methods: A Survey," Operations Research, vol. 14, pp. 699-719, 1966.
[18] L. Wolsey, "Integer Programming," IIE Trans., vol. 32, pp. 273-285, 2000.
[19] L. Wolsey, Integer Programming, series Wiley-Interscience Series in Discrete Math. and Optimization. John Wiley & Sons, 1998.
[20] S. Chapin, W. Cirne, D. Feitelson, J. Jones, S. Leutenegger, U. Schwiegelshohn, W. Smith, and D. Talby, "Benchmarks and Standards for the Evaluation of Parallel Job Schedulers," Proc. Fifth Workshop Job Scheduling Strategies for Parallel Processing, pp. 67-90, 1999.
[21] Atlas, https://www.llnl.gov/news/newsreleases/2007 NR-07-04-05.html, 2013.
[22] T. Braun et al., "A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems," J. Parallel and Distributed Computing, vol. 61, no. 6, pp. 810-837, 2001.
[23] IBM ILOG CPLEX Optimization Studio for Academics Initiative, http://www01.ibm.com/software/websphere/ products/optimizationacademic-initiative /, 2013.
[24] L. Mashayekhy and D. Grosu, "A Merge-and-Split Mechanism for Dynamic Virtual Organization Formation in Grids," Proc. IEEE 30th Int'l Performance Computing and Comm. Conf., 2011.
35 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool