scientific article; zbMATH DE number 1256657

zbMath0977.68878MaRDI QIDQ4230343

Anna R. Karlin, Andrei Z. Broder, Yossi Azar

Publication date: 16 January 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15)

Related Items (18)

Local base station assignment with time intervals in mobile computing environments ⋮ An improved lower bound for load balancing of tasks with unknown duration ⋮ Stochastic analysis of dynamic processes ⋮ Online perfect matching and mobile computing ⋮ Online load balancing of temporary tasks ⋮ Rejecting jobs to minimize load and maximum flow-time ⋮ On-line load balancing for related machines ⋮ Load balancing for response time ⋮ Fair resource allocation for different scenarios of demands ⋮ On-line resource management with applications to routing and scheduling ⋮ Improved bounds for on-line load balancing ⋮ Competitive routing of virtual circuits with unknown duration ⋮ Anonymity and k-Choice Identities ⋮ On-line load balancing of temporary tasks revisited ⋮ On-line bin-stretching ⋮ On large deviations in load sharing networks ⋮ New algorithms for related machines with temporary jobs. ⋮ On-line restricted assignment of temporary tasks with unknown durations.

This page was built for publication: