.png){kind=icon}
返回
Energy-Efficient Algorithms for Flow Time Minimization
.png){kind=icon}
PRE
AI
DOI：10.1145/1290672.1290686.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We study scheduling problems in battery-operated computing devices, aiming at schedules with low total energy consumption. While most of the previous work has focused on finding feasible schedules in deadline-based settings, in this article we are interested in schedules that guarantee good response times. More specifically, our goal is to schedule a sequence of jobs on a variable-speed processor so as to minimize the total cost consisting of the energy consumption and the total flow time of all jobs. We first show that when the amount of work, for any job, may take an arbitrary value, then no online algorithm can achieve a constant competitive ratio. Therefore, most of the article is concerned with unit-size jobs. We devise a deterministic constant competitive online algorithm and show that the offline problem can be solved in polynomial time.
Keyword:
Variable-speed processor
flow time
online algorithms
competitive analysis
offline algorithms
dynamic programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
A
IF:
1.4
论文数:
43
被引数:
1.1K
机构
引用论文
.png){kind=icon}
分享收藏The Interaction of Mass Diffusion and Chemical Reaction During Finishing and Dyeing of Textiles
PREAI
分享收藏
没有更多内容
没有更多内容