The transactional framework used to develop Amadeus C++ applications is based
on a mechanism of queues to manage the message exchanges between components.
These structures are protected from concurrent access thanks to synchronization
services provided by Linux. But theses services have a cost in term of performance
and they bound the volume of messages transmitted by these queues. In a first step, I have to investigate on the state-of-the-art in term of management
algorithms of synchronization-free queue (Lock-Free Queue). Several algorithms will
be studied for different cases: 1 Producer – 1 Consumer, 1 Producer – N Consumer, N
Producer – 1 Consumer, N Producer – N Consumer.
In a second one I will participate to the implementation of these algorithms and to
the validation of the performance improvements obtained regarding current solutions
deployed in Amadeus.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: email@example.com