Optimal Parallel Scheduling Algorithms in WDM Packet Interconnects

2007 ◽  
pp. 23-1-23-19
Author(s):  
Zhenghao Zhang ◽  
Yuanyuan Yang
Keyword(s):  
Scheduling Algorithms ◽  
Parallel Scheduling

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.

Parallel Scheduling Algorithms

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

scholarly journals STATIC AND DYNAMIC BNP PARALLEL SCHEDULING ALGORITHMS FOR DISTRIBUTED DATABASE

2011 ◽  
Vol 1 (1) ◽  
pp. 10-15 ◽  
Author(s):  
Manik Sharma ◽  
Smriti Smriti
Keyword(s):  
Parallel Processing ◽  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Distributed Database ◽  
Parallel Scheduling ◽  
Processor Utilization ◽  
Vast Amount ◽  
Speed Up ◽  
The Impact

Parallel processing is a technique of executing the multiple tasksconcurrently on different processors. Parallel processing is usedto solve the complex problems that require vast amount ofprocessing time. Task scheduling is one of the major problemsof parallel processing. The objective of this study is to analyzethe performance of static (HLFET) and dynamic (DLS) BNPparallel scheduling algorithm for allocating the tasks ofdistributed database over number of processors. In the wholestudy the focus will be given on measuring the impact ofnumber of processors on different metrics of performance likemakespan, speed up and processor utilization by using HLFETand DLS BNP task scheduling algorithms.

Sign in / Sign up

Export Citation Format

Share Document