Abstract
Quality of Service (QoS) provisioning for divisible loads in cluster computing has attracted more attention recently. To enhance QoS and provide performance guarantees in cluster computing environments for divisible loads, in this paper, we integrate a Simplified Multi-Round (SMR) strategy into the design of real-time scheduling algorithms for divisible load applications. Four contributions are made in this paper. First, we present algorithm SMR and extend it to compute a closed form formula for minimum number of processors required to meet an application deadline. Second, we derived a closed form solution for execution time of the optimized SMR. Third, we formally prove that optimized SMR results in better completion time than the single round strategy. Finally, we integrate SMR with our algorithm framework and propose two sets of efficient algorithms.
This work was partially supported by USDA FCIC/RMA 2IE08310228 and NSF CNS 0720810.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Compact Muon Solenoid (CMS) Experiment for the Large Hadron Collider at CERN (European Laboratory for Particle Physics): Cms web page, http://cmsinfo.cern.ch/Welcome.html/
Bharadwaj, V., Robertazzi, T.G., Ghose, D.: Scheduling Divisible Loads in Parallel and Distributed Systems. IEEE Computer Society Press, Los Alamitos (1996)
Veeravalli, B., Ghose, D., Robertazzi, T.G.: Divisible load theory: A new paradigm for load scheduling in distributed systems. Cluster Computing 6(1), 7–17 (2003)
Lin, X., Lu, Y., Deogun, J., Goddard, S.: Real-time divisible load scheduling for cluster computing. In: 13th IEEE Real-Time and Embedded Technology and Application Symposium, Bellevue, WA, pp. 303–314 (2007)
Lin, X., Lu, Y., Deogun, J., Goddard, S.: Real-time divisible load scheduling with different processor available times. In: International Conference on Parallel Processing, Xian, China (2007)
Lin, X., Lu, Y., Deogun, J., Goddard, S.: Enhanced real-time divisible load schedul- ing with different processor available times. In: International Conference on High Performance Computing (2007)
Yang, Y., Casanova, H.: Umr: A multi-round algorithm for scheduling divisible workloads. In: Proceeding of International Parallel and Distributed Processing Symposium, p. 24 (2003)
Yeo, C.S., Buyya, R.: A taxonomy of market-based resource management systems for utility-driven cluster computing. Software: Practice and Experience (accepted, September 2005)
Amir, Y., Awerbuch, B., Barak, A., Borgstrom, R.S., Keren, A.: An opportunity cost approach for job assignment in a scalable computing cluster. IEEE Transactions on Parallel and Distributed Systems 11(7), 760–768 (2000)
Robertazzi, T.G.: Ten reasons to use divisible load theory. Computer 36(5), 63–68 (2003)
Kim, S., Weissman, J.B.: A genetic algorithm based approach for scheduling decomposable data grid applications. In: Proc. of International Conference on Parallel Processing (ICCP 2004), Montreal, Quebec, Canada, pp. 406–413 (2004)
Yu, D., Robertazzi, T.G.: Divisible load scheduling for grid computing. In: Proc. of IASTED International Conference on Paralle and Distributed Computing and Systems (PDCS 2003), Los Angeles, CA, USA (2003)
van der Raadt, K., Yang, Y., Casanova, H.: Practical divisible load scheduling on grid platforms with apst-dv. In: Proc. of 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), Denver, CA, USA (2005)
Yang, Y., Casanova, H.: Multi-round algorithms for scheduling divisible workloads. IEEE Transactions on Parallel and Distributed Systems (TPDS) 16(11), 1092–1102 (2005)
Dertouzos, M.L., Mok, A.K.: Multiprocessor online scheduling of hard-real-time tasks. IEEE Trans. Softw. Eng. 15(12), 1497–1506 (1989)
Manimaran, G., Murthy, C.S.R.: An efficient dynamic scheduling algorithm for multiprocessor real-time systems. IEEE Trans. on Parallel and Distributed Systems 9(3), 312–319 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lin, X., Deogun, J., Lu, Y., Goddard, S. (2008). Multi-round Real-Time Divisible Load Scheduling for Clusters. In: Sadayappan, P., Parashar, M., Badrinath, R., Prasanna, V.K. (eds) High Performance Computing - HiPC 2008. HiPC 2008. Lecture Notes in Computer Science, vol 5374. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89894-8_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-89894-8_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89893-1
Online ISBN: 978-3-540-89894-8
eBook Packages: Computer ScienceComputer Science (R0)