Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Several basic mutual exclusion lock algorithms are known, with one of the simplest being the Ticket Lock.  present a new mutual exclusion lock with properties similar to the Ticket Lock but using atomic_exchange() instead of atomic_fetch_add() that can be more efficient on systems without a native instruction for atomic_fetch_add(), or in which the native instruction for atomic_exchange() is faster than the one for atomic_fetch_add(). Similarly to the Ticket Lock, our lock has small memory foot print, is extremely simple, respects FIFO order, and provides starvation freedom in architectures that implement atomic_exchange() as a single instruction, like x86.
['Pedro Ramalhete', 'Andreia Correia']
I am writing a research paper on a idea Tidex: a mutual exclusion lock
[{"from": "human", "value": "I am writing a research paper on a idea Tidex: a mutual exclusion lock"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Several basic mutual exclusion lock algorithms are known, with one of the simplest being the Ticket Lock.  present a new mutual exclusion lock with properties similar to the Ticket Lock but using atomic_exchange() instead of atomic_fetch_add() that can be more efficient on systems without a native instruction for atomic_fetch_add(), or in which the native instruction for atomic_exchange() is faster than the one for atomic_fetch_add(). Similarly to the Ticket Lock, our lock has small memory foot print, is extremely simple, respects FIFO order, and provides starvation freedom in architectures that implement atomic_exchange() as a single instruction, like x86."}]