High-Level Synthesis of Transactional Memory
Pages 481 - 486
Abstract
The rising popularity of high-level synthesis (HLS) is due to the complexity and amount of background knowledge required to design hardware circuits. Despite significant recent advances in HLS research, HLS-generated circuits may be of lower quality than human-expert-designed circuits, from the performance, power, or area perspectives. In this work, we aim to raise circuit performance by introducing a transactional memory (TM) synchronization model to the open-source LegUp HLS tool [1]. LegUp HLS supports the synthesis of multi-threaded software into parallel hardware [4], including support for mutual-exclusion lock-based synchronization. With the introduction of transactional memory-based synchronization, location-specific (i.e. finer grained) memory locks are made possible, where instead of placing an access lock around an entire array, one can place a lock around individual array elements. Significant circuit performance improvements are observed through reduced stalls due to contention, and greater memory-access parallelism. On a set of 5 parallel benchmarks, wall-clock time is improved by 2.0x, on average, by the TM synchronization model vs. mutex-based locks.
References
[1]
Andrew Canis, Jongsok Choi, Mark Aldham, Victor Zhang, Ahmed Kammoona, Jason H Anderson, Stephen Brown, and Tomasz Czajkowski. 2011. LegUp: high-level synthesis for FPGA-based processor/accelerator systems. In ACM/SIGDA FPGA. 33--36.
[2]
Oregon Medical Laser Center. [n.d.]. Monte Carlo Simulations. https://omlc.org/software/mc/.
[3]
Yu Ting Chen and Jason H Anderson. 2017. Automated generation of banked memory architectures in the high-level synthesis of multi-threaded software. In FPL.
[4]
Jongsok Choi, Stephen Brown, and Jason Anderson. 2013. From software threads to parallel hardware in high-level synthesis for FPGAs. In 2013 International Conference on Field-Programmable Technology (FPT). IEEE, 270--277.
[5]
Jongsok Choi, Stephen Brown, and Jason Anderson. 2015. Resource and memory management techniques for the high-level synthesis of software threads into parallel FPGA hardware. In IEEE FPT. 152--159.
[6]
LAN/MAN Standards Committee et al. 2016. IEEE Standard for Ethernet. IEEE Std 802.3-2015 (2016).
[7]
Dave Dice, Ori Shalev, and Nir Shavit. 2006. Transactional locking II. In International Symposium on Distributed Computing. Springer, 194--208.
[8]
Pascal Felber, Christof Fetzer, and Torvald Riegel. 2008. Dynamic performance tuning of word-based software transactional memory. In ACM PPoPP. 237--246.
[9]
Mark Goresky and Andrew M Klapper. 2002. Fibonacci and Galois representations of feedback-with-carry shift registers. IEEE Transactions on Information Theory 48, 11 (2002), 2826--2836.
[10]
Vincent Gramoli. 2015. More than you ever wanted to know about synchronization: synchrobench, measuring the impact of the synchronization on concurrent algorithms. In ACM SIGPLAN Notices, Vol. 50. 1--10.
[11]
Hsuan Hsiao and Jason Anderson. 2019. Thread Weaving: Static Resource Scheduling for Multithreaded High-Level Synthesis. In ACM/IEEE DAC.
[12]
Christian Jacobi, Timothy Slegel, and Dan Greiner. 2012. Transactional memory architecture and implementation for IBM System z. In ACM/IEEE MICRO. 25--36.
[13]
Chirstoforos Kachris and Chidamber Kulkarni. 2007. Configurable transactional memory. In IEEE FCCM. 65--72.
[14]
Christoforos Kachris and Chidamber Kulkarni. 2011. Transactional memories for multi-processor FPGA platforms. Journal of Systems Architecture 57, 1 (2011), 160--168.
[15]
Chris Lattner and Vikram Adve. 2004. LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation. In IEEE CGO.
[16]
Xiaoyu Ma, Dan Zhang, and Derek Chiou. 2017. FPGA-accelerated transactional execution of graph workloads. In ACM FPGA. 227--236.
[17]
Kevin E Moore, Jayaram Bobba, Michelle J Moravan, Mark D Hill, and David A Wood. 2006. LogTM: Log-based transactional memory. In ACM/IEEE ISCA. 254--265.
[18]
Keshav Pingali, Donald Nguyen, Milind Kulkarni, Martin Burtscher, M Amber Hassaan, Rashid Kaleem, Tsung-Hsien Lee, Andrew Lenharth, Roman Manevich, Mario Méndez-Lojo, et al. 2011. The Tao of Parallelism in Algorithms. In ACM Sigplan Notices, Vol. 46. 12--25.
[19]
Nadesh Ramanathan, Shane T Fleming, John Wickerson, and George A Constantinides. 2017. Hardware synthesis of weakly consistent C concurrency. In ACM FPGA. 169--178.
[20]
Martin Schindewolf, Albert Cohen, Wolfgang Karl, Andrea Marongiu, and Luca Benini. 2009. Towards transactional memory support for gcc.
Recommendations
Operation-Level Wait-Free Transactional Memory with Support for Irrevocable Operations
Transactional memory (TM) aims to be a general purpose concurrency mechanism. However, operations which cause side-effects cannot be easily managed by a TM system, in which transactions are executed optimistically. In particular, networking, I/O, and some ...
Safe privatization in transactional memory
PPoPP '18Transactional memory (TM) facilitates the development of concurrent applications by letting the programmer designate certain code blocks as atomic. Programmers using a TM often would like to access the same data both inside and outside transactions, ...
Stretching transactional memory
PLDI '09Transactional memory (TM) is an appealing abstraction for programming multi-core systems. Potential target applications for TM, such as business software and video games, are likely to involve complex data structures and large transactions, requiring ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
January 2021
930 pages
ISBN:9781450379991
DOI:10.1145/3394885
Copyright © 2021 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
- SIGDA: ACM Special Interest Group on Design Automation
- IEEE CAS
- IEEE CEDA
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 29 January 2021
Check for updates
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
ASPDAC '21
Sponsor:
ASPDAC '21: 26th Asia and South Pacific Design Automation Conference
January 18 - 21, 2021
Tokyo, Japan
Acceptance Rates
ASPDAC '21 Paper Acceptance Rate 111 of 368 submissions, 30%;
Overall Acceptance Rate 466 of 1,454 submissions, 32%
Upcoming Conference
ASPDAC '25
- Sponsor:
- sigda
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 91Total Downloads
- Downloads (Last 12 months)7
- Downloads (Last 6 weeks)1
Reflects downloads up to 01 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in