A competitive algorithm for throughput maximization on identical machines

IF 2.2 2区数学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING

Mathematical Programming Pub Date : 2024-01-10 DOI:10.1007/s10107-023-02045-0

Benjamin Moseley, Kirk Pruhs, Clifford Stein, Rudy Zhou

引用次数: 0

Abstract

This paper considers the basic problem of scheduling jobs online with preemption to maximize the number of jobs completed by their deadline on m identical machines. The main result is an O(1) competitive deterministic algorithm for any number of machines \(m >1\).

Abstract Image

查看原文本刊更多论文

在相同机器上实现吞吐量最大化的竞争性算法

本文研究了一个基本问题，即通过抢占式在线作业调度，在 m 台相同机器上最大限度地提高在截止日期前完成作业的数量。主要结果是针对任意机器数量（m >1\）的 O（1）竞争确定性算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Mathematical Programming 数学-计算机：软件工程

CiteScore

5.70

自引率

11.10%

发文量

160

审稿时长

4-8 weeks

期刊介绍： Mathematical Programming publishes original articles dealing with every aspect of mathematical optimization; that is, everything of direct or indirect use concerning the problem of optimizing a function of many variables, often subject to a set of constraints. This involves theoretical and computational issues as well as application studies. Included, along with the standard topics of linear, nonlinear, integer, conic, stochastic and combinatorial optimization, are techniques for formulating and applying mathematical programming models, convex, nonsmooth and variational analysis, the theory of polyhedra, variational inequalities, and control and game theory viewed from the perspective of mathematical programming.