scientific article
From MaRDI portal
Publication:3113668
DOI10.4230/LIPIcs.STACS.2011.1zbMath1230.68097MaRDI QIDQ3113668
Publication date: 23 January 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_d882.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
response timeschedulingcompetitive analysisonline algorithmflow timeenergy-efficiencyoffline algorithmjob deadlinevariable-speed processor
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Related Items (14)
Energy-efficient scheduling and routing via randomized rounding ⋮ On multiprocessor temperature-aware scheduling problems ⋮ Speed scaling on parallel processors with migration ⋮ A fast algorithm for multiprocessor speed-scaling problem minimizing completion time and energy consumption ⋮ An $$O(n^2)$$ Algorithm for Computing Optimal Continuous Voltage Schedules ⋮ Flow shop for dual CPUs in dynamic voltage scaling ⋮ Continuous speed scaling with variability: a simple and direct approach ⋮ On speed scaling via integer programming ⋮ Best-by-simulations: a framework for comparing efficiency of reconfigurable architectures on workloads with deadlines ⋮ Minimizing energy on homogeneous processors with shared memory ⋮ Flow Shop for Dual CPUs in Dynamic Voltage Scaling ⋮ Green scheduling, flows and matchings ⋮ Speed scaling for maximum lateness ⋮ DVS scheduling in a line or a star network of processors
This page was built for publication:
