About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
ICPP 1993
Conference paper
On performance and efficiency of VLIW and superscalar
Abstract
Instruction-level parallelism in non-numerical code is characterized as leading to small speedup (as little as two) due to its irregularity. Recently, we have developed a new static scheduling algorithm called selecttve scheduling which can be used as a component oj VLIW and superscalar compilers to exploit the irregular parallelism. This paper performs a comprehensive empirical study based on the selective scheduling compiler to examine performance/efficiency of statically scheduled machines, and to estimate the scheduling overhead. The results indicate that a logarithmic speedup increase up to five-fold is achievable on realistic resources without resorting to branch probability.