Scheduling Stochastic Real-Time Coflows in Unreliable Computing Machines

by   Yu-Pin Hsu, et al.
National Taipei University

We consider a distributed computing network consisting of a master machine and multiple computing machines. The master machine is running multiple jobs. Each job stochastically generates real-time coflows with a strict coflows' deadline. While a coflow is a collection of tasks that can be processed by corresponding computing machines, it is completed only when all its tasks are completed within the deadline. Moreover, we consider unreliable computing machines, whose processing speed is uncertain but is limited. Because of the limited processing abilities of the computing machines, an algorithm for scheduling coflows in the unreliable computing machines is critical to maximize the average number of completed coflows for each job. In this paper, we develop two scheduling algorithms, namely, a feasibility-optimal scheduling algorithm and an approximate scheduling algorithm. The feasibility-optimal scheduling algorithm can fulfill the largest region of jobs' requirements for the average number of completed coflows. However, the feasibility-optimal scheduling algorithm suffers from high computational complexity when the number of jobs is large. To address the issue, the approximate scheduling algorithm is proposed with a guaranteed approximation ratio in the worst-case scenario. The approximate scheduling algorithm is also validated in the average-case scenario via computer simulations.


page 1

page 2

page 3

page 4


Scheduling Stochastic Real-Time Jobs in Unreliable Workers

We consider a distributed computing network consisting of a master and m...

Online Scheduling of Time-Critical Tasks to Minimize the Number of Calibrations

We study the online scheduling problem where the machines need to be cal...

Analysis of Busy-Time Scheduling on Heterogeneous Machines

This paper studies a generalized busy-time scheduling model on heterogen...

Assigning and Scheduling Generalized Malleable Jobs under Submodular Processing Speeds

Malleable scheduling is a model that captures the possibility of paralle...

High Multiplicity Scheduling on Uniform Machines in FPT-Time

In high-multiplicity scheduling, jobs of the same size are encoded in an...

Flow-time Optimization For Concurrent Open-Shop and Precedence Constrained Scheduling Models

Scheduling a set of jobs over a collection of machines is a fundamental ...

Scheduling Parallel-Task Jobs Subject to Packing and Placement Constraints

Motivated by modern parallel computing applications, we consider the pro...

Please sign up or login with your details

Forgot password? Click here to reset