Implementation of shared queues (lock-free)

The transactional framework used to develop Amadeus C++ applications is basedon a mechanism of queues to manage the message exchanges between components.These structures are protected from concurrent access thanks to synchronizationservices provided by Linux. But theses services have a cost in term of performanceand 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 managementalgorithms of synchronization-free queue (Lock-Free Queue). Several algorithms willbe studied for different cases: 1 Producer – 1 Consumer, 1 Producer – N Consumer, NProducer – 1 Consumer, N Producer – N Consumer.In a second one I will participate to the implementation of these algorithms and tothe validation of the performance improvements obtained regarding current solutionsdeployed in Amadeus.