Filters








11,373 Hits in 4.5 sec

A system-centric metric for the evaluation of online job schedules

Uwe Schwiegelshohn
2010 Journal of Scheduling  
The paper presents a metric that is well suited to evaluate online job schedules for massively parallel processors.  ...  In addition, it also supports the evaluation of online schedules and allows extensions to consider additional job based system policies.  ...  Definitions and Previous Results In our basic scenario, we use the Pm machine environment, that is, all m processors of a parallel machine are identical.  ... 
doi:10.1007/s10951-010-0206-9 fatcat:3xqggn4bove5jnd5nuxmmdakuq

Semi-online Scheduling: A Survey [article]

Debasis Dwibedy, Rakesh Mohanty
2020 arXiv   pre-print
They envisioned semi-online scheduling as a practically significant model and obtained improved results for 2-identical machine setting.  ...  In online scheduling, jobs are available one by one and each job must be scheduled irrevocably before the availability of the next job.  ...  -Design of optimal semi-online scheduling algorithm with at most 1.5-competitiveness for scheduling on m-identical machines (m ≥ 2) under GOS and known Opt.  ... 
arXiv:2005.08614v1 fatcat:o72fqynztrgxziwk46fsqbn5hu

Optimal semi-online preemptive algorithms for machine covering on two uniform machines

Yong He, Yiwei Jiang
2005 Theoretical Computer Science  
In this paper, we consider the semi-online preemptive scheduling problem with decreasing job sizes on two uniform machines.  ...  We design optimal deterministic semi-online algorithms for every machine speed ratio s ∈ [1, ∞), and show that idle time is required during the assignment procedure of algorithms for any s > √ 6/2.  ...  Then schedule p 1 t on machine M 1 within the idle time interval before L 2 1 , p 2 t on M 2 at time L 2 1 , and p 3 t on M 1 at time L 1 1 , respectively. Return step 2. 4.  ... 
doi:10.1016/j.tcs.2005.02.008 fatcat:6i7byrgzrbf6fae6uq3phzr6ji

Online optimization of busy time on parallel machines

Mordechai Shalom, Ariella Voloshin, Prudence W.H. Wong, Fencol C.C. Yung, Shmuel Zaks
2014 Theoretical Computer Science  
We consider the following online scheduling problem in which the input consists of n jobs to be scheduled on identical machines of bounded capacity g (the maximum number of jobs that can be processed simultaneously  ...  At any given time t a machine M i is said to be busy if there is at least one job J scheduled on it such that t ∈ [r J , c J ], otherwise M i is said to be idle at time t.  ...  Given a (partial) schedule s : J → M, we denote by J s i the set of jobs assigned to machine M i by schedule s, i.e. J s i def = s −1 (M i ).  ... 
doi:10.1016/j.tcs.2014.07.017 fatcat:ybcoraybibgejmlyb6u3bxclfu

Online Optimization of Busy Time on Parallel Machines [chapter]

Mordechai Shalom, Ariella Voloshin, Prudence W. H. Wong, Fencol C. C. Yung, Shmuel Zaks
2012 Lecture Notes in Computer Science  
We consider the following online scheduling problem in which the input consists of n jobs to be scheduled on identical machines of bounded capacity g (the maximum number of jobs that can be processed simultaneously  ...  At any given time t a machine M i is said to be busy if there is at least one job J scheduled on it such that t ∈ [r J , c J ], otherwise M i is said to be idle at time t.  ...  Given a (partial) schedule s : J → M, we denote by J s i the set of jobs assigned to machine M i by schedule s, i.e. J s i def = s −1 (M i ).  ... 
doi:10.1007/978-3-642-29952-0_43 fatcat:msfrgmpsb5fjjmqdbr3pzlwdrq

Utilization of nonclairvoyant online schedules

Mohamed Eid Hussein, Uwe Schwiegelshohn
2006 Theoretical Computer Science  
This paper addresses the analysis of nondelay, nonpreemptive, nonclairvoyant online schedules for independent jobs on m identical machines. In our online model, all jobs are submitted over time.  ...  Therefore, we directly address utilization and determine the maximum deviation from the optimal utilization for the given scheduling problem.  ...  Let be a job system and S be a schedule for on m identical machines.  ... 
doi:10.1016/j.tcs.2006.06.027 fatcat:3u3mtope4rhgfjrnn6wjfiq3l4

Non-Preemptive Scheduling on Machines with Setup Times [article]

Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, Sören Riechers
2015 arXiv   pre-print
Consider the problem in which n jobs that are classified into k types are to be scheduled on m identical machines without preemption.  ...  A machine requires a proper setup taking s time units before processing jobs of a given type. The objective is to minimize the makespan of the resulting schedule.  ...  . , n} of n independent jobs (i.e. there are no precedence constraints for jobs) that are to be scheduled on m identical machines M = {M 1 , . . . , M m }.  ... 
arXiv:1504.07066v1 fatcat:hsr32ljqbbhnrdpywevnip4r7q

Online Algorithms for Machine Minimization [article]

Nikhil Devanur, Konstantin Makarychev, Debmalya Panigrahi, Grigory Yaroslavtsev
2014 arXiv   pre-print
processing lengths on a minimum number of identical machines.  ...  Finally, we consider the complimentary problem of throughput maximization where the goal is to maximize the sum of weights of scheduled jobs on a fixed set of identical machines (introduced by Bar-Noy  ...  A related problem is that of scheduling jobs on identical machines where each job has to be scheduled in one among a given set of discrete intervals.  ... 
arXiv:1403.0486v2 fatcat:it6w24am3ngcjgugonax2uexvi

Online Scheduling with Makespan Minimization: State of the Art Results, Research Challenges and Open Problems [article]

Debasis Dwibedy, Rakesh Mohanty
2020 arXiv   pre-print
This paper highlights the state of the art contributions for online scheduling of a sequence of independent jobs on identical and uniform related machines with a special focus on preemptive and non-preemptive  ...  In this problem, a sequence of jobs is received one by one in order by the scheduler for scheduling over a number of machines.  ...  [34] for non-preemptive online scheduling on m-identical machines.  ... 
arXiv:2001.04698v1 fatcat:4pnxnrya6nfvdcuwx5tstljb3m

Online Throughput Maximization on Unrelated Machines: Commitment is No Burden [article]

Franziska Eberle, Nicole Megow, Kevin Schewior
2021 arXiv   pre-print
Somewhat surprisingly, this is the same optimal performance bound (up to constants) as for scheduling without commitment on a single machine.  ...  1+ε times its processing time on each eligible machine.  ...  [30] give an O 1 ε 2 -competitive online algorithm for scheduling on identical parallel machines.  ... 
arXiv:1912.10769v2 fatcat:3qfwx5t73vcgbpkeoz7rafnodu

Scheduling with processing set restrictions: A survey

Joseph Y.-T. Leung, Chung-Lun Li
2008 International Journal of Production Economics  
Our survey covers offline and online problems, as well as nonpreemptive and preemptive scheduling environments.  ...  These include "scheduling typed task systems," "multi-purpose machine scheduling," "scheduling with eligibility constraints," "scheduling with processing set restrictions," and "semimatchings for bipartite  ...  Jiang et al. (2006) consider online scheduling on two identical machines where idle time between jobs is not allowed on either machine.  ... 
doi:10.1016/j.ijpe.2008.09.003 fatcat:2e7mynkf7bfn7jv4uxbqmbkbti

Online Hierarchical Job Scheduling on Grids [chapter]

Andrei Tchernykh, Uwe Schwiegelshohn, Ramin Yahyapour, Nikolai Kuzjurin
2008 From Grids to Service and Pervasive Computing  
In this paper, we address non preemptive online scheduling of parallel jobs on a Grid. The Grid consists of a large number of identical processors that are divided into several machines.  ...  We consider a Grid scheduling model with two stages. At the first stage, jobs are allocated to a suitable machine while at the second stage, local scheduling is applied to each machine independently.  ...  Further, we will compare our approach with other existing Grid scheduling strategies which are typically based on heuristics. m . m i denotes the number of identical processors of machine N i .  ... 
doi:10.1007/978-0-387-09455-7_6 fatcat:x5dmfmnmtrclxmhx2khq3rgxsy

Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation

Leah Epstein, Arik Ganot
2007 Theory of Computing Systems  
We consider three versions of this problem, preemptive semi-online, non-preemptive on-line and preemptive on-line scheduling.  ...  We study the problem of on-line scheduling on two uniformly related machines where the on-line algorithm has resources different from those of the off-line algorithm.  ...  Seiden, Sgall and Woeginger [31] studied semi-online preemptive scheduling on identical machines.  ... 
doi:10.1007/s00224-007-9007-8 fatcat:rfy3kblbxngevhtq7fq7n2giri

Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation [chapter]

Leah Epstein, Arik Ganot
2004 Lecture Notes in Computer Science  
We consider three versions of this problem, preemptive semi-online, non-preemptive on-line and preemptive on-line scheduling.  ...  We study the problem of on-line scheduling on two uniformly related machines where the on-line algorithm has resources different from those of the off-line algorithm.  ...  Seiden, Sgall and Woeginger [31] studied semi-online preemptive scheduling on identical machines.  ... 
doi:10.1007/978-3-540-24592-6_9 fatcat:fouyhkxuyvgazn4mzukynk4wqu

Online Bounded Analysis [article]

Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
2017 arXiv   pre-print
Through a collection of online problems, including machine scheduling, bin packing, dual bin packing, and seat reservation, we investigate the significance of this particular offline advantage.  ...  , not just on the entire final request sequence, but also on any prefix of that sequence.  ...  Theorem 2 For the problem of minimizing makespan for online job scheduling on m identical machines, GREEDY has online-bounded ratio 2 − 1 m−1 .  ... 
arXiv:1602.06708v2 fatcat:frvmacnm6fh6vmdssvjeqi42ma
« Previous Showing results 1 — 15 out of 11,373 results