
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Riky Subrata, Albert Y. Zomaya, Bjorn Landfeldt, "A Cooperative Game Framework for QoS Guided Job Allocation Schemes in Grids," IEEE Transactions on Computers, vol. 57, no. 10, pp. 14131422, October, 2008.  
BibTex  x  
@article{ 10.1109/TC.2008.79, author = {Riky Subrata and Albert Y. Zomaya and Bjorn Landfeldt}, title = {A Cooperative Game Framework for QoS Guided Job Allocation Schemes in Grids}, journal ={IEEE Transactions on Computers}, volume = {57}, number = {10}, issn = {00189340}, year = {2008}, pages = {14131422}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2008.79}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  A Cooperative Game Framework for QoS Guided Job Allocation Schemes in Grids IS  10 SN  00189340 SP1413 EP1422 EPD  14131422 A1  Riky Subrata, A1  Albert Y. Zomaya, A1  Bjorn Landfeldt, PY  2008 KW  Load balancing and task assignment KW  Heterogeneous (hybrid) systems KW  Distributed architectures KW  Scheduling and task partitioning VL  57 JA  IEEE Transactions on Computers ER   
[1] A. Akella, R. Karp, C. Papadimitriou, S. Seshan, and S. Shenker, “Selfish Behavior and Stability of the Internet: A GameTheoretic Analysis of TCP,” Proc. ACM SIGCOMM '02, pp. 117130, 2002.
[2] M. Avvenuti, L. Rizzo, and L. Vicisano, “A Hybrid Approach to Adaptive Load Sharing and Its Performance,” J. Systems Architecture, vol. 42, pp. 679696, 1997.
[3] N. Bansal and M. HarcholBalter, “Analysis of SRPT Scheduling: Investigating Unfairness,” Proc. SIGMETRICS '01, pp. 279290, 2001.
[4] C. Boeres, A. Lima, and V.E.F. Rebello, “Hybrid Task Scheduling: Integrating Static and Dynamic Heuristics,” Proc. 15th Symp. Computer Architecture and High Performance Computing, pp. 199206, 2003.
[5] Y.C. Chow and W.H. Kohler, “Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor System,” IEEE Trans. Computers, vol. 28, pp. 354361, 1979.
[6] R.B. Cooper, Introduction to Queueing Theory, second ed. Elsevier, 1981.
[7] M.E. Crovella and A. Bestavros, “SelfSimilarity in World Wide Web Traffic Evidence and Possible Causes,” IEEE/ACM Trans. Networking, vol. 5, pp. 835846, 1996.
[8] M.E. Crovella, M. HarcholBalter, and C.D. Murta, “Task Assignment in a Distributed System: Improving Performance by Unbalancing Load,” Technical Report BUCSTR1997018, 1997.
[9] D. Grosu and A.T. Chronopoulos, “Algorithmic Mechanism Design for Load Balancing in Distributed Systems,” IEEE Trans. Systems, Man, and Cybernetics, vol. 34, pp. 7784, 2004.
[10] D. Grosu and A.T. Chronopoulos, “Noncooperative Load Balancing in Distributed Systems,” J. Parallel and Distributed Computing, vol. 65, pp. 10221034, 2005.
[11] D. Grosu, A.T. Chronopoulos, and M.Y. Leung, “Load Balancing in Distributed Systems: An Approach Using Cooperative Games,” Proc. 16th Int'l Parallel and Distributed Processing Symp., pp. 501510, 2002.
[12] M. HarcholBalter, “Job Placement with Unknown Duration and No Preemption,” Performance Evaluation Rev., vol. 28, pp. 35, 2001.
[13] M. HarcholBalter and A.B. Downey, “Exploiting Process Lifetime Distributions for Dynamic Load Balancing,” ACM Trans. Computer Systems, vol. 15, pp. 253285, 1997.
[14] R. Jain, The Art of Computer Systems Performance Analysis: Techniques for Experimental Design, Measurement, Simulation and Modelling. WileyInterscience, 1991.
[15] H. Kameda, J. Li, C. Kim, and Y. Zhang, Optimal Load Balancing in Distributed Computer Systems. Springer, 1997.
[16] C. Kim and H. Kameda, “An Algorithm for Optimal Static Load Balancing in Distributed Computer Systems,” IEEE Trans. Computers, vol. 41, pp. 381384, 1992.
[17] H.W. Kuhn and A.W. Tucker, “Nonlinear Programming,” Proc. Second Berkeley Symp. Math. Statistics and Probability, pp. 481492, 1951.
[18] Y.K. Kwok, K. Hwang, and S. Song, “Selfish Grids: GameTheoretic Modeling and NAS/PSA Benchmark Evaluation,” IEEE Trans. Parallel and Distributed Systems, vol. 18, pp. 621636, 2007.
[19] A. Legrand and C. Touati, “NonCooperative Scheduling of Multiple BagofTask Applications,” Proc. IEEE INFOCOM '07, pp. 427435, 2007.
[20] W.E. Leland, M.S. Taqqu, W. Willinger, and D.V. Wilson, “On the SelfSimilar Nature of Ethernet Traffic (Extended Version),” IEEE/ACM Trans. Networking, vol. 2, pp. 115, 1994.
[21] H.C. Lin and C.S. Raghavendra, “A Dynamic LoadBalancing Policy with a Central Job Dispatcher (LBC),” IEEE Trans. Software Eng., vol. 18, pp. 148158, 1992.
[22] M.O. Lorenz, “Methods of Measuring the Concentration of Wealth,” Publications of the Am. Statistical Assoc., vol. 9, pp. 209219, 1905.
[23] K. Lu, R. Subrata, and A.Y. Zomaya, “Towards Decentralized Load Balancing in a Computational Grid Environment,” Proc. First Int'l Conf. Grid and Pervasive Computing, pp. 466477, 2006.
[24] D.G. Luenberger, Linear and Nonlinear Programming, second ed. AddisonWesley, 1984.
[25] R. Mahajan, M. Rodrig, D. Wetherall, and J. Zahorjan, “Experiences Applying Game Theory to System Design,” Proc. ACM SIGCOMM '04, pp. 183190, 2004.
[26] A. Muthoo, Bargaining Theory with Applications. Cambridge Univ. Press, 1999.
[27] J. Nash, “The Bargaining Problem,” Econometrica, vol. 18, pp. 155162, 1950.
[28] I.A. Rai, G. UrvoyKeller, and E.W. Biersack, “Analysis of LAS Scheduling for Job Size Distributions with High Variance,” Proc. ACM SIGMETRICS '03, pp. 218228, 2003.
[29] K. Ranganathan, M. Ripeanu, A. Sarin, and I. Foster, “Incentive Mechanisms for Large Collaborative Resource Sharing,” Proc. IEEE Int'l Symp. Cluster Computing and the Grid, pp. 18, 2004.
[30] A. Riska, E. Smirni, and G. Ciardo, “Analytic Modeling of Load Balancing Policies for Tasks with HeavyTailed Distributions,” Proc. Second Int'l Workshop Software and Performance, pp. 147157, 2000.
[31] T. Roughgarden and É. Tardos, “How Bad Is Selfish Routing?” J.ACM, vol. 49, pp. 236259, 2002.
[32] N.G. Shivaratri, P. Krueger, and M. Singhal, “Load Distributing for Locally Distributed Systems,” Computer, pp. 3344, 1992.
[33] A. Stefanescu and M.V. Stefanescu, “The Arbitrated Solution for MultiObjective Convex Programming,” Revue Roumaine de Mathematiques Pures et Appliquées, vol. 29, pp. 593598, 1984.
[34] R. Subrata, A.Y. Zomaya, and B. Landfeldt, “Artificial Life Techniques for Load Balancing in Computational Grids,” J.Computer and System Sciences, vol. 73, pp. 11761190, 2007.
[35] R. Subrata, A.Y. Zomaya, and B. Landfeldt, “Game Theoretic Approach for Load Balancing in Computational Grids,” IEEE Trans. Parallel and Distributed Systems, in press.
[36] C. Touati, E. Altman, and J. Galtier, “Generalized Nash Bargaining Solution for Bandwidth Allocation,” Computer Networks, vol. 50, pp. 32423263, 2006.
[37] R. Wolski, J.S. Plank, T. Bryan, and J. Brevik, “GCommerce: Market Formulations Controlling Resource Allocation on the Computational Grid,” Proc. IEEE Int'l Parallel and Distributed Processing Symp., 2001.
[38] R. Wolski, N.T. Spring, and J. Hayes, “The Network Weather Service: A Distributed Resource Performance Forecasting Service for Metacomputing,” J. Future Generation Computer Systems, vol. 15, pp. 757768, 1998.
[39] H. Yaiche, R.R. Mazumdar, and C. Rosenberg, “A Game Theoretic Framework for Bandwidth Allocation and Pricing in Broadband Networks,” IEEE/ACM Trans. Networking, vol. 8, pp. 667678, 2000.