The Community for Technology Leaders
2006 International Conference on Parallel Architectures and Compilation Techniques (PACT) (2006)
Seattle, WA, USA
Sept. 16, 2006 to Sept. 20, 2006
ISBN: 978-1-5090-3022-4
pp: 202-211
Oliverio J. Santana , Universidad de Las Palmas, de Gran Canaria
Ayose Falcon , Barcelona Research Office, HP Labs
Alex Ramirez , Universitat Politécnica de Catalunya and Barcelona Supercomputing Center
Mateo Valero , Universitat Politécnica de Catalunya and Barcelona Supercomputing Center
ABSTRACT
Fast instruction decoding is a challenge for the design of CISC microprocessors. A well-known solution to overcome this problem is using a trace cache. It stores and fetches already decoded instructions, avoiding the need for decoding them again. However, implementing a trace cache involves an important increase in the fetch architecture complexity. In this paper, we propose a novel decoding architecture that reduces the fetch engine implementation cost. Instead of using a special-purpose buffer like the trace cache, our proposal stores frequently decoded instructions in the memory hierarchy. The address where the decoded instructions are stored is kept in the branch prediction mechanism, enabling it to guide our decoding architecture. This makes it possible for the processor front-end to fetch already decoded instructions from memory instead of the original non-decoded instructions. Our results show that an 8-wide superscalar processor achieves an average 14% performance improvement by using our decoding architecture. This improvement is comparable to the one achieved by using the more complex trace cache, while requiring 16% less chip area and 21% less energy consumption in the fetch architecture.
INDEX TERMS
complexity-effective, Instruction decoding, branch predictor
CITATION
Oliverio J. Santana, Ayose Falcon, Alex Ramirez, Mateo Valero, "Branch predictor guided instruction decoding", 2006 International Conference on Parallel Architectures and Compilation Techniques (PACT), vol. 00, no. , pp. 202-211, 2006, doi:
190 ms
(Ver 3.3 (11022016))