A New timed Petri net model for loop scheduling with resource constraints - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1992

A New timed Petri net model for loop scheduling with resource constraints

Abstract

This report uses timed Petri net to model and analyze the problem of instruction-level loop scheduling with resource constraints, which has been proven to be an NP complete problem. First, we present a new timed Petri net model to integrate loop scheduling, functional unit allocation, register allocation and spilling into a unified theoretical framework. Secondly, we theoretically discuss the schedulability of our model. Thirdly, we develop a state subgraph, called register allocation solution graph, which can effectively describe the major behavior of our new model. The main property of this state subgraph is that the number of all its nodes is polynomial. Finally, we present a timed Petri net based loop scheduling approach with polynomial computation complexity, by which the optimum loop schedules can be found under resource constraints for almost all practical loop programs.

Domains

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

Dates and versions

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

Identifiers

  • HAL Id : inria-00074862 , version 1

Cite

Jian Wang, Christine Eisenbeis. A New timed Petri net model for loop scheduling with resource constraints. [Research Report] RR-1810, INRIA. 1992. ⟨inria-00074862⟩
56 View
54 Download

Share

Gmail Facebook Twitter LinkedIn More