Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints

DOI10.1007/S10878-012-9543-2zbMATH Open1275.90023OpenAlexW1994184712MaRDI QIDQ2392745FDOQ2392745

Authors Yanyan Li

Publication date 2 August 2013

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-012-9543-2

zbMATH Keywords

online algorithmscompetitive analysisschedulingtemperatureresource augmentation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints
• Online competitive algorithms for maximizing weighted throughput of unit jobs
• STACS 2004
• Temperature aware online algorithms for scheduling equal length jobs
• Temperature aware online algorithms for scheduling equal length jobs
• Temperature aware online algorithms for minimizing flow time
• Temperature aware online algorithms for minimizing flow time
• Online scheduling of bounded length jobs to maximize throughput
• Online Scheduling of Bounded Length Jobs to Maximize Throughput
• Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine

Cites work

• scientific article; zbMATH DE number 1003262 (Why is no real title available?)
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• scientific article; zbMATH DE number 2079410 (Why is no real title available?)
• Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems
• Competitive analysis of online real-time scheduling algorithms under hard energy constraint
• Considering suppressed packets improves buffer management in QoS switches
• Getting the best response for your erg
• On unified results involving partial sums of a class of meromorphic functions
• Online competitive algorithms for maximizing weighted throughput of unit jobs
• Online scheduling with partial job values: does timesharing or randomization help?
• Temperature Aware Online Scheduling with a Low Cooling Factor

Cited in

(6)

• Temperature aware online algorithms for minimizing flow time
• Temperature aware online algorithms for scheduling equal length jobs
• STACS 2004
• Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints
• Temperature aware online algorithms for scheduling equal length jobs
• Temperature aware online algorithms for minimizing flow time

This page was built for publication: Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints

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