VLIW processors are statically scheduled processors and their performance depends on the quality of schedules generated by the compiler’s scheduler. We propose a new scheduling scheme where the application is first divided into decision trees and then further split into traces. Traces are speculatively scheduled on the processor based on their probability of execution. We have developed a tool “SpliTree ” to generate traces automatically. Using dynamic branch prediction for scheduling traces our scheme achieves approximately 1.4x performance improvement over that using decision trees for Spec92 benchmarks simulated on TriMediatm
A relativeA, small set of static instructions has significant leverage on program execution performa...
The available instruction level parallelism (ILP) is extremely limited within basic blocks of non-nu...
Very long instruction word (VLIW) machines potentially provide the most direct way to exploit Instru...
VLIW processors are statically scheduled processors and their performance depends on the quality of ...
VLIW processors are statically scheduled processors and their performance depends on the quality of ...
instruction-level parallelism, compilers, VLIW, superscalar, code generation Trace Scheduling-2 is a...
International audienceTo maximize performance, out-of-order execution processors sometimes issue ins...
The performance of VLIW architectures is dependent on the capability of the compiler to detect and e...
Main goal of the paper is introducing a dynamic branch prediction scheme suitable for energy-aware V...
Pipelining the scheduling logic, which exposes and exploits the instruction level parallelism, degra...
The paper introduces a dynamic branch prediction scheme suitable for energy-aware Very Long Instruct...
International audienceThe design philosophy of VLIW processors is to maximize instruction level para...
Fine-grain parallelism available in VLIW and superscalar processors can be mainly exploited in compu...
The increasing demand for high performance forces computer architects to employ a plethora of hardwa...
Main goal of the paper is introducing a dynamic branch pre-diction scheme suitable for energy-aware ...
A relativeA, small set of static instructions has significant leverage on program execution performa...
The available instruction level parallelism (ILP) is extremely limited within basic blocks of non-nu...
Very long instruction word (VLIW) machines potentially provide the most direct way to exploit Instru...
VLIW processors are statically scheduled processors and their performance depends on the quality of ...
VLIW processors are statically scheduled processors and their performance depends on the quality of ...
instruction-level parallelism, compilers, VLIW, superscalar, code generation Trace Scheduling-2 is a...
International audienceTo maximize performance, out-of-order execution processors sometimes issue ins...
The performance of VLIW architectures is dependent on the capability of the compiler to detect and e...
Main goal of the paper is introducing a dynamic branch prediction scheme suitable for energy-aware V...
Pipelining the scheduling logic, which exposes and exploits the instruction level parallelism, degra...
The paper introduces a dynamic branch prediction scheme suitable for energy-aware Very Long Instruct...
International audienceThe design philosophy of VLIW processors is to maximize instruction level para...
Fine-grain parallelism available in VLIW and superscalar processors can be mainly exploited in compu...
The increasing demand for high performance forces computer architects to employ a plethora of hardwa...
Main goal of the paper is introducing a dynamic branch pre-diction scheme suitable for energy-aware ...
A relativeA, small set of static instructions has significant leverage on program execution performa...
The available instruction level parallelism (ILP) is extremely limited within basic blocks of non-nu...
Very long instruction word (VLIW) machines potentially provide the most direct way to exploit Instru...