Analysis of Global and Local Synchronization in Parallel Computing

• Published in: IEEE transactions on parallel and distributed systems Vol. 32; no. 5; pp. 988 - 1000
• Main Authors: Cicirelli, Franco, Giordano, Andrea, Mastroianni, Carlo
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.05.2021; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algebra; Asymptotic properties; Computational efficiency; Computational modeling; Computing time; Efficiency; Lower bounds; Nodes; Parallel computing; Parallel processing; Probabilistic logic; Random variables; Simulation; Synchronism; Synchronization; Time synchronization
• ISSN: 1045-9219; 1558-2183
• DOI: 10.1109/TPDS.2020.3037469

In a parallel computing scenario, the synchronization overhead, needed to coordinate the execution on the parallel computing nodes, can significantly impair the overall execution performance. Typically, synchronization is achieved by adopting a global synchronization schema involving all the nodes. In many application domains, though, a looser synchronization schema, namely, local synchronization, can be exploited, in which each node needs to synchronize only with a subset of the other nodes. In this work, we compare the performance of global and local synchronization using the efficiency, i.e., the ratio between the useful computing time and the total computing time, including the synchronization overhead, as a key performance indicator. We present an analytical study of the asymptotic behavior of the efficiency when the number of nodes increases. As an original contribution, we prove, using the Max-Plus algebra, that there is a non-zero lower bound on the efficiency in the case of local synchronization and we present a statistical procedure to find a value of this bound. This outcome marks a significant advantage of local synchronization with respect to global synchronization, for which the efficiency tends to zero when increasing the number of nodes.