On-Line Load Balancing of Temporary Tasks

DOI10.1006/JAGM.1995.0799MaRDI QIDQ3125220zbMATH OpenOpenAlexFDO

Authors Bala Kalyanasundaram, Orli Waarts, Yossi Azar, Serge Plotkin, Kirk Pruhs

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)

Recommendations

• Online load balancing of temporary tasks
• scientific article; zbMATH DE number 1629979
• On-line load balancing of temporary tasks revisited
• On-Line Load Balancing of Temporary Tasks on Identical Machines
• On-line load balancing
• Online and Random-order Load Balancing Simultaneously
• scientific article; zbMATH DE number 1256657
• Online multidimensional load balancing
• Well-behaved online load balancing against strategic jobs

Cited in

(34)

• On-line load balancing
• Temporary tasks assignment resolved
• On-line algorithms for the channel assignment problem in cellular networks.
• New algorithms for related machines with temporary jobs.
• Exponential penalty function control of loss networks
• On-line restricted assignment of temporary tasks with unknown durations.
• Off-line temporary tasks assignment.
• 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
• A nonmonotone analysis with the primal-dual approach: online routing of virtual circuits with unknown durations
• scientific article; zbMATH DE number 1617258 (Why is no real title available?)
• scientific article; zbMATH DE number 1629979 (Why is no real title available?)
• A nonmonotone analysis with the primal-dual approach: online routing of virtual circuits with unknown durations
• An improved lower bound for load balancing of tasks with unknown duration
• scientific article; zbMATH DE number 1003263 (Why is no real title available?)
• An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem
• scientific article; zbMATH DE number 1256657 (Why is no real title available?)
• On-Line Load Balancing of Temporary Tasks on Identical Machines
• scientific article; zbMATH DE number 2119652 (Why is no real title available?)
• Online load balancing of temporary tasks
• Minimizing maximum flow time on related machines via dynamic posted pricing
• Minimizing maximum (weighted) flow-time on related and unrelated machines
• Minimum congestion mapping in a cloud
• Approximation and Online Algorithms
• Dynamic storage allocation with known durations
• Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs
• Competitive routing of virtual circuits with unknown duration
• On-line load balancing of temporary tasks revisited
• On-line bin-stretching
• A case for on-machine load balancing
• An O( n)-competitive posted-price algorithm for online matching on the line
• Fully-dynamic load balancing
• Fully-dynamic load balancing
• On-line load balancing made simple: greedy strikes back

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3125220)