Optimal Scheduling Algorithms for Communication Constrained Parallel Processing

2002 ◽  
pp. 197-206 ◽  
Author(s):  
D. Turgay Altilar ◽  
Yakup Paker
Keyword(s):  
Parallel Processing ◽  
Scheduling Algorithms ◽  
Optimal Scheduling

Parallel Processing of Robot Dynamics Simulation Using Optimal Multiprocessor Scheduling Algorithms

1988 ◽  
Vol 19 (10) ◽  
pp. 45-54
Author(s):  
Hironori Kasahara ◽  
Masahiko Iwata ◽  
Seinosuke Narita ◽  
Hirofumi Fujii
Keyword(s):  
Parallel Processing ◽  
Scheduling Algorithms ◽  
Multiprocessor Scheduling ◽  
Dynamics Simulation ◽  
Robot Dynamics

On Optimal Scheduling Algorithms for Time-Shared Systems

1981 ◽  
Vol 28 (3) ◽  
pp. 477-486 ◽  
Author(s):  
Leonard Kleinrock ◽  
Arne Nilsson
Keyword(s):  
Scheduling Algorithms ◽  
Optimal Scheduling

On Optimal Scheduling Algorithms for Small Generalized Switches

2010 ◽  
Vol 18 (5) ◽  
pp. 1585-1598 ◽  
Author(s):  
Tianxiong Ji ◽  
Eleftheria Athanasopoulou ◽  
R. Srikant
Keyword(s):  
Scheduling Algorithms ◽  
Optimal Scheduling

On Optimal Scheduling Algorithms for Well-Structured Workflows in the Cloud with Budget and Deadline Constraints

2016 ◽  
Vol 26 (02) ◽  
pp. 1650009 ◽  
Author(s):  
Yang Wang ◽  
Wei Shi ◽  
Kenneth B. Kent
Keyword(s):  
Optimization Problem ◽  
Virtual Machines ◽  
Scheduling Algorithms ◽  
Optimal Scheduling ◽  
Optimal Algorithms ◽  
Programming Technique ◽  
Total Budget ◽  
The Common ◽  
Deadline Constraints ◽  
The Cost

In this paper, we consider optimal scheduling algorithms for scientific workows with two typical structures, fork&join and tree, on a set of provisioned (virtual) machines under budget and deadline constraints in cloud computing. First, given a total budget B, by leveraging a bi-step dynamic programming technique, we propose optimal algorithms in pseudo-polynomial time for both workows with minimum scheduling length as a goal. Our algorithms are efficient if the total budget B is polynomially bounded by the number of jobs in respective workows, which is usually the common case in practice. Second, we consider the dual of this optimization problem to minimize the cost when the deadline of the computation D is fixed. We change this problem into the standard multiple-choice knapsack problem via a parallel transformation.

Sign in / Sign up

Export Citation Format

Share Document