Abstract
Instruction Scheduling is the task of deciding what instruction will be executed at which unit of time. The objective is to extract maximum instruction level parallelism for the code. Compilers designed for VLIW and EPIC architectures do static instruction scheduling in a back-end pass. This pass, known as scheduler, needs to have full knowledge of the execution time of each instruction. But memory access instructions have a variable latency, depending on their locality and the memory hierarchy architecture. The scheduler must assume a constant value, usually the execution time assigned to a hit. At execution a miss may reduce the parallelism because idle cycles may appear before the instructions that need the data. This paper describes a statistic model to evaluate how sensitive are the scheduling algorithms to the variable time operations. We present experimental measures taken over two static scheduling algorithms based on software pipelining.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
C. Barrado and J. Labarta: “Hamiltonian Recurrence for ILP”, EuroPar, 1997.
P. Borensztejn, C. Barrado and J. Labarta: “The Scheduling Graph in the Variable Time Model”. Report UPC-DAC-1999-18.
M. Lam: “Software Pipelining: An Effective Scheduling Technique for VLIW machines”, Proceedings SIGPLAN’88 PLDI, pp.318–28, 1988.
J. Llosa, M. Valero, E. Ayguadé and A. González: “Hypernode Reduction Modulo Scheduling”, Micro-28, pp.350–360, Dec. 1995.
B. Rau: “Iterative Modulo Scheduling: An Algorithm for Software Pipelining Loops”, IEEE Micro-27, pp.63–74, Nov. 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Borensztejn, P., Barrado, C., Labarta, J. (1999). Influence of Variable Time Operations in Static Instruction Scheduling⋆. In: Amestoy, P., et al. Euro-Par’99 Parallel Processing. Euro-Par 1999. Lecture Notes in Computer Science, vol 1685. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48311-X_26
Download citation
DOI: https://doi.org/10.1007/3-540-48311-X_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66443-7
Online ISBN: 978-3-540-48311-3
eBook Packages: Springer Book Archive