Paper Info
Title
A symbolic approach for the combined solution of scheduling and allocation
Abstract
Scheduling is widely recognized as a very important step in high-level synthesis. Nevertheless, it is usually done without taking into account the effects on the actual hardware implementation. This paper presents an efficient symbolic technique to concurrently integrate operation scheduling and resource allocation. The technique inherits all the features of "standard" BDD-based control dominated scheduling, including resource-constraining, speculation and pruning. In addition, it introduces an efficient way of encoding allocation information within a symbolic scheduling automaton with a two-folded target. Firstly, it finds a minimum cost allocation of operation resources satisfying a given schedule. Secondly, it optimizes the amount of registers required to store intermediate results of operations. Theory and algorithms are developed and presented. Experimental results on a well known set of benchmarks show the potentiality of the approach.
Year
DOI
Venue
2002
10.1145/581199.581252
Kyoto, Japan
Keywords
Field
DocType
resource allocation,minimum cost allocation,bdd-based control,operation resource,encoding allocation information,symbolic scheduling automaton,symbolic approach,combined solution,actual hardware implementation,operation scheduling,efficient symbolic technique,scheduling,allocation,high level synthesis,satisfiability,automata
Fixed-priority pre-emptive scheduling,Fair-share scheduling,Computer science,Parallel computing,Real-time computing,Two-level scheduling,Resource allocation,Rate-monotonic scheduling,Dynamic priority scheduling,Earliest deadline first scheduling,Round-robin scheduling
Conference
ISBN
Citations 
PageRank 
1-58113-576-9
2
0.36
References 
Authors
4
6
Name
Order
Citations
PageRank
Gianpiero Cabodi135237.41
Mihai Lazarescu248653.45
Luciano Lavagno31752216.46
Sergio Nocco4887.90
Claudio Passerone521631.27
Stefano Quer639637.74