The workflow scheduling problem which is considered difficult on the Grid becomes even more challenging when multiple scheduling criteria are used for optimization. The existing approaches can address only certain variants of the multi-criteria workflow scheduling problem, usually considering up to two contradicting criteria being scheduled in some specific Grid environments. A comprehensive description of the problem can be an important step towards more general scheduling approaches. Based on the related work and on our own experience, we propose several novel taxonomies of the multi-criteria workflow scheduling problem, considering five facets which may have a major impact on the selection of an appropriate scheduling strategy: scheduling process, scheduling criteria, resource model, task model, and workflow model. We analyze different existing workflow scheduling approaches for the Grid, and classify them according to the proposed taxonomies, identifying the most common use cases and the areas which have not been sufficiently explored yet.
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
Platform Computing Inc. Platform LSF. http://www.platform.com/Products/Platform. LSF.Family/.
A. O. A. Cesta and S. Smith. A Constrained-Based Method for Project Scheduling with Time Windows. Journal of Heuristics, 8:109-136, 2002.
Altair Engineering, Inc. PBS Professional. http://www.altair.com/software/pbspro.htm.
P. Baptiste, C. Le Pape, and W. Nuijten. Constraint-based Scheduling: Applying Constraint Programming to Scheduling Problems, volume 39 of International Series in Operations Research and Management Science. Kluwer Academic Publishers, Norwell, MA, 2001.
J. Basney, M. Litzkow, T. Tannenbaum, and M. Livny. Checkpoint and migration of unix processes in the condor distributed processing system. Technical Report Technical Report 1346, April 1997.
Berman, F. et al. New Grid Scheduling and Rescheduling Methods in the GrADS Project. International Journal of Parallel Programming, 33:209-229(21), June 2005.
J. Blazewicz, M. Machowiak, J. Weglarz, M. Kovalyov, and D. Trystram. Scheduling Mal-leable Tasks on Parallel Processors to Minimize the Makespan: Models and Algorithms for Planning and Scheduling Problems. Annals of Operations Research, 129:65-80(16), July 2004.
I. Brandic, S. Benkner, G. Engelbrecht, and R. Schmidt. QoS Support for Time-Critical Grid Workflow Applications. In E-SCIENCE ’05: Proceedings of the First International Conference on e-Science and Grid Computing, pages 108-115, Washington, DC, USA, 2005. IEEE Computer Society.
I. Brandic, S. Pllana, and S. Benkner. Amadeus: A Holistic Service-oriented Environment for Grid Workflows. gccw, 0:259-266, 2006.
R. Buyya, D. Abramson, and S. Venugopal. The Grid Economy. In M. Parashar and C. Lee, editors, Proceedings of the IEEE, volume 93 of Special Issue on Grid Computing, pages 698-714. IEEE Press, New Jersey, USA, Mar 2005.
R. Buyya, H. Stockinger, J. Giddy, and D. Abramson. Economic Models for Management of Resources in Peer-to-Peer and Grid Computing. Technical Re-port 0108001, Economics Working Paper Archive at WUSTL, 2001. available at http://ideas.repec.org/p/wpa/wuwpco/0108001.html.
H. Casanova, F. Desprez, and F. Suter. From Heterogeneous Task Scheduling to Heteroge- neous Mixed Parallel Scheduling. In M. Danelutto, D. Laforenza, and M. Vanneschi, ed-itors, Proceedings of the 10th International Euro-Par Conference (Euro-Par’04), volume 3149 of Lecture Notes in Computer Science, pages 230-237, Pisa, Italy, August/September 2004. Springer.
H. Casanova, A. Legrand, D. Zagorodnov, and F. Berman. Heuristics for Scheduling Pa- rameter Sweep Applications in Grid Environments. In Proceedings of 9th Heterogeneous Computing Workshop (HCW), pages 349-363, Cancun, Mexico, May 2000.
C.-H. Chien, P. H.-M. Chang, and V.-W. Soo. Market-Oriented Multiple Resource Scheduling in Grid Computing Environments. In AINA ’05: Proceedings of the 19th International Conference on Advanced Information Networking and Applications, pages 867-872, Washington, DC, USA, 2005. IEEE Computer Society.
ClusterResources,Inc.MauiClusterScheduler. http://www.clusterresources.com/pages/products/maui-cluster-scheduler.php.
DAGMan (Directed Acyclic Graph Manager). http://www.cs.wisc.edu/condor/dagman/.
H. Dail, O. Sievert, F. Berman, H. Casanova, A. YarKhan, S. Vadhiyar, J. Dongarra, C. Liu, L. Yang, D.r Angulo, and I. Foster. Scheduling in the Grid Application Development Software Project, 2003.
E. Deelman, J. Blythe, Y. Gil, and C. Kesselman. Workflow Management in GriPhyN. Grid Resource Management, State of the Art and Future Trends. pages 99-116, 2004.
E. Deelman, G. Singh, M.-H. Su, J. Blythe, Y. Gil, C. Kesselman, G. Mehta, K. Vahi, G. B. Berriman, J. Good, A. Laity, J. C. Jacob, and D. Katz. Pegasus: a Framework for Mapping Complex Scientific Workflows onto Distributed Systems. Scientific Programming Journal, 13 (2), November 2005.
F. Dong and S. G. Akl. Scheduling Algorithms for Grid Computing: State of the Art and Open Problems. Technical Report 2006-504, School of Computing, Queen’s University, Kingston, Ontario, January 2006.
H. Z. E. Tsiakkouri, R. Sakellariou and M. D. Dikaiakos. Scheduling Workflows with Budget Constraints. In S. Gorlatch and M. Danelutto, editors, In Proceedings of the CoreGRID Workshop "Integrated research in Grid Computing", pages 347-357, Nov. 2005.
T. Fahringer, R. Prodan, R. Duan, F. Nerieri, S. Podlipnig, J. Qin, M. Siddiqui, H.-L. Truong, A. Villazon, and M. Wieczorek. ASKALON: A Grid Application Development and Computing Environment. In 6th International Workshop on Grid Computing (Grid 2005), Seattle, USA, Nov. 2005. IEEE Computer Society Press.
T. Fahringer, J. Qin, and S. Hainzer. Specification of Grid Workflow Applications with AGWL: An Abstract Grid Workflow Language. In Proceedings of IEEE International Symposium on Cluster Computing and the Grid 2005 (CCGrid 2005), Cardiff, UK, May 9-12, 2005. IEEE Computer Society Press.
I. Foster, C. Kesselman, and S. Tuecke. The Anatomy of the Grid: Enabling Scalable Vir- tual Organizations. International Journal of Supercomputing Applications, 15(3), 2002.
A. Gounaris, R. Sakellariou, N. Paton, and A. Fernandes. A novel approach to resource scheduling for parallel query processing on computational grids. Distributed and Parallel Databases, 19:87-106(20), May 2006.
A. Hoheisel. User tools and languages for graph-based Grid workflows: Research Articles. Concurr. Comput. : Pract. Exper., 18(10):1101-1113, 2006.
A. Hoheisel and H. Rose. Konzept f ür das Scheduling von Workflow-Aktivit äten in Instant Grid. Technical report, Fraunhofer Institut f ür Rechnerarchitektur und Softwaretechnik, June 2006.
N. R. Jennings, P. Faratin, A. R. Lomuscio, S. Parsons, C. Sierra, and M. Woodlidge. Automated Negotiation: Prospects, Methods and Challenges. International Journal of Group Decision and Negotiation, 10(2):199-215, 2001.
Java CoG Kit Karajan Guide. http://www.cogkit.org/current/manual/workflow.pdf.
T. Kosar and M. Livny. Stork: Making data placement a first class citizen in the grid, 2004.
J. Li and R. Yahyapour. A Negotiation Model Supporting Co-Allocation for Grid Schedul-ing. In Proceedings of 7th IEEE/ACM International Conference on Grid Computing (Grid’06), Barcelona, Spain, 2006. IEEE Computer Society Press.
J. Li and R. Yahyapour. Learning-Based Negotiation Strategies for Grid Scheduling. In IEEE Int’l Symposium on Cluster Computing and the Grid (CCGrid 2006), Singapore, pages 567-583. IEEE Press, 2006.
J. Li and R. Yahyapour. Negotiation Strategies for Grid Scheduling. In The First In- ternational Conference on Grid and Pervasive Computing (GPC2006), volume 3947 of Lecture Notes in Computer Science, pages 42-52, Tunghai University, Taiwan, 2006. Springer-Verlag.
T. Ma and R. Buyya. Critical-Path and Priority based Algorithms for Scheduling Work- flows with Parameter Sweep Tasks on Global Grids. In Proceedings of the 17th Interna-tional Symposium on Computer Architecture and High Performance Computing (SBAC-PAD 2005), Rio de Janeiro, Brazil, Oct. 24-27 2005. IEEE Computer Society Press.
M. Mair, J. Qin, M. Wieczorek, and T. Fahringer. Workflow conversion and processing in the askalon grid environment. 2nd Austrian Grid Symposium, 2007.
C. F. Mela and D. R. Lehmann. Using fuzzy set theoretic techniques to identify preference rules from interactions in the linear model: an empirical study. Fuzzy Sets Syst., 71(2):165-181,1995.
M. Mika, G. Walig óra, and J. Weglarz. Workflow Management in GriPhyN. Grid Resource Management, State of the Art and Future Trends. pages 295-318, 2004.
H. Mohamed and D. Epema. The Design and Implementation of the KOALA Co- Allocating Grid Scheduler. In European Grid Conference, volume 3470 of Lecture Notes in Computer Science, pages 640-650. Springer-Verlag, 2005.
T. N’Takp é and F. Suter. Critical path and area based scheduling of parallel task graphs on heterogeneous platforms. In Proceedings of the 12th International Conference onParallel and Distributed Systems, ICPADS 2006, Minneapolis, Minnesota, USA, July 2006. IEEE Computer Society Press.
A. Radulescu, C. Nicolescu, A. J. C. van Gemund, and P. P. Jonker. CPR: Mixed task and data parallel scheduling for distributed systems. In Proceedings of the 15th International Parallel and Distributed Processing Symposium (IPDPS), pages 39-41, San Francisco, USA, Apr. 2001. IEEE Computer Society Press.
M. D. Rodriguez Moreno, D. Borrajo Mill án, and D. Meziat Luna. Representing and Planning tasks with time and resources. PhD thesis, Universidad de Alcal á , Spain, Dec. 2003.
R. Sakellariou and H. Zhao. A Hybrid Heuristic for DAG Scheduling on Heterogeneous Systems. In IPDPS, 2004.
A. Schrijver. Theory of Linear and Integer Programming. Wiley, 1987. SchRI a 87:1 1.Ex.
G. Singh, C. Kesselman, and E. Deelman. Application-Level Resource Provisioning on the Grid. e-science, 0:83, 2006.
J. Subhlok and G. Vondran. Optimal Use of Mixed Task and Data Parallelism for Pipelined Computations. Journal of Parallel and Distributed Computing, 60:297-319(23), March 2000.
Sun Microsystems, Inc. Grid Engine. http://gridengine.sunsource.net/.
T. Andrews, et al. Business Process Execution Language for Web Services. Technical report, BEA Systems, et al., May 2003.
The K-WfGrid project. http://www.kwfgrid.net.
L. Tian andK.M.Chandy. Resource allocation in streaming environments. In Proceedings of 7th IEEE/ACM International Conference on Grid Computing (Grid’06), Barcelona, Spain, 2006. IEEE Computer Society Press.
V. T’kindt and J. Billaut. Multicriteria Scheduling. Springer Verlag, Berlin, 2002.
A. Čaplinskas and J. Gasperovič. Techniques to Aggregate the Characteristics of Internal Quality of an IS Specification Language. Informatica, 16(4), 2005.
F. Vraalsen, R. A. Aydt, C. L. Mendes, and D. A. Reed. Performance Contracts: Predicting and Monitoring Grid Application Behavior. Lecture Notes in Computer Science, 2242:154–166, 2001.
O. W¨aldrich, W. Ziegler, and P. Wieder. A Meta-Scheduling Service for Co-allocating Arbitrary Types of Resources. Technical Report TR-0010, Institute on Resource Management and Scheduling, CoreGRID - Network of Excellence, December 2005.
M.Wieczorek, M. Siddiqui, A. Villazon, R. Prodan, and T. Fahringer. Applying Advance Reservation to Increase Predictability ofWorkflow Execution on the Grid. In E-SCIENCE ’06: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing, page 82, Washington, DC, USA, 2006. IEEE Computer Society.
R. Wolski, J. S. Plank, J. Brevik, and T. Bryan. Analyzing Market-Based Resource Allocation Strategies for the Computational Grid. 15(3):258–281, Fall 2001.
X. Xiao and L. M. Ni. Internet QoS: A Big Picture. IEEE Network, 13(2):8–18, Mar. 1999.
J. Yu and R. Buyya. A Budget Constrained Scheduling of Workflow Applications on Utility Grids using Genetic Algorithms. In Proceedings of the 15th IEEE International Symposium on High Performance Distributed Computing (HPDC 2006), Paris, France, June 2006. IEEE, IEEE CS Press.
J. Yu and R. Buyya. Scheduling Scientific Workflow Applications with Deadline and Budget Constraints using Genetic Algorithms. Scientific Programming Journal, 14(1), 2006.
J. Yu, R. Buyya, and C. K. Tham. QoS-based Scheduling of Workflow Applications on Service Grids. In Proceedings of the 1st IEEE International Conference on e-Science and Grid Computing (e-Science 2005),Melbourne, Australia, Dec. 2005. IEEE, IEEE CS Press.
Z. Yu and W. Shi. An Adaptive Rescheduling Strategy for Grid Workflow Applications. In Proceedings of the 21st IPDPS 2007, Long Beach, USA, Mar 26 -30 2007. IEEE Computer Society Press.
H. Zhao and R. Sakellariou. An Experimental Investigation into the Rank Function of the Heterogeneous Earliest Finish Time Scheduling Algorithm. In Euro-Par, pages 189–194, 2003.
H. Zhao and R. Sakellariou. Advance Reservation Policies forWorkflows. In Proceedings of the 12th International Workshop on Job Scheduling Strategies for Parallel Processing, volume 4376 of Lecture Notes in Computer Science, pages 47–67, Saint-Malo, France, June 2006. Springer-Verlag.
H. Zhao and R. Sakellariou. SchedulingMultiple DAGs onto Heterogeneous Systems. In 15th Heterogeneous ComputingWorkshop (HCW’06), Rhodes, Greece, April 2006. IEEE Computer Society Press.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Wieczorek, M., Hoheisel, A., Prodan, R. (2008). Taxonomies of the Multi-Criteria Grid Workflow Scheduling Problem. In: Grid Middleware and Services. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-78446-5_16
Download citation
DOI: https://doi.org/10.1007/978-0-387-78446-5_16
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-78445-8
Online ISBN: 978-0-387-78446-5
eBook Packages: Computer ScienceComputer Science (R0)