Abstract
The computational grid provides a promising platform for the deployment of various high-performance computing applications. Problem in implementing computational grid environments is how to effectively use various resources in the system, such as compute cycle, memory, communication network, and data repository. There are many effective heuristic algorithms for scheduling in the computational grid, however most scheduling strategies have no theoretical guarantees at all. This paper expands on the previous work, which considers CPU and memory with economic principle in the cluster environment. A cost-based online scheduling algorithm is presented for job assignment in the grid environment, and the performance of the algorithm is analyzed against the performance of the optimal offline algorithm.
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
Foster, I., Kesselman, C., Tuecke, S.: The Anatomy of the Grid: Enabling Scalable Virtual Organizations. Int. J. of Supercomputer Appl. 15(3), 200–222 (2001)
Foster, I., Kesselman, C. (eds.): The GRID: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, San Francisco (1998)
Pinedo, M.: Scheduling: Theory, Algorithms, and Systems. Prentice Hall, Englewood Cliffs (1995)
Bartal, Y., Fiat, A., Karloff, H., Vohra, R.: New Algorithms for an Ancient Scheduling Problem. J. Comput. Syst. Sci. 51(3), 359–366 (1995)
Macheswaran, M., Ali, S., Siegel, H.J., Hensgen, D., Freund, R.F.: Dynamic Matching and Scheduling of a Class of Independent Tasks onto Heterogeneous Computing Systems. In: Proceedings of the 8th Heterogeneous Computing Workshop, pp. 30–44. IEEE, Los Alamitos (1999)
Casanova, H., Legrand, A., Zagorodnov, D., Berman, F.: Heuristics for Scheduling Parameter Sweep Applications in Grid Environments. In: Proceedings of the 9th Heterogeneous Computing Workshop, pp. 349–363. IEEE, Los Alamitos (2000)
Takefusa, A., Casanova, H., Matsuoka, S., Berman, F.: A Study of Deadline Scheduling for Client-Server Systems on the Computational Grid. In: Proceedings of the 10th IEEE International Symposium on High Performance Distributed Computing, pp. 406–415. IEEE, Los Alamitos (2001)
Subrammani, V., Kettimuthu, R., Srinivasan, S., Sadayappan, P.: Distributed Job Scheduling on Computational Grids Using Multiple Simultaneous Requests. In: Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing, pp. 359–367. IEEE, Los Alamitos (2002)
Heymann, E., Senar, M.A., Luque, E., Livny, M.: Adaptive Scheduling for Master-Worker Applications on the Computational Grid. In: Buyya, R., Baker, M. (eds.) GRID 2000. LNCS, vol. 1971, pp. 214–227. Springer, Heidelberg (2000)
Ernemann, C., Hamscher, V., Schwiegelshohn, U., Yahyapour, R., Streit, A.: On Advantages of Grid Computing for Parallel Job Scheduling. In: Proceedings of the 2nd IEEE International Symposium on Cluster Computing and the Grid, pp. 39–46. IEEE, Los Alamitos (2002)
Amir, Y., Awerbuch, B., Barak, A., Borgstrom, R.S., Keren, A.: Opportunity Cost Approach for Job Assignment in a Scalable Computing Cluster. IEEE Trans. Parallel Distrib. Syst. 11(7), 760–768 (2000)
Aspnes, J., Azar, Y., Fiat, A., Plotkin, S., Waarts, O.: On-Line Routing of Virtual Circuits with Applications to Load Balancing and Machine Scheduling. J. ACM 44(3), 486–504 (1997)
Sgall, J.: On-line scheduling – a survey. In: Fiat, A. (ed.) Online Algorithms: The State of the Art. LNCS, vol. 1442, pp. 196–231. Springer, Heidelberg (1998)
Buyya, R., Abramson, D., Giddy, J., Stockinger, H.: Economic Models for Resource Management and Scheduling in Grid Computing. J. Concurrency Comput. Practice & Experience 14(13–15), 1507–1542 (2002)
Smallen, S., Casanova, H., Berman, F.: Applying Scheduling and Tuning to On-Line Parallel Tomography. Scient. Prog. 10(4), 271–289 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Weng, C., Lu, X. (2003). A Cost-Based Online Scheduling Algorithm for Job Assignment on Computational Grids. In: Zhou, X., Xu, M., Jähnichen, S., Cao, J. (eds) Advanced Parallel Processing Technologies. APPT 2003. Lecture Notes in Computer Science, vol 2834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39425-9_41
Download citation
DOI: https://doi.org/10.1007/978-3-540-39425-9_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20054-3
Online ISBN: 978-3-540-39425-9
eBook Packages: Springer Book Archive