ABSTRACT
In the generic statement of the workflow scheduling problem we are given a set of tasks that have precedence constraints and a set of available machines whereby they can be assigned. The problem is to schedule the tasks to machines so that some target function, e.g., makespan, is optimized. The workflow itself is usually modeled by means of a DAG with nodes representing tasks and edges capturing precedence requirements. In the multiple workflow version of the problem a set of workflows must be scheduled concurrently to the available machines. Most research in the area focused on using a common task queue for all workflows, while task to machine assignment exhibited no restrictions, other than the ones imposed by performance optimization criteria. Nevertheless, strong privacy requirements might entail disjoint workflow to machine assignments. In this paper we tackle the resulting resource allocation problem when multiple workflows must be executed in a secluded manner. We investigate the performance of three heuristics that decide upon the splitting of available machines to the workflows. Experimental evaluation using common benchmark DAGs reveal different trade-offs for the proposed schemes.
- Vahid Arabnejad, Kris Bubendorfer, and Bryan Ng. 2018. Budget and deadline aware e-science workflow scheduling in clouds. IEEE Transactions on Parallel and Distributed Systems 30, 1 (2018), 29–44.Google ScholarDigital Library
- Shishir Bharathi, Ann Chervenak, Ewa Deelman, Gaurang Mehta, Mei-Hui Su, and Karan Vahi. 2008. Characterization of scientific workflows. In 2008 third workshop on workflows in support of large-scale science. IEEE, 1–10.Google Scholar
- Hamid Reza Faragardi, Mohammad Reza Saleh Sedghpour, Saber Fazliahmadi, Thomas Fahringer, and Nayereh Rasouli. 2019. GRP-HEFT: A budget-constrained resource provisioning scheme for workflow scheduling in IaaS clouds. IEEE Transactions on Parallel and Distributed Systems 31, 6 (2019), 1239–1254.Google ScholarCross Ref
- Muhammad H Hilman, Maria A Rodriguez, and Rajkumar Buyya. 2020. Multiple Workflows Scheduling in Multi-tenant Distributed Systems: A Taxonomy and Future Directions. ACM Computing Surveys (CSUR) 53, 1 (2020), 1–39.Google ScholarDigital Library
- Gideon Juve, Ann Chervenak, Ewa Deelman, Shishir Bharathi, Gaurang Mehta, and Karan Vahi. 2013. Characterizing and profiling scientific workflows. Future Generation Computer Systems 29, 3 (2013), 682–692.Google ScholarDigital Library
- Yu-Kwong Kwok and Ishfaq Ahmad. 1999. Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Computing Surveys (CSUR) 31, 4 (1999), 406–471.Google ScholarDigital Library
- Maria Alejandra Rodriguez and Rajkumar Buyya. 2017. A taxonomy and survey on scheduling algorithms for scientific workflows in IaaS cloud computing environments. Concurrency and Computation: Practice and Experience 29, 8(2017), e4041.Google ScholarCross Ref
- Georgios L Stavrinides and Helen D Karatza. 2015. A cost-effective and qos-aware approach to scheduling real-time workflow applications in paas and saas clouds. In 2015 3rd International Conference on Future Internet of Things and Cloud. IEEE, 231–239.Google ScholarDigital Library
- Haluk Topcuoglu, Salim Hariri, and Min-you Wu. 2002. Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE transactions on parallel and distributed systems 13, 3 (2002), 260–274.Google ScholarDigital Library
- Yiping Wen, Jianxun Liu, Wanchun Dou, Xiaolong Xu, Buqing Cao, and Jinjun Chen. 2020. Scheduling workflows with privacy protection constraints for big data applications on cloud. Future Generation Computer Systems 108 (2020), 1084–1091.Google ScholarCross Ref
- Jia Yan, Suzhi Bi, Ying Jun Zhang, and Meixia Tao. 2019. Optimal task offloading and resource allocation in mobile-edge computing with inter-user task dependency. IEEE Transactions on Wireless Communications 19, 1(2019), 235–250.Google ScholarCross Ref
Recommendations
The Grid Resource Broker workflow engine
2nd International Workshop on Workflow Management and Applications in Grid Environments (WaGe2007)Increasingly, complex scientific applications are structured in terms of workflows. These applications are usually computationally and-or data intensive and thus are well suited for execution in grid environments. Distributed, geographically spread ...
Integration of Workflow Partitioning and Resource Provisioning
CCGRID '12: Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)The recent increased use of workflow management systems by large scientific collaborations presents the challenge of scheduling large-scale workflows onto distributed resources. This work aims to partition large-scale scientific workflows in conjunction ...
Dependable Grid Workflow Scheduling Based on Resource Availability
Due to the highly dynamic feature, dependable workflow scheduling is critical in the Grid environment. Various scheduling algorithms have been proposed, but seldom consider the resource reliability. Current Grid systems mainly exploit fault tolerance ...
Comments