On-Line Load Balancing in a Hierarchical Server Topology
From MaRDI portal
Publication:2784469
DOI10.1137/S0097539798346135zbMath0994.68069OpenAlexW2047837328MaRDI QIDQ2784469
Joseph (Seffi) Naor, Amotz Bar-Noy, Ari Freund
Publication date: 23 April 2002
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539798346135
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Algorithms in computer science (68W99)
Related Items (48)
Total completion time minimization in online hierarchical scheduling of unit-size jobs ⋮ Online parallel machines scheduling with two hierarchies ⋮ Online scheduling on two uniform machines subject to eligibility constraints ⋮ OPTIMAL ONLINE ALGORITHMS ON TWO HIERARCHICAL MACHINES WITH RESOURCE AUGMENTATION ⋮ Online Hierarchical Scheduling on Two Uniform Machines with Bounded Job Sizes ⋮ Online and semi-online scheduling of two machines under a grade of service provision ⋮ On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines ⋮ On-line hierarchical job scheduling on grids with admissible allocation ⋮ A note on hierarchical scheduling on two uniform machines ⋮ Total completion time minimization scheduling on two hierarchical uniform machines ⋮ Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy ⋮ Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements ⋮ Semi-online scheduling with two GoS levels and unit processing time ⋮ Online scheduling on uniform machines with two hierarchies ⋮ Multiprofessor scheduling ⋮ Online hierarchical scheduling: an approach using mathematical programming ⋮ Bin stretching with migration on two hierarchical machines ⋮ Fast approximation algorithms for job scheduling with processing set restrictions ⋮ An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem ⋮ Scheduling uniform machines with restricted assignment ⋮ Online and semi-online hierarchical scheduling for load balancing on uniform machines ⋮ Scheduling jobs with equal processing times subject to machine eligibility constraints ⋮ Optimal algorithms for semi-online machine covering on two hierarchical machines ⋮ On-line load balancing made simple: greedy strikes back ⋮ Preemptive scheduling on a small number of hierarchical machines ⋮ On-line algorithms for the channel assignment problem in cellular networks. ⋮ The hierarchical model for load balancing on two machines ⋮ Scheduling unit length jobs on parallel machines with lookahead information ⋮ Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing ⋮ Makespan minimization in online scheduling with machine eligibility ⋮ Online scheduling on parallel machines with two goS levels ⋮ Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan ⋮ Fast approximation algorithms for uniform machine scheduling with processing set restrictions ⋮ Makespan minimization in online scheduling with machine eligibility ⋮ Online scheduling of two job types on a set of multipurpose machines with unit processing times ⋮ An optimal online algorithm for fractional scheduling on uniform machines with three hierarchies ⋮ Improved bounds for online scheduling with eligibility constraints ⋮ On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints ⋮ On-line load balancing of temporary tasks revisited ⋮ Online scheduling of jobs with favorite machines ⋮ Online scheduling with unit processing times and processing set restrictions ⋮ Scheduling parallel machines with inclusive processing set restrictions and job release times ⋮ Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs ⋮ Online fractional hierarchical scheduling on uniformly related machines ⋮ Online scheduling with migration on two hierarchical machines ⋮ On-line booking policies and competitive analysis of medical examination in hospital ⋮ Optimal online algorithms on two hierarchical machines with tightly-grouped processing times ⋮ Inefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machines
This page was built for publication: On-Line Load Balancing in a Hierarchical Server Topology