Skip to main content
SpringerLink
Log in

The hierarchical model for load balancing on two machines

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

Following previous work, we consider the hierarchical load balancing model on two machines of possibly different speeds. We first focus on maximizing the minimum machine load and show that no competitive algorithm exists for this problem. We overcome this barrier in two ways, both related to previously known models. The first one is fractional assignment, where each job can be arbitrarily split between the machines. The second one is a semi-online model where the sum of jobs is known in advance. We design algorithms of best possible competitive ratios for both these cases. Furthermore, we show that the combination of the two models leads to the existence of an optimal algorithm (i.e., an algorithm of competitive ratio 1). This algorithm is clearly optimal for the makespan minimization problem as well. For the latter problem, we consider the fractional assignment model and design an algorithm of best possible competitive ratio for it.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

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

    Article  MATH  MathSciNet  Google Scholar 

  • Awerbuch B, Azar Y, Grove EF, Kao M-Y, Krishnan P, Vitter JS (1995) Load balancing in the l p norm. In: Proceedings of the 36th symposium foundations of computer science (FOCS). IEEE, New York, pp 383–391

    Google Scholar 

  • Azar Y, Epstein L (1998) On-line machine covering. J Sched 1(2):67–77

    Article  MATH  MathSciNet  Google Scholar 

  • Azar Y, Naor J, Rom R (1995) The competitiveness of on-line assignments. J Algorithms 18:221–237

    Article  MATH  MathSciNet  Google Scholar 

  • Bansal N, Sviridenko M (2006) The santa claus problem. In: 38th ACM symposium on theory of computing (STOC2006), pp 31–40

  • Bar-Noy A, Freund A, Naor J (2001) On-line load balancing in a hierarchical server topology. SIAM J Comput 31:527–549

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  • Crescenzi P, Gambosi G, Penna P (2004) On-line algorithms for the channel assignment problem in cellular networks. Discret Appl Math 137(3):237–266

    Article  MATH  MathSciNet  Google Scholar 

  • Dósa G, Epstein L (2006) Preemptive scheduling on a small number of hierarchical machines. Manuscript

  • Epstein L (2005) Tight bounds for online bandwidth allocation on two links. Discret Appl Math 148(2):181–188

    Article  MATH  Google Scholar 

  • Graham RL (1966) Bounds for certain multiprocessing anomalies. Bell Syst Tech J 45:1563–1581

    Google Scholar 

  • Jiang Y-W, He Y, Tang C-M (2006) Optimal online algorithms for scheduling on two identical machines under a grade of service. J Zhejiang Univ Sci A 7(3):309–314

    Article  MATH  Google Scholar 

  • Park J, Chang SY, Lee K (2006) Online and semi-online scheduling of two machines under a grade of service provision. Oper Res Lett 34(6):692–696

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Haifa, 31905, Haifa, Israel

    Orion Chassid & Leah Epstein

Authors
  1. Orion Chassid
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Leah Epstein
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Leah Epstein.

Additional information

This work was submitted as the M.Sc. thesis of the first author.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chassid, O., Epstein, L. The hierarchical model for load balancing on two machines. J Comb Optim 15, 305–314 (2008). https://doi.org/10.1007/s10878-007-9078-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-007-9078-0

Keywords

Search

Navigation