It is increasingly accepted that superscalar processors can only achieve their full performance potential through compile-time instruction scheduling. This paper presents preliminary performance results using a Conditional Group Scheduler which targets the HSA processor model developed at the University of Hertfordshire. In particular, we show that guarded instruction execution improves performance by allowing the processor to squash instructions in the Instruction Buffer before they are issued to functional units and enables the scheduler to delete a significant number of branch instructions
Although instruction scheduling is an scNP-complete problem (27), many techniques have been develope...
High performance computer architectures increasingly use compile-time instruction scheduling to reor...
Due to the character of the original source materials and the nature of batch digitization, quality ...
If a high-performance superscalar processor is to realise its full potential, the complier must re-o...
We present a technique for ameliorating the detrimental impact of the true data dependencies that ul...
LaZy Superscalar is a processor architecture which delays the execution of fetched instructions unti...
Super-scalar processors can execute multiple instructions out-of-order per cycle and speculatively ...
[[abstract]]This paper introduces a novel superscalar micro-architecture, called IAS-S, and its rela...
This thesis describes work done in two areas of compilation support for superscalar processors; regi...
One of the main obstacles to exploiting the fine-grained parallelism that is available in general-pu...
While delayed branch mechanisms were popular with the designers of RISC processors, most superscalar...
Modern superscalar architectures with dynamic scheduling and register renaming capabilities have int...
The main aim of this short paper is to investigate multiple-instruction-issue in a high-performance ...
The foremost goal of superscalar processor design is to increase performance through the exploitatio...
Superscalar and superpipelining techniques increase the overlap between the instructions in a pipeli...
Although instruction scheduling is an scNP-complete problem (27), many techniques have been develope...
High performance computer architectures increasingly use compile-time instruction scheduling to reor...
Due to the character of the original source materials and the nature of batch digitization, quality ...
If a high-performance superscalar processor is to realise its full potential, the complier must re-o...
We present a technique for ameliorating the detrimental impact of the true data dependencies that ul...
LaZy Superscalar is a processor architecture which delays the execution of fetched instructions unti...
Super-scalar processors can execute multiple instructions out-of-order per cycle and speculatively ...
[[abstract]]This paper introduces a novel superscalar micro-architecture, called IAS-S, and its rela...
This thesis describes work done in two areas of compilation support for superscalar processors; regi...
One of the main obstacles to exploiting the fine-grained parallelism that is available in general-pu...
While delayed branch mechanisms were popular with the designers of RISC processors, most superscalar...
Modern superscalar architectures with dynamic scheduling and register renaming capabilities have int...
The main aim of this short paper is to investigate multiple-instruction-issue in a high-performance ...
The foremost goal of superscalar processor design is to increase performance through the exploitatio...
Superscalar and superpipelining techniques increase the overlap between the instructions in a pipeli...
Although instruction scheduling is an scNP-complete problem (27), many techniques have been develope...
High performance computer architectures increasingly use compile-time instruction scheduling to reor...
Due to the character of the original source materials and the nature of batch digitization, quality ...