30,039 research outputs found
Online scheduling on three uniform machines
AbstractThis paper investigates the online scheduling on three uniform machines problem. Denote by sj the speed of each machine, j=1,2,3. Assume 0<s1≤s2≤s3, and let s=s2/s1 and t=s3/s2 be two speed ratios. We show the greedy algorithm LS is an optimal online algorithm when the speed ratios (s,t)∈G1∪G2, where G1={(s,t)|1≤t<1+316,s≥3t5+2t−6t2} and G2={(s,t)|s(t−1)t≥1+s,s≥1,t≥1}. The competitive ratio of LS is 1+s+2sts+st when (s,t)∈G1 and 1+sst+1 when (s,t)∈G2. Moreover, for the general speed ratios, we show the competitive ratio of LS is no more than min{1+s+2sts+st,1+sst+1,1+s+3st1+s+st} and its overall competitive ratio is 2 which matches the overall lower bound of the problem
Randomized algorithms for fully online multiprocessor scheduling with testing
We contribute the first randomized algorithm that is an integration of
arbitrarily many deterministic algorithms for the fully online multiprocessor
scheduling with testing problem. When there are two machines, we show that with
two component algorithms its expected competitive ratio is already strictly
smaller than the best proven deterministic competitive ratio lower bound. Such
algorithmic results are rarely seen in the literature. Multiprocessor
scheduling is one of the first combinatorial optimization problems that have
received numerous studies. Recently, several research groups examined its
testing variant, in which each job arrives with an upper bound on
the processing time and a testing operation of length ; one can choose to
execute for time, or to test for time to obtain the
exact processing time followed by immediately executing the job for
time. Our target problem is the fully online version, in which the jobs arrive
in sequence so that the testing decision needs to be made at the job arrival as
well as the designated machine. We propose an expected -competitive randomized algorithm as a non-uniform
probability distribution over arbitrarily many deterministic algorithms, where
is the Golden ratio. When there are two
machines, we show that our randomized algorithm based on two deterministic
algorithms is already expected -competitive. Besides, we use Yao's principle to prove lower
bounds of and on the expected competitive ratio for any
randomized algorithm at the presence of at least three machines and only two
machines, respectively, and prove a lower bound of on the competitive
ratio for any deterministic algorithm when there are only two machines.Comment: 21 pages with 1 plot; an extended abstract to be submitte
Scheduling of unit-length jobs with bipartite incompatibility graphs on four uniform machines
In the paper we consider the problem of scheduling identical jobs on 4
uniform machines with speeds respectively.
Our aim is to find a schedule with a minimum possible length. We assume that
jobs are subject to some kind of mutual exclusion constraints modeled by a
bipartite incompatibility graph of degree , where two incompatible jobs
cannot be processed on the same machine. We show that the problem is NP-hard
even if . If, however, and ,
, then the problem can be solved to optimality in time
. The same algorithm returns a solution of value at most 2 times
optimal provided that . Finally, we study the case and give an -time -approximation algorithm in
all such situations
Pipelining the Fast Multipole Method over a Runtime System
Fast Multipole Methods (FMM) are a fundamental operation for the simulation
of many physical problems. The high performance design of such methods usually
requires to carefully tune the algorithm for both the targeted physics and the
hardware. In this paper, we propose a new approach that achieves high
performance across architectures. Our method consists of expressing the FMM
algorithm as a task flow and employing a state-of-the-art runtime system,
StarPU, in order to process the tasks on the different processing units. We
carefully design the task flow, the mathematical operators, their Central
Processing Unit (CPU) and Graphics Processing Unit (GPU) implementations, as
well as scheduling schemes. We compute potentials and forces of 200 million
particles in 48.7 seconds on a homogeneous 160 cores SGI Altix UV 100 and of 38
million particles in 13.34 seconds on a heterogeneous 12 cores Intel Nehalem
processor enhanced with 3 Nvidia M2090 Fermi GPUs.Comment: No. RR-7981 (2012
Competitive-Ratio Approximation Schemes for Minimizing the Makespan in the Online-List Model
We consider online scheduling on multiple machines for jobs arriving
one-by-one with the objective of minimizing the makespan. For any number of
identical parallel or uniformly related machines, we provide a
competitive-ratio approximation scheme that computes an online algorithm whose
competitive ratio is arbitrarily close to the best possible competitive ratio.
We also determine this value up to any desired accuracy. This is the first
application of competitive-ratio approximation schemes in the online-list
model. The result proves the applicability of the concept in different online
models. We expect that it fosters further research on other online problems
New Results on Online Resource Minimization
We consider the online resource minimization problem in which jobs with hard
deadlines arrive online over time at their release dates. The task is to
determine a feasible schedule on a minimum number of machines. We rigorously
study this problem and derive various algorithms with small constant
competitive ratios for interesting restricted problem variants. As the most
important special case, we consider scheduling jobs with agreeable deadlines.
We provide the first constant ratio competitive algorithm for the
non-preemptive setting, which is of particular interest with regard to the
known strong lower bound of n for the general problem. For the preemptive
setting, we show that the natural algorithm LLF achieves a constant ratio for
agreeable jobs, while for general jobs it has a lower bound of Omega(n^(1/3)).
We also give an O(log n)-competitive algorithm for the general preemptive
problem, which improves upon the known O(p_max/p_min)-competitive algorithm.
Our algorithm maintains a dynamic partition of the job set into loose and tight
jobs and schedules each (temporal) subset individually on separate sets of
machines. The key is a characterization of how the decrease in the relative
laxity of jobs influences the optimum number of machines. To achieve this we
derive a compact expression of the optimum value, which might be of independent
interest. We complement the general algorithmic result by showing lower bounds
that rule out that other known algorithms may yield a similar performance
guarantee
Preemptive scheduling on uniform parallel machines with controllable job processing times
In this paper, we provide a unified approach to solving preemptive scheduling problems with uniform parallel machines and controllable processing times. We demonstrate that a single criterion problem of minimizing total compression cost subject to the constraint that all due dates should be met can be formulated in terms of maximizing a linear function over a generalized polymatroid. This justifies applicability of the greedy approach and allows us to develop fast algorithms for solving the problem with arbitrary release and due dates as well as its special case with zero release dates and a common due date. For the bicriteria counterpart of the latter problem we develop an efficient algorithm that constructs the trade-off curve for minimizing the compression cost and the makespan
- …