Scheduling nonlinear divisible loads in a single level tree network

• Main Authors: Suresh, Sundaram, Run, Cui, Kim, H. J., Robertazzi, T. G.
• Other Authors: School of Computer Engineering
• Format: Article
• Language: English
• Published: 2013
• Subjects: DRNTU::Engineering::Computer science and engineering
• Online Access: https://hdl.handle.net/10356/99293; http://hdl.handle.net/10220/17260
• Institution: Nanyang Technological University

In this paper, we study the scheduling problem for polynomial time complexity computational loads in a single level tree network with a collective communication model. The problem of minimizing the processing time is investigated when the computational loads require polynomial order of processing ti...