This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Scheduling Multisource Divisible Loads on Arbitrary Networks
April 2010 (vol. 21 no. 4)
pp. 520-531
ASCII Text
x 
 
Jingxi Jia, Bharadwaj Veeravalli, Jon Weissman, "Scheduling Multisource Divisible Loads on Arbitrary Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 21, no. 4, pp. 520-531, April, 2010.
 
 
BibTex
x
 
@article{ 10.1109/TPDS.2009.62,
author = {Jingxi Jia and Bharadwaj Veeravalli and Jon Weissman},
title = {Scheduling Multisource Divisible Loads on Arbitrary Networks},
journal ={IEEE Transactions on Parallel and Distributed Systems},
volume = {21},
number = {4},
issn = {1045-9219},
year = {2010},
pages = {520-531},
doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2009.62},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Parallel and Distributed Systems
TI - Scheduling Multisource Divisible Loads on Arbitrary Networks
IS - 4
SN - 1045-9219
SP520
EP531
EPD - 520-531
A1 - Jingxi Jia,
A1 - Bharadwaj Veeravalli,
A1 - Jon Weissman,
PY - 2010
KW - Divisible loads
KW - multisource
KW - communication delay
KW - processing time
KW - arbitrary network.
VL - 21
JA - IEEE Transactions on Parallel and Distributed Systems
ER -
 
Jingxi Jia, National University of Singapore, Singapore
Bharadwaj Veeravalli, National University of Singapore, Singapore
Jon Weissman, University of Minnesota, Minneapolis
Scheduling multisource divisible loads is a challenging task as different sources should cooperate and share their computing power with others to balance their loads and minimize total computational time. In this study, we attempt to address a generalized divisible load scheduling problem for handling loads from multiple sources on arbitrary networks. This problem is all the more challenging as 1) the topology is arbitrary, 2) in such networks, it is difficult to decide from which source and which route a processing node should receive loads, and 3) processing nodes must be allocated to different sources when they become available. We study two distinct cases of interest, static case and dynamic case, and propose two novel strategies, referred to as Static Scheduling Strategy (SSS) and Dynamic Scheduling Strategy (DSS), respectively. Both strategies work in an iterative fashion. In each iteration, they will use a novel Graph Partitioning (GP) scheme to partition the network such that each source in the network gains a portion of network resources and then these sources cooperate to process their loads. We analyze the performance of DSS using queuing theory and derive upper bounds on a load's average waiting time and a source's average queue length. We use simulation to verify the usefulness and effectiveness of SSS and DSS. Our findings reveal an interesting “load insensitive” property of SSS and also verify the theoretical upper bound of average queue length at each source in the dynamic case.

[1] Y.C. Cheng and T.G. Robertazzi, "Distributed Computation with Communication Delays," IEEE Trans. Aerospace and Electronic Systems, vol. 24, no. 6, pp. 700-712, Nov. 1988.
[2] V. Bharadwaj, D. Ghose, V. Mani, and T.G. Robertazzi, Scheduling Divisible Loads in Parallel and Distributed Systems, CS Press, 1996.
[3] S.K. Chan, V. Bharadwaj, and D. Ghose, "Large Matrix-Vector Products on Distributed Bus Networks with Communication Delays Using the Divisible Load Paradigm: Performance Analysis and Simulation," Math. and Computers in Simulation, vol. 58, pp. 71-79, 2001.
[4] J. Blazewicz, M. Drozdowski, and M. Markiewicz, "Divisible Task Scheduling—Concept and Verification," Parallel Computing, vol. 25, pp. 87-98, Jan. 1999.
[5] M. Drozdowski and P. Wolniewicz, "Experiments with Scheduling Divisible Tasks in Clusters of Workstations," Proc. Euro-Par '00, pp. 311-319, 2000.
[6] D. Ghose and H.J. Kim, "Computing BLAS Level-2 Operations on Workstation Clusters Using the Divisible Load Paradigm," Math. and Computer Modelling, vol. 41, pp. 49-71, Jan. 2005.
[7] M. Drozdowksi and P. Wolniewicz, "Divisible Load Scheduling in Systems with Limited Memory," Cluster Computing, special issue on divisible load scheduling, vol. 6, no. 1, pp. 19-30, Jan. 2003.
[8] M. Drozdowski and P. Wolniewicz, "Performance Limits of Divisible Load Processing in Systems with Limited Communication Buffers," J. Parallel and Distributed Computing, vol. 64, no. 8, pp. 960-973, 2004.
[9] P. Wolniewicz, "Multi-Installment Divisible Job Processing with Communication Startup Cost," Foundations of Computing and Decision Sciences, vol. 27, no. 1, pp. 43-57, 2002.
[10] V. Bharadwaj and G. Barlas, "Scheduling Divisible Loads with Processor Release Times and Finite Size Buffer Capacity Constraints," Cluster Computing, vol. 6, pp. 63-74, 2003.
[11] Y. Yang, K. van der Raadt, and H. Casanova, "Multiround Algorithms for Scheduling Divisible Loads," IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 11, pp. 1092-1102, Nov. 2005.
[12] D. Ghose, H.J. Kim, and T.H. Kim, "Adaptive Divisible Load Scheduling Strategies for Workstation Clusters with Unknown Network Resources," IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 10, pp. 897-907, Oct. 2005.
[13] M. Moges and T. Robertazzi, "Grid Scheduling Divisible Loads from Multiple Sources via Linear Programming," Proc. IASTED Int'l Conf. Parallel and Distributed Computing and Systems, 2004.
[14] M. Moges, T. Robertazzi, and D. Yu, "Divisible Load Scheduling with Multiple Sources: Closed Form Solutions," Proc. Conf. Information Sciences and Systems, The Johns Hopkins Univ. Mar. 2005.
[15] T. Lammie and T. Robertazzi, "A Linear Daisy Chain with Two Divisible Load Sources," Proc. Conf. Information Sciences and Systems, The Johns Hopkins Univ., Mar. 2005.
[16] T.G. Robertazzi and D. Yu, "Multi-Source Grid Scheduling for Divisible Loads," Proc. Conf. Information Sciences and Systems, pp. 188-191, Mar. 2006.
[17] J.A. Broberg, Z. Liu, C.H. Xia, and L. Zhang, "A Multicommodity Flow Model for Distributed Stream Processing," ACM SIGMETRICS Performance Evaluation Rev., vol. 34, no. 1, pp. 377-378, 2006.
[18] C.H. Xia, J.A. Broberg, Z. Li, and L. Zhang, "Distributed Resource Allocation in Stream Processing Systems," Proc. 20th Int'l Symp. Distributed Computing, pp. 489-504, 2006.
[19] J.T. Hung and T.G. Robertazzi, "Divisible Load Cut through Switching in Sequential Tree Networks," IEEE Trans. Aerospace and Electronic Systems, vol. 40, no. 3, pp. 968-982, July 2004.
[20] P. Byrnes and L.A. Miller, "Divisible Load Scheduling in Distributed Computing Environments: Complexity and Algorithms," Technical Report MN ISYE-TR-06-006, Univ. of Minnesota, Graduate Program in Industrial and Systems Eng., 2006.
[21] J. Yao and B. Veeravalli, "Design and Performance Analysis of Divisible Load Scheduling Strategies on Arbitrary Graphs," Cluster Computing, vol. 7, no. 2, pp. 841-865, 2004.
[22] D. England, B. Veeravalli, and J. Weissman, "A Robust Spanning Tree Topology for Data Collection and Dissemination in Distributed Environments," IEEE Trans. Parallel and Distributed System, vol. 18, no. 5, pp. 608-620, May 2007.
[23] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, second ed. MIT Press, Sept. 2001.
[24] D. Bertsekas and R. Gallager, Data Networks. Prentice-Hall, 1992.
[25] J. Little, "A Proof of the Queueing Formula $L=\lambda W$ ," Operations Research J., vol. 18, pp. 172-174, 1961.

Index Terms:
Divisible loads, multisource, communication delay, processing time, arbitrary network.
Citation:
Jingxi Jia, Bharadwaj Veeravalli, Jon Weissman, "Scheduling Multisource Divisible Loads on Arbitrary Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 21, no. 4, pp. 520-531, April 2010, doi:10.1109/TPDS.2009.62
Usage of this product signifies your acceptance of the Terms of Use.