变加工速度下的能量最优调度:任务大小可变性的作用

IF 0.9 4区 管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE
Jonatha Anselmi, Bruno Gaujal
{"title":"变加工速度下的能量最优调度:任务大小可变性的作用","authors":"Jonatha Anselmi,&nbsp;Bruno Gaujal","doi":"10.1016/j.orl.2025.107379","DOIUrl":null,"url":null,"abstract":"<div><div>In this paper, we study the execution of a single task with an unknown size on a server with variable processing speed. Our goal is to analyze structural properties of the optimal energy consumption under the optimal speed profile that minimizes the expected energy consumption while meeting a hard deadline constraint. Specifically, we investigate how the task size probability distribution impacts the overall energy.</div><div>Under mild assumptions, our main result shows that the expected energy consumption induced by the optimal speed profile preserves the convex increasing order with respect to the task size distribution. Then, we leverage this property to derive simple bounds and conduct a worst-case analysis. In particular, we derive a simple, general formula for the energy gap induced by the ‘best’ and ‘worst’ task size distributions, expressed in terms of the support and expectation of the task size.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"64 ","pages":"Article 107379"},"PeriodicalIF":0.9000,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Energy-optimal scheduling with variable processing speed: The role of task size variability\",\"authors\":\"Jonatha Anselmi,&nbsp;Bruno Gaujal\",\"doi\":\"10.1016/j.orl.2025.107379\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>In this paper, we study the execution of a single task with an unknown size on a server with variable processing speed. Our goal is to analyze structural properties of the optimal energy consumption under the optimal speed profile that minimizes the expected energy consumption while meeting a hard deadline constraint. Specifically, we investigate how the task size probability distribution impacts the overall energy.</div><div>Under mild assumptions, our main result shows that the expected energy consumption induced by the optimal speed profile preserves the convex increasing order with respect to the task size distribution. Then, we leverage this property to derive simple bounds and conduct a worst-case analysis. In particular, we derive a simple, general formula for the energy gap induced by the ‘best’ and ‘worst’ task size distributions, expressed in terms of the support and expectation of the task size.</div></div>\",\"PeriodicalId\":54682,\"journal\":{\"name\":\"Operations Research Letters\",\"volume\":\"64 \",\"pages\":\"Article 107379\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2025-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Operations Research Letters\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0167637725001403\",\"RegionNum\":4,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Operations Research Letters","FirstCategoryId":"91","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167637725001403","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 0

摘要

在本文中,我们研究了一个未知大小的单一任务的执行在一个服务器上具有可变的处理速度。我们的目标是分析在满足硬截止日期约束的同时最小化预期能耗的最佳速度剖面下的最佳能耗结构特性。具体来说,我们研究了任务大小概率分布对总能量的影响。在温和的假设下,我们的主要结果表明,由最优速度曲线引起的期望能量消耗相对于任务大小分布保持凸递增顺序。然后,我们利用这个性质来推导简单的边界并进行最坏情况分析。特别地,我们推导了一个简单的,由“最佳”和“最差”任务大小分布引起的能量差距的通用公式,用任务大小的支持和期望来表示。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Energy-optimal scheduling with variable processing speed: The role of task size variability
In this paper, we study the execution of a single task with an unknown size on a server with variable processing speed. Our goal is to analyze structural properties of the optimal energy consumption under the optimal speed profile that minimizes the expected energy consumption while meeting a hard deadline constraint. Specifically, we investigate how the task size probability distribution impacts the overall energy.
Under mild assumptions, our main result shows that the expected energy consumption induced by the optimal speed profile preserves the convex increasing order with respect to the task size distribution. Then, we leverage this property to derive simple bounds and conduct a worst-case analysis. In particular, we derive a simple, general formula for the energy gap induced by the ‘best’ and ‘worst’ task size distributions, expressed in terms of the support and expectation of the task size.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Operations Research Letters
Operations Research Letters 管理科学-运筹学与管理科学
CiteScore
2.10
自引率
9.10%
发文量
111
审稿时长
83 days
期刊介绍: Operations Research Letters is committed to the rapid review and fast publication of short articles on all aspects of operations research and analytics. Apart from a limitation to eight journal pages, quality, originality, relevance and clarity are the only criteria for selecting the papers to be published. ORL covers the broad field of optimization, stochastic models and game theory. Specific areas of interest include networks, routing, location, queueing, scheduling, inventory, reliability, and financial engineering. We wish to explore interfaces with other fields such as life sciences and health care, artificial intelligence and machine learning, energy distribution, and computational social sciences and humanities. Our traditional strength is in methodology, including theory, modelling, algorithms and computational studies. We also welcome novel applications and concise literature reviews.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信