This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Adaptive Divisible Load Scheduling Strategies for Workstation Clusters with Unknown Network Resources
October 2005 (vol. 16 no. 10)
pp. 897-907

Abstract—Conventional divisible load scheduling algorithms attempt to achieve optimal partitioning of massive loads to be distributed among processors in a distributed computing system in the presence of communication delays in the network. However, these algorithms depend strongly upon the assumption of prior knowledge of network parameters and cannot handle variations or lack of information about these parameters. In this paper, we present an adaptive strategy that estimates network parameter values using a probing technique and uses them to obtain optimal load partitioning. Three algorithms, based on the same strategy, are presented in the paper, incorporating the ability to cope with unknown network parameters. Several illustrative numerical examples are given. Finally, we implement the adaptive algorithms on an actual network of processor nodes using MPI implementation and demonstrate the feasibility of the adaptive approach.

[1] Y.C. Cheng and T.G. Robertazzi, “Distributed Computation with Communication Delays,” IEEE Trans. Aerospace and Electronic Systems, vol. 24, pp. 700-712, 1988.
[2] Y.C. Cheng and T.G. Robertazzi, “Distributed Computation for a Tree Network with Communication Delays,” IEEE Trans. Aerospace and Electronic Systems, vol. 26, no. 3, pp. 511-516, 1990.
[3] R. Agrawal and H.V. Jagadish, “Partitioning Techniques for Large-Grained Parallelism,” IEEE Trans. Computers, vol. 37, no. 12, pp. 1627-1634, 1988.
[4] V. Bharadwaj, D. Ghose, V. Mani, and T.G. Robertazzi, Scheduling Divisible Loads in Parallel and Distributed Systems. CS Press, 1996.
[5] M. Drozdowski, “Selected Problems of Scheduling Tasks in Multiprocessor Computer Systems,” Poznan Univ. of Technology Press Series Monographs: No. 321, Poznan, Poland, 1997.
[6] V. Bharadwaj, D. Ghose, and T.G. Robertazzi, “Divisible Load Theory: A New Paradigm for Load Scheduling in Distributed Systems,” Cluster Computing, vol. 6, no. 1, pp. 7-17, 2003.
[7] T. Robertazzi, “Ten Reasons to Use Divisible Load Theory,” Computer, vol. 36, no. 5, pp. 63-68, 2003.
[8] V. Bharadwaj, H.F. Li, and T. Radhakrishnan, “Scheduling Divisible Loads in Bus Networks with Arbitrary Processor Release Times,” Computer Math. Applications, vol. 32, no. 7, pp. 57-77, 1996.
[9] J. Sohn and T.G. Robertazzi, “Optimal Time-Varying Load Sharing for Divisible Loads,” IEEE Trans. Aerospace and Electronic Systems, vol. 34, pp. 907-924, 1998.
[10] V. Bharadwaj and G. Barlas, “Efficient Scheduling Strategies for Processing Multiple Divisible Loads on Bus Networks,” J. Parallel and Distributed Computing, vol. 62, no. 1, pp. 132-151, 2002.
[11] K. Li, “Parallel Processing of Divisible Loads on Partitionable Static Interconnection Networks,” Cluster Computing, vol. 6, no. 1, pp. 47-55, 2003.
[12] 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.
[13] M. Drozdowski and P. Wolniewicz, “Out-of-Core Divisible Load Processing,” IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 10, pp. 1048-1056, Oct. 2003.
[14] G. Barlas, “Collection-Aware Optimum Sequencing of Operations and Closed-Form Solutions for the Distribution of a Divisible Load on Arbitrary Processor Trees,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 5, pp. 429-441, May 1998.
[15] J. Sohn, T.G. Robertazzi, and S. Luryi, “Optimizing Computing Costs Using Divisible Load Analysis,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 3, pp. 225-234, Mar. 1998.
[16] S. Charcranoon, T.G. Robertazzi, and S. Luryi, “Parallel Processor Configuration Design with Processing/Transmission Costs,” IEEE Trans. Computers, vol. 40, no. 9, pp. 987-991, Sept. 2000.
[17] S. Bataineh and M. Al-Ibrahim, “Effect of Fault-Tolerance and Communication Delay on Response Time in a Multi-Workstation System with Bus Topology,” Computer Comm., vol. 17, pp. 843-851, 1994.
[18] D. Ghose, “A Feedback Strategy for Load Allocation in Workstation Clusters with Unknown Network Resource Capabilities Using the DLT Paradigm,” Proc. Int'l Conf. Parallel and Distributed Processing Techniques and Applications, vol. 1, pp. 425-428, July 2002.
[19] K. Nahrstedt, H.-H. Chu, and S. Narayan, “QoS Aware Resource Management for Distributed Multimedia Applictions,” J. High Speed Networks, vol. 7, pp. 229-257, 1998.
[20] B. Li, D. Xu, and K. Nahrstedt, “An Integrated Runtime QoS-Aware Middleware Framework for Distributed Multimedia Applications,” Multimedia Systems, vol. 8, pp. 420-430, 2002.
[21] http:/www.lindo.com, 2005.
[22] D. Ghose et al., “Adaptive Divisible Load Scheduling Strategies for Workstation Clusters with Unknown Network Resources,” Technical Report KNU/CI/MSL/001/2003, Multimedia Security Laboratory, Kangwon Nat'l Univ., July 2003.
[23] W. Gropp, E. Lusk, and A. Skjellum, Using MPI: Portable Parallel Programming with the Message-Passing Interface, second ed., Cambridge, Mass.: MIT Press, 1999.

Index Terms:
Scheduling and task partitioning, divisible loads, distributed applications, workstations, multiprocessor systems.
Citation:
Debasish Ghose, Hyoung Joong Kim, Tae Hoon Kim, "Adaptive Divisible Load Scheduling Strategies for Workstation Clusters with Unknown Network Resources," IEEE Transactions on Parallel and Distributed Systems, vol. 16, no. 10, pp. 897-907, Oct. 2005, doi:10.1109/TPDS.2005.117
Usage of this product signifies your acceptance of the Terms of Use.