Evaluation of message passing synchronization algorithms in embedded systems
Paper in proceedings, 2014

The constantly increasing computational power of the embedded systems is based on the integration of a large number of cores on a single chip. In such complex platforms, the synchronization of the accesses of the shared memory data is becoming a major issue, since it affects the performance of the whole system. This problem, which is currently a challenge in the embedded systems, has been studied in the High Performance Computing domain, where several message passing algorithms have been designed to efficiently avoid the limitations coming from locking. In this work, inspired from the work on message passing synchronization algorithms in the High Performance Computing domain we design and evaluate a set of synchronization algorithms for multi-core embedded platforms. We compare them with the corresponding lock-based implementations and prove that message passing synchronization algorithms can be efficiently utilized in multi-core embedded systems. By using message passing synchronization instead of lock-based, we managed to reduce the execution time of our benchmark up to 29.6%.

message passing

multi-core embedded systems

lock-free

Author

L. Papadopoulos

National Technical University of Athens (NTUA)

Ivan Walulya

Chalmers, Computer Science and Engineering (Chalmers), Networks and Systems (Chalmers)

Philippas Tsigas

Chalmers, Computer Science and Engineering (Chalmers), Networks and Systems (Chalmers)

D.J. Soudris

National Technical University of Athens (NTUA)

B. Barry

Movidius Ltd

14th International Conference on Embedded Computer Systems: Architectures, Modeling and Simulation, SAMOS 2014

282-289

Areas of Advance

Information and Communication Technology

Subject Categories

Information Science

DOI

10.1109/SAMOS.2014.6893222

ISBN

978-147993770-7

More information

Latest update

9/6/2018 1