1Scheduling Divisible Workloads from Multiple Sources in Linear Daisy Chain Networks
Xinxin Liu, Han Zhao, Xiaolin Li · 2016
Abstract—This paper considers scheduling divisible workloads from multiple sources in linear networks of processors. We propose a two phase scheduling strategy to minimize the overall processing time of these workloads by taking advantage of the processor equivalence technique. A case study with two sources of workloads is presented to illustrate the general approach for multiple sources of workloads. At the first phase, following the equivalent processor model to represent the processors in-between two load sources, we derive recursive equations to obtain near-optimal workload distribution for all processors and the minimum processing time of the overall workloads. At the second phase, we propose an efficient algorithm to obtain near-optimal load distribution for all processors represented by the equivalent processor. The simulation results and analysis for various scenarios are presented to show the behavior and efficiency of the proposed method.