A modify ant colony optimization for the grid jobs scheduling problem with QoS requirements

Xun Pu; XianLiang Lu

doi:10.1117/12.913402

1 October 2011 A modify ant colony optimization for the grid jobs scheduling problem with QoS requirements

Xun Pu, XianLiang Lu

Proceedings Volume 8285, International Conference on Graphic and Image Processing (ICGIP 2011); 82855G (2011) https://doi.org/10.1117/12.913402
Event: 2011 International Conference on Graphic and Image Processing, 2011, Cairo, Egypt

Abstract

Job scheduling with customers' quality of service (QoS) requirement is challenging in grid environment. In this paper, we present a modify Ant colony optimization (MACO) for the Job scheduling problem in grid. Instead of using the conventional construction approach to construct feasible schedules, the proposed algorithm employs a decomposition method to satisfy the customer's deadline and cost requirements. Besides, a new mechanism of service instances state updating is embedded to improve the convergence of MACO. Experiments demonstrate the effectiveness of the proposed algorithm.

Citation Download Citation

Xun Pu and XianLiang Lu "A modify ant colony optimization for the grid jobs scheduling problem with QoS requirements", Proc. SPIE 8285, International Conference on Graphic and Image Processing (ICGIP 2011), 82855G (1 October 2011); https://doi.org/10.1117/12.913402

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available