The management of multiple submissions in parallel systems: the fair scheduling approach (2014)
- Authors:
- Autor USP: PINHEIRO, VINICIUS GAMA - IME
- Unidade: IME
- Sigla do Departamento: MAC
- Subjects: ALGORITMOS E ESTRUTURAS DE DADOS; ALGORITMOS DE SCHEDULING
- Agências de fomento:
- Language: Inglês
- Abstract: The High Performance Computing community is constantly facing new challenges due to the ever growing demand for processing power from scientific applications that represent diverse areas of human knowledge. Parallel and distributed systems are the key to speed up the execution of these applications as many jobs can be executed concurrently. These systems are shared by many users who submit their jobs over time and expect a fair treatment by the scheduler. The work done in this thesis lies in this context: to analyze and develop fair and efficient algorithms for managing computing resources shared among multiple users. We analyze scenarios with many submissions issued from multiple users over time. These submissions contain several jobs and the set of submissions are organized in successive campaigns. In what we define as the Campaign Scheduling model, the jobs of a campaign do not start until all the jobs from the previous campaign are completed. Each user is interested in minimizing the flow times of their own campaigns. This is motivated by the user submission behavior whereas the execution of a new campaign can be tuned by the results of the previous campaign. 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 also delivers the same approximation ratio for the Campaign Scheduling problem. For the general case with multiple users, we establish a fairness criteria inspired by time sharing. Then, we propose a scheduling algorithm called FairCamp which uses campaign deadlines to achieve fairness among users between consecutive campaigns. The second part of this work explores a more relaxed and realistic Campaign Scheduling model, provided with dynamic features.To handle this setting, we propose a new algorithm called OStrich whose principle is to maintain a virtual time-sharing schedule in which the same amount of processors is assigned to each user. The completion times in the virtual schedule determine the execution order on the physical processors. Then, the campaigns are interleaved in a fair way. For independent sequential jobs, we show that OStrich guarantees the stretch of a campaign to be proportional to campaigns size and to the total number of users. The stretch is used for measuring by what factor a workload is slowed down relatively to the time it takes to be executed on an unloaded system. Finally, the third part of this work extends the capabilities of OStrich to handle parallel jobs. This new version executes campaigns using a greedy approach and uses an event-based resizing mechanism to shape the virtual time-sharing schedule according to the system utilization ratio
- Imprenta:
- Data da defesa: 14.02.2014
-
ABNT
PINHEIRO, Vinicius Gama. The management of multiple submissions in parallel systems: the fair scheduling approach. 2014. Tese (Doutorado) – Universidade de São Paulo, São Paulo, 2014. Disponível em: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-31102016-100453. Acesso em: 16 abr. 2024. -
APA
Pinheiro, V. G. (2014). The management of multiple submissions in parallel systems: the fair scheduling approach (Tese (Doutorado). Universidade de São Paulo, São Paulo. Recuperado de http://www.teses.usp.br/teses/disponiveis/45/45134/tde-31102016-100453 -
NLM
Pinheiro VG. The management of multiple submissions in parallel systems: the fair scheduling approach [Internet]. 2014 ;[citado 2024 abr. 16 ] Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-31102016-100453 -
Vancouver
Pinheiro VG. The management of multiple submissions in parallel systems: the fair scheduling approach [Internet]. 2014 ;[citado 2024 abr. 16 ] Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-31102016-100453
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
