On-Line Load Balancing of Temporary Tasks

DOI10.1006/jagm.1995.0799zbMath0876.68026OpenAlexW1972257233MaRDI QIDQ3125220

Bala Kalyanasundaram, Orli Waarts, Yossi Azar, Kirk R. Pruhs, Serge A. Plotkin

Publication date: 18 March 1997

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1995.0799

zbMATH Keywords

on-line load balancing problem

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items (18)

Local base station assignment with time intervals in mobile computing environments ⋮ A poly-log competitive posted-price algorithm for online metrical matching on a spider ⋮ An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem ⋮ On-line load balancing made simple: greedy strikes back ⋮ On-line algorithms for the channel assignment problem in cellular networks. ⋮ Minimizing maximum (weighted) flow-time on related and unrelated machines ⋮ Dynamic storage allocation with known durations ⋮ Exponential penalty function control of loss networks ⋮ Competitive routing of virtual circuits with unknown duration ⋮ On-line load balancing of temporary tasks revisited ⋮ On-line bin-stretching ⋮ Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs ⋮ Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing ⋮ New algorithms for related machines with temporary jobs. ⋮ On-line restricted assignment of temporary tasks with unknown durations. ⋮ Minimum Congestion Mapping in a Cloud ⋮ A nonmonotone analysis with the primal-dual approach: online routing of virtual circuits with unknown durations ⋮ A Nonmonotone Analysis with the Primal-Dual Approach: Online Routing of Virtual Circuits with Unknown Durations

This page was built for publication: On-Line Load Balancing of Temporary Tasks