Cluster Computing

, Volume 12, Issue 2, pp 205–220 | Cite as

Scheduling mixed-parallel applications with advance reservations

Article

Abstract

This paper investigates the scheduling of mixed-parallel applications, which exhibit both task and data parallelism, in advance reservations settings. Both the problem of minimizing application turn-around time and that of meeting a deadline are studied. For each several scheduling algorithms are proposed, some of which borrow ideas from previously published work in non-reservation settings. Algorithms are compared in simulation over a wide range of application and reservation scenarios. The main finding is that schedules computed using the previously published CPA algorithm can be adapted to advance reservation settings, notably resulting in low resource consumption and thus high efficiency.

Keywords

Scheduling Advance reservation Mixed parallelism 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bansala, S., Kumarb, P., Singh, K.: An improved two-step algorithm for task and data parallel scheduling in distributed memory machines. Parallel Comput. 32(10), 759–774 (2006) CrossRefMathSciNetGoogle Scholar
  2. 2.
    Boudet, V., Desprez, F., Suter, F.: One-step algorithm for mixed data and task parallel scheduling without data replication. In: 17th Int. Parallel and Distributed Processing Symp. (IPDPS), April 2003 Google Scholar
  3. 3.
    Capit, N., Costa, G.D., Georgiou, Y., Huard, G., Martin, C., Mounié, G., Neyron, P., Richard, O.: A batch scheduler with high-level components. In: Proc. of the Intl. Symp. on Cluster Computing and the Grid (CCGrid), May 2005 Google Scholar
  4. 4.
    Casanova, H.: Benefits and drawbacks of redundant batch requests. J. Grid Comput. 5(2), 235–250 (2007) CrossRefMathSciNetGoogle Scholar
  5. 5.
    Castillo, C., Rouskas, G.N., Harfoush, K.: Efficient implementation of best-fit scheduling for advance reservations QoS in Grid. In: Proc. of the 1st IEEE/IFIP Intl. Workshop on End-to-end Virtualization and Grid Management (EVGM), October 2007 Google Scholar
  6. 6.
    Castillo, C., Rouskas, G.N., Harfoush, K.: On the design of online scheduling algorithms for advance reservations QoS in grids. In: Proc. of the 21st IEEE Intl. Parallel and Distributed Processing Symp. (IPDPS), March 2007 Google Scholar
  7. 7.
    Chakrabarti, S., Demmel, J., Yelick, K.: Modeling the benefits of mixed data and task parallelism. In: Proc. of Symp. on Parallel Algorithms and Architectures, pp. 74–83, July 1995 Google Scholar
  8. 8.
    DAG Generation Program. http://www.loria.fr/~suter/dags.html
  9. 9.
    Decker, J., Schneider, J.: Heuristic scheduling of grid workflows supporting co-allocation and advance reservation. In: Proc. of the Seventh IEEE Intl. Symp. on Cluster Computing and the Grid (CCGrid), May 2007 Google Scholar
  10. 10.
    Eyraud, L., Mounié, G., Trystram, D.: Analysis of scheduling algorithms with reservations. In: Proc. of 21st IEEE Intl. Parallel and Distributed Processing Symp. (IPDPS), March 2007 Google Scholar
  11. 11.
    Farooq, U., Majumdar, S., Parsons, E.W.: Impact of laxity on scheduling with advance reservations in grids. In: Proc. of the 13th IEEE Intl. Symp. on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS), September 2005 Google Scholar
  12. 12.
    Feitelson, D.G., Rudolph, L., Schwiegelshohn, U.: Parallel job scheduling—a status report. In: Job Scheduling Strategies for Parallel Processing. LNCS, vol. 3277. Springer, Berlin (2004) Google Scholar
  13. 13.
    Foster, I., Chandy, K.: Fortran M: a language for modular parallel programming. J. Parallel Distrib. Comput. 26(1), 24–35 (1995) MATHCrossRefGoogle Scholar
  14. 14.
    Garey, M.R., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979) MATHGoogle Scholar
  15. 15.
  16. 16.
    Grid5000. http://www.grid5000.org (2007)
  17. 17.
    Hassen, S.B., Bal, H., Jacobs, C.J.H.: A task- and data-parallel programming language based on shared objects. ACM Trans. Program. Lang. Syst. 20(6), 1131–1170 (1998) CrossRefGoogle Scholar
  18. 18.
    Hastings, S., Kurc, T., Langella, S., Catalyurek, U., Pan, T., Saltz, J.: Image processing for the grid: a toolkit for building grid-enabled image processing applications. In: Proc. of the Intl. Symp. on Cluster Computing and the Grid (CCGrid), pp. 36–43, May 2003 Google Scholar
  19. 19.
    Hu, C., Huai, J., Wo, T.: Flexible resource reservation using slack time for service grid. In: Proc. of the 12th Intl. Conf. on Parallel and Distributed Systems (ICPADS), vol. 1, July 2006 Google Scholar
  20. 20.
    Hunold, S., Rauber, T., Rünger, G.: Dynamic scheduling of multi-processor tasks on clusters of clusters. In: Proc. of HeteroPar’07, September 2007 Google Scholar
  21. 21.
    Jansen, K., Zhang, H.: An approximation algorithm for scheduling malleable tasks under general precedence constraints. ACM Transactions on Algorithms 2(3), 416–434 (2006) CrossRefMathSciNetGoogle Scholar
  22. 22.
    Kanazawa, H., Yamada, M., Miyahara, Y., Hayase, Y., Kawata, S., Usami, H.: Problem solving environment based on grid services: NAREGI-PSE. In: Proc. of the First Intl. Conf. on e-Science and Grid Computing, pp. 456–463, December 2005 Google Scholar
  23. 23.
    Lee, C.B., Snavely, A.: Precise and realistic utility functions for user-centric performance analysis of schedulers. In: Proc. of IEEE Symp. on High-Performance Distributed Computing (HPDC), June 2007 Google Scholar
  24. 24.
    Lepere, R., Trystram, D., Woeginger, G.: Approximation algorithms for scheduling malleable tasks under precedence constraints. In: 9th Annual European Symp. on Algorithms (ESA). LNCS, vol. 2161, pp. 146–157. Springer, Berlin (2001) Google Scholar
  25. 25.
  26. 26.
    Margo, M.W., Yoshimoto, K., Kovatch, P., Andrews, P.: Impact of reservations on production job scheduling. In: Proc. of the 13th Workshop of Job Scheduling Strategies for Parallel Processing, June 2007 Google Scholar
  27. 27.
  28. 28.
    Min, R., Maheswaran, M.: Scheduling co-reservations with priorities in grid computing systems. In: Proc. of the 2nd IEEE/ACM Intl. Symp. on Cluster Computing and the Grid (CCGrid), May 2002 Google Scholar
  29. 29.
    Mu’alem, W.A., Feitelson, D.G.: Utilization, predictability, workloads, and runtime user estimates in scheduling the IBM SP2 with Backfilling. IEEE Trans. Parallel Distrib. Syst. 12(6), 529–543 (2001) CrossRefGoogle Scholar
  30. 30.
    Nakada, H., Takefusa, A., Ookubo, K., Kishimoto, M., Kudoh, T., Tanaka, Y., Sekiguchi, S.: Design and implementation of a local scheduling system with advance reservation for co-allocation on the grid. In: Proc. of the 2006 IEEE Intl. Conf. on Computer and Information Technology (CIT), September 2006 Google Scholar
  31. 31.
    N’Takpé, T., Suter, F., Casanova, H.: A comparison of scheduling approaches for mixed-parallel applications on heterogeneous platforms. In: Proc. of the 6th Intl. Symp. on Parallel and Distributed Computing (ISPDC), July 2007 Google Scholar
  32. 32.
    Nurmi, D., Mandal, A., Brevik, J., Keolbel, C., Wolski, R., Kennedy, K.: Evaluation of a workflow scheduler using integrated performance modelling and batch queue wait time prediction. In: Proc. of SC06, November 2006 Google Scholar
  33. 33.
  34. 34.
  35. 35.
    Radulescu, A., van Gemund, A.: A low-cost approach towards mixed task and data parallel scheduling. In: 15th Int. Conf. on Parallel Processing (ICPP), September 2001 Google Scholar
  36. 36.
    Radulescu, A., van Gemund, A.: A low-cost approach towards mixed task and data parallel scheduling. In: 15th Intl. Conf. on Parallel Processing (ICPP), September 2001 Google Scholar
  37. 37.
    Ramaswamy, S., Sapatnekar, S., Banerjee, P.: A framework for exploiting task- and data-parallelism on distributed memory multicomputers. IEEE Trans. Parallel Distrib. Syst. 8(11), 1098–1116 (1997) CrossRefGoogle Scholar
  38. 38.
    Ramaswany, S.: Simultaneous exploitation of task and data parallelism in regular scientific applications. PhD thesis, Univ. of Illinois, Urbana-Champaign (1996) Google Scholar
  39. 39.
    Rauber, T., Rünger, G.: Compiler support for task scheduling in hierarchical execution models. J. Syst. Archit. 45, 483–503 (1998) CrossRefGoogle Scholar
  40. 40.
    Schwiegelshohn, U., Yahyapour, R.: Fairness in parallel job scheduling. J. Sched. 3(5), 297–320 (2000) MATHCrossRefMathSciNetGoogle Scholar
  41. 41.
    Sinner, O.: Task Scheduling for Parallel Systems. Wiley, New York (2007) Google Scholar
  42. 42.
    Smith, W., Foster, I., Taylor, V.: Scheduling with advanced reservations. In: Proc. of 14th Intl. Parallel and Distributed Processing Symp. (IPDPS), May 2000 Google Scholar
  43. 43.
    Snell, Q., Clement, M., Jackson, D.: The performance impact of advance reservation meta-scheduling. In: Proc. of the 6th Workshop on Job Scheduling Strategies for Parallel Processing. LNCS, vol. 1911. Springer, Berlin (2000) Google Scholar
  44. 44.
    Stef-Praun, T., Clifford, B., Foster, I., Hasson, U., Hategan, M., Small, S., Wilde, M., Zhao, Y.: Accelerating medical research using the swift workflow system. In: Proc. of HealthGrid, April 2007 Google Scholar
  45. 45.
    The Grid Workloads Archive. http://gwa.ewi.tudelft.nl (2007)
  46. 46.
  47. 47.
    Vydyanathan, N., Krishnamoorthy, S., Sabin, G., Catalyurek, U., Kurc, T., Sadayappan, P., Saltz, J.: An integrated approach for processor allocation and scheduling of mixed-parallel applications. In: Proc. of the Intl. Conf. on Parallel Processing (ICPP), August 2006 Google Scholar
  48. 48.
    Zhao, H., Sakellariou, R.: Advance reservation policies for workflows. In: Job Scheduling Strategies for Parallel Processing. LNCS, vol. 4376. Springer, Berlin (2006) Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  1. 1.Center for Grid Research and DevelopmentNational Institute of InformaticsTokyoJapan
  2. 2.Dept. of Information and Computer SciencesUniversity of Hawai‘i at ManoaHonoluluUSA

Personalised recommendations