On the public citation graph

Speed Scaling for Weighted Flow Time

0 signed · 80 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11671411_24openalex-snapshot
Speed Scaling of Tasks with Precedence Constraints
inferredcites →https://doi.org/10.1007/3-540-44666-4_8openalex-snapshot
Online Weighted Flow Time and Deadline Scheduling
inferredcites →https://doi.org/10.1007/978-3-540-27810-8_3openalex-snapshot
Getting the Best Response for Your Erg
inferredcites →https://doi.org/10.1007/s00224-007-9070-1openalex-snapshot
Speed Scaling of Tasks with Precedence Constraints
inferredcites →https://doi.org/10.1016/b978-0-12-566780-7.50020-9openalex-snapshot
Preemptive Scheduling of Uniform Machines Subject to Release Dates
inferredcites →https://doi.org/10.1016/j.jda.2005.12.001openalex-snapshot
Online weighted flow time and deadline scheduling
inferredcites →https://doi.org/10.1109/2.917539openalex-snapshot
Power: a first-class architectural design constraint
inferredcites →https://doi.org/10.1109/40.888701openalex-snapshot
Power-aware microarchitecture: design and modeling challenges for next-generation microprocessors
inferredcites →https://doi.org/10.1109/focs.2004.24openalex-snapshot
Dynamic Speed Scaling to Manage Energy and Temperature
inferredcites →https://doi.org/10.1109/sfcs.1995.492493openalex-snapshot
A scheduling model for reduced CPU energy
inferredcites →https://doi.org/10.1145/1067309.1067324openalex-snapshot
Algorithmic problems in power management
inferredcites →https://doi.org/10.1145/1148109.1148140openalex-snapshot
Power-aware scheduling for makespan and flow
inferredcites →https://doi.org/10.1145/1206035.1206038openalex-snapshot
Speed scaling to manage energy and temperature
inferredcites →https://doi.org/10.1145/1290672.1290686openalex-snapshot
Energy-efficient algorithms for flow time minimization
inferredcites →https://doi.org/10.1145/1367064.1367078openalex-snapshot
Getting the best response for your erg

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-319-09873-9_17openalex-snapshot
Energy Efficient Scheduling of MapReduce Jobs
inferred← citeshttps://doi.org/10.1007/978-3-319-44162-7_5openalex-snapshot
Energy-Efficient Scheduling for Portable Computers as Bi-Criteria Optimization Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-99660-8_4openalex-snapshot
A Near Optimal Mechanism for Energy Aware Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_27openalex-snapshot
Scalably Scheduling Power-Heterogeneous Processors
inferred← citeshttps://doi.org/10.1007/978-3-642-15775-2_3openalex-snapshot
Non-clairvoyant Speed Scaling for Weighted Flow Time
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_19openalex-snapshot
Sleep Management on Multiple Machines for Energy and Flow Time
inferred← citeshttps://doi.org/10.1007/978-3-642-32241-9_3openalex-snapshot
Speed Scaling for Maximum Lateness
inferred← citeshttps://doi.org/10.1007/978-3-642-38016-7_15openalex-snapshot
Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_63openalex-snapshot
Dual Techniques for Scheduling on a Machine with Varying Speed
inferred← citeshttps://doi.org/10.1007/978-3-662-48054-0_7openalex-snapshot
On the Complexity of Speed Scaling
inferred← citeshttps://doi.org/10.1007/s00224-015-9622-8openalex-snapshot
Speed Scaling for Maximum Lateness
inferred← citeshttps://doi.org/10.1007/s00453-012-9678-7openalex-snapshot
Speed Scaling on Parallel Processors
inferred← citeshttps://doi.org/10.1007/s00453-016-0208-xopenalex-snapshot
Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-Off Schedules
inferred← citeshttps://doi.org/10.1007/s10878-013-9618-8openalex-snapshot
Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines
inferred← citeshttps://doi.org/10.1007/s10951-014-0371-3openalex-snapshot
Scheduling to minimize energy and flow time in broadcast scheduling
inferred← citeshttps://doi.org/10.1007/s10951-017-0552-yopenalex-snapshot
Models and algorithms for energy-efficient scheduling with immediate start of jobs
inferred← citeshttps://doi.org/10.1016/j.ejor.2025.07.044openalex-snapshot
Dynamic batching of online arrivals to leverage economies of scale
inferred← citeshttps://doi.org/10.1016/j.ejor.2026.07.034openalex-snapshot
An extension of Hu’s algorithm for resource leveling and some related results
inferred← citeshttps://doi.org/10.1016/j.kijoms.2015.11.008openalex-snapshot
Release Round Robin: R3 an energy-aware non-clairvoyant scheduling on speed bounded processors
inferred← citeshttps://doi.org/10.1016/j.omega.2019.102117openalex-snapshot
Energy-efficient no-wait permutation flow shop scheduling by adaptive multi-objective variable neighborhood search
inferred← citeshttps://doi.org/10.1016/j.orl.2012.02.003openalex-snapshot
Speed scaling for stretch plus energy
inferred← citeshttps://doi.org/10.1016/j.peva.2020.102145openalex-snapshot
Network speed scaling
inferred← citeshttps://doi.org/10.1016/j.suscom.2011.05.007openalex-snapshot
Nonclairvoyantly scheduling power-heterogeneous processors
inferred← citeshttps://doi.org/10.1016/j.suscom.2013.01.007openalex-snapshot
Optimal energy trade-off schedules
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.11.021openalex-snapshot
Scheduling for weighted flow time and energy with rejection penalty
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.07.007openalex-snapshot
Energy-efficient multiprocessor scheduling for flow time and makespan
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.02.021openalex-snapshot
Energy efficient scheduling of parallelizable jobs
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115488openalex-snapshot
Competitive mechanisms for energy-efficient cloud computing
inferred← citeshttps://doi.org/10.1049/iet-smt.2016.0365openalex-snapshot
Power‐aware speed scaling in multiprocessor systems
inferred← citeshttps://doi.org/10.1109/allerton.2016.7852371openalex-snapshot
Load balancing and speed scaling interaction in processor-sharing systems with exponential power functions
inferred← citeshttps://doi.org/10.1109/focs.2014.63openalex-snapshot
SelfishMigrate: A Scalable Algorithm for Non-clairvoyantly Scheduling Heterogeneous Processors
inferred← citeshttps://doi.org/10.1109/focs.2016.24openalex-snapshot
Online Algorithms for Covering and Packing Problems with Convex Objectives
inferred← citeshttps://doi.org/10.1109/greencomp.2010.5598311openalex-snapshot
Nonclairvoyantly scheduling power-heterogeneous processors
inferred← citeshttps://doi.org/10.1109/icc51166.2024.10622993openalex-snapshot
Power-Managed Data Centers for Sustainable Computing
inferred← citeshttps://doi.org/10.1109/igcc.2012.6322257openalex-snapshot
Optimal energy trade-off schedules
inferred← citeshttps://doi.org/10.1109/infcom.2012.6195720openalex-snapshot
Geographic trough filling for internet datacenters
inferred← citeshttps://doi.org/10.1109/infocom.2015.7218459openalex-snapshot
Energy-efficient heuristics for job assignment in processor-sharing server farms
inferred← citeshttps://doi.org/10.1109/ipdps.2018.00028openalex-snapshot
The Power to Schedule a Parallel Program
inferred← citeshttps://doi.org/10.1109/isit50566.2022.9834434openalex-snapshot
Scheduling Group Tests over Time
inferred← citeshttps://doi.org/10.1109/jsac.2015.2482098openalex-snapshot
On the Interaction Between Load Balancing and Speed Scaling
inferred← citeshttps://doi.org/10.1109/jsac.2015.2483438openalex-snapshot
Energy-Efficient Heuristics for Insensitive Job Assignment in Processor-Sharing Server Farms
inferred← citeshttps://doi.org/10.1109/qest.2012.35openalex-snapshot
Decoupled Speed Scaling: Analysis and Evaluation
inferred← citeshttps://doi.org/10.1109/tcc.2014.2382118openalex-snapshot
Joint Resource Provisioning for Internet Datacenters with Diverse and Dynamic Traffic
inferred← citeshttps://doi.org/10.1109/tnet.2022.3142091openalex-snapshot
Speed Scaling on Parallel Servers With MapReduce Type Precedence Constraints
inferred← citeshttps://doi.org/10.1109/tpds.2008.115openalex-snapshot
Nonmigratory Multiprocessor Scheduling for Response Time and Energy
inferred← citeshttps://doi.org/10.1109/waim.2008.63openalex-snapshot
Temperature-Aware Scheduling: When is System-Throttling Good Enough?
inferred← citeshttps://doi.org/10.1137/1.9781611973099.97openalex-snapshot
Resource Augmentation for Weighted Flow-time explained by Dual Fitting
inferred← citeshttps://doi.org/10.1137/16m105589xopenalex-snapshot
Dual Techniques for Scheduling on a Machine with Varying Speed
inferred← citeshttps://doi.org/10.1145/1998037.1998058openalex-snapshot
A tutorial on amortized local competitiveness in online scheduling
inferred← citeshttps://doi.org/10.1145/2755573.2755582openalex-snapshot
Speed Scaling in the Non-clairvoyant Model
inferred← citeshttps://doi.org/10.1145/3155297openalex-snapshot
Primal Dual Gives Almost Optimal Energy-Efficient Online Algorithms
inferred← citeshttps://doi.org/10.1145/3680278openalex-snapshot
Learning-Augmented Energy-Aware List Scheduling for Precedence-Constrained Tasks
inferred← citeshttps://doi.org/10.1287/ijoc.2015.0660openalex-snapshot
Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines
inferred← citeshttps://doi.org/10.1287/opre.2024.1044openalex-snapshot
Relating Electric Vehicle Charging to Speed Scaling with Job-Specific Speed Limits
inferred← citeshttps://doi.org/10.32920/ryerson.14657736openalex-snapshot
Cost minimization of algorithms for scheduling parallel, single-threaded, heterogeneous, speed-scalable processors
inferred← citeshttps://doi.org/10.32920/ryerson.14657736.v1openalex-snapshot
Cost minimization of algorithms for scheduling parallel, single-threaded, heterogeneous, speed-scalable processors
inferred← citeshttps://doi.org/10.3390/app9071467openalex-snapshot
Energy-Aware Online Non-Clairvoyant Scheduling Using Speed Scaling with Arbitrary Power Function
inferred← citeshttps://doi.org/10.4086/cjtcs.2011.001openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.2012.v008a009openalex-snapshot
inferred← citeshttps://doi.org/10.4108/icst.valuetools.2014.258149openalex-snapshot
Optimal sleep-state control of energy-aware M/G/1 queues
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2011.1openalex-snapshot
Algorithms for Dynamic Speed Scaling
inferred← citeshttps://doi.org/10.46338/ijetae0322_09openalex-snapshot
SoC Power Consumption Estimation at High Level of Abstraction: A Survey Study
inferred← citeshttps://doi.org/10.48550/arxiv.1907.04498openalex-snapshot
Speed Scaling with Tandem Servers
inferred← citeshttps://doi.org/10.5555/2634074.2634157openalex-snapshot
Primal dual gives almost optimal energy efficient online algorithms
inferred← citeshttps://doi.org/10.70675/42246f59za193z4da4z9f89zbacafbd38dd9openalex-snapshot
Algorithmic problems in power management of computing systems
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.