Software Transactional Memory (STM) is a promising new approach to programming shared-memory parallel processors which does not suffer from the drawbacks of locks. However STM also has some limitations. One of the limitations of STM is that while programming with STM users have to identify the critical sections explicitly and enclose them in transactions using appropriate STM calls to ensure synchronization. This approach is similar to using locks in parallel programs. This paper introduces a new flexible approach for programming using STM in which users do not need to identify critical sections explicitly. In this approach whenever users need to perform read or write operations they can do so using appropriate STM calls and STM will ensure synchronization by its internal constructs. Thus users can concentrate only on the algorithm of the parallel problem without thinking about synchronization. Thus this approach is very user-friendly. Time taken will also be less than lock programming as users do not have to identify critical sections explicitly.

Multiprocessing, Parallel Processing, Locks, Software Transactional Memory, Flexible Programming Approach

[1] Yang Ni, Vijay Menon, Richard L. Hudson, Ali-Reza Adl-Tabatabai, J. Eliot, B. Moss, Bratin Saha, Antony L. Hosking, Tatiana Shpeisman,“Open Nesting in Software Transactional Memory”, In the Proceedings of the 12th ACM SIGPLAN symposium on Principles and practice of parallel programming, pp. 68-78, 2007
[2] Zhengyu He, Bo Hong, “Impact of Early Abort Mechanisms on Lock-Based Software Transactional Memory”, In the Proceedings of International Conference on High Performance Computing (HiPC), 2009
[3] Yossi Lev, Victor Luchangco, Virendra J. Marathe, Mark Moir, Dan Nussbaum, Marek Olszewski, “Anatomy of a Scalable Software Transactional Memory”, In the Proceedings of the 4th ACM SIGPLAN Workshop on Transactional Computing , 2009
[4] Justin E. Gottschlich, Manish Vachharajani, Jeremy G. Siek, “An Efficient Software Transactional Memory Using Commit-Time Invalidation”, In the Proceedings of the 8th annual IEEE/ACM international symposium on Code generation and optimization , pp. 101-110, 2010
[5] Sandhya S.Mannarswamy, Ramaswamy Govindarajan, “Variable Granularity Access Tracking Scheme for Improving the Performance of Software Transactional Memory”, In the Proceedings of International Conference on Parallel Architectures and Compilation Techniques, pp. 232-242, 2011
[6] Anupriya Chakraborty, Sourav Saha, Ryan Saptarshi Ray, Utpal Kumar Ray,“ Lock-Free Readers/Writers”, International Journal of Computer Science Issues (IJCSI), ISSN (PRINT): 1694 – 0814, ISSN (ONLINE): 1694 – 0784, Volume- 10, Issue-4, No-2, pp. 180-186, 2013
[7] Sandeep Agrawal, Shweta Das, Manjunatha Valmiki, Sanjay Wandhekar, Prof. Rajat Moona, “A case for PARAM Shavak: Ready-to-use and affordable supercomputing solution”, In the Proceedings of the International Conference on High Performance Computing & Simulation, pp. 396-401, 2017
[8] Ryan Saptarshi Ray, Parama Bhaumik, Utpal Kumar Ray,“ Hybrid Parallel Programming Using Locks and STM”, International Journal of Computer Sciences and Engineering (IJCSE) E-ISSN:2347-2693, Volume- 5, Issue-10, pp. 185-192, 2017
[9] Anjum Mohd Aslam, Mantripatjit kaur,“ A Review on Energy Efficient techniques in Green cloud: Open Research Challenges and Issues”, International Journal of Scientific Research in Computer Sciences and Engineering ISSN: 2320-7639, Volume- 6, Issue-3, pp. 44-50, 2018
[10] S. Vimala, P. Uma, S. Senbagam,“ Adaptive Vector Quantization for Improved Coding Efficiency”, International Journal of Scientific Research in Network Security and Communication ISSN: 2321-3256, Volume- 6, Issue-3, pp. 18-22, 2018