Abstract
Two distinct characteristics of grid computing systems are resource heterogeneity and availability variation. There are many well-designed scheduling algorithms proposed for heterogeneous computing systems. However, the availability variation is seldom considered in developing scheduling ongoing applications on a grid. In this paper, a scheduling algorithm called AROF is proposed. It considers availability variation as well as resource heterogeneity while scheduling applications to the grids. An experiment has been conducted to demonstrate that AROF algorithm outperforms the well-known scheduling algorithms Modified HEFT and GS in most of the cases.
This research is supported by National Science Council under the grant 98-2221-E-197-014.
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
Baskiyar, S., SaiRanga, P.C.: Scheduling Directed A-cyclic Task Graphs on Heterogeneous Network of Workstations to Minimize Schedule Length. In: Proc. The Int’l Conf. Parallel Processing Workshops, pp. 97–103 (2003)
Cao, H., et al.: DAGMap: Efficient Scheduling for DAG Grid Workflow Job. In: The 9th IEEE/ACM Int’l Conf. Grid Computing, pp. 17–24 (2008)
Carter, B.R., et al.: Generational Scheduling for Dynamic Task Management in Heterogeneous Computing Systems. J. Information Sciences series 106, 219–236 (1998)
Chang, J.-Y., Chen, H.-L.: Dynamic-Grouping Bandwidth Reservation Scheme for Multimedia Wireless Networks. IEEE J. Selected Areas in Communications 21, 1566–1574 (2003)
Freund, R.F., et al.: Scheduling Resources in Multi-user, Heterogeneous, Computing Environments with SmartNet. In: Proc. Heterogeneous Computing Workshop, pp. 184–199 (1998)
Ilavarasan, E., Thambidurai, P., Mahilmannan, R.: Performance Effective Task Scheduling Algorithm for Heterogeneous Computing System. In: Proc. The 4th Int’l Symp. Parallel and Distributed Computing, pp. 28–38 (2005)
Kwok, Y.-K., Ahmad, I.: Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors. IEEE Trans. Parallel and Distributed Systems series 7, 506–521 (1996)
de O. Lucchese, F., et al.: An Adaptive Scheduler for Grids. J. Grid Computing series 4, 1–17 (2006)
Maheswaran, M., et al.: Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing System. J. Parallel and Distributed Computing 59, 107–131 (1999)
Rauber, T., Rünger, G.: Anticipated Distributed Task Scheduling for Grid Environments. In: Proc. The 20th Int’l Parallel and Distributed Processing Symposium (2006)
Sakellariou, R., Zhao, H.: A Hybrid Heuristic for DAG Scheduling on Heterogeneous Systems. In: Proc. The 18th Int’l Parallel and Distributed Processing Symposium (2004)
Topcuoglu, H., Hariri, S., Wu, M.-Y.: Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing. IEEE Trans. Parallel and Distributed Systems series 13, 260–274 (2003)
Wang, L., et al.: Task Matching and Scheduling in Heterogeneous Computing Environments Using a Genetic-Algorithm-Based Approach. J. Parallel and Distributed Computing series 47, 8–22 (1997)
Wu, M.-Y., Gajski, D.D.: Hypertool: A Programming Aid for Message-Passing Systems. IEEE Trans. Parallel and Distributed Systems 1, 330–343 (1990)
Yang, M., et al.: An End-to-End QoS Framework with On-Demand Bandwidth Reconfiguration. Computer Communications series 28, 2034–2046 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lin, CC., Hsu, CH. (2010). Adaptable Scheduling Algorithm for Grids with Resource Redeployment Capability. In: Hsu, CH., Yang, L.T., Park, J.H., Yeo, SS. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2010. Lecture Notes in Computer Science, vol 6081. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13119-6_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-13119-6_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13118-9
Online ISBN: 978-3-642-13119-6
eBook Packages: Computer ScienceComputer Science (R0)