Tight bounds for bandwidth allocation on two links

DOI10.1016/J.DAM.2005.02.002zbMATH Open1138.90343OpenAlexW2054437184MaRDI QIDQ2486751FDOQ2486751

Leah Epstein

Publication date: 17 August 2005

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2005.02.002

zbMATH Keywords

SchedulingOn-line algorithmsBandwidth allocationRelated machines

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cites Work

• The exact LPT-bound for maximizing the minimum completion time
• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
• On-line machine covering

Cited In (17)

• A note on hierarchical scheduling on two uniform machines
• Semi-online scheduling with ``end of sequence information
• Inefficiency of equilibria for the machine covering game on uniform machines
• Machine covering with combined partial information
• Online-bounded analysis
• Online Bounded Analysis
• Parallel machine covering with limited number of preemptions
• The hierarchical model for load balancing on two machines
• Semi-online machine covering for two uniform machines
• Title not available (Why is that?)
• Online scheduling with rejection and reordering: exact algorithms for unit size jobs
• Semi-online scheduling: a survey
• Online scheduling with rejection and withdrawal
• Two models of two-dimensional bandwidth problems
• On-line machine covering on two machines with local migration
• A better semi-online algorithm for \(\mathrm Q3/s_{1} = s_{2}\leq s_{3}/C_{\mathrm{min}}\) with the known largest size
• Semi-online machine covering on two uniform machines with known total size

This page was built for publication: Tight bounds for bandwidth allocation on two links

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