Visual analogy videos for understanding fundamental parallel scheduling policies

2021 ◽  
Author(s):  
Nasser Giacaman ◽  
Oliver Sinnen ◽  
Joel Adams
Keyword(s):  
Parallel Scheduling ◽  
Scheduling Policies ◽  
Visual Analogy

A Survey of Low-Energy Parallel Scheduling Algorithms

2021 ◽  
pp. 1-1
Author(s):  
Guoqi Xie ◽  
Xiongren Xiao ◽  
Hao Peng ◽  
Renfa Li ◽  
Keqin Li
Keyword(s):  
Scheduling Algorithms ◽  
Low Energy ◽  
Parallel Scheduling

Parallel Scheduling Algorithms Investigation of Support Strict Resource Reservation from Grid

2014 ◽  
Vol 519-520 ◽  
pp. 108-113 ◽  
Author(s):  
Jun Chen ◽  
Bo Li ◽  
Er Fei Wang
Keyword(s):  
Parallel Computing ◽  
Resource Utilization ◽  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Resource Reservation ◽  
Parallel Scheduling ◽  
Scheduling Model ◽  
Computing Grid ◽  
Simulation Results ◽  
Reservation Request

This paper studies resource reservation mechanisms in the strict parallel computing grid,and proposed to support the parallel strict resource reservation request scheduling model and algorithms, FCFS and EASY backfill analysis of two important parallel scheduling algorithm, given four parallel scheduling algorithms supporting resource reservation. Simulation results of four algorithms of resource utilization, job bounded slowdown factor and the success rate of Advanced Reservation (AR) jobs were studied. The results show that the EASY backfill + firstfit algorithm can ensure QoS of AR jobs while taking into account the performance of good non-AR jobs.

scholarly journals Optimal scheduling policies in time sharing service systems

1995 ◽  
Vol 22 (10-12) ◽  
pp. 247-259 ◽  
Author(s):  
M. Ohnishi ◽  
H. Maeda ◽  
T. Ibaraki
Keyword(s):  
Service Systems ◽  
Optimal Scheduling ◽  
Time Sharing ◽  
Scheduling Policies

scholarly journals Optimality of index policies for stochastic scheduling with switching penalties

1992 ◽  
Vol 29 (04) ◽  
pp. 957-966 ◽  
Author(s):  
Mark P. Van Oyen ◽  
Dimitrios G. Pandelis ◽  
Demosthenis Teneketzis
Keyword(s):  
Optimal Policy ◽  
Time Delays ◽  
Stochastic Scheduling ◽  
Optimal Scheduling ◽  
Scheduling Policies ◽  
Parallel Queues ◽  
Lump Sum ◽  
Index Policies ◽  
Service Policy ◽  
The Impact

We investigate the impact of switching penalties on the nature of optimal scheduling policies for systems of parallel queues without arrivals. We study two types of switching penalties incurred when switching between queues: lump sum costs and time delays. Under the assumption that the service periods of jobs in a given queue possess the same distribution, we derive an index rule that defines an optimal policy. For switching penalties that depend on the particular nodes involved in a switch, we show that although an index rule is not optimal in general, there is an exhaustive service policy that is optimal.

Parallel Scheduling Algorithms

1983 ◽  
Vol 31 (1) ◽  
pp. 24-49 ◽  
Author(s):  
Eliezer Dekel ◽  
Sartaj Sahni
Keyword(s):  
Scheduling Algorithms ◽  
Parallel Scheduling
Sign in / Sign up

Export Citation Format

Share Document