Network Speed Scaling
- 5 March 2021
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 48 (3), 61-62
- https://doi.org/10.1145/3453953.3453967
Abstract
Speed scaling for a network of servers represented by a directed acyclic graph is considered. Jobs arrive at a source server, with a specified destination server, and are defined to be complete once they are processed by all servers on any feasible path between the source and the corresponding destination. Each server has variable speed, with power consumption function P, a convex increasing function of the speed. The objective is to minimize the sum of the flow time (summed across jobs) and the energy consumed by all the servers, which depends on how jobs are routed, as well as how server speeds are set. Algorithms are derived for both the worst case and stochastic job arrivals setting, whose competitive ratio depends only on the power functions and path diversity in the network, but is independent of the workload.Keywords
This publication has 8 references indexed in Scilit:
- Network speed scalingPerformance Evaluation, 2020
- Multiple Server SRPT With Speed Scaling Is CompetitiveIEEE/ACM Transactions on Networking, 2020
- Optimality, fairness, and robustness in speed scaling designsPublished by Association for Computing Machinery (ACM) ,2010
- Speed Scaling with an Arbitrary Power FunctionPublished by Society for Industrial & Applied Mathematics (SIAM) ,2009
- Speed Scaling Functions for Flow Time Scheduling Based on Active Job CountLecture Notes in Computer Science, 2008
- Scheduling for Speed Bounded ProcessorsLecture Notes in Computer Science, 2008
- Energy-efficient algorithms for flow time minimizationACM Transactions on Algorithms, 2007
- A scheduling model for reduced CPU energyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002