Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/99293
Title: Scheduling nonlinear divisible loads in a single level tree network
Authors: Suresh, Sundaram
Run, Cui
Kim, H. J.
Robertazzi, T. G.
Keywords: DRNTU::Engineering::Computer science and engineering
Issue Date: 2011
Source: Suresh, S., Kim, H. J., Run, C., & Robertazzi, T. G. (2012). Scheduling nonlinear divisible loads in a single level tree network. The Journal of Supercomputing, 61(3), 1068-1088.
Series/Report no.: The journal of supercomputing
Abstract: 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 time which is proportional to the size of load fraction. In the divisible load theory framework, the presence of polynomial time complexity computational loads leads to solving higher-order algebraic equations to find the optimal load fractions assigned to the processors in the network. The problem of finding optimal load fraction is a computationally intensive task. Using a mild assumption on the ratio of communication time to computation time, we present a closed-form solution for near optimal load fractions and processing time for the entire load fractions. Finally, we also present a closed-form solution for scheduling polynomial loads with start-up delay in communication and computation. The numerical speedup results obtained using closed-form solution clearly show that super-linear speedup is possible for the polynomial computational loads.
URI: https://hdl.handle.net/10356/99293
http://hdl.handle.net/10220/17260
DOI: http://dx.doi.org/10.1007/s11227-011-0677-2
Fulltext Permission: none
Fulltext Availability: No Fulltext
Appears in Collections:SCSE Journal Articles

Google ScholarTM

Check

Altmetric

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.