Journal of the Institute of Electronics Engineers of Korea CI (전자공학회논문지CI)

The Institute of Electronics and Information Engineers (대한전자공학회)
권호 표지

Multi -Core Transactional Memory for High Contention Parallel Processing

집중 충돌 병렬 처리를 위한 효율적인 다중 코어 트랜잭셔널 메모리

  • Kim, Seung-Hun (Department of Electrical and Electronic Engineering, Yonsei University) ;
  • Kim, Sun-Woo (Department of Electrical and Electronic Engineering, Yonsei University) ;
  • Ro, Won-Woo (Department of Electrical and Electronic Engineering, Yonsei University)
  • 김승훈 (연세대학교 전기전자공학과) ;
  • 김선우 (연세대학교 전기전자공학과) ;
  • 노원우 (연세대학교 전기전자공학과)
  • Received : 2010.08.25
  • Accepted : 2010.12.23
  • Published : 2011.01.25
Download PDF
⟨ Previous Next ⟩

Abstract

The importance of parallel programming seriously emerges ever since the modern microprocessor architecture has been shifted to the multi-core system. Transactional Memory has been proposed to address synchronization which is usually implemented by using locks. However, the lock based synchronization method reduces the parallelism and has the possibility of causing deadlock. In this paper, we propose an efficient method to utilize transactional memory for the situation which has high contention. The proposed idea is based on the theoretical analysis and it is verified with simulation results. The simulation environment has been implemented using HTM(Hardware Transactional Memory) systems. We also propose a model of the dining philosopher problem to discuss the efficient resource management using the transactional memory technique.

다중 코어 프로세서의 보급과 더불어 이를 효율적으로 활용하기 위한 병렬 프로그래밍의 중요성은 나날이 강조되고 있다. 트랜잭셔널 메모리는 병렬 프로그래밍의 핵심적인 요소인 동기화(Synchronization)를 위해 제안된 구조로서 lock을 사용한 동기화로 인해 발생하는 병렬성 저하, deadlock 등의 문제를 극복할 수 있다. 본 논문은 높은 수준의 contention 상황에 따른 효율적인 트랜잭셔널 메모리의 구조에 대한 이론적인 분석을 제시하며 시뮬레이션을 통해 분석의 타당성을 확인한다. 시뮬레이션 환경은 하드웨어 트랜잭셔널 메모리 (Hardware Transactional Memory) 시스템으로 구성되었으며 이론의 검증을 위해 STAMP 벤치마크와 높은 contention을 유발하는 프로그램을 시뮬레이션 하였다. 또한 트랜잭셔널 메모리를 적용한 dining philosopher problem의 모델링을 통해 효율적인 자원 할당 방안에 있어 lazy 데이터 관리 정책이 유리함을 보였다.

Keywords

References

  1. Maurice Herlihy and J. Eliot B. Moss, Transactional Memory: Architectural Support for Lock-Free Data Structures, in Proceedings of the 20th Annual International Symposium on Computer Architecture. pp. 289--300, 1993.
  2. Peter S. Magnusson Peter S. Magnusson, Magnus Christensson, Jesper Eskilson, Daniel Forsgren, Gustav Hallberg, Johan Högberg, Fredrik Larsson, Andreas Moestedt, and Bengt Werner. Simics: A Full System Simulation Platform, IEEE Computer, 35(2):50-58, Feb. 2002. https://doi.org/10.1109/2.982916
  3. Milo M.K. Martin, Daniel J. Sorin, Bradford M. Beckmann, Michael R. Marty, Min Xu, Alaa R. Alameldeen, Kevin E. Moore, Mark D. Hill, and David A. Wood. Multifacet's General Execution-driven Multiprocessor Simulator (GEMS) Toolset. Computer Architecture News, pages 92-99, Sept. 2005.
  4. Peng Wu and et al. in IBM Research, Compiler and Runtime Techniques for Software Transactional Memory Optimization, CONCURRENCY AND COMPUTATION: PRACTICE AND EXPERIENCE. 21 (1):7-23, Jan 2009. https://doi.org/10.1002/cpe.1336
  5. D. Dice, O. Shalev, and N. Shavit. Transactional Locking II. Lecture Notes in Computer Science, Volume 4167, 194-208, 2006.
  6. K. Fraser and T. Harris. Concurrent Programming Without Locks. ACM Trans. on Computer Systems, 25(2), May 2007.
  7. B. Saha, A.-R. Adl-Tabatabai, R. L. Hudson, C. C. Minh, and B. Hertzberg. McRTSTM: A High Performance Software Transactional Memory System for a Multi-Core Runtime. 11th ACM Symp. on Principles and Practice of Parallel Programming, Mar. 2006.
  8. L. Hammond, V.Wong, M. Chen, B. Hertzberg, B. Carlstrom, M. Prabhu, H.Wijaya, C. Kozyrakis, and K. Olukotun. Transactional Memory Coherence and Consistency, 31st Intl. Symp. on Computer Architecture, June 2004.
  9. R. Rajwar, M. Herlihy, and K. Lai. Virtualizing Transactional Memory. 32nd Intl. Symp. on Computer Architecture, June 2005.
  10. C. Scott Ananian, Krste Asanovic, Bradley C. Kuszmaul, Charles E. Leiserson, and Sean Lie. Unbounded Transactional Memory. In Proc. of the Eleventh IEEE Symp. on High-Performance Computer Architecture, Feb. 2005.
  11. C. C. Minh, M. Trautmann, J. Chung,, A. McDonald, N. Bronson, J. Casper, C. Kozyrakis, and K. Olukotun. An Effective Hybrid Transactional Memory System with Strong Isolation Guarantees. 34th Intl. Symp. on Computer Architecture, June 2007.
  12. A. Shriraman, M. F. Spear, H. Hossain, S. Dwarkadas, and M. L. Scott. An Integrated Hardware-Software Approach to Flexible Transactional Memory. 34th Intl. Symp. on Computer Architecture, June 2007. TR 910, Dept. of Computer Science, Univ. of Rochester, Dec. 2006.
  13. Tomic, Sasa and Perfumo, Cristian and Kulkarni, Chinmay and Armejach, Adria and Cristal, Adrian and Unsal, Osman and Harris, Tim and Valero, Mateo, EazyHTM: Eager-Lazy Hardware Transactional Memory, MICRO 09 Proceedings of the 2009 42nd IEEE/ACM International Symposium on Microarchitecture, 2009.
  14. L. Yen, J. Bobba, M. M. Marty, K. E. Moore, H. Volos, M. D. Hill, M. M. Swift, and D. A. Wood, "LogTM-SE: Decoupling Hardware Transactional Memory from Caches," in Procs. of the 13th Intl Symp on High-Performance Computer Architecture, pages 261-272, Feb. 2007.
  15. C. Minh, J. Chung, C. Kozyrakis, and K. Olukotun, "STAMP: Stanford Transactional Applications for Multi-Processing," in Proceedings of the IEEE International Symposium on Workload Characterization, pages 35-46, 2008.