Using clp(FD) to Support Instruction Schedulers for Multi-issue Pipelined Architectures - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1996

Using clp(FD) to Support Instruction Schedulers for Multi-issue Pipelined Architectures

Annie Despland
  • Function : Author

Abstract

In the conventional models of pipelined architectures, pipeline conflicts are generally avoided through techniques like reservation tables. They are intended to describe the run time of instructions for which the delays between the execution stage and the fetch one is a constant depending only on the instruction. In fact actual superscalar processors don't comply this model since such delays are context dependent. The proposed approach fully supports slackness in the run time flow of execution. We advocate a model that is based on the concurrency of tasks performed by pipelines rather than the concurrent usage of resources as most current approaches do. The scheduling algorithm is based on the properties of this model. Since most of the constraints can be stated as linear equations or inequations, an implementation using CLP with finite domains is straightforward.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-3078.pdf (315.8 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00073614 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00073614 , version 1

Cite

Annie Despland, Monique Mazaud. Using clp(FD) to Support Instruction Schedulers for Multi-issue Pipelined Architectures. [Research Report] RR-3078, INRIA. 1996. ⟨inria-00073614⟩
60 View
117 Download

Share

Gmail Facebook Twitter LinkedIn More