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

最小化不相关机器上的流程时间

Minimizing Flow-Time on Unrelated Machines

Nikhil Bansal, Janardhan Kulkarni

摘要:

我们考虑一些流时间最小化问题中的不相关的机器设置。在此设置中,存在一组$m$机器和一组$n$作业,并且每个作业$j$在机器$i$上具有与机器相关的处理时间$p_{ij}$。作业流时间是作业在系统中所花费的总时间(完成时间减去到达时间),是最自然的服务质量度量之一。我们显示了以下两个结果:一个$O(\min(\log^2 n,\log n \log P))$近似算法的总流时间最小化,和$O(\log n)$近似最大流时间最小化。这里,$P$是最大作业大小与最小作业大小之比。这是第一个已知的多对数保证这两个问题。

英文摘要:

We consider some flow-time minimization problems in the unrelated machines setting. In this setting, there is a set of $m$ machines and a set of $n$ jobs, and each job $j$ has a machine dependent processing time of $p_{ij}$ on machine $i$. The flow-time of a job is the total time the job spends in the system (completion time minus its arrival time), and is one of the most natural quality of service measure. We show the following two results: an $O(\min(\log^2 n,\log n \log P))$ approximation algorithm for minimizing the total-flow time, and an $O(\log n)$ approximation for minimizing the maximum flow-time. Here $P$ is the ratio of maximum to minimum job size. These are the first known poly-logarithmic guarantees for both the problems.

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

↑