This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Allocating Non-Real-Time and Soft Real-Time Jobs in Multiclusters
February 2006 (vol. 17 no. 2)
pp. 99-112

Abstract—This paper addresses workload allocation techniques for two types of sequential jobs that might be found in multicluster systems, namely, non-real-time jobs and soft real-time jobs. Two workload allocation strategies, the Optimized mean Response Time (ORT) and the Optimized mean Miss Rate (OMR), are developed by establishing and numerically solving two optimization equation sets. The ORT strategy achieves an optimized mean response time for non-real-time jobs, while the OMR strategy obtains an optimized mean miss rate for soft real-time jobs over multiple clusters. Both strategies take into account average system behaviors (such as the mean arrival rate of jobs) in calculating the workload proportions for individual clusters and the workload allocation is updated dynamically when the change in the mean arrival rate reaches a certain threshold. The effectiveness of both strategies is demonstrated through theoretical analysis. These strategies are also evaluated through extensive experimental studies and the results show that when compared with traditional strategies, the proposed workload allocation schemes significantly improve the performance of job scheduling in multiclusters, both in terms of the mean response time (for non-real-time jobs) and the mean miss rate (for soft real-time jobs).

[1] B. Adelberg, H. Garcia-Molina, and B. Kao, “Emulating Soft Real-time Scheduling Using Traditional Operating System Schedulers,” Proc. 1994 IEEE Real-Time Systems Symp., pp. 292-298, 1994.
[2] O. Aumage, “Heterogeneous Multi-Cluster Networking with the Madeleine III Communication Library,” Proc. 16th Int'l Parallel and Distributed Processing Symp. (IPDPS 2002), pp. 172-183, 2002.
[3] S.A. Banawan and N.M. Zeidat, “A Comparative Study of Load Sharing in Heterogeneous Multicomputer Systems,” Proc. 25th Ann. Simulation Symp., pp. 22-31, 1992.
[4] S. Banen, A.I.D. Bucur, and D.H.J. Epema, “A Measurement-Based Simulation Study of Processor Co-Allocation in Multicluster Systems,” Proc. Ninth Workshop Job Scheduling Strategies for Parallel Processing, pp. 105-128, 2003.
[5] M. Barreto, R. Avila, and P. Navaux, “The MultiCluster Model to the Integrated Use of Multiple Workstation Clusters,” Proc. Third Workshop Personal Computer-Based Networks of Workstations, pp. 71-80, 2000.
[6] D.P. Bertsekas, Constrained Optimization and Lagrange Multiplier Methods, ISBN: 1-886529-04-3, 1996.
[7] A. Bivens, D. Dillenberger, C. Chhuor, G. Ferris, W. Chou, and J. Fenton, “CISCO Load Balancing with SASP and Enterprise Workload Management,” Oct. 2004.
[8] G. Bolch, S. Greiner, H. de Meer, and K.S. Trivedi, Queueing Networks and Markov Chains, Modeling and Performance Evaluation with Computer Science Applications. John Wiley & Sons, 1998.
[9] A.I.D. Bucur and D.H.J. Epema, “The Maximal Utilization of Processor Co-Allocation in Multicluster Systems,” Proc. Int'l Parallel and Distributed Processing Symp. (IPDPS 2003), pp. 60-69, 2003.
[10] K. Chen and L. Decreusefond, “Just How Bad is the FIFO Discipline for Handling Randomly Arriving Time-Critical Messages,” Proc. 1995 IEEE Int'l Workshop Factory Comm. Systems, pp. 183-190, 1995.
[11] Y.C. Chow and W.H. Kohler, “Models for Dynamic Load Balancing in Heterogeneous Multiple Processor System,” IEEE Trans. Computers, vol. 28, no. 5, pp. 354-361, 1979.
[12] M. Colajanni and P.S. Yu, “Dynamic Load Balancing in Geographically Distributed Heterogeneous Web Servers,” Proc. 18th Int'l Conf. Distributed Computing Systems, pp. 295-302, 1998.
[13] M. Chu, K. Fan, and S. Mahlke, “Region-Based Hierarchical Operation Partitioning for Multicluster Processors,” Proc. ACM SIGPLAN 2003 Conf. Programming Language Design and Implementation, pp. 300-311, 2003.
[14] M.M. Deris, J.H. Abawajy, and H.M. Suzuri, “An Efficient Replicated Data Access Approach for Large-Scale Distributed Systems,” Proc. Fourth IEEE Int'l Symp. Cluster Computing and the Grid, pp. 588-594, 2004.
[15] L. He, S.A. Jarvis, D.P. Spooner, X. Chen, and G.R. Nudd, “Hybrid Performance-Based Workload Management for Multiclusters and Grids,” IEE Proc. Software, special issue on performance eng., vol. 151, no. 5, pp. 224-231, Oct. 2004.
[16] L. He, S.A. Jarvis, D.P. Spooner, X. Chen, and G.R. Nudd, “Dynamic Scheduling of Parallel Jobs with QoS Demands in Multiclusters and Grids,” Proc. Fifth IEEE/ACM Int'l Workshop Grid Computing (Grid 2004), pp. 402-409, 2004.
[17] L. He, S.A. Jarvis, D.P. Spooner, and G.R. Nudd, “Optimising Static Workload Allocation in Multiclusters,” Proc. 18th IEEE Int'l Parallel and Distributed Processing Symp. (IPDPS '04), 2004.
[18] L. He, S.A. Jarvis, D.P. Spooner, and G.R. Nudd, “Dynamic Scheduling of Parallel Real-Time Jobs by Modelling Spare Capabilities in Heterogeneous Clusters,” Proc. Fifth IEEE Int'l Conf. Cluster Computing (Cluster '03), pp. 2-10, 2003.
[19] L. He, Z. Han, H. Jin, and L. Pang, “DAG-Based Parallel Real Time Task Scheduling Algorithm on a Cluster,” Proc. Seventh Int'l Conf. Parallel and Distributed Processing Techniques and Applications (PDPTA 2000), pp. 437-443, 2000.
[20] B. Kao and H. Garcia-Molina, “Scheduling Soft Real-Time Jobs over Dual Non-Real-Time Servers,” IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 1, pp. 56-68, Jan. 1996.
[21] L. Kleinrock, Queueing System. John Wiley & Sons, 1975.
[22] R. Leslie and S. McKenzie, “Evaluation of Load Sharing Algorithms for Heterogeneous Distributed Systems,” Computer Comm., vol. 22, no. 4, pp. 376-389, 1999.
[23] Z. Liu, M.S. Squillante, and J.L. Wolf, “On Maximizing Service-Level-Agreement Profits,” Proc. Third ACM Conf. Electronic Commerce, pp. 213-223, 2001.
[24] N.G. Shivaratri, P. Krueger, and M. Singhal, “Load Distribution for Locally Distributed Systems,” Computer, vol. 8, no. 12, pp. 33-44, Dec. 1992.
[25] X.Y. Tang and S.T. Chanson, “Optimizing Static Job Scheduling in a Network of Heterogeneous Computers,” Proc. 29th Int'l Conf. Parallel Processing, pp. 373-382, 2000.
[26] M.Q. Xu, “Effective Metacomputing Using LSF Multicluster,” Proc. First Int'l Symp. Cluster Computing and the Grid (CCGrid '01), pp. 100-105, 2001.
[27] S. Zhou, “A Trace-Driven Simulation Study of Dynamic Load Balancing,” IEEE Trans. Software Eng., vol. 14, no. 9, pp. 1327-1341, 1988.
[28] W. Zhu and B. Fleisch, “Performance Evaluation of Soft Real-Time Scheduling on a Multicomputer Cluster,” Proc. 20th Int'l Conf. Distributed Computing Systems (ICDCS 2000), pp. 610-617, 2000.

Index Terms:
Scheduling, parallel systems, distributed systems, real-time systems, numerical algorithms.
Citation:
Ligang He, Stephen A. Jarvis, Daniel P. Spooner, Hong Jiang, Donna N. Dillenberger, Graham R. Nudd, "Allocating Non-Real-Time and Soft Real-Time Jobs in Multiclusters," IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 2, pp. 99-112, Feb. 2006, doi:10.1109/TPDS.2006.18
Usage of this product signifies your acceptance of the Terms of Use.