Abstract
Researches have demonstrated that runtime scheduling with respect to parallelism can provide a low-overhead load balancing with global load information. In this paper, we present a new approach that is with respect to job parallelism for computational grid. The approach has the capability of redressing the amount of parallel jobs automatically through grain size and other significant factors we specified. As all the jobs parallelized have been divided by an aptotic grain size before being scheduled, the approach can analyze and manage the affiliation of parallel jobs automatically. The approach is so polished that scheduling can be adjusted in real time with little delay. It provides high-quality load balancing for parallel jobs and is universal for computational grid making every grid resource work efficiently, not only as a good scheduling scheme but also as a scheme for scheduling and managing job parallelism.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Foster, I., Kesselman, C. (eds.): The Grid Blueprint for a New Computing Infrastructure. Morgan Kaufmann Publishers, San Francisco (1998)
Baker, M., Buyya, R., Laforenza, D.: The Grid: International Efforts in Global Computing. In: Proc. of International Conference on Advances in Infrastructure for Electronic Business, Science, and Education on the Internet, Rome, Italy (2000)
Zheng, R., Jin, H.: An Integrated Management and Scheduling Scheme for Computational Grid. In: The second international workshop on grid and cooperative computing, Shanghai, China (2003)
Wu, M.-Y.: On Runtime Parallel Scheduling for Processor Load Balancing (1997)
Hui, C.C., Chanson, S.T.: Improved strategies for dynamic load balancing. IEEE Concurrency, 58–67 (1999)
Jian, Z., Lian, L.: Mathematical Network Computing based on Specification Oriented Programming. Master thesis, Computer Science Department, Lanzhou University (2003)
Maheswaran, M.: Quality of Service Driven Resource Management Algorithms for Network Computing. In: Proc of International Conference on Parallel and Distributed Processing Technologies and Applications (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, L., Zhan, J., Li, L. (2004). A Runtime Scheduling Approach with Respect to Job Parallelism for Computational Grid. In: Jin, H., Pan, Y., Xiao, N., Sun, J. (eds) Grid and Cooperative Computing - GCC 2004. GCC 2004. Lecture Notes in Computer Science, vol 3251. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30208-7_39
Download citation
DOI: https://doi.org/10.1007/978-3-540-30208-7_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23564-4
Online ISBN: 978-3-540-30208-7
eBook Packages: Springer Book Archive