The Community for Technology Leaders
RSS Icon
Issue No.10 - Oct. (2011 vol.22)
pp: 1697-1704
Menglan Hu , National University of Singapore, Singapore
This paper investigates the problem of scheduling multiple divisible loads in networked computer systems with a particular emphasis in capturing two important real-life constraints, the arbitrary processor release times (or ready times) and heterogeneous processing requirements of different loads. We study two distinct cases of interest, static case, where processors' release times are predetermined and known, and dynamic case, where release times are unknown until processors are released. To address the two cases, we propose two novel scheduling strategies, referred to as Static Scheduling Strategy (SSS) and Dynamic Scheduling Strategy (DSS), respectively. In addition, we capture a task's processing requirements in our strategies, a unique feature that is applicable for handling loads on networks that run proprietary applications only on certain nodes. Thus, each task can only be processed by some certain nodes in our formulation. To handle the contention of multiple applications that have various processing requirements but share the same processing nodes, we propose an efficient load selection policy, referred to as Most Remaining Load First (MRF). We integrate MRF into SSS and DSS to address the problem of scheduling multiple divisible loads with arbitrary processor release times and heterogeneous requirements. We evaluate the strategies using extensive simulation experiments.
Divisible loads, parallel processing, communication delay, processing time, multiple applications, release times.
Menglan Hu, "Requirement-Aware Strategies with Arbitrary Processor Release Times for Scheduling Multiple Divisible Loads", IEEE Transactions on Parallel & Distributed Systems, vol.22, no. 10, pp. 1697-1704, Oct. 2011, doi:10.1109/TPDS.2011.31
[1] B. Veeravalli, D. Ghose, V. Mani, and T.G. Robertazzi, "Scheduling Divisible Loads in Parallel and Distributed Systems," IEEE CS Press, John Wiley and Sons, 1996.
[2] J. Jia, B. Veeravalli, and J. Weissman, "Scheduling Multisource Divisible Loads on Arbitrary Networks," IEEE Trans. Parallel and Distributed Systems, vol. 21, no. 4, pp. 520-531, Apr. 2010.
[3] O. Beaumont, H. Casanova, A. Legrand, Y. Robert, and Y. Yang, "Scheduling Divisible Loads on Star and Tree Networks: Results and Open Problems," IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 3, pp. 207-218, Mar. 2005.
[4] T.E. Carroll and D. Grosu, "Strategyproof Mechanisms for Scheduling Divisible Loads in Bus-Networked Distributed Systems," IEEE Trans. Parallel and Distributed Systems, vol. 19, no. 8, pp. 1124 - 1135, Aug. 2008.
[5] Y. Yang, K. 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.
[6] 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.
[7] K. Ko and T.G. Robertazzi, "Signature Search Time Evaluation in Flat File Databases," IEEE Trans. Aerospace and Electronic Systems, vol. 44, no. 2, pp. 493-502, Apr. 2008.
[8] 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.
[9] H.M. Wong and B. Veeravalli, "Aligning Biological Sequences on Distributed Bus Networks: A Divisible Load Scheduling Approach," IEEE Trans. Information Technology in BioMedicine, vol. 9, no. 4, pp. 489-501, Dec. 2005.
[10] B. Veeravalli and H.M. Wong, "Scheduling Divisible Loads on Heterogeneous Linear Daisy Chain Networks with Arbitrary Processor Release Times," IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 3, pp. 273-288, Mar. 2004.
[11] B. Veeravalli, H.F. Li, and T. Radhakrishnan, "Scheduling Divisible Loads in Bus Networks with Arbitrary Processor Release Times," Computers and Math. with Applications, vol. 32, no. 7, pp. 57-77, 1996.
[12] S. Chuprat and S. Baruah, "Scheduling Divisible Real-Time Loads on Clusters with Varying Processor Start Times," Proc. IEEE 14th Int'l Conf. Embedded and Real-Time Computing Systems and Applications (RTCSA '08), 2008.
[13] M. Drozdowski, M. Lawenda, and F. Guinand, "Scheduling Multiple Divisible Loads," Int'l J. High Performance Computing Applications, vol. 20, no. 1, pp. 19-30, 2006.
[14] M. Drozdowski and M. Lawenda, "Scheduling Multiple Divisible Loads in Homogeneous Star Systems," J. Scheduling, vol. 11, no. 5, pp. 347-356, Oct. 2008.
[15] L. Marchal, Y. Yang, H. Casanova, and Y. Robert, "Steady-State Scheduling of Multiple Divisible Load Applications on Wide-Area Distributed Computing Platforms," Int'l J. High Performance Computing Applications, vol. 20, no. 3, pp. 365-381, 2006.
22 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool