Skip to Main content Skip to Navigation

The management of multiple submissions in parallel systems : the fair scheduling approach

Abstract : We study the problem of scheduling in parallel and distributed systems with multiple users. New platforms for parallel and distributed computing offers very large power which allows to contemplate the resolution of complex interactive applications. Nowadays, it is still difficult to use this power efficiently due to lack of resource management tools. The work done in this thesis lies in this context: to analyse and develop efficient algorithms for manage computing resources shared among multiple users. We analyze scenarios with many submissions issued from multiple users over time. These submissions contain one or more jobs and the set of submissions are organized in successive campaigns. Any job from a campaign can not start until all the jobs from the previous campaign are completed. Each user is interested inminimizing the sum of flow times of the campaigns. In the first part of this work, we define a theoretical model for Campaign Scheduling under restrictive assumptions and we show that, in the general case, it is NP-hard. For the single-user case, we show that an ρ-approximation scheduling algorithm for the (classic) parallel job scheduling problem is also an ρ-approximation for the Campaign Scheduling problem. For the general case with k users, we establish a fairness criteria inspired by time sharing. Then, we propose FairCamp, a scheduling algorithm which uses campaign deadlines to achieve fairness among users between consecutive campaigns. We prove that FairCamp increases the flow time of each user by a factor of at most ρ compared with a machine dedicated to the user. We also prove that FairCamp is an ρ-approximation algorithm for the maximum stretch. We compare FairCamp to "First-Come-First-Served" (FCFS) by simulation. We showthat, compared with FCFS, FairCamp reduces the maximum stretch by up to 3.4 times. The difference is significant in systems used by many (k≻5) users. Our results show that, rather than just individual, independent jobs, campaignsof jobs can be handled by the scheduler efficiently and fairly.
Document type :
Complete list of metadatas

Cited literature [49 references]  Display  Hide  Download
Contributor : Abes Star :  Contact
Submitted on : Monday, January 8, 2018 - 3:44:34 PM
Last modification on : Saturday, October 17, 2020 - 8:58:07 PM


Version validated by the jury (STAR)


  • HAL Id : tel-01677743, version 1




Vinicius Gama Pinheiro. The management of multiple submissions in parallel systems : the fair scheduling approach. Symbolic Computation [cs.SC]. Université de Grenoble; Universidade de São Paulo (Brésil), 2014. English. ⟨NNT : 2014GRENM042⟩. ⟨tel-01677743⟩



Record views


Files downloads