scientific article; zbMATH DE number 2038778

MaRDI QIDQ4449245zbMATH OpenFDO

Authors Pilu Crescenzi, Giorgio Gambosi, Gaia Nicosia, Paolo Penna, Walter Unger

Publication date 8 February 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2719/27191108.htm

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On-line load balancing made simple: greedy strikes back
• scientific article; zbMATH DE number 1256657
• On-line load balancing
• Load balancing of temporary tasks in the \(\ell _{p}\) norm
• On-line load balancing in a hierarchical server topology

Cited in

(7)

• On-line load balancing
• Offline file assignments for online load balancing
• Approximate majorization and fair online load balancing
• On-line load balancing in a hierarchical server topology
• Online client-server load balancing without global information
• Approximate majorization and fair online load balancing
• On-line load balancing made simple: greedy strikes back

This page was built for publication:

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