Contention-free many-to-many communication scheduling for high performance clusters

Satyajit Banerjee, Atish Datta Chowdhury, Koushik Sinha, Subhas Kumar Ghosh

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

In the context of generating efficient, contention free schedules for inter-node communication through a switch fabric in cluster computing or data center type environments, all-to-all scheduling with equal sized data transfer requests has been studied in the literature [1,3,4]. In this paper, we propose a communication scheduling module (CSM) towards generating contention free communication schedules for many-to-many communication with arbitrary sized data. Towards this end, we propose three approximation algorithms - PST, LDT and SDT. From time to time, the CSM first generates a bipartite graph from the set of received requests, then determines which of these three algorithms gives the best approximation factor on this graph and finally executes that algorithm to generate a contention free schedule. Algorithm PST has a worst case run time of O( max (Δ|E|, |E|log(|E|))) and guarantees an approximation factor of 2H 2Δ-1, where |E| is the number of edges in the bipartite graph, Δ is the maximum node degree of the bipartite graph and H 2Δ-1 is the (2Δ-1)-th harmonic number. LDT runs in O(|E|2) and has an approximation factor of 2(1+τ), where τ is a constant defined as a guard band or pause time to eliminate the possibility of contention (in an apparently contention free schedule) caused by system jitter and synchronization inaccuracies between the nodes. SDT gives an approximation factor of 4log(w max ) and has a worst case run time of O(Δ|E|log(w max )), where w max represents the longest communication time in a set of received requests.

Original languageEnglish
Title of host publicationDistributed Computing and Internet Technology - 7th International Conference, ICDCIT 2011, Proceedings
Pages150-161
Number of pages12
DOIs
Publication statusPublished - 21 Feb 2011
Event7th International Conference on Distributed Computing and Internet Technology, ICDCIT 2011 - Bhubaneshwar, India
Duration: 9 Feb 201112 Feb 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6536 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other7th International Conference on Distributed Computing and Internet Technology, ICDCIT 2011
CountryIndia
CityBhubaneshwar
Period9/2/1112/2/11

    Fingerprint

Keywords

  • Many-to-many scheduling
  • approximation algorithms
  • cluster computing
  • contention free schedule
  • data centers
  • switch fabric
  • switch scheduling

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Banerjee, S., Datta Chowdhury, A., Sinha, K., & Ghosh, S. K. (2011). Contention-free many-to-many communication scheduling for high performance clusters. In Distributed Computing and Internet Technology - 7th International Conference, ICDCIT 2011, Proceedings (pp. 150-161). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6536 LNCS). https://doi.org/10.1007/978-3-642-19056-8_10