Grid scheduling divisible loads from two sources

Journal Article · Fri Jul 10 04:00:00 EDT 2009 · Computers and Mathematics with Applications

DOI:https://doi.org/10.1016/j.camwa.2009.07.046· OSTI ID:1040332

Moges, M A; Yu, D; Robertazzi, T

To date closed form solutions for optimal finish time and job allocation are largely obtained only for network topologies with a single load originating (root) processor. However in large-scale data intensive problems with geographically distributed resources, load is generated from multiple sources. This paper introduces a new divisible load scheduling strategy for single level tree networks with two load originating processors. Solutions for an optimal allocation of fractions of load to nodes in single level tree networks are obtained via linear programming. A unique scheduling strategy that allows one to obtain closed form solutions for the optimal finish time and load allocation for each processor in the network is also presented. The tradeoff between linear programming and closed form solutions in terms of underlying assumptions is examined. Finally, a performance evaluation of a two source homogeneous single level tree network with concurrent communication strategy is presented.

• Research Organization: BROOKHAVEN NATIONAL LABORATORY (BNL)
• Sponsoring Organization: USDOE SC OFFICE OF SCIENCE (SC)
• DOE Contract Number: AC02-98CH10886
• OSTI ID: 1040332
• Report Number(s): BNL--91084-2010-JA
• Journal Information: Computers and Mathematics with Applications, Journal Name: Computers and Mathematics with Applications Journal Issue: 6 Vol. 58; ISSN 0898-1221
• Country of Publication: United States
• Language: English

Related Subjects

97 MATHEMATICS AND COMPUTING
99 GENERAL AND MISCELLANEOUS
COMMUNICATIONS
COMPUTER NETWORKS
EVALUATION
LINEAR PROGRAMMING
PERFORMANCE
divisible loads
grid scheduling
multiple sources
optimal scheduling
tree networks