Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.11851/7585
Title: Tag Simplification: Achieving Power Efficiency through Reducing the Complexity of the Wakeup Logic
Authors: Aykenar, Mehmet Burak
Özgür, Muhammet
Bayraktar, Vehbi Eşref
Ergin, Oğuz
Keywords: CAM logic
issue queue
wakeup logic
low-power
Publisher: IEEE
Source: International Conference on Energy Aware Computing (ICEAC) -- NOV 30-DEC 02, 2011 -- Istanbul, TURKEY
Series/Report no.: International Conference on Energy Aware Computing
Abstract: Contemporary microprocessor cores employ out-of-order execution in order to boost performance. One of the artifacts of the out-of-order execution is the Content Addressable Memory (CAM) cells that allow comparison of the incoming data with the stored value. Many components use these cells inside the processor such as the Issue Queue (IQ), which holds the instructions until their source operands are ready. These processor components receive lookup data each cycle and dissipate significant energy for the comparison operation. In this paper we propose a methodology to remove the capacitive load from the lookup buses and reduce the complexity of the comparison circuitry inside the CAM logic. For demonstration purposes we show the design of a new implementation of the IQ that allows the designers to transfer the complexity to the frontend stages of the processor. Our design reduces the dynamic energy dissipation of the CAM array inside the issue queue 15% with virtually no impact on performance.
URI: https://hdl.handle.net/20.500.11851/7585
ISBN: 978-1-4673-0465-8
ISSN: 2163-5617
Appears in Collections:Bilgisayar Mühendisliği Bölümü / Department of Computer Engineering
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection

Show full item record



CORE Recommender

Page view(s)

42
checked on Mar 25, 2024

Google ScholarTM

Check




Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.