Article

A hybrid algorithm for scheduling workflow applications in grid environments (ICPDP)

Authors:

Catalin Leordeanu,

Valentin CristeaAuthors Info & Claims

OTM'07: Proceedings of the 2007 OTM confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part II

Pages 1331 - 1348

Published: 25 November 2007 Publication History

Abstract

In this paper, based on a thorough analysis of different policies for DAG scheduling, an improved algorithm ICPDP (Improved Critical Path using Descendant Prediction) is introduced. The algorithm performs well with respect to the total scheduling time, the schedule length and load balancing. In addition, it provides efficient resource utilization, by minimizing the idle time on the processing elements. The algorithm has a quadratic polynomial time complexity. Experimental results are provided to support the performance evaluation of the algorithm and compare them with those obtained for other scheduling strategies. The ICPDP algorithm, as well as other analyzed algorithms, have been integrated in the DIOGENES project, and have been tested by using Mon-Alisa farms and ApMon, a MonAlisa extension.

References

[1]

Muresan, O., Pop, F., Gorgan, D., Cristea, V.: Satellite Image Processing Applications in MedioGRID. In: ISPDC 2006 (2006).

Digital Library

[2]

Mandal, A., Dasgupta, A., Kennedy, K., Mazina, M., Koelbel, C., Marin, G., Cooper, K., Mellor-Crummey, J., Liu, B., Johnsson, L.: Cluster Computing and the Grid. In: CCGrid 2004, IEEE International Symposium (2004).

[3]

Walton, D.: The Simulation of Dynamic Resource Brokering in a Grid Environment, B.Comp.Sc., Department of Computer Science, The University of Adelaide, South Australia (November 2002).

[4]

Foster, I., Kesselman, C.: The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, San Francisco (1999).

Digital Library

[5]

Foster, I., Kesselman, C., Tuecke, S.: The Anatomy of the Grid: Enabling Scalable Virtual Organizations. International J. Supercomputer Applications (2001).

Digital Library

[6]

Dong, F., Akl, S.G.: Scheduling Algorithms for Grid Computing: State of the Art and Open Problems, Technical Report (2006).

[7]

El-Rewini, H., Lewis, T.G.: Scheduling parallel programs onto arbitrary target machines. J. Parallel Distrib. Comput. (June 1990).

Digital Library

[8]

Gerasoulis, A., Yang, T.: A comparison of clustering heuristics for scheduling DAGs on multiprocessors. J. Parallel Distrib. Comput. (December 1992).

[9]

Ibarra, O.H., Kim, C.E.: Heuristic algorithms for scheduling independent tasks on nonidentical processors. J. Assoc. Comput. Mach. 24(2), 280-289 (1977).

Digital Library

[10]

Fernandez Baca, D.: Allocating modules to processors in a distributed system. IEEE Trans. Software Engrg. 15(11), 1427-1436 (1989).

Digital Library

[11]

Shen, C.-C., Tsai, W.-H.: A graph matching approach to optimal task assignment in distributed computing system using a minimax criterion. IEEE Trans. Comput. 34(3), 197-203 (1985).

Digital Library

[12]

Kwok, Y.K., Ahmad, I.: Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors. ACM Computing Surveys 31(4) (December 1999).

Digital Library

[13]

Ullman, J.: NP-complete scheduling problems. J. Comput. System Sci. 10 (1975).

[14]

Kafil, M., Ahmad, I.: Optimal task assignment in heterogeneous distributed computing systems. IEEE Concurrency 6(3), 42-51 (1998).

Digital Library

[15]

Adam, T.L., Chandy, K.M., Dickson, J.: A comparison of list scheduling for parallel processing systems. Comm. ACM 17 (December 1974).

Digital Library

[16]

Ahmad, I., Kwok, Y.K.: On parallelizing the multiprocessor scheduling problem. IEEE Trans. Parallel Distrib. Systems 11 (April 1999).

Digital Library

[17]

Yang, T., Gerasoulis, A.: List scheduling with and without communication delays. Parallel Comput. (1993).

Digital Library

[18]

MonALISA Web page (accessed on June 27, 2007), http://monalisa.cacr.caltech.edu

[19]

Hwang, J.J., Chow, Y.C., Anger, F.D., Lee, C.Y.: Scheduling precedence graphs in systems with interprocessor communication times. SIAM J. Comput. 18 (April 1999).

Digital Library

[20]

Wu, M.-Y., Gajski, D.D.: Hypercool: a programming aid for message-passing systems. IEEE Trans. Parallel Distrib. Systems (July 1990).

Digital Library

[21]

Kwok, Y.-K., Ahmad: Dynamic critical-path scheduling: An effective technique for allocating task graphs to multiprocessors. IEEE Trans. Parallel Distrib. Syst. 7 (1996).

Digital Library

[22]

Wu, M.-Y.: MCP revisited - Department of Electrical and Computer Engineering, The University of New Mexico.

[23]

Iordache, G.V., Boboila, M.S., Pop, F., Stratan, C., Cristea, V.: A Decentralized Strategy for Genetic Scheduling in Heterogeneous Environments. In: GADA 2006, Montpellier, France, November(2-3) (2006).

Digital Library

[24]

El-Rewini, H., Lewis, T., Ali, H.: Task Scheduling in Parallel and Distributed Systems. Prentice Hall, Englewood Cliffs (1994).

Digital Library

[25]

Waldo: The Jini architecture for network-centric computing. Communications of the ACM (July 1999).

Digital Library

[26]

Gupta, R., Talwar, S., Agrawal, D.P.: Jini Home Networking: A Step toward Pervasive Computing. Computer, 34-40 (August 2002).

Digital Library

[27]

Venugopal, S., Buyya, R., Winton, L.: A Grid Service Broker for Scheduling Distributed Data-Oriented Applications on Global Grids. In: ACM International Conference Proceeding Series, vol. 76, pp. 75-80 (2004).

Digital Library

Cited By

Popa EIacono MPop F(2018)Adapting MCP and HLFET Algorithms to Multiple Simultaneous SchedulingInternational Journal of Parallel Programming10.1007/s10766-017-0516-z46:3(607-629)Online publication date: 1-Jun-2018
https://dl.acm.org/doi/10.1007/s10766-017-0516-z
Vasile MPop FTutueanu RCristea VKołodziej J(2015)Resource-aware hybrid scheduling algorithm in heterogeneous distributed computingFuture Generation Computer Systems10.1016/j.future.2014.11.01951:C(61-71)Online publication date: 1-Oct-2015
https://dl.acm.org/doi/10.1016/j.future.2014.11.019

Recommendations

Reactive grid scheduling of DAG applications
PDCN'07: Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks

We consider the problem of scheduling parallel applications, represented by directed acyclic graphs (DAGs), onto Grid style resource pools. The core issues are that the availability and performance of grid resources, which are already by their nature ...
A Novel Heterogeneous Scheduling Algorithm with Improved Task Priority
HPCC-CSS-ICESS '15: Proceedings of the 2015 IEEE 17th International Conference on High Performance Computing and Communications, 2015 IEEE 7th International Symposium on Cyberspace Safety and Security, and 2015 IEEE 12th International Conf on Embedded Software and Systems

Efficient application scheduling algorithms are important to obtain high performance in heterogeneous computing systems. However, most of current algorithms are of low efficiency in scheduling. Aiming at this problem, we propose a heterogeneous ...
Evolutionary Grid Scheduling Algorithm with Predictive Resource Optimization
CHINAGRID '10: Proceedings of the The Fifth Annual ChinaGrid Conference

Optimal assigning jobs to resources is an important problem in grid computing. Now grid scheduling policies are mostly traditional heuristic algorithms for scheduling n independent tasks on m processors in early finishing time. However grids have ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

OTM'07: Proceedings of the 2007 OTM confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part II

November 2007

1857 pages

ISBN:3540768351

Editors:
Robert Meersman
Vrije Universiteit Brussel, STARLab, Brussels, Belgium
,
Zahir Tari
RMIT University, School of Computer Science and Information Technology, Melbourne, VIC, Australia

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 25 November 2007

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
3
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Popa EIacono MPop F(2018)Adapting MCP and HLFET Algorithms to Multiple Simultaneous SchedulingInternational Journal of Parallel Programming10.1007/s10766-017-0516-z46:3(607-629)Online publication date: 1-Jun-2018
https://dl.acm.org/doi/10.1007/s10766-017-0516-z
Vasile MPop FTutueanu RCristea VKołodziej J(2015)Resource-aware hybrid scheduling algorithm in heterogeneous distributed computingFuture Generation Computer Systems10.1016/j.future.2014.11.01951:C(61-71)Online publication date: 1-Oct-2015
https://dl.acm.org/doi/10.1016/j.future.2014.11.019

View Options

View options

Figures

Tables

Media

View Table of Conten