• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 296
Next 10 →

Multiscalar Processors

by Gurindar S. Sohi, Scott E. Breach, T. N. Vijaykumar - In Proceedings of the 22nd Annual International Symposium on Computer Architecture , 1995
"... Multiscalar processors use a new, aggressive implementation paradigm for extracting large quantities of instruction level parallelism from ordinary high level language programs. A single program is divided into a collection of tasks by a combination of software and hardware. The tasks are distribute ..."
Abstract - Cited by 589 (30 self) - Add to MetaCart
are distributed to a number of parallel processing units which reside within a processor complex. Each of these units fetches and executes instructions belonging to its assigned task. The appearance of a single logical register file is maintained with a copy in each parallel processing unit. Register results

Optimization of Instruction Fetch Mechanisms for High Issue Rates

by Thomas M. Conte, Kishore N. Menezes, Patrick M. Mills, Burzin A. Patel - In 22nd Annual International Symposium on Computer Architecture , 1995
"... Recent superscalar processors issue four instructions per cycle. These processors are also powered by highly-parallel superscalar cores. The potential performance can only be exploited when fed by high instruction bandwidth. This task is the responsibility of the instruction fetch unit. Accurate bra ..."
Abstract - Cited by 133 (4 self) - Add to MetaCart
Recent superscalar processors issue four instructions per cycle. These processors are also powered by highly-parallel superscalar cores. The potential performance can only be exploited when fed by high instruction bandwidth. This task is the responsibility of the instruction fetch unit. Accurate

Instruction Fetch Unit

by Rw Ra Rb
"... busA ..."
Abstract - Add to MetaCart
Abstract not found

Performance Tradeoffs in Mobile Computing: To Fetch Or Not To Fetch? ABSTRACT

by Aditya Dua
"... As portable wireless devices have become commoplace today, the popularity and acceptance of a broad range of mobile applications is higher than ever. Acceptable user experience warrants low latency of execution of computational tasks on the mobile terminals which owing to their portability requireme ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
caused due to background tasks running on a mobile device and latency of execution of new tasks fetched from central server over time-varying wireless channel. Adopting a baseline model for wireless channel variations, rate of task execution, and congestion cost per unit time experience at a mobile

Fetch Rate User given.

by C. Moura, Superdlx A Generic Superscalar Simulator, Acaps Technical Memo
"... KNL model. Branch Prediction User-speci ed direct-mapped BHT with 2-bit damping counter. In-Order Issue Out-of-order execution model. Out-of-Order Issue Out-of-order execution model. Functional Units User given. Functional Units User given. EXE latency ..."
Abstract - Add to MetaCart
KNL model. Branch Prediction User-speci ed direct-mapped BHT with 2-bit damping counter. In-Order Issue Out-of-order execution model. Out-of-Order Issue Out-of-order execution model. Functional Units User given. Functional Units User given. EXE latency

Process coordination with fetch-and-increment

by Eric Freudenthal, Allan Gottlieb - In Proceedings of the 4th International Conference on Architecture Support for Programming Languages and Operating Systems , 1991
"... The fetch-and-add (F&A) operation has been used effectively in a number of process coordination algorithms. In this paper we assess the power of fetch-and-increment (F&I) and fetch-anddecrement (F&D), which weview asrestricted forms of F&A in which the only addends permitted are ±1. ..."
Abstract - Cited by 37 (1 self) - Add to MetaCart
The fetch-and-add (F&A) operation has been used effectively in a number of process coordination algorithms. In this paper we assess the power of fetch-and-increment (F&I) and fetch-anddecrement (F&D), which weview asrestricted forms of F&A in which the only addends permitted are ±1

Design of the UltraSPARC instruction fetch unit

by Robert Yung - Sun Microsystems Laboratories , 1996
"... Designing a modern microprocessor is a complex task that demands careful balance between cycle time, cycles-per-instruction, and area costs. In particular, the instruction fetch unit greatly affects the performance of a multi-issue processor. It must provide adequate bandwidth to sustain peak instru ..."
Abstract - Cited by 6 (2 self) - Add to MetaCart
Designing a modern microprocessor is a complex task that demands careful balance between cycle time, cycles-per-instruction, and area costs. In particular, the instruction fetch unit greatly affects the performance of a multi-issue processor. It must provide adequate bandwidth to sustain peak

Cool-Fetch: Compiler-Enabled Power-Aware Fetch Throttling

by Osman S. Unsal, Israel Koren, C. Mani Krishna, Csaba Andras Moritz - IEEE Computer Architecture Letters , 2002
"... In this paper, we present an architecture compiler based approach to reduce energy consumption in the processor. While we mainly target the fetch unit, an important side-effect of our approach is that we obtain energy savings in many other parts in the processor. The explanation is that the fetch un ..."
Abstract - Cited by 11 (4 self) - Add to MetaCart
In this paper, we present an architecture compiler based approach to reduce energy consumption in the processor. While we mainly target the fetch unit, an important side-effect of our approach is that we obtain energy savings in many other parts in the processor. The explanation is that the fetch

Critical Issues Regarding the Trace Cache Fetch Mechanism

by Sanjay Jeram Patel, Daniel Holmes Friendly, Yale N. Patt , 1997
"... In order to meet the demands of wider issue processors, fetch mechanisms will need to fetch multiple basic blocks per cycle. The trace cache supplies several basic blocks each cycle by storing logically contiguous instructions in physically contiguous storage. When a particular basic block is reques ..."
Abstract - Cited by 54 (6 self) - Add to MetaCart
In order to meet the demands of wider issue processors, fetch mechanisms will need to fetch multiple basic blocks per cycle. The trace cache supplies several basic blocks each cycle by storing logically contiguous instructions in physically contiguous storage. When a particular basic block

Designing and Optimizing the Fetch Unit for a RISC Core

by Mojtaba Shojaei, Bahman Javadi, Mohammad Kazem Akbari, Farnaz Irannejad
"... Despite the extensive deployment of multi-core architectures in the past few years, the design and optimization of each single processing core is still a fresh field in computing. On the other hand, having a design procedure (used to solve the problems related to the design of a single processing co ..."
Abstract - Add to MetaCart
for parallelism, need a high instruction width in order to reach an appropriate performance. Accurate branch prediction and low cache miss rate are two effective factors in the operation of the fetching unit. In this paper, we have designed and analyzed the fetching unit for a 4-way (4-issue) superscalar
Next 10 →
Results 1 - 10 of 296
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University