Skip to main content

Design and Implement of a Scheduling Strategy Based on PSO Algorithm

  • Conference paper
  • 2178 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6146))

Abstract

The job scheduling technology is an effective way to achieve resource sharing and to improve computational efficiency. Scheduling problem has been proved to be NP-complete problems, Particle Swarm Optimization (PSO) algorithm has demonstrated outstanding performance in solving such issues. In cognizance of the characteristics of cluster scheduling problem, a schedule strategy based on PSO was designed and implemented. Comparing with backfilling algorithm, PSO algorithm can improve the fairness of jobs better. It can avoid the problem that bigger jobs can’t be executed quickly. The speed and accuracy of strategy generation are improved significantly. The experiment results show that the scheduling strategy based on PSO algorithm can increase the utilization of the CPU and reduce average response time significantly.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Liu, Z.-x., Wang, S.-m.: Research on parallel machines scheduling problem based on particle swarm optimization algorithm. Computer Integrated Manufacturing Systems 12(2), 183–185, 296 (2006)

    Google Scholar 

  2. Wu, Q.-d., Lei, W.: Research and Application of Intelligence Particle Swarm Optimization. Jiangsu Education Publishing House, Nan Jing (2005)

    Google Scholar 

  3. Zhang, L.-x., Yuan, L.-q., Xu, W.-m.: A Kind of Scheduling Strategy Based on the Type of the Job. Computer Engineering 30(13), 63–64, 115 (2004)

    Google Scholar 

  4. Yong, Y., Cai, Z.-x., Ying, F.: An Adaptive Grid Job Scheduling Method Based on Genetic Algorithm. Computer Engineering and Applications 1, 48–50, 167 (2005)

    Google Scholar 

  5. Hao, T.: Research on the Strategy of Grids Resource Management Scheduling Based on Genetic Algorithm. Journal of Wuhan University of Technology (Information & Management Engineering) 28(11), 16–19 (2006)

    Google Scholar 

  6. Liu, Z.-x.: Research and Application of Particle Swarm Optimization in Scheduling Problem. PhD thesis, Wuhan University of Technology, 46–64 (2005)

    Google Scholar 

  7. Feng, G., Chen, H.-p., Lu, B.-y.: Particle Swarm Optimization For Flexible Job Shop Scheduling. Systems Engineering 23(9), 20–23 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, S., Wang, J., Li, X., Shuo, J., Liu, H. (2010). Design and Implement of a Scheduling Strategy Based on PSO Algorithm. In: Tan, Y., Shi, Y., Tan, K.C. (eds) Advances in Swarm Intelligence. ICSI 2010. Lecture Notes in Computer Science, vol 6146. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13498-2_66

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13498-2_66

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13497-5

  • Online ISBN: 978-3-642-13498-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics