By Topic

A new generalized particle approach to allot resources and jobs for grid computing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Dianxun Shuai ; Dept. of Comput. Sci. & Eng., East China Univ. of Sci. & Tech., Shanghai, China ; Xiang Feng ; Rui Gong ; Xing Wang

This paper presents a new generalized particle approach (GPA) to optimally allot the resources and jobs for grid computing (Shuai and Zhao, 2004). The proposed GPA transforms the allocation problem of grid resources and grid jobs into the kinematics and dynamics of massive particles in a force-field. This paper discusses the construction, dynamics and properties of the GPA and corresponding algorithm. The GPA has many advantages in terms of the parallelism, multiobjective optimization, multitype coordination, and the ability to deal with a variety of complex issues, such as the autonomy, personality, congestion, failure of distinct grid facilities. The simulations have shown the effectiveness and suitability of the proposed approach for grid computing.

Published in:

Information Technology: Coding and Computing, 2005. ITCC 2005. International Conference on  (Volume:1 )

Date of Conference:

4-6 April 2005