Equal Service Providing Virtual Organization Formation in GRID

P. Balaji, A. Edison, S.L. Jany Shabu

Abstract


Large-scale  application  programs  in  grid  require  resources  from  several  grid  service
providers  (GSPs).  These  grid  service  providers  form  virtual  organizations  (VOs)  by  pooling  their
resources together to provide the required capabilities to execute the application. In this model, the
VO formation  is  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.  In  this  approach,  the  mechanism
guarantees that the VOs are stable but GSPs not stable it will break away from the   current VO and
join  some  other  VO.  Thus  the  results  show  that  the  mechanism  produces  VOs  that  are  stable
yielding high cost for the participating GSPs.
Key  words:  Grid  Computing,  Virtual  Organization,  Coalitional  Game  Theory,  Merge  &  Split
Mechanism, Branch-And-Bound.

Full Text:

PDF 46-55

References


Miguel, S. L., Maryam, F., Stephen, B. (2007).Portfolio optimization with linear and fixed transaction costs, Ann Oper Res; (152):41–365.

Cirne, W., Paranhos, D., Costa, L., Santos-Neto, E., Brasileiro, F., Sauve´, J., Silva, F., Barros, C., Silveira, C. (2003). Running Bag-of-Tasks Applications on Computational Grids: The Mygrid Approach, Proc. Int’l Conf. Parallel Processing: 407-416.

Weng, C., Lu, X. (2005). Heuristic Scheduling for Bag-of-Tasks Applications in Combination with QoS in the Computational Grid, Future Generation Computer Systems; 21(2): 271-280.

DeSanctis, G., Monge, P. (1999).Communication Processes for Virtual Organizations, Organization Science; 10(6): 693-703.

Osborne, M.J., Rubinstein, A. (1994). A Course in Game Theory. MIT Press.

Shehory, O., Kraus, S. (1995). Task Allocation via Coalition Formation among Autonomous Agents, Proc. Int’l Joint Conf. Artificial Intelligence; 14: 655-661.

Mashayekhy, L., Grosu, D. (2011). A Merge-and-Split Mechanism for Dynamic Virtual Organization Formation in Grids, Proc. IEEE 30th Int’l Performance Computing and Comm. Conf.

Frey, J., Tannenbaum, T., Foster, I., Livny, M., Tuecke,S. (2002). Condor-G: A Computation Management Agent for Multi-Institutional Grids, Cluster Computing; 5(3): 237-246.

Grimshaw, A.S., Wulf, W.A. (1997).The Legion Vision of a Worldwide Virtual Computer, Comm. the ACM; 40(1).

Foster, I., Kesselman, C. (2004). The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann.

Pinedo, M. (200). Scheduling: Theory, Algorithms, and Systems. Prentice Hall.

Kuhn, H., Tucker, A. (1953). A Value for N-Person Games, Contributions to the Theory of Games, eds, Princeton Univ. Press;2: 307-317.

Sandholm, T., Larson, K., Andersson, M., Shehory, O., Tohme, F. (1999). Coalition Structure Generation with Worst Case Guarantees, Artificial Intelligence; 111: 209-238.

Knuth, D. (2005). The Art of Computer Programming, Generating All Combinations and Partitions. Addison-Wesley Professional;4 (3).

Lawler, E., Wood, D. (1966).Branch-and-Bound Methods: A Survey, Operations Research; 14: 699-719.

Wolsey, L. (1998). Integer Programming, series Wiley-Inter science Series in Discrete Math. and Optimization. John Wiley & Sons.

Braun T. (2001). A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems, J. Parallel and Distributed Computing;61(6): 810-837.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

World of Researches Publication