Exploiting Instruction Level Parallelism In Processors By Caching Scheduled Groups
Download Exploiting Instruction Level Parallelism In Processors By Caching Scheduled Groups PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Exploiting Instruction Level Parallelism In Processors By Caching Scheduled Groups book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Cache and Memory Hierarchy Design
A widely read and authoritative book for hardware and software designers. This innovative book exposes the characteristics of performance-optimal single- and multi-level cache hierarchies by approaching the cache design process through the novel perspective of minimizing execution time.
High-Performance Computing and Networking
Author: Peter Sloot
language: en
Publisher: Springer Science & Business Media
Release Date: 1999-03-30
This book constitutes the refereed proceedings of the 7th International Conference on High-Performance Computing and Networking, HPCN Europe 1999, held in Amsterdam, The Netherlands in April 1999. The 115 revised full papers presented were carefully selected from a total of close to 200 conference submissions as well as from submissions for various topical workshops. Also included are 40 selected poster presentations. The conference papers are organized in three tracks: end-user applications of HPCN, computational science, and computer science; additionally there are six sections corresponding to topical workshops.
Exploiting Instruction Level Parallelism in Processors by Caching Scheduled Groups
Author: International Business Machines Corporation. Research Division
language: en
Publisher:
Release Date: 1996
Abstract: "Modern processors employ a large amount of hardware to dynamically detect parallelism in single-threaded programs and maintain the sequential semantics implied by these programs. The complexity of some of this hardware diminishes the gains due to parallelism because of longer clock period or increased pipeline latency of the machine. In this paper we propose a processor implementation which dynamically schedules groups of instructions while executing them on a fast simple engine and caches them for repeated execution on a fast VLIW-type engine. Our experiments show that scheduling groups spanning several basic blocks and caching these scheduled groups results in significant performance gain over fill buffer approaches for a standard VLIW cache. This concept, which we call DIF (Dynamic Instruction Formatting), unifies and extends principles underlying several schemes being proposed today to reduce superscalar processor complexity. This paper examines various issues in designing such a processor and presents results of experiments using trace-driven simulation of SPECint95 benchmark programs."