• DocumentCode
    2839895
  • Title

    LogSPoTM: a scalable thread level speculation model based on transactional memory

  • Author

    Guo, Rui ; An, Hong ; Dou, Ruiling ; Cong, Ming ; Wang, Yaobin ; Li, Qi

  • Author_Institution
    Dept. of Comput. Sci. & Technol., Univ. of Sci. & Technol. of China, Hefei
  • fYear
    2008
  • fDate
    4-6 Aug. 2008
  • Firstpage
    1
  • Lastpage
    8
  • Abstract
    Thread level speculation (TLS) and transactional memory (TM) are both proposed to address the problem of productivity in multi-core era. Both of them require similar underlying support. In this paper, we propose a low-design-complexity approach to effective unified support for both TLS & TM, by extending a scalable TM model to support TLS. The baseline TM model chosen is LogTM. A distributed hardware arbitration mechanism is also proposed to intensify scalability. This method takes advantage of hardware resources introduced by TM, resulting simplified hardware design. Moreover, it provides rich semantics of both TLS and TM to programmers. Five representative benchmarks have been adopted to evaluate performance characteristics of our TLS model under different memory access patterns. Influence of design choices such as interconnection is also studied. The evaluation shows that the new system performs well in most of the benchmarks in spite of its simplicity, resulting average region speedups around 3.5 at four threads.
  • Keywords
    distributed memory systems; LogSPoTM; distributed hardware arbitration mechanism; hardware resources; memory access patterns; multicore productivity; scalable thread level speculation model; transactional memory; Computer science; Hardware; Parallel programming; Performance analysis; Performance evaluation; Productivity; Programming profession; Scalability; System recovery; Yarn;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Systems Architecture Conference, 2008. ACSAC 2008. 13th Asia-Pacific
  • Conference_Location
    Hsinchu
  • Print_ISBN
    978-1-4244-2682-9
  • Electronic_ISBN
    978-1-4244-2683-6
  • Type

    conf

  • DOI
    10.1109/APCSAC.2008.4625443
  • Filename
    4625443