Optimal All-to-All Personalized Exchange in Self-Routable Multistage Networks
IEEE Transactions on Parallel and Distributed Systems
A comparison of some dynamic load-balancing algorithms for a parallel adaptive flow solver
Parallel Computing - Special issue on graph partioning and parallel computing
Contention-Aware Communication Schedule for High-Speed Communication
Cluster Computing
Switch Scheduling via Randomized Edge Coloring
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
An asymptotic approximation scheme for multigraph edge coloring
ACM Transactions on Algorithms (TALG)
Efficient Load Balancing on a Cluster for Large Scale Online Video Surveillance
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Bandwidth efficient all-to-all broadcast on switched clusters
International Journal of Parallel Programming
Hi-index | 0.00 |
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 2H2Δ-1, where |E| is the number of edges in the bipartite graph, Δ is the maximum node degree of the bipartite graph and H2Δ-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 4 log (wmax) and has a worst case run time of O(Δ|E| log (wmax)), where wmax represents the longest communication time in a set of received requests.