Scheduling nonlinear divisible loads in a single level tree network

• المؤلفون الرئيسيون: Suresh, Sundaram, Run, Cui, Kim, H. J., Robertazzi, T. G.
• مؤلفون آخرون: School of Computer Engineering
• التنسيق: مقال
• اللغة: English
• منشور في: 2013
• الموضوعات: DRNTU::Engineering::Computer science and engineering
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/99293; http://hdl.handle.net/10220/17260
• المؤسسة: 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...