Abstract
Most common jobs of Grid computing are arbitrarily divisible. Divisible load theory(DLT) provides the mathematical machinery for time-optimal processing. With multiple round load distributions, idle processor periods can be harnessed for useful computation. Optimized rounds for the purpose can be planned in advance. The Grid is dynamic in nature. The above theory does not fully account for this. Any realistic scheduling strategy based on DLT has to take this fact into account. Existing multiple rounds algorithms do not involve time-varying effects due to environmental changes. This is a situation that leads to processing delays, such as Disk I/O contention. The proposed inter-round scheduling algorithm takes this into consideration. It involves time-varying resource performance degradation and results in resonable performance.
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.
Similar content being viewed by others
References
Bharadwaj, V., Ghose, D., Mani, V., Robertazzi, T.G.: Scheduling Divisible Load. In: Parallel And Distributed Systems. IEEE Press, Los Alamitos (1996)
Veeravalli, B., Li, X., Ko, C.C.: On the influence of start-up costs in scheduling divisible loads on bus networks. IEEE Trans. on Parallel and Dist. Systems 11(12) (December 2000)
Casanova, H., Yang, Y.: Algorithms and Software to Schedule and Deploy Independent Tasks in Grid Environment (February 2003)
Yang, Y., Casanova, H.: A Multi-Round Algorithm for Scheduling Divisible Workload Applications: Analysis and Experimental Evaluation, Department of Computer Science and Engineering, UCSD, Technical Report CS2002-0721, September 26 (2002)
Yang, Y., Casanova, H.: RUMR: Robust Scheduling for Divisible Workloads. In: HPDC 2003 (June 2003)
Yang, Y., Casanova, H.: Extensions to the Multi-installmemnt Algorithm: Affine Costs and Output Data Transfers (July 2003)
Lee, D., Ramakrishna, R.S.: Disk I/O Performance Forecast using Basic Prediction Techniques for Grid Computing. In: Malyshkin, V.E. (ed.) PaCT 2003. LNCS, vol. 2763, pp. 259–269. Springer, Heidelberg (2003)
Lee, D., Ramakrishna, R.S.: Storage Weather Service: Storage Performance Forecast, Cluster Computing and the Grid(CCGrid), Tokyo, Japan (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, D., Ramakrishna, R.S. (2005). Inter-round Scheduling for Divisible Workload Applications. In: Hobbs, M., Goscinski, A.M., Zhou, W. (eds) Distributed and Parallel Computing. ICA3PP 2005. Lecture Notes in Computer Science, vol 3719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11564621_25
Download citation
DOI: https://doi.org/10.1007/11564621_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29235-7
Online ISBN: 978-3-540-32071-5
eBook Packages: Computer ScienceComputer Science (R0)