A simple model of noise with an adjustable level of asynchrony is presented. The model is used to generate synthetic noise traces in the presence of a representative bulk synchronous, nearest neighbor time stepping algorithm. The resulting performance of the algorithm is measured and compared to the performance of the algorithm in the presence of Gaussian distributed noise. The results empirically illustrate that asynchrony is a dominant mechanism by which many types of computational noise degrade the performance of bulk-synchronous algorithms, whether or not their macroscopic noise distributions are constant or random.
CITATION STYLE
Hammouda, A., Siegel, A., & Siegel, S. (2015). Overcoming asynchrony: An analysis of the effects of asynchronous noise on nearest neighbor synchronizations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8759, pp. 100–109). Springer Verlag. https://doi.org/10.1007/978-3-319-15976-8_7
Mendeley helps you to discover research relevant for your work.