Paper Info
Title
Parametric Computation of Margins and of Minimum Cumulative Register Lifetime Dates
Abstract
We present simple and efficient algorithms for solving three basic problems which occur while modulo scheduling loops: a) computing the minimum initiation interval which satisfies the recurrence constraints, and exposing the most constraining recurrence cycle; b) computing and maintaining, as scheduling proceeds, the earliest and latest possible schedule dates (the margins) of the not yet scheduled instructions; c) computing and maintaining the tentative schedule dates of the not yet scheduled instructions which minimize the cumulative lifetimes of the registers. In addition, these problems are solved parametrically with the initiation interval.
Year
DOI
Venue
1996
10.1007/BFb0017256
LCPC
Keywords
Field
DocType
parametric computation,minimum cumulative register lifetime,cumulant,satisfiability
Microcode,Scheduling (computing),Computer science,Modulo,Parallel computing,Parametric statistics,Distributed computing,Computation
Conference
ISBN
Citations 
PageRank 
3-540-63091-0
6
0.56
References 
Authors
13
1
Name
Order
Citations
PageRank
Benoît Dupont de Dinechin119712.60