arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2212.07002cs.DS
收藏

将实时的作业与能量收集交织在一起以最大化吞吐量

Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput

Baruch Schieber, Bhargav Samineni, Soroush Vahidi

摘要:

受无电池物联网设备的启发,我们考虑以下调度问题。输入包括$n$单位时间作业$\mathcal{J} = \{J_1, \ldots, J_n\}$,其中每个作业$J_i$具有释放时间$r_i$、到期日$d_i$、能量需求$e_i$和权重$w_i$。我们认为时间是有槽的;因此,所有与时间相关的作业值都是指槽。设$T=\max_i\{d_i\}$。输入还包括每个时隙$t$($1 \leq t \leq T$)的$h_t$值,其是在该时隙上可收获的能量。在没有执行作业的时间段收集能量。目标是找到一个可行的调度,最大化的权重调度的工作。如果对于调度中的每个作业$J_j$及其对应的时隙$t_j$,$t_{j} \neq t_{j'}$,如果${j} \neq {j'}$,$r_j \leq t_j \leq d_j$,并且在$t_j$之前的可用能量至少为$e_j$,则调度是可行的。据我们所知,我们是第一个考虑这个问题的理论方面。在这项工作中,我们展示了以下内容。(1)当所有作业具有相同的$r_i, d_i$和$w_i$时的多项式时间算法。(2)当所有作业具有相同的$w_i$但具有任意的$r_i$和$d_i$时的$\frac{1}{2}$近似算法。(3)当所有作业都具有相同的$r_i$和$d_i$但具有任意的$w_i$时的FPTAS。(4)约简表明问题的所有变体,其中至少有一个属性$r_i$,$d_i$或$w_i$对于所有作业都不相同,是NP难的。

英文摘要:

Motivated by baterryless IoT devices, we consider the following scheduling problem. The input includes $n$ unit time jobs $\mathcal{J} = \{J_1, \ldots, J_n\}$, where each job $J_i$ has a release time $r_i$, due date $d_i$, energy requirement $e_i$, and weight $w_i$. We consider time to be slotted; hence, all time related job values refer to slots. Let $T=\max_i\{d_i\}$. The input also includes an $h_t$ value for every time slot $t$ ($1 \leq t \leq T$), which is the energy harvestable on that slot. Energy is harvested at time slots when no job is executed. The objective is to find a feasible schedule that maximizes the weight of the scheduled jobs. A schedule is feasible if for every job $J_j$ in the schedule and its corresponding slot $t_j$, $t_{j} \neq t_{j'}$ if ${j} \neq {j'}$, $r_j \leq t_j \leq d_j$, and the available energy before $t_j$ is at least $e_j$. To the best of our knowledge, we are the first to consider the theoretical aspects of this problem. In this work we show the following. (1) A polynomial time algorithm when all jobs have identical $r_i, d_i$ and $w_i$. (2) A $\frac{1}{2}$-approximation algorithm when all jobs have identical $w_i$ but arbitrary $r_i$ and $d_i$. (3) An FPTAS when all jobs have identical $r_i$ and $d_i$ but arbitrary $w_i$. (4) Reductions showing that all the variants of the problem in which at least one of the attributes $r_i$, $d_i$, or $w_i$ are not identical for all jobs are NP-Hard.

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

↑