Abstract
The computational grid provides many resources with powerful computational ability; however, we need to select appropriate resources for resolving the problem. In this paper, several simple and fast resource selection policies are presented. Under varying types of resource topologies and problems, the efficiency of these resource selection policies is compared. The contribution of this research is following. To solve the undetermined resource problem in the grid computing, the bottom level equation is modified in the list scheduling algorithm. Average Schedule Length (ASL) is presented to approximate the schedule length of the improved list scheduling method, and simulation result shows the accuracy of this approximation. The bounded number of the resources is found by performing the FindAlpha algorithm. Simulation result shows that selection policies can achieve minimal schedule length efficiently by choosing the limited number of the resources.
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.: The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, San Francisco (1999)
Ulman, J.D.: NP-Complete Scheduling Problems. Journal of Computing System Science 10 (1975)
Adam, T.L., Chandy, K.M., Dickson, J.R.: Comparison of List Schedule for Parallel Processing Systems. Communications of the ACM 17 (1974)
Arikawa, H., Fujikawa, K., Sunahara, H.: A Node Selection Mechanism based on the Node Usage Pattern on Campus Grid. In: IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (2003)
Goteti, S., Subhlok, J.: Communication Pattern Based Node Selection for Shared Networks. In: Proceedings of the Autonomic Computing Workshop (2003)
Liu, C., Yang, L., Foster, I., Angulo, D.: Design and Evaluation of a Resource Selection Framework for Grid Applications. In: Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing HPDC-11 (2002)
Lee, H., Chung, K., Chin, S., Lee, J., Lee, D., Park, S., Yu, H.: A Resource Management and Fault Tolerance Services in Grid Computing. Journal of Parallel and Distributed Computing 65 (2005)
Zhang, W., Fang, B., He, H., Zhang, H., Hu, M.: Multisite Resource Selection and Scheduling Algorithm on Computational Grid. In: Proceedings of the 18th International Parallel and Distributed Processing Symposium (2004)
Kolano, P.Z.: Surfer: An Extensible Pull-Based Framework for Resource Selection and Ranking. In: IEEE International Symposium on Cluster Computing and the Grid (2004)
Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)
Li, K.: Job Scheduling for Grid Computing on Metacomputers. In: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (2005)
Sinnen, O., Sousa, L.A.: Communication Contention in Task Scheduling. IEEE Transactions on Parallel and Distributed Systems 16 (2005)
GT-ITM project, http://www.cc.gatech.edu/projects/gtitm/
Lloyd Allison’s web site, http://www.csse.monash.edu.au/~lloyd/tildeAlgDS/Graph/DAG/
Parberry, I., Gasarch, W.: Problems on Algorithms, 2nd edn. (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, UR., Wang, CH., Lin, W. (2006). Average Schedule Length and Resource Selection Policies on Computational Grids. In: Chung, YC., Moreira, J.E. (eds) Advances in Grid and Pervasive Computing. GPC 2006. Lecture Notes in Computer Science, vol 3947. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11745693_7
Download citation
DOI: https://doi.org/10.1007/11745693_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33809-3
Online ISBN: 978-3-540-33810-9
eBook Packages: Computer ScienceComputer Science (R0)