Online scheduling in grids

Schwiegelshohn, Uwe; Tchernykh, Andrei; Yahyapour, Ramin

doi:10.1109/ipdps.2008.4536273

Cited by 53 publications

(42 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Job scheduling on a multiprocessor system has been studied for more than 30 years and is known to be NP-hard [26]. Scheduling in Grid systems, become more complicated with multiorganizational shared resources, therefore Grid scheduling is also NP-hard [8,22]. Solutions thus, apply some sort of heuristics and approximations as listed in Section 2.…”

Section: Our Model For Grid Allocationmentioning

confidence: 99%

On Efficiency of Multi-job Grid Allocation Based on Statistical Trace Data

et al. 2013

View full text Add to dashboard Cite

The ever growing number of computationintensive applications calls for utilizing large-scale, potentially interoperable distributed infrastructures. Nowadays, such distributed systems enable the management of heterogeneous scientific workflows of considerable sizes, where job scheduling and resource management is a crucial issue. In this paper we focus on the challenges of scheduling parameter sweep applications, a specific and commonly used type of workflows where ordering of job executions is irrelevant. A parameter sweep has a large set of independent job instances, called a multi-job, submitted for execution in a single step. In order to cope with the high uncertainty and unpredictable load of resources, and the si- multaneous submissions of multi-job instances, we propose a statistics-based brokering approach for allocating jobs to resources so that the makespan is minimised. Earlier studies claim that users' predictions on job runtime are inaccurate and unusable for scheduling. Our aim is to examine, whether statistical trace data for the same purpose is efficient compared to randomized allocation.

show abstract

Section: Our Model For Grid Allocationmentioning

confidence: 99%

On Efficiency of Multi-job Grid Allocation Based on Statistical Trace Data

et al. 2013

View full text Add to dashboard Cite

show abstract

“…Schwiegelshohn et al [6] studied a very similar problem, where the jobs can be scheduled in non-contiguous processors. Their algorithm is a 3-approximation for the maximum completion time (makespan) if all jobs are known in advance, and a 5-approximation for the makespan on the online, non-clairvoyant case.…”

Section: Related Workmentioning

confidence: 99%

Multi‐organization scheduling approximation algorithms

Cohen¹,

Cordeiro²,

Trystram³

et al. 2011

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYIn this paper we consider the problem of scheduling on computing platforms composed of several independent organizations, known as the Multi-Organization Scheduling Problem (MOSP). Each organization provides both resources and jobs and follows its own objectives. We are interested in the best way to minimize the makespan on the entire platform when the organizations behave in a selfish way. We study the complexity of the MOSP problem with two different local objectives-makespan and average completion time-and show that MOSP is strongly NP-Hard in both cases. We formally define a selfishness notion, by means of restrictions on the schedules. We prove that selfish behavior imposes a lower bound of 2 on the approximation ratio for the global makespan. We present various approximation algorithms of ratio 2 which validate selfishness restrictions. These algorithms are experimentally evaluated through simulation, exhibiting good average performances and presenting good fairness to organizations' local objectives.

show abstract

“…Motivated by grid computing systems, Schwiegelshohn, Tchernykh, and Yahyapour [5] studied a very similar problem, with the difference that the jobs can be sched-uled in non-contiguous processors instead of rectangles. They presented an algorithm with a guarantee that is a 3-approximation for the maximum completion time (makespan) when all the jobs are known in advance.…”

Section: B Related Workmentioning

confidence: 99%

Tight Analysis of Relaxed Multi-organization Scheduling Algorithms

Cordeiro

Dutot

Mounié

et al. 2011

2011 IEEE International Parallel &Amp; Distributed Processing Symposium

View full text Add to dashboard Cite

Abstract-The goal of this paper is to study how limited cooperation can impact the quality of the schedule obtained by multiple independent organizations in a typical grid computing platform. This relaxed version of the problem known as the Multi-Organization Scheduling Problem (MOSP) models an environment where organizations providing both resources and jobs tolerate a bounded degradation on the makespan of their own jobs in order to minimize the makespan over the entire platform.More precisely, the technical contributions are the following. First, we improve the existing inapproximation bounds for this problem proving that what was previously though as not polynomially approximable (unless P = N P ) is actually not approximable at all. We achieve this using two families of instances whose Pareto optimal solutions are on par with the previous inaproximability bounds.Then, we present two algorithms that solve the problem with approximation ratios of (2; 3/2) and (3; 4/3) respectively. This means that when using the first (second) algorithm, if an organization tolerates that the completion time of its last job cannot exceed twice (three times) the time it would have obtained by itself, then the algorithm provides a solution that is a 3/2-approximation (4/3-approximation) for the optimal global makespan. Both algorithms are efficient since their performance ratio correspond to the Pareto optimal solutions of the previously defined instances.

show abstract

Online scheduling in grids

Abstract: This paper addresses nonclairvoyant and nonpreemptive online job scheduling in Grids.In

Cited by 53 publications

References 12 publications

On Efficiency of Multi-job Grid Allocation Based on Statistical Trace Data

On Efficiency of Multi-job Grid Allocation Based on Statistical Trace Data

Multi‐organization scheduling approximation algorithms

Tight Analysis of Relaxed Multi-organization Scheduling Algorithms

Contact Info

Product

Resources

About