arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2206.01360cs.DS
收藏

平衡流动时间和能量消耗

Balancing Flow Time and Energy Consumption

Sami Davies, Samir Khuller, Shirley Zhang

摘要:

在本文中,我们研究了以下批调度模型:找到一个时间表,最小化总流动时间为$n$均匀长度的工作,释放时间和最后期限,其中机器只积极处理作业在最多$k$同步批次的大小最多$B$。以前的工作,这样的批调度模型只考虑了可行性,没有考虑流时间的时间表。但是,从调度程序的角度最小化成本的算法(例如最小化处理器活动时间的算法)可能导致总流时间任意高的调度\cite{ChangGabowKhuller}。从客户的角度来看,这样的时间表没有价值。作为回应,我们的工作提供了动态的程序,最大限度地减少流动时间的活动时间限制。我们的主要贡献集中在工作与同意的最后期限,对于这样的工作实例,我们引入动态程序,实现运行时的O $(B \cdot k \cdot n)$的单位作业和O $(B \cdot k \cdot n^5)$的统一长度的工作。这些结果改进后,我们修改了一个不同的,经典的动态规划的方法,由巴蒂斯特。虽然修改后的DP在最后期限不一致时工作,但该解决方案更昂贵,具有运行时$O(B \cdot k^2 \cdot n^7)$ \cite{Baptiste00}。

英文摘要:

In this paper, we study the following batch scheduling model: find a schedule that minimizes total flow time for $n$ uniform length jobs, with release times and deadlines, where the machine is only actively processing jobs in at most $k$ synchronized batches of size at most $B$. Prior work on such batch scheduling models has considered only feasibility with no regard to the flow time of the schedule. However, algorithms that minimize the cost from the scheduler's perspective -- such as ones that minimize the active time of the processor -- can result in schedules where the total flow time is arbitrarily high \cite{ChangGabowKhuller}. Such schedules are not valuable from the perspective of the client. In response, our work provides dynamic programs which minimize flow time subject to active time constraints. Our main contribution focuses on jobs with agreeable deadlines; for such job instances, we introduce dynamic programs that achieve runtimes of O$(B \cdot k \cdot n)$ for unit jobs and O$(B \cdot k \cdot n^5)$ for uniform length jobs. These results improve upon our modification of a different, classical dynamic programming approach by Baptiste. While the modified DP works when deadlines are non-agreeable, this solution is more expensive, with runtime $O(B \cdot k^2 \cdot n^7)$ \cite{Baptiste00}.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑