Scheduling nonlinear divisible loads in a single level tree network
- Authors
- Suresh, S.; Kim, H. J.; Run, Cui; Robertazzi, T. G.
- Issue Date
- 9월-2012
- Publisher
- SPRINGER
- Keywords
- Nonlinear divisible loads; Broadcast communication or simultaneously load distribution model; Overhead delays; Single-level tree network
- Citation
- JOURNAL OF SUPERCOMPUTING, v.61, no.3, pp.1068 - 1088
- Indexed
- SCIE
SCOPUS
- Journal Title
- JOURNAL OF SUPERCOMPUTING
- Volume
- 61
- Number
- 3
- Start Page
- 1068
- End Page
- 1088
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/107574
- DOI
- 10.1007/s11227-011-0677-2
- ISSN
- 0920-8542
- 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - ETC > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.