Pingrong Lin
ABSTRACT
Taking the course selection system of South china Institute of Software Engineering of Guangzhou University as an example, the underlying data interaction technology of the system and its advantages and disadvantages are analyzed, and an optimization scheme is proposed based on this. The optimization solution uses the fast access feature of memory data to pre-load necessary data into memory, uses ConcurrentHashMap to improve the system's concurrency and processing efficiency, uses locks to ensure that lock acquisition is performed in the order of requested locks, and then uses the message queue component Rabbitmq to asynchronously memory data Update to the background database. Experimental results verify the feasibility and effectiveness of the scheme.
- BAI Weili. The design and implementation of course selection system for students[J].Computer & Telecommunication, 2018(10):38--40.Google Scholar
- ZHOU Huikui, HE Yuanzi. Research on performance optimization of course selection system in Universities under big data environment [J]. Computer Knowledge and Technology, 2016, 12(31):8--9+11.Google Scholar
- CUI Zheng, DUAN Liguo. Thread interaction based on Java synchronized synchronization lock [J]. Software Engineering, 2018, 21(02):1--3.Google Scholar
- LI Dapeng, HUANG Jinhong. Research Based on Java Concurrent HashMap[J]. E-Business Journal, 2010(05):67.Google Scholar
- XIAO Shun, YAN Bibo. Design and implementation of a message push system based on rabbitmq[J]. Electronics World, 2019(07):204--205.Google Scholar
- WANG Xiaoxia, CHEN Liang. Design and implementation of Message Queuing Middleware[J]. Computer Engineering, 2005(21):91--93.Google Scholar
- LI Dawei. The application of MSMQ technology in the high concurrent access of independent course selection system[J].Technology Wind, 2012(03):231--232.Google Scholar
Index Terms
- Course Selection System Based on Memory Data Access Technology
Recommendations
The semantics of progress in lock-based transactional memory
POPL '09Transactional memory (TM) is a promising paradigm for concurrent programming. Whereas the number of TM implementations is growing, however, little research has been conducted to precisely define TM semantics, especially their progress guarantees. This ...
A Lock-Based STM Protocol That Satisfies Opacity and Progressiveness
OPODIS '08: Proceedings of the 12th International Conference on Principles of Distributed SystemsThe aim of a software transactional memory (STM) system is to facilitate the delicate problem of low-level concurrency management, i.e. the design of programs made up of processes/threads that concurrently access shared objects. To that end, a STM ...
From lock to correct and efficient software transactional memory
INTERACT-14: Proceedings of the 2010 Workshop on Interaction between Compilers and Computer ArchitectureTransactional memory solves many problems in lock-based parallel programs. Unfortunately, the semantics of transactions are different from those of critical sections defined by locks. The semantic differences make it difficult to correctly port existing ...
Comments