Scheduling preemptable tasks on parallel processors with limited availability

Błażewicz, Jacek; Drozdowski, Maciej; Formanowicz, Piotr; Kubiak, Wiesław; Schmidt, Günter

doi:10.1016/s0167-8191(00)00035-1

Cited by 55 publications

(89 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The late work models the amount of work not executed on time, which determines, e.g., the loss of income caused by not executing parts of jobs on time, the fine which has to be paid to customers in case of delay, or just the amount of work which has to be scheduled in the following interval, because it was not completed in the assumed planning horizon. Jobs may also model pieces of information (Blazewicz 1984) which have to be collected by sensing devices before a given deadline. Minimizing late work corresponds to minimizing information loss, directly influencing the efficiency of control algorithms.…”

Section: Problem Definition and Related Workmentioning

confidence: 99%

“…Late work parameter, Y j , was first introduced by Blazewicz (1984), who called it information loss, referring to a possible application of this performance measure in control systems. The phrase late work was proposed by Potts and Van Wassenhove (1991), who denoted this parameter as V j , which appears in the literature alongside Y j .…”

Section: Problem Definition and Related Workmentioning

confidence: 99%

“…It was first proposed by Blazewicz (1984). Soon a number of research groups focused on this performance measure, obtaining a set of interesting results.…”

Section: Introductionmentioning

confidence: 99%

“…The single-machine case was considered mainly by Potts and Van Wassenhove (1991), Hochbaum and Shamir (1990), Hariri et al (1995), Kovalyov et al (1994), Kethley and Alidaee (2002), and, more recently, by Lin and Hsu (2005), Zhang and Wang (2005), as well as by Ren et al (2009). The parallel machines environment was studied by Blazewicz (1984), Blazewicz and Finke (1987), and Leung (2004), while the dedicated machines environment was investigated mainly by Blazewicz et al (2004aBlazewicz et al ( , 2005aBlazewicz et al ( , 2007 and by Leung (2004), as well as by Lin et al (2006). The state of the art for late work scheduling was presented by Leung (2004) in the context of imprecise computations and then by Sterna (2011).…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Scheduling on parallel identical machines with late work criterion: Offline and online cases

Chen

Sterna

Han

et al. 2015

J Sched

View full text Add to dashboard Cite

In the paper, we consider the problem of scheduling jobs on parallel identical machines with the late work criterion and a common due date, both offline and online cases. Since the late work criterion has not been studied in the online mode so far, the analysis of the online problem is preceded by the analysis of the offline problem, whose complexity status has not been formally stated in the literature yet. Namely, for the offline mode, we prove that the twomachine problem is binary NP-hard, and the general case is unary NP-hard. In the online mode we assume that jobs arrive in the system one by one, i.e., we consider the online over list model. We give an algorithm with a competitive ratio being a function of the number of machines, and we prove the optimality of this approach for two identical machines.

show abstract

Section: Problem Definition and Related Workmentioning

confidence: 99%

Section: Problem Definition and Related Workmentioning

confidence: 99%

“…It was first proposed by Blazewicz (1984). Soon a number of research groups focused on this performance measure, obtaining a set of interesting results.…”

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Scheduling on parallel identical machines with late work criterion: Offline and online cases

Chen

Sterna

Han

et al. 2015

J Sched

View full text Add to dashboard Cite

show abstract

“…Porto et al [28] apply the tabu search algorithm to the static task scheduling problem in a heterogeneous multiprocessor environment under precedence constraints. More task scheduling algorithms are addressed in [29][30][31][32][33][34][35][36][37][38].…”

Section: Related Workmentioning

confidence: 99%

A performance study of multiprocessor task scheduling algorithms

2007

View full text Add to dashboard Cite

Multiprocessor task scheduling is an important and computationally difficult problem. A large number of algorithms were proposed which represent various tradeoffs between the quality of the solution and the computational complexity and scalability of the algorithm. Previous comparison studies have frequently operated with simplifying assumptions, such as independent tasks, artificially generated problems or the assumption of zero communication delay. In this paper, we propose a comparison study with realistic assumptions. Our target problems are two well known problems of linear algebra: LU decomposition and Gauss-Jordan elimination. Both algorithms are naturally parallelizable but have heavy data dependencies. The communication delay will be explicitly considered in the comparisons. In our study, we consider nine scheduling algorithms which are frequently used to the best of our knowledge: min-min, chaining, A * , genetic algorithms, simulated annealing, tabu search, HLFET, ISH, and DSH with task duplication. Based on experimental results, we present a detailed analysis of the scalability, advantages and disadvantages of each algorithm.

show abstract

New applications of the Muntz and Coffman algorithm

Drozdowski

2001

J. Sched.

Self Cite

View full text Add to dashboard Cite

SUMMARYMuntz and Co man proposed an algorithm to solve the problem of scheduling preemptable tasks either with arbitrary precedences on two processors, or tasks with tree-like precedences on an arbitrary number of processors, for the schedule length criterion. In this work, we demonstrate that this well-known algorithm has interesting features which extend its application to many other scheduling problems. Three deterministic scheduling problems for preemptable tasks are considered. Though these problems have diverse formulations, they have at least one thing in common: Basically their optimization algorithms boil down to the Muntz-Co man algorithm. The foundations of the Muntz-Co man algorithm versatility are established.

show abstract

Scheduling preemptable tasks on parallel processors with limited availability

Cited by 55 publications

References 14 publications

Scheduling on parallel identical machines with late work criterion: Offline and online cases

Scheduling on parallel identical machines with late work criterion: Offline and online cases

A performance study of multiprocessor task scheduling algorithms

New applications of the Muntz and Coffman algorithm

Contact Info

Product

Resources

About