Scheduling Divisible Loads on Bus Networks with Arbitrary Processor Release Time and Start-Up Costs: XRMI

We present a novel algorithm to schedule divisible loads using multi-round installment load distribution. This algorithm considers additional real-world factors, such as task initialization overhead and arbitrary processor release times. We analyze this algorithm's properties and demonstrate its behaviors through multiple illustrative examples. The analysis provides both a deeper understanding of the divisible load scheduling difficulties when considering more real-world factors and allows us to design more efficient algorithms. We show that this algorithm generate better solutions for practical applications.