Advertisement

An Availability-Aware Task Scheduling for Heterogeneous Systems Using Quantum-behaved Particle Swarm Optimization

  • Hao Yuan
  • Yong Wang
  • Long Chen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6145)

Abstract

A major challenge in task scheduling is the availability of resources. In a heterogeneous environment, where processors operate at different speeds and are not continuously available for computation, achieving a better make-span is a key issue. The existing algorithm SSAC has proved to be a good trade-off between availability and responsiveness while maintaining a good performance in the average response time of multiclass tasks. But the makespan may be influenced due to load imbalance. In this paper we proposed approach try to further optimize this scheduling strategy by using quantum-behaved particle swarm optimization. And compared with SSAC and MINMIN in the simulation experiment; results indicate that our proposed technique is a better solution for reducing the makespan considerably.

Keywords

Quantum-behaved Particle Swarm Optimization Task Scheduling Heterogeneous Systems 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Srinivasan, S., Jha, N.K.: Safety and Reliability Driven Task Allocation in Distributed Systems. IEEE Transactions on Parallel and Distributed Systems 10(3), 238–251 (1999)CrossRefGoogle Scholar
  2. 2.
    Lee, C.-Y.: Two-Machine Flowshop Scheduling with Availability Constraints. European J. Operational Research 114(2), 420–429 (1999)zbMATHCrossRefGoogle Scholar
  3. 3.
    Topcuoglu, H., Hariri, S., Wu, M.-Y.: Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing. IEEE Transactions on Parallel and Distributed Systems 13(3), 260–274 (2002)CrossRefGoogle Scholar
  4. 4.
    Hagras, T., Janecek, J.: A high performance, low complexity algorithm for compile-time task scheduling in heterogeneous systems. Parallel Computing 31(7), 653–670 (2005)CrossRefGoogle Scholar
  5. 5.
    Song, S.-S., Hwang, K., Kwok, Y.-K.: Risk-Resilient Heuristics and Genetic Algorithms for Security-Assured Grid Job Scheduling. IEEE Transactions on Computers 55(6), 703–719 (2006)CrossRefGoogle Scholar
  6. 6.
    Qin, X., Xie, T.: An Availability-Aware Task Scheduling Strategy for Heterogeneous Systems. IEEE Transactions on Computer 57(2), 188–199 (2008)CrossRefMathSciNetGoogle Scholar
  7. 7.
    Sun, J., Xu, W.B.: A Global Search Strategy of Quantum-behaved Particle Swarm Optimization. In: Proceedings of IEEE Conference on Cybemetics and Intelligent Systems, pp. 111–116 (2004)Google Scholar
  8. 8.
    Sun, J., Feng, B., Xu, W.B.: Particle Swarm Optimization with Particles Having Quantum Behavior. In: Proceedings of Congress on Evolutionary Computation, pp. 325–331 (2004)Google Scholar
  9. 9.
    Ding, F., Li, K.: An Improved Task Scheduling Algorithm for Heterogeneous Systems. In: Proceedings of the 2009 International Joint Conference on Computational Sciences and Optimization, pp. 90–94. IEEE Computer Society, Los Alamitos (2009)CrossRefGoogle Scholar
  10. 10.
    Eberhart, R., Kennedy, J.: A new optimizer using particle swarm theory. In: The 6th Int. Symposium on Micro Machine and Human Science, Nagoya, Japan, pp. 39–43 (1995)Google Scholar
  11. 11.
    Liu, H., Xu, S., Liang, X.: A Modified Quantum-Behaved Particle Swarm Optimization for Constrained Optimization. In: International Symposium on Intelligent Information Technology Application Workshops, pp. 531–534 (2008)Google Scholar
  12. 12.
    Kacem, I., Sadfi, C., El-Kamel, A.: Branch and Bound and Dynamic Programming to Minimize the Total Completion Times on a Single Machine with Availability Constraints. In: Proc IEEE Int’l Conf. Systems, Man and Cybernetics, pp. 1657–1662 (2005)Google Scholar
  13. 13.
    Deepa, R., Srinivasan, P.T., Doreen Hephzibah Miriam, D.: An Efficient Task Scheduling Technique in Heterogeneous Systems Using Self-Adaptive Selection-Based Genetic Algorithm. In: Proceedings of the international symposium on Parallel Computing in Electrical Engineering, pp. 343–348. IEEE Computer Society, Los Alamitos (2006)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Hao Yuan
    • 1
  • Yong Wang
    • 1
  • Long Chen
    • 2
  1. 1.Electronic Commerce & Modern Logisties Key LaboratoryChongqing University of Posts and TelecommunicationsChongqin
  2. 2.School of Computer ScienceChongqing University of Posts and TelecommunicationsChongqin

Personalised recommendations