Transactional memory systems represent a paradigm shift in concurrent programming by abstracting low-level lock management and enabling sequences of operations to be executed as atomic transactions.

In recent years with the advent of programming techniques, parallel programming consumes less execution time as compared to sequential. The odd-even merge sort algorithm was developed by K.E. Batcher.