Skip to main content
SpringerLink
Log in

On-Line Scheduling of Parallel Jobs in Heterogeneous Multiple Clusters

  • Conference paper
Book cover Frontiers in Algorithmics and Algorithmic Aspects in Information and Management

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

Abstract

We consider the on-line scheduling of parallel jobs in heterogeneous multiple clusters, in which a set of clusters is given and the parallel jobs arrive one by one, and the goal is to schedule all the jobs while minimizing the makespan. A cluster consists of many identical processors. A parallel job may require several processors in one cluster to execute it simultaneously. In this paper, we investigate two variants of the heterogeneous clusters. First, for the clusters of different widths (number of processors) but identical processor speeds, we provide an on-line algorithm with a competitive ratio at most of 14.2915. Second, for the clusters of different speeds but identical widths, we provide an on-line algorithm with a competitive ratio at most of 18.2788.

Research was supported by NSFC(11071215).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aspnes, J., Azar, Y., Fiat, A., Plotkin, S., Waarts, O.: On-line load balancing with applications to machine scheduling and virtual circuit routing. Journal of the ACM 44, 486–504 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  2. Baker, B.S., Schwartz, J.S.: Shelf algorithms for two-dimensional packing problems. SIAM Journal on Computing 12, 508–525 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  3. Berman, P., Charikar, M., Karpinski, M.: On-line load balancing for related machines. Journal of Algorithms 35, 108–121 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  4. Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press (1998)

    Google Scholar 

  5. Bougeret, M., Dutot, P.-F., Jansen, K., Otte, C., Trystram, D.: A Fast 5/2-Approximation Algorithm for Hierarchical Scheduling. In: D’Ambra, P., Guarracino, M., Talia, D. (eds.) Euro-Par 2010. LNCS, vol. 6271, pp. 157–167. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  6. Bougeret, M., Dutot, P.F., Jansen, K., Otte, C., Trystram, D.: Approximating the non-contiguous multiple organization packing problem. In: Proceedings of Theoretical Computer Science: the 6th IFIP WG 2.2 International Conference (TCS), pp. 316–327 (2010)

    Google Scholar 

  7. Bougeret, M., Dutot, P.F., Jansen, K., Otte, C., Trystram, D.: Approximation Algorithms for Multiple Strip Packing. In: Bampis, E., Jansen, K. (eds.) WAOA 2009. LNCS, vol. 5893, pp. 37–48. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  8. Bougeret, M., Dutot, P.F., Trystram, D.: An extention of the 5/2-approximation algorithm using oracle. Research Report (2010)

    Google Scholar 

  9. Chrobak, M., Kenyon, C.: Competitiveness via doubling. In: SIGACT News, pp. 115–126 (2006)

    Google Scholar 

  10. Coffman, E.G., Garey, M.R., Johnson, D.S., Tarjan, R.E.: Performance bounds for level oriented two-dimensional packing algorithms. SIAM Journal on Computing 9, 808–826 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  11. Ebenlendr, T., Sgall, J.: A lower bound on deterministic online algorithms for scheduling on related machines without preemption. In: Proc. of the 9th Workshop on Approximation and Online Algorithms, WAOA 2011 (2012)

    Google Scholar 

  12. Harren, R., Jansen, K., Prädel, L., van Stee, R.: A (5/3 + ε)-Approximation for Strip Packing. In: Dehne, F., Iacono, J., Sack, J.-R. (eds.) WADS 2011. LNCS, vol. 6844, pp. 475–487. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  13. Hurink, J.L., Paulus, J.J.: Online Algorithm for Parallel Job Scheduling and Strip Packing. In: Kaklamanis, C., Skutella, M. (eds.) WAOA 2007. LNCS, vol. 4927, pp. 67–74. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  14. Jansen, K., van Stee, R.: On strip packing With rotations. In: Proc. 37th Symp. Theory of Computing (STOC), pp. 755–761 (2005)

    Google Scholar 

  15. Kenyon, C., Remila, E.: Approximate Strip Packing. In: Proc. 37th Symp. Foundations of Computer Science (FOCS), vol. 37, pp. 31–37 (1996)

    Google Scholar 

  16. Schiermeyer, I.: Reverse-Fit: A 2-Optimal Algorithm for Packing Rectangles. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol. 855, pp. 290–299. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  17. Schwiegelshohn, U., Tchernykh, A., Yahyapour, R.: Online scheduling in grids. In: IEEE International Symposium on Parallel and Distributed Processing (IPDPS), pp. 1–10 (2008)

    Google Scholar 

  18. Steinberg, A.: A strip-packing algorithm with absolute performance bound 2. SIAM Journal on Computing 26, 401–409 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  19. Ye, D., Han, X., Zhang, G.: A note on online strip packing. Journal of Combinatorial Optimization 17(4), 417–423 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  20. Ye, D., Han, X., Zhang, G.: Online multiple-strip packing. Theoretical Computer Science 412(3), 233–239 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  21. Zhuk, S.: Approximate algorithms to pack rectangles into several strips. Discrete Mathematics and Applications 16(1), 73–85 (2006)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Computer Science, Zhejiang University, Hangzhou, 310027, China

    Deshi Ye & Lili Mei

Authors
  1. Deshi Ye
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lili Mei
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of North Carolina, CB 3175 Brooks Bldg, 27599-3175, Chapel Hill, NC, USA

    Jack Snoeyink

  2. Microsoft Research Asia, No 999, Zixing Road, Minhang District, 200241, Shanghai, China

    Pinyan Lu

  3. Peking University, Science BLK 1, No.5 Yiheyuan Road, Haidian District, 100871, Beijing, P.R.China

    Kaile Su

  4. Department of Computer Science, City University of Hong Kong, Tat Chee Ave., Kowloon, Hong Kong

    Lusheng Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ye, D., Mei, L. (2012). On-Line Scheduling of Parallel Jobs in Heterogeneous Multiple Clusters. In: Snoeyink, J., Lu, P., Su, K., Wang, L. (eds) Frontiers in Algorithmics and Algorithmic Aspects in Information and Management. Lecture Notes in Computer Science, vol 7285. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29700-7_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29700-7_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29699-4

  • Online ISBN: 978-3-642-29700-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation