Advertisement

Budget Constrained Scheduling Strategies for On-line Workflow Applications

  • Hamid Arabnejad
  • Jorge G. Barbosa
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8584)

Abstract

To execute scientific applications, described by workflows, whose tasks have different execution requirements, efficient scheduling methods are essential for task matching (machine assignment) and scheduling (ordered for execution) on a variety of machines provided by a heterogeneous computing system. Several algorithms for concurrent workflow scheduling have been proposed, being most of them off-line solutions. Recent research attempted to propose on-line strategies for concurrent workflows but only address fairness in resource sharing among applications while minimizing the execution time. In this paper, we propose a new strategy that extends on-line methods by optimizing execution time constrained to the user budget. Experimental results show a significant improvement of the produced schedules when our strategy is applied.

Keywords

Directed Acyclic Graph Turnaround Time Online Schedule Ready Task Grid Scheduler 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Zhao, H., Sakellariou, R.: Scheduling multiple DAGs onto heterogeneous systems. In: Int. Parallel and Distributed Processing Symposium, pp. 1–14. IEEE (2006)Google Scholar
  2. 2.
    N’takpé, T., Suter, F.: Concurrent scheduling of parallel task graphs on multi-clusters using constrained resource allocations. In: Int. Parallel and Distributed Processing Symposium, pp. 1–8. IEEE (2009)Google Scholar
  3. 3.
    Bittencourt, L.F., Madeira, E.: Towards the scheduling of multiple workflows on computational grids. Journal of Grid Computing 8, 419–441 (2010)CrossRefGoogle Scholar
  4. 4.
    Hsu, C.C., Huang, K.C., Wang, F.J.: Online scheduling of workflow applications in grid environments. Future Generation Computer Systems 27(6), 860–870 (2011)CrossRefGoogle Scholar
  5. 5.
    Yu, Z., Shi, W.: A planner-guided scheduling strategy for multiple workflow applications. In: ICPP-W 2008, pp. 1–8. IEEE (2008)Google Scholar
  6. 6.
    Arabnejad, H., Barbosa, J.G.: Fairness resource sharing for dynamic workflow scheduling on heterogeneous systems. In: Int. Symp. on Parallel and Distributed Processing with Applications (ISPA), pp. 633–639. IEEE (2012)Google Scholar
  7. 7.
    Arabnejad, H., Barbosa, J.G., Suter, F.: Fair resource sharing for dynamic scheduling of workflows on heterogeneous systems. In: Jeannot, E., Zilinskas, J. (eds.) High-Performance Computing on Complex Environments, pp. 147–167. John Wiley & Sons (2014)Google Scholar
  8. 8.
    Yu, J., Venugopal, S., Buyya, R.: A market-oriented grid directory service for publication and discovery of grid service providers and their services. The Journal of Supercomputing 36(1), 17–31 (2006)CrossRefGoogle Scholar
  9. 9.
  10. 10.
  11. 11.
    Topcuoglu, H., Hariri, S., Wu, M.: Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Transactions on Parallel and Distributed Systems 13(3), 260–274 (2002)CrossRefGoogle Scholar
  12. 12.
    Sakellariou, R., Zhao, H., Tsiakkouri, E., Dikaiakos, M.: Scheduling workflows with budget constraints. In: Int. Research in Grid Computing, pp. 189–202 (2007)Google Scholar
  13. 13.
    Ali, S., Siegel, H.J., Maheswaran, M., Hensgen, D.: Task execution time modeling for heterogeneous computing systems. In: Heterogeneous Computing Workshop, pp. 185–199. IEEE (2000)Google Scholar
  14. 14.
    Braun, T.D., Siegel, H.J., Beck, N., Bölöni, L.L., Maheswaran, M., Reuther, A.I., Robertson, J.P., Theys, M.D., Yao, B., Hensgen, D., et al.: A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. Journal of Parallel and Distributed computing 61(6), 810–837 (2001)CrossRefGoogle Scholar
  15. 15.
    Casanova, H., Legrand, A., Quinson, M.: Simgrid: a generic framework for large-scale distributed experiments. In: Int. Conf. on Computer Modeling and Simulation, UKSIM, pp. 126–131. IEEE CS (2008)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Hamid Arabnejad
    • 1
  • Jorge G. Barbosa
    • 1
  1. 1.LIACC, Departamento de Engenharia Informática Faculdade de EngenhariaUniversidade do PortoPortoPortugal

Personalised recommendations