Efficient Service Task Assignment in Grid Computing Environments

Grids facilitate the employment of various nodes comprising supercomputers, storage elements and databases that are distributed for resolving computational demanding problems in many disciplines of science and commerce (Foster, 2001). To utilize Grids effectively, an efficient allocation algorithm is needed to assign service tasks to Grid resources. Thus, assuming that a user wishes to perform a specific service task, which can be served by various candidate Grid nodes (CGNs), a problem that should be addressed is the assignment of the requested service task to the most appropriate Grid node. In this paper, the pertinent problem is called Service Task Allocation (STA).

[1]  Eric Walden,et al.  How Consumer Perceptions of Network Size and Social Interactions Influence the Intention to adopt Peer-to-Peer Technologies , 2007, Int. J. E Bus. Res..

[2]  Nabeel A. Y Al-Qirim.  Global Electronic Business Research: Opportunities And Directions , 2005 .

[3]  Hein Meling,et al.  Anthill: a framework for the development of agent-based peer-to-peer systems , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[4]  Krista J. Crawford-Mathis.  Concepts and Challenges of E-Leadership , 2009 .

[5]  H. R. Lourenço,et al.  Adaptive search heuristics for the generalized assignment problem , 2002 .

[6]  H. R. Lourenço,et al.  Adaptive Approach Heuristics for The Generalized Assignment Problem , 1998 .

[7]  Frank G. Goethals,et al.  Editorial Preface : International Journal of E-Business Research , 2022 .

[8]  Namchul Shin.  Strategies for generating e-business returns on investment , 2004 .

[9]  Xiaolin Li,et al.  Coping with Manufacturers' Dilemma in the E-Commerce Era: A Relational Model and a Strategic Framework , 2010, Int. J. E Bus. Res..

[10]  Rakesh Agrawal,et al.  Location Independent Remote Execution in NEST , 1987, IEEE Transactions on Software Engineering.

[11]  Felix B. Tan,et al.  An Exploratory Study of the Design Preferences of U.S. and Chinese Virtual Communities , 2006, Int. J. E Bus. Res..

[12]  Edward D. Lazowska,et al.  Adaptive load sharing in homogeneous distributed systems , 1986, IEEE Transactions on Software Engineering.

[13]  Pattie Maes,et al.  Challenger: a multi-agent system for distributed resource allocation , 1997, AGENTS '97.

[14]  Nirvikar Singh.  Encyclopedia of E-Business Development and Management in the Global Economy , 2010 .

[15]  Bernd Freisleben,et al.  A peer-to-peer meta-scheduler for service-oriented grid environments , 2007, GridNets '07.

[16]  Monique Snoeck,et al.  Two Basic Types of Business-to-Business Integration , 2005, Int. J. E Bus. Res..

[17]  Rami Qahwaji,et al.  Towards an Understanding of User Acceptance to Use Biometrics Authentication Systems in E-commerce: Using an Extension of the Technology Acceptance Model , 2010, Int. J. E Bus. Res..

[18]  Ruay-Shiung Chang,et al.  An ant algorithm for balanced job scheduling in grids , 2009, Future Gener. Comput. Syst..

[19]  David Abramson,et al.  Economic models for resource management and scheduling in Grid computing , 2002, Concurr. Comput. Pract. Exp..

[20]  Hui Yan,et al.  An improved ant algorithm for job scheduling in grid computing , 2005, 2005 International Conference on Machine Learning and Cybernetics.

[21]  Ian T. Foster,et al.  The anatomy of the grid: enabling scalable virtual organizations , 2001, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.

[22]  T. Kollmann,et al.  Web 1.0, Web 2.0 and Web 3.0: The Development of E-Business , 2010 .

[23]  In Lee,et al.  Electronic Business: Concepts, Methodologies, Tools, and Applications , 2008 .

[24]  Gregory R. Andrews,et al.  Paradigms for process interaction in distributed programs , 1991, CSUR.

[25]  Phillip Krueger,et al.  A comparison of preemptive and non-preemptive load distributing , 1988, [1988] Proceedings. The 8th International Conference on Distributed.

[26]  Douglas C. Schmidt,et al.  Evaluating the performance of middleware load balancing strategies , 2004, Proceedings. Eighth IEEE International Enterprise Distributed Object Computing Conference, 2004. EDOC 2004..

[27]  Jian Xu,et al.  Heuristic methods for dynamic load balancing in a message-passing supercomputer , 1990, Supercomputing '90.

[28]  A. Svensson.  Dynamic alternation between load sharing algorithms , 1992, Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences.

[29]  Edward D. Lazowska,et al.  A Comparison of Receiver-Initiated and Sender-Initiated Adaptive Load Sharing , 1986, Perform. Evaluation.