The Community for Technology Leaders
2014 23rd International Conference on Parallel Architecture and Compilation (PACT) (2014)
Edmonton, Canada
Aug. 23, 2014 to Aug. 27, 2014
ISBN: 978-1-5090-6607-0
pp: 201-212
Lihang Zhao , Information Sciences Institute, University of Southern California, Marina del Rey, CA 90292
Jeffrey Draper , Information Sciences Institute, University of Southern California, Marina del Rey, CA 90292
ABSTRACT
Hardware Transactional Memory (HTM) promises to ease multithreaded parallel programming with uncompromised performance. Microprocessors supporting HTM implement a conflict detection mechanism to detect data access conflicts between transactions. Understanding the on-chip network bandwidth utilization of such mechanisms is important as the energy and latency cost of routing packets across the chip is growing alarmingly. We investigate the communication characteristics of a typical conflict detection mechanism. A variety of traffic overheads are identified, which accounts for a combined 56% of the total transactional traffic in a wide spectrum of applications. To combat this problem, we propose C2D (Consolidated Conflict Detection), a novel micro-architectural technique to consolidate conflict detection to a logically central (but physically distributed) agent to reduce the bandwidth utilization of conflict detection. Full system evaluation shows that the proposed technique, if applied to conventional eager conflict detection, can reduce 35% of the traffic and hence 27% of the network energy. The consolidated eager conflict detection generates less traffic than a lazy conflict detection scheme thereby closing the gap between bandwidth utilization of eager and lazy conflict detection.
INDEX TERMS
Coherence, Bandwidth, Hardware, Protocols, Data transfer, System-on-chip, Microprocessors
CITATION
Lihang Zhao, Jeffrey Draper, "Consolidated conflict detection for hardware transactional memory", 2014 23rd International Conference on Parallel Architecture and Compilation (PACT), vol. 00, no. , pp. 201-212, 2014, doi:10.1145/2628071.2628076
94 ms
(Ver 3.3 (11022016))