Abstract
Processor co-allocation can be of performance benefit. This is because breaking jobs into components reduces overall cluster fragmentation. However, the slower inter-cluster communication links increase job execution times. This leads to performance deterioration which can make co-allocation unviable. We use intra-cluster to inter-cluster communication speed ratio and job communication intensity to model the job execution time penalty due to co-allocation. We then study viability of co-allocation in selected job and system based instances. We also study performance variation with selected job stream parameters. We observe that co-allocation is viable so long as the execution time penalty caused is relatively low. We also observe that the negative performance effect due to co-allocation is felt by the entire job stream rather than only the (few) co-allocated jobs. Finally, we observe that for every value of communication time penalty, there is a job size s *, where if all jobs whose size is greater than s * are co-allocated, we get the best performance.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
Aida, K., Kasahara, K., Narita, S.: Job scheduling scheme for pure space sharing among rigid jobs. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1998, SPDP-WS 1998, and JSSPP 1998. LNCS, vol. 1459, pp. 98–121. Springer, Heidelberg (1998)
Bucur, A.I.D.: Performance analysis of processor co-allocation in multi-cluster systems. PhD Thesis, Technical University Delft, Delft, The Netherlands (2004)
Bucur, A.I.D., Epema, D.H.J.: The influence of communication on the performance of co-allocation. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 2001. LNCS, vol. 2221, pp. 66–86. Springer, Heidelberg (2001)
Czajkowski, K., Foster, I.T., Kasselman, C.: Resource co-allocation in computational grids. In: Proc. HPDC 1999, pp. 37–47 (1999)
Feitelson, D.G.: Metric and workload effects on computer systems evaluation. Computers 36(9), 18–25 (2003)
Feitelson, D.G., Rudolph, L.: Towards convergence of job schedulers for parallel supercomputers. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1996 and JSSPP 1996. LNCS, vol. 1162, pp. 1–26. Springer, Heidelberg (1996)
Feitelson, D.G., Rudolph, L., Schwiegelshohn, U.: Parallel job scheduling: A status report. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2004. LNCS, vol. 3277, pp. 1–16. Springer, Heidelberg (2005)
Frachtenberg, E., Feitelson, D.G.: Pitfalls in parallel job scheduling evaluation. In: Feitelson, D.G., Frachtenberg, E., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2005. LNCS, vol. 3834, pp. 257–282. Springer, Heidelberg (2005)
Jones, W.M.: Improving parallel job scheduling performance in multi-clusters through selective job co-allocation. PhD dissertation, Clemson University, Clemson, South Carolina, USA (2005)
Jones, W.M., Ligon III, W.B., Pang, L.W.: Characterization of bandwidth-aware meta-schedulers for co-allocating jobs across multiple clusters. Journal of Supercomputing 34(2), 135–163 (2005)
Jones, W.M., Pang, L.W., Stanzione, D., Ligon III, W.B.: Bandwidth-aware co-allocating meta-schedulers for mini-grid architectures. In: Proc. CLUSTER 2004, pp. 45–54 (2004)
Ngubiri, J., van Vliet, M.: Group-wise performance evaluation of processor co-allocation in multi-cluster systems. In: Frachtenberg, E., Schwiegelshohn, U. (eds.) JSSPP 2007. LNCS, vol. 4942, pp. 1–13. Springer, Heidelberg (2008)
Sonmez, O., Mohamed, H., Epema, D.H.J.: Communication-aware job placement policies for the KOALA grid scheduler. In: Proc. 2nd IEEE Int. Conf. on e-Science and Grid Comp., pp. 79–87 (2006)
Srinivasan, S., Kettimuthu, R., Subramani, V., Sadayappan, P.: Characterization of backfilling strategies for parallel job scheduling. In: Proc. ICPPW 2002, pp. 514–520 (2002)
Srinivasan, S., Kettimuthu, R., Subramani, V., Sadayappan, P.: Selective reservation strategies for backfill job scheduling. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2002. LNCS, vol. 2537, pp. 55–71. Springer, Heidelberg (2002)
Srinivasan, S., Krishnamoorthy, S., Sadayappan, P.: A robust scheduling technology for moldable scheduling of parallel jobs. In: Proc. CLUSTER 2003, pp. 92–99 (2003)
Stromaier, E., Dongarra, J.J., Meuer, H.W., Simon, H.D.: Recent trends in the marketplace of high performance computing. Parallel Computing 31(3,4), 261–273 (2005)
The Grid Workloads Archive, http://gwa.ewi.tudelft.nl/
The Parallel Workloads Archive, http://www.cs.huji.ac.il/labs/parallel/workload/
Tsafrir, D., Feitelson, D.G.: Instability in parallel job scheduling simulation: The role of workload flurries. In: Proc. IPDPS 2006 (2006)
Top500 supercomputing sites (Accessed December 20th, 2007), http://www.top500.org
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ngubiri, J., van Vliet, M. (2008). Co-allocation with Communication Considerations in Multi-cluster Systems. In: Luque, E., Margalef, T., Benítez, D. (eds) Euro-Par 2008 – Parallel Processing. Euro-Par 2008. Lecture Notes in Computer Science, vol 5168. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85451-7_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-85451-7_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85450-0
Online ISBN: 978-3-540-85451-7
eBook Packages: Computer ScienceComputer Science (R0)