Scheduling chains on uniform processors with communication delays

Kubiak, Wiesław; Penz, Bernard; Trystram, Denis

doi:10.1002/jos.121

Cited by 11 publications

(5 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…So, N P-completeness of BSSP is not trivial. Trystram et al proved N P-completeness of scheduling independent chains under the BSP model [14], [18]. This proof implies N P-completeness of BSSP in the case of scheduling independent chains.…”

Section: Proofs Of N P-completeness and Nonapproximabilitymentioning

confidence: 69%

On approximation of the bulk synchronous task scheduling problem

Fujimoto

Hagihara

2003

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

The bulk synchronous task scheduling problem (BSSPO) is known as an effective task scheduling problem for distributedmemory machines. This paper presents a proof of N P-completeness of the decision counterpart of BSSPO, even in the case of makespan of at most five. This implies nonapproximability of BSSPO, meaning that there is no approximation algorithm with performance guarantee smaller than 6 5 unless P ¼ N P. This paper also gives an approximation algorithm with a performance guarantee of two for BSSPO in several restricted cases.

show abstract

Section: Proofs Of N P-completeness and Nonapproximabilitymentioning

confidence: 69%

On approximation of the bulk synchronous task scheduling problem

Fujimoto

Hagihara

2003

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

show abstract

“…Kubiak, Penz and Trystram [90] showed that the problem of scheduling chains of unit execution time (UET) jobs on uniform processors with communication delays to minimize the makespan is NP-hard in the strong sense. They also presented a heuristic that generates solutions with known and relatively small, absolute error for this problem.…”

Section: Miscellaneous Problem With Preemptive Jobsmentioning

confidence: 99%

Literature Review of Single Machine Scheduling Problem with Uniform Parallel Machines

Panneerselvam¹,

Narayanan²

2010

IIM

View full text Add to dashboard Cite

This paper presents a survey of single machine scheduling problem with uniform parallel machines. The single machine scheduling problem with uniform parallel machines consists of n jobs, each with single operation, which are to be scheduled on m parallel machines with different speeds. These parallel machines are also called proportional machines or related machines. There are several measures of performance which are to be optimized in uniform parallel machines scheduling. Since, this scheduling problem is a combinatorial problem; usage of a heuristic is inevitable to obtain solution in polynomial time. This paper gives a classification of the literatures of this scheduling problem in three major categories, viz. offline scheduling, online scheduling and miscellaneous scheduling. In total, the available literatures are classified into 17 subgroups. Under each of the first two categories, the available literatures are discussed under different groups based on different measures of performance and non-preemptive/preemptive nature of the jobs. In the last category, the literatures are discussed under three subgroups, namely non-preemptive jobs, preemptive jobs and periodic jobs.

show abstract

“…The resulting scheduling problem (i.e. pre-emptable components executing on machines that differ in their rates of processing-but these rates are constant for the duration of the experiment-with migration overheads) is well defined in the literature on processor scheduling (see Kubiak et al 2002). Thus, we face a known problem in the (new) context of dynamically changing resources and applications (i.e.…”

Section: Experimental Studymentioning

confidence: 99%

Improved performance control on the Grid

Tellier

Riley

Freeman

2009

Phil. Trans. R. Soc. A.

View full text Add to dashboard Cite

In the 2005 paper by Mayes et al., a threshold-based performance control system (PerCo) was described and an initial experimental evaluation was presented. The objective of the current paper is to investigate the role of the threshold value in PerCo and to place the threshold-based rescheduling heuristic on a more principled footing. Simulation enables us to identify the 'optimal' threshold value for a particular application scenario, and we show that this optimal value results in a 10 per cent improvement in performance for the application considered by Mayes et al. Furthermore, we find that the execution time of this optimal threshold-based schedule is very close (within 0.5%) to the execution time that results from a linear programming optimal schedule.

show abstract

Scheduling chains on uniform processors with communication delays

Cited by 11 publications

References 7 publications

On approximation of the bulk synchronous task scheduling problem

On approximation of the bulk synchronous task scheduling problem

Literature Review of Single Machine Scheduling Problem with Uniform Parallel Machines

Improved performance control on the Grid

Contact Info

Product

Resources

About