Scheduling nonlinear divisible loads in a single level tree network

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...

Full description

Saved in:
Bibliographic Details
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:
Online Access:https://hdl.handle.net/10356/99293
http://hdl.handle.net/10220/17260
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
Be the first to leave a comment!
You must be logged in first