|
Digital
Library of the European Council for Modelling and Simulation |
Title: |
Global And Local
Synchronization In Parallel Space-Aware Applications |
Authors: |
Franco
Cicirelli, Agostino Forestiero, Andrea Giordano, Carlo Mastroianni,
Rostislav V. Razumchik |
Published in: |
(2018). ECMS 2018
Proceedings Edited by: Lars Nolle, Alexandra
Burger, Christoph Tholen,
Jens Werner, Jens Wellhausen European Council for
Modeling and Simulation. doi:
10.7148/2018-0005 ISSN:
2522-2422 (ONLINE) ISSN:
2522-2414 (PRINT) ISSN:
2522-2430 (CD-ROM) 32nd European Conference on Modelling and Simulation, Wilhelmshaven, Germany, May 22nd
– May 265h, 2018 |
Citation
format: |
Franco
Cicirelli, Agostino Forestiero, Andrea Giordano, Carlo Mastroianni,
Rostislav V. Razumchik
(2018). Global
And Local Synchronization In Parallel Space-Aware Applications, ECMS 2018 Proceedings Edited by: Lars Nolle, Alexandra Burger, Christoph
Tholen, Jens Werner, Jens Wellhausen
European Council for Modeling and Simulation. doi: 10.7148/2018-0491 |
DOI: |
https://doi.org/10.7148/2018-0491 |
Abstract: |
Space-aware applications are characterized by an
explicit representation of a spatial environment in which some entities live
and operate by interacting with each other and with the hosting territory. A
relevant space-aware ap-plication domain is the
so-called urban computing, em-bracing issues like
the simulation and implementation of public transportation systems, traffic
management, urban monitoring and control. The execution of such applica-tions is often distributed on parallel computing
nodes, which need to cooperate and exchange data among each other, thus
raising synchronization issues. In this paper we analyze time-related
characteristics of the computa-tional process in a
space-aware application in the case when each node does not need global
synchronization (i.e. synchronization with all other nodes) but requires only
local synchronization (i.e. synchronization with a subset of neighbor nodes). Performance is evaluated both
analytically and numerically. We provide the analyti-cal
support to an important conclusion: the mean com-putation
time per step remains finite irrespective of the number of nodes under local
synchronization, while un-der global
synchronization it grows unboundedly as the number of nodes increases. In
practical scenarios this corresponds to significantly better scalability
properties of local synchronization. |
Full
text: |